|
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_IntersectIterator_H |
|
53 #define Patternist_IntersectIterator_H |
|
54 |
|
55 #include "qitem_p.h" |
|
56 |
|
57 QT_BEGIN_HEADER |
|
58 |
|
59 QT_BEGIN_NAMESPACE |
|
60 |
|
61 namespace QPatternist |
|
62 { |
|
63 /** |
|
64 * @short Implements the @c intersect operator. That is, the computation |
|
65 * of the intersection between two sequences of nodes. |
|
66 * |
|
67 * The @c intersect operator can be seen as logical @c AND of the two sets. |
|
68 * |
|
69 * @ingroup Patternist_iterators |
|
70 */ |
|
71 class IntersectIterator : public Item::Iterator |
|
72 { |
|
73 public: |
|
74 /** |
|
75 * It is assumed that @p it1 and @p it2 are in document order and |
|
76 * without duplicates. |
|
77 */ |
|
78 IntersectIterator(const Item::Iterator::Ptr &it1, |
|
79 const Item::Iterator::Ptr &it2); |
|
80 |
|
81 virtual Item next(); |
|
82 virtual Item current() const; |
|
83 virtual xsInteger position() const; |
|
84 virtual Item::Iterator::Ptr copy() const; |
|
85 |
|
86 private: |
|
87 inline Item closedExit() |
|
88 { |
|
89 m_position = -1; |
|
90 m_current = Item(); |
|
91 return Item(); |
|
92 } |
|
93 |
|
94 const Item::Iterator::Ptr m_it1; |
|
95 const Item::Iterator::Ptr m_it2; |
|
96 Item m_current; |
|
97 xsInteger m_position; |
|
98 Item m_node1; |
|
99 Item m_node2; |
|
100 }; |
|
101 } |
|
102 |
|
103 QT_END_NAMESPACE |
|
104 |
|
105 QT_END_HEADER |
|
106 |
|
107 #endif |