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
|
/****************************************************************************
**
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** 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.1, 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.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qcommonsequencetypes_p.h"
#include "qcommonvalues_p.h"
#include "qgenericpredicate_p.h"
#include "qgenericsequencetype_p.h"
#include "qinsertioniterator_p.h"
#include "qpatternistlocale_p.h"
#include "qcardinalityverifier_p.h"
QT_BEGIN_NAMESPACE
using namespace QPatternist;
QString CardinalityVerifier::wrongCardinality(const Cardinality &req,
const Cardinality &got)
{
return QtXmlPatterns::tr("Required cardinality is %1; got cardinality %2.")
.arg(formatType(req), formatType(got));
}
Expression::Ptr CardinalityVerifier::verifyCardinality(const Expression::Ptr &operand,
const Cardinality &requiredCard,
const StaticContext::Ptr &context,
const ReportContext::ErrorCode code)
{
const Cardinality opCard(operand->staticType()->cardinality());
if(requiredCard.isMatch(opCard))
return operand;
else if(requiredCard.canMatch(opCard))
return Expression::Ptr(new CardinalityVerifier(operand, requiredCard, code));
else if(context->compatModeEnabled() &&
!opCard.isEmpty())
{
return GenericPredicate::createFirstItem(operand);
}
else
{
/* Sequences within this cardinality can never match. */
context->error(wrongCardinality(requiredCard, opCard), code, operand.data());
return operand;
}
}
CardinalityVerifier::CardinalityVerifier(const Expression::Ptr &operand,
const Cardinality &card,
const ReportContext::ErrorCode code)
: SingleContainer(operand),
m_reqCard(card),
m_allowsMany(operand->staticType()->cardinality().allowsMany()),
m_errorCode(code)
{
Q_ASSERT_X(m_reqCard != Cardinality::zeroOrMore(), Q_FUNC_INFO,
"It makes no sense to use CardinalityVerifier for cardinality zero-or-more.");
}
Item::Iterator::Ptr CardinalityVerifier::evaluateSequence(const DynamicContext::Ptr &context) const
{
const Item::Iterator::Ptr it(m_operand->evaluateSequence(context));
const Item next(it->next());
if(next)
{
const Item next2(it->next());
if(next2)
{
if(m_reqCard.allowsMany())
{
Item::List start;
start.append(next);
start.append(next2);
return Item::Iterator::Ptr(new InsertionIterator(it, 1, makeListIterator(start)));
}
else
{
context->error(wrongCardinality(m_reqCard, Cardinality::twoOrMore()), m_errorCode, this);
return CommonValues::emptyIterator;
}
}
else
{
/* We might be instantiated for the empty sequence. */
if(m_reqCard.isEmpty())
{
context->error(wrongCardinality(m_reqCard, Cardinality::twoOrMore()), m_errorCode, this);
return CommonValues::emptyIterator;
}
else
return makeSingletonIterator(next);
}
}
else
{
if(m_reqCard.allowsEmpty())
return CommonValues::emptyIterator;
else
{
context->error(wrongCardinality(m_reqCard, Cardinality::twoOrMore()), m_errorCode, this);
return CommonValues::emptyIterator;
}
}
}
Item CardinalityVerifier::evaluateSingleton(const DynamicContext::Ptr &context) const
{
if(m_allowsMany)
{
const Item::Iterator::Ptr it(m_operand->evaluateSequence(context));
const Item item(it->next());
if(item)
{
if(it->next())
{
context->error(wrongCardinality(m_reqCard, Cardinality::twoOrMore()),
m_errorCode, this);
return Item();
}
else
return item;
}
else if(m_reqCard.allowsEmpty())
return Item();
else
{
context->error(wrongCardinality(m_reqCard), m_errorCode, this);
return Item();
}
}
else
{
const Item item(m_operand->evaluateSingleton(context));
if(item)
return item;
else if(m_reqCard.allowsEmpty())
return Item();
else
{
context->error(wrongCardinality(m_reqCard), m_errorCode, this);
return Item();
}
}
}
const SourceLocationReflection *CardinalityVerifier::actualReflection() const
{
return m_operand->actualReflection();
}
Expression::Ptr CardinalityVerifier::compress(const StaticContext::Ptr &context)
{
if(m_reqCard.isMatch(m_operand->staticType()->cardinality()))
return m_operand->compress(context);
else
return SingleContainer::compress(context);
}
SequenceType::List CardinalityVerifier::expectedOperandTypes() const
{
SequenceType::List result;
result.append(CommonSequenceTypes::ZeroOrMoreItems);
return result;
}
SequenceType::Ptr CardinalityVerifier::staticType() const
{
return makeGenericSequenceType(m_operand->staticType()->itemType(), m_reqCard);
}
ExpressionVisitorResult::Ptr CardinalityVerifier::accept(const ExpressionVisitor::Ptr &visitor) const
{
return visitor->visit(this);
}
Expression::ID CardinalityVerifier::id() const
{
return IDCardinalityVerifier;
}
QT_END_NAMESPACE
|
