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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the either Technology Preview License Agreement or the
** Beta Release License Agreement.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at http://www.qtsoftware.com/contact.
** $QT_END_LICENSE$
**
****************************************************************************/
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists purely as an
// implementation detail. This header file may change from version to
// version without notice, or even be removed.
//
// We mean it.
#ifndef Patternist_AtomicComparators_H
#define Patternist_AtomicComparators_H
#include "qabstractfloat_p.h"
#include "qatomiccomparator_p.h"
#include "qprimitives_p.h"
/**
* @file
* @short Contains all the classes implementing comparisons between atomic values.
*/
QT_BEGIN_HEADER
QT_BEGIN_NAMESPACE
namespace QPatternist
{
/**
* @short Performs case @em sensitive string comparison
* between @c xs:anyUri, @c xs:string, and @c xs:untypedAtomic.
*
* @ingroup Patternist_xdm
* @author Frans Englich <fenglich@trolltech.com>
*/
class StringComparator : public AtomicComparator
{
public:
/**
* Compares two strings, and returns the appropriate AtomicComparator::ComparisonResult enum. This
* is a bit simplified version of string comparison as defined in the XPath specifications,
* since this does not take any string collations into account(which an implementation neither
* is required to do).
*
* @see <a href="http://www.w3.org/TR/xpath-functions/#string-compare">XQuery 1.0 and XPath
* 2.0 Functions and Operators, 7.3 ValueComparison::Equality and Comparison of Strings</a>
*/
virtual ComparisonResult compare(const Item &op1,
const AtomicComparator::Operator op,
const Item &op2) const;
/**
* Compares two strings, and returns @c true if they are considered equal as per
* an ordinary string comparison. In other words, this is an implementation with
* the Unicode code point collation.
*
* @see <a href="http://www.w3.org/TR/xpath-functions/#string-compare">XQuery 1.0 and XPath
* 2.0 Functions and Operators, 7.3 ValueComparison::Equality and Comparison of Strings</a>
*/
virtual bool equals(const Item &op1,
const Item &op2) const;
};
/**
* @short Performs case @em insensitive string comparison
* between @c xs:anyUri, @c xs:string, and @c xs:untypedAtomic.
*
* @ingroup Patternist_xdm
* @author Frans Englich <fenglich@trolltech.com>
*/
class CaseInsensitiveStringComparator : public AtomicComparator
{
public:
/**
* Converts both string values to upper case and afterwards compare them.
*/
virtual ComparisonResult compare(const Item &op1,
const AtomicComparator::Operator op,
const Item &op2) const;
/**
* Converts both string values case insensitively.
*/
virtual bool equals(const Item &op1,
const Item &op2) const;
};
/**
* @short Compares @c xs:base64Binary and @c xs:hexBinary values.
*
* @author Frans Englich <fenglich@trolltech.com>
*/
class BinaryDataComparator : public AtomicComparator
{
public:
virtual bool equals(const Item &op1,
const Item &op2) const;
};
/**
* @short Compares @c xs:boolean values.
*
* This is done via the object's Boolean::evaluteEBV() function.
*
* @author Frans Englich <fenglich@trolltech.com>
*/
class BooleanComparator : public AtomicComparator
{
public:
virtual ComparisonResult compare(const Item &op1,
const AtomicComparator::Operator op,
const Item &op2) const;
virtual bool equals(const Item &op1,
const Item &op2) const;
};
/**
* @short Compares @c xs:double values.
*
* @todo Add docs about numeric promotion
*
* @author Frans Englich <fenglich@trolltech.com>
*/
class AbstractFloatComparator : public AtomicComparator
{
public:
virtual ComparisonResult compare(const Item &op1,
const AtomicComparator::Operator op,
const Item &op2) const;
virtual bool equals(const Item &op1,
const Item &op2) const;
};
/**
* @short Compares @c xs:double values for the purpose of sorting.
*
* @todo Add docs about numeric promotion
*
* @author Frans Englich <fenglich@trolltech.com>
*/
template<const AtomicComparator::Operator t_op>
class AbstractFloatSortComparator : public AbstractFloatComparator
{
public:
virtual ComparisonResult compare(const Item &o1,
const AtomicComparator::Operator op,
const Item &o2) const
{
Q_ASSERT_X(t_op == OperatorLessThanNaNLeast || t_op == OperatorLessThanNaNGreatest, Q_FUNC_INFO,
"Can only be instantiated with those two.");
Q_ASSERT(op == t_op);
Q_UNUSED(op); /* Needed when building in release mode. */
const xsDouble v1 = o1.template as<Numeric>()->toDouble();
const xsDouble v2 = o2.template as<Numeric>()->toDouble();
if(qIsNaN(v1) && !qIsNaN(v2))
return t_op == OperatorLessThanNaNLeast ? LessThan : GreaterThan;
if(!qIsNaN(v1) && qIsNaN(v2))
return t_op == OperatorLessThanNaNLeast ? GreaterThan : LessThan;
if(Double::isEqual(v1, v2))
return Equal;
else if(v1 < v2)
return LessThan;
else
return GreaterThan;
}
};
/**
* @short Compares @c xs:decimal values.
*
* @author Frans Englich <fenglich@trolltech.com>
*/
class DecimalComparator : public AtomicComparator
{
public:
virtual ComparisonResult compare(const Item &op1,
const AtomicComparator::Operator op,
const Item &op2) const;
virtual bool equals(const Item &op1,
const Item &op2) const;
};
/**
* @short Compares @c xs:integer values.
*
* @author Frans Englich <fenglich@trolltech.com>
*/
class IntegerComparator : public AtomicComparator
{
public:
virtual ComparisonResult compare(const Item &op1,
const AtomicComparator::Operator op,
const Item &op2) const;
virtual bool equals(const Item &op1,
const Item &op2) const;
};
/**
* @short Compares @c xs:QName values.
*
* @author Frans Englich <fenglich@trolltech.com>
*/
class QNameComparator : public AtomicComparator
{
public:
virtual bool equals(const Item &op1,
const Item &op2) const;
};
/**
* @short Compares sub-classes of AbstractDateTime.
*
* @author Frans Englich <fenglich@trolltech.com>
*/
class AbstractDateTimeComparator : public AtomicComparator
{
public:
virtual ComparisonResult compare(const Item &op1,
const AtomicComparator::Operator op,
const Item &op2) const;
virtual bool equals(const Item &op1,
const Item &op2) const;
};
/**
* @short Compares sub-classes of AbstractDuration.
*
* @author Frans Englich <fenglich@trolltech.com>
*/
class AbstractDurationComparator : public AtomicComparator
{
public:
virtual ComparisonResult compare(const Item &op1,
const AtomicComparator::Operator op,
const Item &op2) const;
virtual bool equals(const Item &op1,
const Item &op2) const;
private:
static inline QDateTime addDurationToDateTime(const QDateTime &dateTime,
const AbstractDuration *const duration);
};
}
QT_END_NAMESPACE
QT_END_HEADER
#endif
|
