1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
\ test some double primitives
\ Copyright (C) 1996,1998,1999,2000,2003,2007 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 3
\ 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, see http://www.gnu.org/licenses/.
require ./tester.fs
require ./coretest.fs
\ fm/mod, sm/rem, um/mod, s>d, m*, um* already covered in coretest.fs
{ 0. 0 m+ -> 0. }
{ 0. 1 m+ -> 1. }
{ 0. -1 m+ -> -1. }
{ 1. -1 m+ -> 0. }
{ MAX-UINT 0 1 m+ -> 0 1 }
{ MAX-UINT MAX-UINT 1 m+ -> 0. }
{ 0. 0. d+ -> 0. }
{ 1. -1. d+ -> 0. }
{ -1. 1. d+ -> 0. }
{ -1. -1. d+ -> -2. }
{ MAX-UINT 0 2dup d+ -> MAX-UINT 1- 1 }
{ MAX-UINT 1 1 1 d+ -> 0 3 }
{ 0. 0. d- -> 0. }
{ 0. 1. d- -> -1. }
{ 0. -1. d- -> 1. }
{ 1. 0. d- -> 1. }
{ 1. 1. d- -> 0. }
{ -1. -1. d- -> 0. }
{ 1. -1. d- -> 2. }
{ -1. 1. d- -> -2. }
{ 0 2 1. d- -> MAX-UINT 1 }
{ 0. dnegate -> 0. }
{ 1. dnegate -> -1. }
{ -2. dnegate -> 2. }
{ 0 1 dnegate -> 0 -1 }
{ 1 1 dnegate -> MAX-UINT -2 }
{ 1. d2* -> 2. }
{ -10. d2* -> -20. }
{ MAX-UINT 1 d2* -> MAX-UINT 1- 3 }
{ 0. d2/ -> 0. }
{ 1. d2/ -> 0. }
{ -1. d2/ -> -1. }
{ MAX-UINT 3 d2/ -> MAX-UINT 1 }
{ 0. 0. d= -> true }
{ 0. 1. d= -> false }
{ 0 1 0 0 d= -> false }
{ 1 1 0 0 d= -> false }
{ 0. 0. d<> -> false }
{ 0. 1. d<> -> true }
{ 0 1 0 0 d<> -> true }
{ 1 1 0 0 d<> -> true }
{ 1. 1. d< -> false }
{ 0. 1. d< -> true }
{ 1 0 0 1 d< -> true }
{ 0 1 1 0 d< -> false }
{ -1. 0. d< -> true }
{ 1. 1. d> -> false }
{ 0. 1. d> -> false }
{ 1 0 0 1 d> -> false }
{ 0 1 1 0 d> -> true }
{ -1. 0. d> -> false }
{ 1. 1. d>= -> true }
{ 0. 1. d>= -> false }
{ 1 0 0 1 d>= -> false }
{ 0 1 1 0 d>= -> true }
{ -1. 0. d>= -> false }
{ 1. 1. d<= -> true }
{ 0. 1. d<= -> true }
{ 1 0 0 1 d<= -> true }
{ 0 1 1 0 d<= -> false }
{ -1. 0. d<= -> true }
\ Since the d-comparisons, the du-comparisons, and the d0-comparisons
\ are generated from the same source, we only test the ANS words in
\ the following.
{ 0. d0= -> true }
{ 1. d0= -> false }
{ 0 1 d0= -> false }
{ 1 1 d0= -> false }
{ -1. d0= -> false }
{ 0. d0< -> false }
{ -1. d0< -> true }
{ -1 0 d0< -> false }
{ 0 min-int d0< -> true }
{ 1. 1. du< -> false }
{ 0. 1. du< -> true }
{ 1 0 0 1 du< -> true }
{ 0 1 1 0 du< -> false }
{ -1. 0. du< -> false }
\ some M*/ consistency checks against */
{ -7. 3 5 M*/ -> -7 3 5 */ s>d }
{ 7. 3 5 M*/ -> 7 3 5 */ s>d }
|
