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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
|
/*
* File: ocomp.r
* Contents: lexeq, lexge, lexgt, lexle, lexlt, lexne, numeq, numge,
* numgt, numle, numlt, numne, eqv, neqv
*/
/*
* NumComp is a macro that defines the form of a numeric comparisons.
*/
#begdef NumComp(icon_op, func_name, c_op, descript)
"x " #icon_op " y - test if x is numerically " #descript " y."
operator{0,1} icon_op func_name(x,y)
arith_case (x, y) of {
C_integer: {
abstract {
return integer
}
inline {
if c_op(x, y)
return C_integer y;
fail;
}
}
integer: { /* large integers only */
abstract {
return integer
}
inline {
if (big_ ## c_op (x,y))
return y;
fail;
}
}
C_double: {
abstract {
return real
}
inline {
if c_op (x, y)
return C_double y;
fail;
}
}
}
end
#enddef
/*
* x = y
*/
#define NumEq(x,y) (x == y)
#define big_NumEq(x,y) (bigcmp(&x,&y) == 0)
NumComp( = , numeq, NumEq, equal to)
/*
* x >= y
*/
#define NumGe(x,y) (x >= y)
#define big_NumGe(x,y) (bigcmp(&x,&y) >= 0)
NumComp( >=, numge, NumGe, greater than or equal to)
/*
* x > y
*/
#define NumGt(x,y) (x > y)
#define big_NumGt(x,y) (bigcmp(&x,&y) > 0)
NumComp( > , numgt, NumGt, greater than)
/*
* x <= y
*/
#define NumLe(x,y) (x <= y)
#define big_NumLe(x,y) (bigcmp(&x,&y) <= 0)
NumComp( <=, numle, NumLe, less than or equal to)
/*
* x < y
*/
#define NumLt(x,y) (x < y)
#define big_NumLt(x,y) (bigcmp(&x,&y) < 0)
NumComp( < , numlt, NumLt, less than)
/*
* x ~= y
*/
#define NumNe(x,y) (x != y)
#define big_NumNe(x,y) (bigcmp(&x,&y) != 0)
NumComp( ~=, numne, NumNe, not equal to)
/*
* StrComp is a macro that defines the form of a string comparisons.
*/
#begdef StrComp(icon_op, func_name, special_test, c_comp, comp_value, descript)
"x " #icon_op " y - test if x is lexically " #descript " y."
operator{0,1} icon_op func_name(x,y)
declare {
int temp_str = 0;
}
abstract {
return string
}
if !cnv:tmp_string(x) then
runerr(103,x)
if !is:string(y) then
if cnv:tmp_string(y) then
inline {
temp_str = 1;
}
else
runerr(103,y)
body {
/*
* lexcmp does the work.
*/
if (special_test (lexcmp(&x, &y) c_comp comp_value)) {
/*
* Return y as the result of the comparison. If y was converted to
* a string, a copy of it is allocated.
*/
result = y;
if (temp_str)
Protect(StrLoc(result) = alcstr(StrLoc(result), StrLen(result)), runerr(0));
return result;
}
else
fail;
}
end
#enddef
StrComp(==, lexeq, (StrLen(x) == StrLen(y)) &&, ==, Equal, equal to)
StrComp(~==, lexne, (StrLen(x) != StrLen(y)) ||, !=, Equal, not equal to)
StrComp(>>=, lexge, , !=, Less, greater than or equal to)
StrComp(>>, lexgt, , ==, Greater, greater than)
StrComp(<<=, lexle, , !=, Greater, less than or equal to)
StrComp(<<, lexlt, , ==, Less, less than)
"x === y - test equivalence of x and y."
operator{0,1} === eqv(x,y)
abstract {
return type(y)
}
inline {
/*
* Let equiv do all the work, failing if equiv indicates non-equivalence.
*/
if (equiv(&x, &y))
return y;
else
fail;
}
end
"x ~=== y - test inequivalence of x and y."
operator{0,1} ~=== neqv(x,y)
abstract {
return type(y)
}
inline {
/*
* equiv does all the work.
*/
if (!equiv(&x, &y))
return y;
else
fail;
}
end
|
