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
|
/*************************************************************************
*
* HTCd - Copyright (C) 1998-2006 Henrik Rydberg
*
* This program 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <ops/operator.h>
#include <ops/nnstyle.h>
OP2_IMPL(lt) {out<<(L<R);}
OP2_IMPL(le) {out<<(L<=R);}
OP2_IMPL(ge) {out<<(L>=R);}
OP2_IMPL(gt) {out<<(L>R);}
OP2_IMPL(ltn) {out<<(L.compare(R,cset_lcase)<0);}
OP2_IMPL(len) {out<<(L.compare(R,cset_lcase)<=0);}
OP2_IMPL(gen) {out<<(L.compare(R,cset_lcase)>=0);}
OP2_IMPL(gtn) {out<<(L.compare(R,cset_lcase)>0);}
OP2_IMPL(ltnn) {out<<(nncomp(L,R)<0);}
OP2_IMPL(lenn) {out<<(nncomp(L,R)<=0);}
OP2_IMPL(genn) {out<<(nncomp(L,R)>=0);}
OP2_IMPL(gtnn) {out<<(nncomp(L,R)>0);}
OP2_IMPL(ltf) {out<<(atof(L)<atof(R));}
OP2_IMPL(lef) {out<<(atof(L)<=atof(R));}
OP2_IMPL(gef) {out<<(atof(L)>=atof(R));}
OP2_IMPL(gtf) {out<<(atof(L)>atof(R));}
void opAddComp(opmap& M)
{
OP_ADD(20,lt,
"Lexicographic less than\n"
"Syntax: (string) lt (string)\n"
"Returns: (int)\n"
);
OP_ADD(20,le,
"Lexicographic less or equal\n"
"Syntax: (string) le (string)\n"
"Returns: (int)\n"
);
OP_ADD(20,ge,
"Lexicographic greater or equal\n"
"Syntax: (string) ge (string)\n"
"Returns: (int)\n"
);
OP_ADD(20,gt,
"Lexicographic greater than\n"
"Syntax: (string) gt (string)\n"
"Returns: (int)\n"
);
OP_ADD(20,ltn,
"Lexicographic less than, case insensitive\n"
"Syntax: (string) ltn (string)\n"
"Returns: (int)\n"
);
OP_ADD(20,len,
"Lexicographic less or equal, case insensitive\n"
"Syntax: (string) len (string)\n"
"Returns: (int)\n"
);
OP_ADD(20,gen,
"Lexicographic greater or equal, case insensitive\n"
"Syntax: (string) gen (string)\n"
"Returns: (int)\n"
);
OP_ADD(20,gtn,
"Lexicographic greater than, case insensitive\n"
"Syntax: (string) gtn (string)\n"
"Returns: (int)\n"
);
OP_ADD(20,ltnn,
"Lexicographic less than, NN-style\n"
"Syntax: (string) ltnn (string)\n"
"Returns: (int)\n"
"\n"
"NN-style compares names as <lastname> <initials>\n"
);
OP_ADD(20,lenn,
"Lexicographic less or equal, NN-style\n"
"Syntax: (string) lenn (string)\n"
"Returns: (int)\n"
"\n"
"NN-style compares names as <lastname> <initials>\n"
);
OP_ADD(20,genn,
"Lexicographic greater or equal, NN-style\n"
"Syntax: (string) genn (string)\n"
"Returns: (int)\n"
"\n"
"NN-style compares names as <lastname> <initials>\n"
);
OP_ADD(20,gtnn,
"Lexicographic greater than, NN-style\n"
"Syntax: (string) gtnn (string)\n"
"Returns: (int)\n"
"\n"
"NN-style compares names as <lastname> <initials>\n"
);
OP_ADDN(20,ltf,<,
"Arithmetic less than\n"
"Syntax: (real) < (real)\n"
"Returns: (int)\n"
);
OP_ADDN(20,lef,<=,
"Arithmetic less or equal\n"
"Syntax: (real) <= (real)\n"
"Returns: (int)\n"
);
OP_ADDN(20,gef,>=,
"Arithmetic greater or equal\n"
"Syntax: (real) >= (real)\n"
"Returns: (int)\n"
);
OP_ADDN(20,gtf,>,
"Arithmetic greater than\n"
"Syntax: (real) > (real)\n"
"Returns: (int)\n"
);
}
|
