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
|
/****************************************************************************
**
** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** 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, Digia gives you certain additional
** rights. These rights are described in the Digia 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.
**
**
** $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_UnlimitedContainer_H
#define Patternist_UnlimitedContainer_H
#include <QList>
#include "qexpression_p.h"
#include "qgenericsequencetype_p.h"
QT_BEGIN_HEADER
QT_BEGIN_NAMESPACE
namespace QPatternist
{
/**
* @short Base class for expressions that has any amount of operands.
*
* @author Frans Englich <frans.englich@nokia.com>
* @ingroup Patternist_expressions
*/
class UnlimitedContainer : public Expression
{
public:
/**
* Creates an UnlimitedContainer containing the operands @p operands. @p operands
* may be empty.
*/
UnlimitedContainer(const Expression::List &operands = Expression::List());
virtual void setOperands(const Expression::List &list);
virtual Expression::List operands() const;
/**
* @note This function cannot be called before setOperands is called.
*/
virtual bool compressOperands(const StaticContext::Ptr &);
/**
* Tells how operandsUnionType() should compute the cardinality of
* its children.
*
* This type is public because of a bug in the HP-UX aCC compiler.
*/
enum CardinalityComputation
{
ProductOfCardinality,
UnionOfCardinality
};
protected:
/**
* Computes and returns the union type of all the Expression instances
* in this Expression's operands.
*
* This implementation is placed inside because CardinalityComputation
* can't be referenced from the outside(in conforming compilers).
*/
template<CardinalityComputation suppliedCard>
inline
SequenceType::Ptr operandsUnionType() const
{
Q_ASSERT(suppliedCard == ProductOfCardinality || suppliedCard == UnionOfCardinality);
const Expression::List::const_iterator end(m_operands.constEnd());
Expression::List::const_iterator it(m_operands.constBegin());
/* Load the first one, and jump over it in the loop. */
SequenceType::Ptr t(m_operands.first()->staticType());
ItemType::Ptr type(t->itemType());
Cardinality card(t->cardinality());
++it;
for(; it != end; ++it)
{
t = (*it)->staticType();
type |= t->itemType();
/* Since this function is a template function, it doesn't
* hurt performance that this test is inside the loop. */
if(suppliedCard == ProductOfCardinality)
card += t->cardinality();
else
card |= t->cardinality();
}
return makeGenericSequenceType(type, card);
}
Expression::List m_operands;
};
}
QT_END_NAMESPACE
QT_END_HEADER
#endif
|
