\ test some gforth extension words \ Copyright (C) 2003,2004,2005 Free Software Foundation, Inc. \ This file is part of Gforth. \ Gforth is free software; you can redistribute it and/or \ modify it under the terms of the GNU General Public License \ as published by the Free Software Foundation; either version 2 \ of the License, or (at your option) any later version. \ This program is distributed in the hope that it will be useful, \ but WITHOUT ANY WARRANTY; without even the implied warranty of \ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the \ GNU General Public License for more details. \ You should have received a copy of the GNU General Public License \ along with this program; if not, write to the Free Software \ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. require ./tester.fs decimal \ division exception tests; exceptions are not guaranteed for gforth-fast environment-wordlist >order { max-n invert -1 ' / catch 0= -> max-n invert -1 false } { max-n invert -1 ' mod catch 0= -> max-n invert -1 false } { max-n invert -1 ' /mod catch 0= -> max-n invert -1 false } { 1 max-n invert -1 ' */ catch 0= -> 1 max-n invert -1 false } { 1 max-n invert -1 ' */mod catch 0= -> 1 max-n invert -1 false } { max-n invert s>d -1 ' fm/mod catch 0= -> max-n invert s>d -1 false } { max-n invert s>d -1 ' sm/rem catch 0= -> max-n invert s>d -1 false } { 2 max-n 2/ 1+ 1 ' */ catch 0= -> 2 max-n 2/ 1+ 1 false } { 2 max-n 2/ 1+ 1 ' */mod catch 0= -> 2 max-n 2/ 1+ 1 false } { max-n 0 1. d+ 1 ' fm/mod catch 0= -> max-n 0 1. d+ 1 false } { max-n 0 1. d+ 1 ' sm/rem catch 0= -> max-n 0 1. d+ 1 false } { max-u 0 1. d+ 1 ' um/mod catch 0= -> max-u 0 1. d+ 1 false } { 1 1 dnegate 2 ' fm/mod catch 0= -> max-u 0 2. d+ dnegate 2 false } { 1 1 dnegate 2 ' sm/rem catch 0= -> -1 max-n invert true } { 1 1 -2 ' fm/mod catch 0= -> 1 1 -2 false } { 1 1 -2 ' sm/rem catch 0= -> 1 max-n invert true } { max-u max-n 2/ max-n invert ' fm/mod catch -> -1 max-n invert 0 } { max-u max-n 2/ max-n invert ' sm/rem catch -> max-n max-n negate 0 } { 0 max-n 2/ 1+ max-n invert ' fm/mod catch -> 0 max-n invert 0 } { 0 max-n 2/ 1+ max-n invert ' sm/rem catch -> 0 max-n invert 0 } { 1 max-n 2/ 1+ max-n invert ' fm/mod catch 0= -> 1 max-n 2/ 1+ max-n invert false } { 1 max-n 2/ 1+ max-n invert ' sm/rem catch 0= -> 1 max-n invert true } { 0 max-u -1. d+ max-u ' um/mod catch 0= -> max-u 1- max-u true } { 0 max-u max-u ' um/mod catch 0= -> 0 max-u max-u false }