Diff for /gforth/test/gforth.fs between versions 1.9 and 1.19

version 1.9, 2006/10/22 16:54:01 version 1.19, 2011/08/12 16:53:19
Line 1 Line 1
 \ test some gforth extension words  \ test some gforth extension words
   
 \ Copyright (C) 2003,2004,2005 Free Software Foundation, Inc.  \ Copyright (C) 2003,2004,2005,2006,2007,2009 Free Software Foundation, Inc.
   
 \ This file is part of Gforth.  \ This file is part of Gforth.
   
 \ Gforth is free software; you can redistribute it and/or  \ Gforth is free software; you can redistribute it and/or
 \ modify it under the terms of the GNU General Public License  \ modify it under the terms of the GNU General Public License
 \ as published by the Free Software Foundation; either version 2  \ as published by the Free Software Foundation, either version 3
 \ of the License, or (at your option) any later version.  \ of the License, or (at your option) any later version.
   
 \ This program is distributed in the hope that it will be useful,  \ This program is distributed in the hope that it will be useful,
Line 15 Line 15
 \ GNU General Public License for more details.  \ GNU General Public License for more details.
   
 \ You should have received a copy of the GNU General Public License  \ You should have received a copy of the GNU General Public License
 \ along with this program; if not, write to the Free Software  \ along with this program. If not, see http://www.gnu.org/licenses/.
 \ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.  
   
 require ./tester.fs  require ./tester.fs
 decimal  decimal
Line 44  decimal Line 43  decimal
 { 'A  -> 65 }  { 'A  -> 65 }
 { 1. '1 -> 1. 49 }  { 1. '1 -> 1. 49 }
   
 \ represent has no trailing 0s even for inf and nan  \ REPRESENT has no trailing 0s even for inf and nan
   
 {  1e 0e f/ pad 16 represent drop 2drop pad 15 + c@ '0 = -> false }  {  1e 0e f/ pad 16 represent drop 2drop pad 15 + c@ '0 = -> false }
 {  0e 0e f/ pad 16 represent drop 2drop pad 15 + c@ '0 = -> false }  {  0e 0e f/ pad 16 represent drop 2drop pad 15 + c@ '0 = -> false }
 { -1e 0e f/ pad 16 represent drop 2drop pad 15 + c@ '0 = -> false }  { -1e 0e f/ pad 16 represent drop 2drop pad 15 + c@ '0 = -> false }
   
 \ gforth now guarantees exceptions in division errors  \ TRY and friends
   
 \ division by zero  : 0<-throw ( n -- )
 { 1 0 ' /    catch -> 1 0 -10 }      0< throw ;
 { 1 0 ' mod  catch -> 1 0 -10 }  
 { 1 0 ' /mod catch -> 1 0 -10 }  
 { 1 1 0 ' */mod catch -> 1 1 0 -10 }  
 { 1 1 0 ' */    catch -> 1 1 0 -10 }  
 { 1. 0 ' fm/mod catch -> 1. 0 -10 }  
 { 1. 0 ' sm/rem catch -> 1. 0 -10 }  
 { 1. 0 ' um/mod catch -> 1. 0 -10 }  
   
 \ division overflows (might come out as "division by zero" or "overflow")  
 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 }  : try-test1 ( n1 -- n2 )
 { 0 max-n 2/ 1+ max-n invert ' sm/rem catch -> 0 max-n invert 0 }      try
           dup 0<-throw
           iferror
               2drop 25
           then
           1+
       endtry ;
   
   { -5 try-test1 -> 26 }
   { 5  try-test1 ->  6 }
   
   : try-test2 ( n1 -- n2 )
       try
           0
       restore
           drop 1+ dup 0<-throw
       endtry ;
   
   { -5 try-test2 -> 0 }
   {  5 try-test2 -> 6 }
   
   : try-test3 ( n1 -- n2 )
       try
           dup 0<-throw
       endtry-iferror
           2drop 10
       else
           1+
       then ;
   
   { -5 try-test3 -> 10 }
   {  5 try-test3 ->  6 }
   
   \ fcopysign
   
   t{  5e  1e fcopysign ->  5e }t
   t{ -5e  1e fcopysign ->  5e }t
   t{  5e -1e fcopysign -> -5e }t
   t{ -5e -1e fcopysign -> -5e }t
   \ tests involving -0e?
   
   \ ?of nextcase contof
   
   : mysgn ( n1 -- n2 )
       case
           dup 0< ?of drop -1 endof
           dup 0> ?of drop 1 endof
           dup
       endcase ;
   
   t{  5 mysgn ->  1 }
   t{ -3 mysgn -> -1 }
   t{  0 mysgn ->  0 }
   
   : myscan ( addr1 n1 char -- addr2 n2 )
       >r case
           dup 0= ?of endof
           over c@ r@ = ?of endof
           1 /string
           dup nextcase
       rdrop ;
   
   t{ s" dhfa;jfsdk" 2dup ';' myscan 2swap 4 /string d= -> true }
   t{ s" abcdef" 2dup 'g' myscan 2swap 6 /string d= -> true }
   
   
   : gcd ( n1 n2 -- n )
       case
           2dup > ?of tuck - contof
           2dup < ?of over - contof
       endcase ;
   
 { 1 max-n 2/ 1+ max-n invert ' fm/mod catch 0= -> 1 max-n 2/ 1+ max-n invert false }  t{ 48 42 gcd -> 6 }
 { 1 max-n 2/ 1+ max-n invert ' sm/rem catch 0= -> 1 max-n invert true }  t{ 42 48 gcd -> 6 }
   
 { 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 }  
   

Removed from v.1.9  
changed lines
  Added in v.1.19


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