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
178
179
180
181
182
183
|
// -*- mode: c++; c-basic-offset:4 -*-
// This file is part of libdap, A C++ implementation of the OPeNDAP Data
// Access Protocol.
// Copyright (c) 2002,2003 OPeNDAP, Inc.
// Author: James Gallagher <jgallagher@opendap.org>
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library 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
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
//
// You can contact OPeNDAP, Inc. at PO Box 112, Saunderstown, RI. 02874-0112.
// (c) COPYRIGHT URI/MIT 1999
// Please read the full copyright statement in the file COPYRIGHT_URI.
//
// Authors:
// jhrg,jimg James Gallagher <jgallagher@gso.uri.edu>
// Templates for relational operations.
//
// jhrg 3/24/99
#ifndef _operators_h
#define _operators_h
#include "GNURegex.h" // GNU Regex class used for string =~ op.
#include "ce_expr.tab.hh"
namespace libdap {
/** Compare two numerical types, both of which are either signed or unsigned.
This class is one implementation of the comparison policy used by
rops.
@see rops
@see USCmp
@see SUCmp */
template<class T1, class T2>
bool Cmp(int op, T1 v1, T2 v2)
{
DBGN(cerr << __PRETTY_FUNCTION__ << v1 << " " << op << " " << v2 << endl);
switch (op) {
case SCAN_EQUAL:
return v1 == v2;
case SCAN_NOT_EQUAL:
return v1 != v2;
case SCAN_GREATER:
return v1 > v2;
case SCAN_GREATER_EQL:
return v1 >= v2;
case SCAN_LESS:
return v1 < v2;
case SCAN_LESS_EQL:
return v1 <= v2;
case SCAN_REGEXP:
throw Error(malformed_expr, "Regular expressions are supported for strings only.");
default:
throw Error(malformed_expr, "Unrecognized operator.");
}
}
template<class T>
static inline unsigned long long dap_floor_zero(T i)
{
return (unsigned long long) ((i < 0) ? 0 : i);
}
/** Compare two numerical types, the first one unsigned and the second
signed. If the signed argument is negative, zero is used in the
comparison. This class is one implementation of the comparison policy
used by rops.
@see rops
@see SUCmp
@see Cmp */
template<class UT1, class T2>
bool USCmp(int op, UT1 v1, T2 v2)
{
DBGN(cerr << __PRETTY_FUNCTION__ << v1 << " " << op << " " << v2 << endl);
switch (op) {
case SCAN_EQUAL:
return v1 == dap_floor_zero<T2>(v2);
case SCAN_NOT_EQUAL:
return v1 != dap_floor_zero<T2>(v2);
case SCAN_GREATER:
return v1 > dap_floor_zero<T2>(v2);
case SCAN_GREATER_EQL:
return v1 >= dap_floor_zero<T2>(v2);
case SCAN_LESS:
return v1 < dap_floor_zero<T2>(v2);
case SCAN_LESS_EQL:
return v1 <= dap_floor_zero<T2>(v2);
case SCAN_REGEXP:
throw Error(malformed_expr, "Regular expressions are supported for strings only.");
default:
throw Error(malformed_expr, "Unrecognized operator.");
}
}
/** Compare two numerical types, the first one signed and the second
unsigned. If the signed argument is negative, zero is used in the
comparison. This class is one implementation of the comparison policy
used by rops. This class is here to make writing the Byte::ops, ...
member functions simpler. It is not necessary since the functions could
twidle the order of arguments to rops and use <tt>USCmp</tt>. Having
this class make Byte:ops, ... simpler to read and write.
@see Byte::ops
@see USCmp
@see Cmp
@see ops */
template<class T1, class UT2>
bool SUCmp(int op, T1 v1, UT2 v2)
{
DBGN(cerr << __PRETTY_FUNCTION__ << v1 << " " << op << " " << v2 << endl);
switch (op) {
case SCAN_EQUAL:
return dap_floor_zero<T1>(v1) == v2;
case SCAN_NOT_EQUAL:
return dap_floor_zero<T1>(v1) != v2;
case SCAN_GREATER:
return dap_floor_zero<T1>(v1) > v2;
case SCAN_GREATER_EQL:
return dap_floor_zero<T1>(v1) >= v2;
case SCAN_LESS:
return dap_floor_zero<T1>(v1) < v2;
case SCAN_LESS_EQL:
return dap_floor_zero<T1>(v1) <= v2;
case SCAN_REGEXP:
throw Error(malformed_expr, "Regular expressions are supported for strings only.");
default:
throw Error(malformed_expr, "Unrecognized operator.");
}
}
/** Compare two string types.
This class is one implementation of the comparison policy used by
rops.
@see rops */
template<class T1, class T2>
bool StrCmp(int op, T1 v1, T2 v2)
{
switch (op) {
case SCAN_EQUAL:
return v1 == v2;
case SCAN_NOT_EQUAL:
return v1 != v2;
case SCAN_GREATER:
return v1 > v2;
case SCAN_GREATER_EQL:
return v1 >= v2;
case SCAN_LESS:
return v1 < v2;
case SCAN_LESS_EQL:
return v1 <= v2;
case SCAN_REGEXP: {
Regex r(v2.c_str());
return r.match(v1.c_str(), v1.length()) > 0;
}
default:
throw Error(malformed_expr, "Unrecognized operator.");
}
}
} // namespace libdap
#endif // _operators_h
|
