0
|
1 |
/****************************************************************************
|
|
2 |
**
|
|
3 |
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
4 |
** All rights reserved.
|
|
5 |
** Contact: Nokia Corporation (qt-info@nokia.com)
|
|
6 |
**
|
|
7 |
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
|
|
8 |
**
|
|
9 |
** $QT_BEGIN_LICENSE:LGPL$
|
|
10 |
** No Commercial Usage
|
|
11 |
** This file contains pre-release code and may not be distributed.
|
|
12 |
** You may use this file in accordance with the terms and conditions
|
|
13 |
** contained in the Technology Preview License Agreement accompanying
|
|
14 |
** this package.
|
|
15 |
**
|
|
16 |
** GNU Lesser General Public License Usage
|
|
17 |
** Alternatively, this file may be used under the terms of the GNU Lesser
|
|
18 |
** General Public License version 2.1 as published by the Free Software
|
|
19 |
** Foundation and appearing in the file LICENSE.LGPL included in the
|
|
20 |
** packaging of this file. Please review the following information to
|
|
21 |
** ensure the GNU Lesser General Public License version 2.1 requirements
|
|
22 |
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
|
23 |
**
|
|
24 |
** In addition, as a special exception, Nokia gives you certain additional
|
|
25 |
** rights. These rights are described in the Nokia Qt LGPL Exception
|
|
26 |
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
27 |
**
|
|
28 |
** If you have questions regarding the use of this file, please contact
|
|
29 |
** Nokia at qt-info@nokia.com.
|
|
30 |
**
|
|
31 |
**
|
|
32 |
**
|
|
33 |
**
|
|
34 |
**
|
|
35 |
**
|
|
36 |
**
|
|
37 |
**
|
|
38 |
** $QT_END_LICENSE$
|
|
39 |
**
|
|
40 |
****************************************************************************/
|
|
41 |
|
|
42 |
//
|
|
43 |
// W A R N I N G
|
|
44 |
// -------------
|
|
45 |
//
|
|
46 |
// This file is not part of the Qt API. It exists purely as an
|
|
47 |
// implementation detail. This header file may change from version to
|
|
48 |
// version without notice, or even be removed.
|
|
49 |
//
|
|
50 |
// We mean it.
|
|
51 |
|
|
52 |
#ifndef Patternist_ExpressionSequence_H
|
|
53 |
#define Patternist_ExpressionSequence_H
|
|
54 |
|
|
55 |
#include "qunlimitedcontainer_p.h"
|
|
56 |
|
|
57 |
QT_BEGIN_HEADER
|
|
58 |
|
|
59 |
QT_BEGIN_NAMESPACE
|
|
60 |
|
|
61 |
namespace QPatternist
|
|
62 |
{
|
|
63 |
/**
|
|
64 |
* @short Implements the comma(",") operator, the sequence constructor.
|
|
65 |
*
|
|
66 |
* For example, the expression <tt>alpha, beta</tt> evaluates to a sequence
|
|
67 |
* containing the items the nodetest @c alpha evaluates to, concatenated
|
|
68 |
* with the items the nodetest @c beta evaluates to.
|
|
69 |
*
|
|
70 |
* @see <a href="http://www.w3.org/TR/xpath20/#construct_seq">XML Path Language
|
|
71 |
* (XPath) 2.0, 3.3.1 Constructing Sequences</a>
|
|
72 |
* @author Frans Englich <frans.englich@nokia.com>
|
|
73 |
* @ingroup Patternist_expressions
|
|
74 |
*/
|
|
75 |
class ExpressionSequence : public UnlimitedContainer
|
|
76 |
{
|
|
77 |
public:
|
|
78 |
/**
|
|
79 |
* Creates an ExpressionSequence with the operands @p operands. @p operands
|
|
80 |
* must contain two or more Expression instances.
|
|
81 |
*/
|
|
82 |
ExpressionSequence(const Expression::List &operands);
|
|
83 |
|
|
84 |
virtual Item::Iterator::Ptr evaluateSequence(const DynamicContext::Ptr &) const;
|
|
85 |
|
|
86 |
/**
|
|
87 |
* Forwards the call to its children.
|
|
88 |
*/
|
|
89 |
virtual void evaluateToSequenceReceiver(const DynamicContext::Ptr &context) const;
|
|
90 |
|
|
91 |
virtual SequenceType::List expectedOperandTypes() const;
|
|
92 |
virtual SequenceType::Ptr staticType() const;
|
|
93 |
|
|
94 |
/**
|
|
95 |
* Removes any empty sequences, typically "()", from its list of children. If
|
|
96 |
* after that rewrite has no children, it rewrites itself to the CommonValues::empty;
|
|
97 |
* if it has only one, it rewrites to the child.
|
|
98 |
*
|
|
99 |
* This optimization is not very usable by itself, but potentially becomes effective after other
|
|
100 |
* optimizations have rewritten themselves into empty sequences. Thus,
|
|
101 |
* saving memory consumption and runtime overhead.
|
|
102 |
*/
|
|
103 |
virtual Expression::Ptr compress(const StaticContext::Ptr &context);
|
|
104 |
|
|
105 |
inline Item::Iterator::Ptr mapToSequence(const Expression::Ptr &,
|
|
106 |
const DynamicContext::Ptr &) const;
|
|
107 |
|
|
108 |
virtual Expression::Ptr typeCheck(const StaticContext::Ptr &context,
|
|
109 |
const SequenceType::Ptr &reqType);
|
|
110 |
/**
|
|
111 |
* @returns Expression::DisableElimination, plus the union
|
|
112 |
* of all this ExpressionSequence's children's properties. If any child
|
|
113 |
* does not have IsEvaluated, it is removed from the result.
|
|
114 |
*/
|
|
115 |
virtual Expression::Properties properties() const;
|
|
116 |
virtual ExpressionVisitorResult::Ptr accept(const ExpressionVisitor::Ptr &visitor) const;
|
|
117 |
virtual ID id() const;
|
|
118 |
private:
|
|
119 |
typedef QExplicitlySharedDataPointer<const ExpressionSequence> ConstPtr;
|
|
120 |
};
|
|
121 |
}
|
|
122 |
|
|
123 |
QT_END_NAMESPACE
|
|
124 |
|
|
125 |
QT_END_HEADER
|
|
126 |
|
|
127 |
#endif
|