Annotation of gforth/test/coremore.fs, revision 1.2

1.1       anton       1: \ test some core stuff not tested by John Hayes' suite
                      2: 
                      3: \ Copyright (C) 2006 Free Software Foundation, Inc.
                      4: 
                      5: \ This file is part of Gforth.
                      6: 
                      7: \ Gforth is free software; you can redistribute it and/or
                      8: \ modify it under the terms of the GNU General Public License
1.2     ! anton       9: \ as published by the Free Software Foundation, either version 3
1.1       anton      10: \ of the License, or (at your option) any later version.
                     11: 
                     12: \ This program is distributed in the hope that it will be useful,
                     13: \ but WITHOUT ANY WARRANTY; without even the implied warranty of
                     14: \ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
                     15: \ GNU General Public License for more details.
                     16: 
                     17: \ You should have received a copy of the GNU General Public License
1.2     ! anton      18: \ along with this program. If not, see http://www.gnu.org/licenses/.
1.1       anton      19: 
                     20: \ uses some non-core and non-standard words
                     21: 
                     22: require ./tester.fs
                     23: decimal
                     24: 
                     25: \ division
                     26: environment-wordlist >order
                     27: { 1 1 dnegate 2 ' sm/rem catch 0= -> -1 max-n invert true }
                     28: 
                     29: { 1 1 -2 ' sm/rem catch 0= -> 1 max-n invert true }
                     30: 
                     31: { max-u max-n 2/ max-n invert ' fm/mod catch -> -1 max-n invert 0 }
                     32: { max-u max-n 2/ max-n invert ' sm/rem catch -> max-n max-n negate 0 }
                     33: 
                     34: { 0 max-n 2/ 1+ max-n invert ' fm/mod catch -> 0 max-n invert 0 }
                     35: { 0 max-n 2/ 1+ max-n invert ' sm/rem catch -> 0 max-n invert 0 }
                     36: 
                     37: { 1 max-n 2/ 1+ max-n invert ' sm/rem catch 0= -> 1 max-n invert true }
                     38: 
                     39: { 0 max-u -1. d+ max-u ' um/mod catch 0= -> max-u 1- max-u true }

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>