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
|
/****************************************************************************
**
** 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://qt.nokia.com/contact.
** $QT_END_LICENSE$
**
****************************************************************************/
/**
* @file
* @short This file is included by qcomparisonplatform_p.h.
* If you need includes in this file, put them in qcomparisonplatform_p.h, outside of the namespace.
*/
template <typename TSubClass, bool issueError,
AtomicComparator::ComparisonType comparisonType, ReportContext::ErrorCode errorCode>
bool ComparisonPlatform<TSubClass, issueError, comparisonType, errorCode>::
flexibleCompare(const Item &it1,
const Item &it2,
const DynamicContext::Ptr &context) const
{
if(m_comparator)
/* The comparator was located at compile time. */
return compare(it1, it2, m_comparator, operatorID());
else
{
const AtomicComparator::Ptr cp(fetchComparator(it1.type(),
it2.type(),
context));
return cp ? compare(it1, it2, cp, operatorID()) : false;
}
}
template <typename TSubClass, bool issueError,
AtomicComparator::ComparisonType comparisonType, ReportContext::ErrorCode errorCode>
AtomicComparator::ComparisonResult
ComparisonPlatform<TSubClass, issueError, comparisonType, errorCode>::
detailedFlexibleCompare(const Item &it1,
const Item &it2,
const DynamicContext::Ptr &context) const
{
AtomicComparator::Ptr comp;
if(m_comparator)
comp = m_comparator;
else
{
comp = fetchComparator(it1.type(),
it2.type(),
context);
}
Q_ASSERT_X(operatorID() == AtomicComparator::OperatorLessThanNaNLeast || operatorID() == AtomicComparator::OperatorLessThanNaNGreatest,
Q_FUNC_INFO, "Only OperatorLessThan is currently supported for this function.");
return comp->compare(it1, operatorID(), it2);
}
template <typename TSubClass, bool issueError,
AtomicComparator::ComparisonType comparisonType, ReportContext::ErrorCode errorCode>
bool ComparisonPlatform<TSubClass, issueError, comparisonType, errorCode>::
compare(const Item &oand1,
const Item &oand2,
const AtomicComparator::Ptr &comp,
const AtomicComparator::Operator op) const
{
Q_ASSERT(oand1);
Q_ASSERT(oand2);
Q_ASSERT(comp);
switch(op)
{
case AtomicComparator::OperatorEqual:
return comp->equals(oand1, oand2);
case AtomicComparator::OperatorNotEqual:
return !comp->equals(oand1, oand2);
case AtomicComparator::OperatorLessThanNaNLeast:
case AtomicComparator::OperatorLessThanNaNGreatest:
/* Fallthrough. */
case AtomicComparator::OperatorLessThan:
return comp->compare(oand1, op, oand2) == AtomicComparator::LessThan;
case AtomicComparator::OperatorGreaterThan:
return comp->compare(oand1, op, oand2) == AtomicComparator::GreaterThan;
case AtomicComparator::OperatorLessOrEqual:
{
const AtomicComparator::ComparisonResult ret = comp->compare(oand1, op, oand2);
return ret == AtomicComparator::LessThan || ret == AtomicComparator::Equal;
}
case(AtomicComparator::OperatorGreaterOrEqual):
{
const AtomicComparator::ComparisonResult ret = comp->compare(oand1, op, oand2);
return ret == AtomicComparator::GreaterThan || ret == AtomicComparator::Equal;
}
}
/* GCC unbarfer, this line should never be reached. */
Q_ASSERT(false);
return false;
}
template <typename TSubClass, bool issueError,
AtomicComparator::ComparisonType comparisonType, ReportContext::ErrorCode errorCode>
AtomicComparator::Ptr ComparisonPlatform<TSubClass, issueError, comparisonType, errorCode>::
fetchComparator(const ItemType::Ptr &t1,
const ItemType::Ptr &t2,
const ReportContext::Ptr &context) const
{
Q_ASSERT(t1);
Q_ASSERT(t2);
if(*BuiltinTypes::xsAnyAtomicType == *t1 ||
*BuiltinTypes::xsAnyAtomicType == *t2 ||
*BuiltinTypes::item == *t1 ||
*BuiltinTypes::item == *t2 ||
*BuiltinTypes::numeric == *t1 ||
*BuiltinTypes::numeric == *t2 ||
*CommonSequenceTypes::Empty == *t1 ||
*CommonSequenceTypes::Empty == *t2)
{
/* The static type of(at least) one of the operands could not
* be narrowed further, so we do the operator
* lookup at runtime.
*/
return AtomicComparator::Ptr();
}
const AtomicComparatorLocator::Ptr locator
(static_cast<const AtomicType *>(t1.data())->comparatorLocator());
if(!locator)
{
if(issueError)
{
context->error(QtXmlPatterns::tr("No comparisons can be done involving the type %1.")
.arg(formatType(context->namePool(), t1)),
errorCode, static_cast<const TSubClass *>(this)->actualReflection());
}
return AtomicComparator::Ptr();
}
const AtomicComparator::Ptr comp(static_cast<const AtomicType *>(t2.data())->accept(locator, operatorID(),
static_cast<const TSubClass *>(this)->actualReflection()));
if(comp)
return comp;
else if(issueError)
{
context->error(QtXmlPatterns::tr("Operator %1 is not available between atomic values of type %2 and %3.")
.arg(formatKeyword(AtomicComparator::displayName(operatorID(),
comparisonType)),
formatType(context->namePool(), t1),
formatType(context->namePool(), t2)),
errorCode, static_cast<const TSubClass *>(this)->actualReflection());
}
return AtomicComparator::Ptr();
}
template <typename TSubClass, bool issueError,
AtomicComparator::ComparisonType comparisonType, ReportContext::ErrorCode errorCode>
void ComparisonPlatform<TSubClass, issueError, comparisonType, errorCode>::
prepareComparison(const AtomicComparator::Ptr &c)
{
m_comparator = c;
}
|
