| 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 | // |
| 41 | // W A R N I N G |
| 42 | // ------------- |
| 43 | // |
| 44 | // This file is not part of the Qt API. It exists purely as an |
| 45 | // implementation detail. This header file may change from version to |
| 46 | // version without notice, or even be removed. |
| 47 | // |
| 48 | // We mean it. |
| 49 | |
| 50 | #ifndef Patternist_ReturnOrderBy_H |
| 51 | #define Patternist_ReturnOrderBy_H |
| 52 | |
| 53 | #include <private/qorderby_p.h> |
| 54 | #include <private/qunlimitedcontainer_p.h> |
| 55 | |
| 56 | QT_BEGIN_NAMESPACE |
| 57 | |
| 58 | namespace QPatternist |
| 59 | { |
| 60 | /** |
| 61 | * @short Together with OrderBy, it implements XQuery 1.0's <tt>order by</tt> expression. |
| 62 | * |
| 63 | * ReturnOrderBy evaluates the sort keys and values, and hands it over to |
| 64 | * OrderBy, which is an AST ancestor, using SortTuples. |
| 65 | * |
| 66 | * @author Frans Englich <frans.englich@nokia.com> |
| 67 | * @ingroup Patternist_expressions |
| 68 | */ |
| 69 | class ReturnOrderBy : public UnlimitedContainer |
| 70 | { |
| 71 | public: |
| 72 | /** |
| 73 | * In @p operands the first item is the return expression, and the |
| 74 | * rest, which is at least one, are the sort keys. |
| 75 | */ |
| 76 | ReturnOrderBy(const OrderBy::Stability stability, |
| 77 | const OrderBy::OrderSpec::Vector &oSpecs, |
| 78 | const Expression::List &operands); |
| 79 | |
| 80 | virtual Item evaluateSingleton(const DynamicContext::Ptr &context) const; |
| 81 | virtual bool evaluateEBV(const DynamicContext::Ptr &context) const; |
| 82 | virtual SequenceType::Ptr staticType() const; |
| 83 | virtual SequenceType::List expectedOperandTypes() const; |
| 84 | virtual Expression::Ptr compress(const StaticContext::Ptr &context); |
| 85 | virtual ExpressionVisitorResult::Ptr accept(const ExpressionVisitor::Ptr &visitor) const; |
| 86 | virtual ID id() const; |
| 87 | |
| 88 | inline OrderBy::OrderSpec::Vector orderSpecs() const |
| 89 | { |
| 90 | return m_orderSpecs; |
| 91 | } |
| 92 | |
| 93 | inline OrderBy::Stability stability() const |
| 94 | { |
| 95 | return m_stability; |
| 96 | } |
| 97 | |
| 98 | /** |
| 99 | * In the case of that we don't have a for-expression beloning us, but |
| 100 | * only a let clause, this ReturnOrderBy breaks if it stays in the AST. |
| 101 | * So, by default we assume that we should write ourselves away, unless |
| 102 | * this function is called. The associated ForClause will call it |
| 103 | * during typeCheck(), if it exists. |
| 104 | */ |
| 105 | inline void setStay(const bool a) |
| 106 | { |
| 107 | m_flyAway = !a; |
| 108 | } |
| 109 | |
| 110 | virtual Properties properties() const; |
| 111 | private: |
| 112 | /** |
| 113 | * This variable is unfortunately only used at compile time. However, |
| 114 | * it's tricky to get rid of it due to how QueryTransformParser would |
| 115 | * have to be adapted. |
| 116 | */ |
| 117 | const OrderBy::Stability m_stability; |
| 118 | |
| 119 | OrderBy::OrderSpec::Vector m_orderSpecs; |
| 120 | |
| 121 | /** |
| 122 | * @see stay() |
| 123 | */ |
| 124 | bool m_flyAway; |
| 125 | }; |
| 126 | } |
| 127 | |
| 128 | QT_END_NAMESPACE |
| 129 | |
| 130 | #endif |
| 131 | |