1 | /**************************************************************************** |
2 | ** |
3 | ** Copyright (C) 2016 The Qt Company Ltd. |
4 | ** Contact: https://www.qt.io/licensing/ |
5 | ** |
6 | ** This file is part of the QtXmlPatterns module of the Qt Toolkit. |
7 | ** |
8 | ** $QT_BEGIN_LICENSE:LGPL$ |
9 | ** Commercial License Usage |
10 | ** Licensees holding valid commercial Qt licenses may use this file in |
11 | ** accordance with the commercial license agreement provided with the |
12 | ** Software or, alternatively, in accordance with the terms contained in |
13 | ** a written agreement between you and The Qt Company. For licensing terms |
14 | ** and conditions see https://www.qt.io/terms-conditions. For further |
15 | ** information use the contact form at https://www.qt.io/contact-us. |
16 | ** |
17 | ** GNU Lesser General Public License Usage |
18 | ** Alternatively, this file may be used under the terms of the GNU Lesser |
19 | ** General Public License version 3 as published by the Free Software |
20 | ** Foundation and appearing in the file LICENSE.LGPL3 included in the |
21 | ** packaging of this file. Please review the following information to |
22 | ** ensure the GNU Lesser General Public License version 3 requirements |
23 | ** will be met: https://www.gnu.org/licenses/lgpl-3.0.html. |
24 | ** |
25 | ** GNU General Public License Usage |
26 | ** Alternatively, this file may be used under the terms of the GNU |
27 | ** General Public License version 2.0 or (at your option) the GNU General |
28 | ** Public license version 3 or any later version approved by the KDE Free |
29 | ** Qt Foundation. The licenses are as published by the Free Software |
30 | ** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3 |
31 | ** included in the packaging of this file. Please review the following |
32 | ** information to ensure the GNU General Public License requirements will |
33 | ** be met: https://www.gnu.org/licenses/gpl-2.0.html and |
34 | ** https://www.gnu.org/licenses/gpl-3.0.html. |
35 | ** |
36 | ** $QT_END_LICENSE$ |
37 | ** |
38 | ****************************************************************************/ |
39 | |
40 | #include "qcommonsequencetypes_p.h" |
41 | #include "qexpressionsequence_p.h" |
42 | #include "qsorttuple_p.h" |
43 | |
44 | #include "qreturnorderby_p.h" |
45 | |
46 | QT_BEGIN_NAMESPACE |
47 | |
48 | using namespace QPatternist; |
49 | |
50 | ReturnOrderBy::ReturnOrderBy(const OrderBy::Stability aStability, |
51 | const OrderBy::OrderSpec::Vector &oSpecs, |
52 | const Expression::List &ops) : UnlimitedContainer(ops) |
53 | , m_stability(aStability) |
54 | , m_orderSpecs(oSpecs) |
55 | , m_flyAway(true) |
56 | { |
57 | Q_ASSERT_X(m_operands.size() >= 2, Q_FUNC_INFO, |
58 | "ReturnOrderBy must have the return expression, and at least one sort key." ); |
59 | Q_ASSERT(m_orderSpecs.size() == ops.size() - 1); |
60 | } |
61 | |
62 | Item ReturnOrderBy::evaluateSingleton(const DynamicContext::Ptr &context) const |
63 | { |
64 | Q_ASSERT(m_operands.size() > 1); |
65 | const Item::Iterator::Ptr value(makeListIterator(list: m_operands.first()->evaluateSequence(context)->toList())); |
66 | Item::Vector sortKeys; |
67 | |
68 | /* We're skipping the first operand. */ |
69 | const int len = m_operands.size() - 1; |
70 | sortKeys.resize(asize: len); |
71 | |
72 | for(int i = 1; i <= len; ++i) |
73 | sortKeys[i - 1] = m_operands.at(i)->evaluateSingleton(context); |
74 | |
75 | return Item(new SortTuple(value, sortKeys)); |
76 | } |
77 | |
78 | bool ReturnOrderBy::evaluateEBV(const DynamicContext::Ptr &context) const |
79 | { |
80 | // TODO This is temporary code. |
81 | return m_operands.first()->evaluateEBV(context); |
82 | } |
83 | |
84 | Expression::Ptr ReturnOrderBy::compress(const StaticContext::Ptr &context) |
85 | { |
86 | /* We first did this in typeCheck(), but that broke due to that type checks were |
87 | * missed, which other pieces relied on. */ |
88 | if(m_flyAway) |
89 | { |
90 | /* We only want the return expression, not the sort keys. */ |
91 | return m_operands.first()->compress(context); |
92 | } |
93 | else |
94 | { |
95 | /* We don't need the members, so don't keep a reference to them. */ |
96 | m_orderSpecs.clear(); |
97 | |
98 | return UnlimitedContainer::compress(context); |
99 | } |
100 | } |
101 | |
102 | Expression::Properties ReturnOrderBy::properties() const |
103 | { |
104 | /* For some unknown reason this is necessary for XQTS test case orderBy18. */ |
105 | return DisableElimination; |
106 | } |
107 | |
108 | ExpressionVisitorResult::Ptr ReturnOrderBy::accept(const ExpressionVisitor::Ptr &visitor) const |
109 | { |
110 | return visitor->visit(this); |
111 | } |
112 | |
113 | SequenceType::Ptr ReturnOrderBy::staticType() const |
114 | { |
115 | return m_operands.first()->staticType(); |
116 | } |
117 | |
118 | SequenceType::List ReturnOrderBy::expectedOperandTypes() const |
119 | { |
120 | SequenceType::List result; |
121 | result.append(t: CommonSequenceTypes::ZeroOrMoreItems); |
122 | result.append(t: CommonSequenceTypes::ZeroOrOneAtomicType); |
123 | return result; |
124 | } |
125 | |
126 | Expression::ID ReturnOrderBy::id() const |
127 | { |
128 | return IDReturnOrderBy; |
129 | } |
130 | |
131 | QT_END_NAMESPACE |
132 | |