|
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 #include "qitem_p.h" |
|
43 |
|
44 #include "qunioniterator_p.h" |
|
45 |
|
46 QT_BEGIN_NAMESPACE |
|
47 |
|
48 using namespace QPatternist; |
|
49 |
|
50 UnionIterator::UnionIterator(const Item::Iterator::Ptr &it1, |
|
51 const Item::Iterator::Ptr &it2) : m_it1(it1), |
|
52 m_it2(it2), |
|
53 m_position(0), |
|
54 m_node1(m_it1->next()), |
|
55 m_node2(m_it2->next()) |
|
56 { |
|
57 Q_ASSERT(m_it1); |
|
58 Q_ASSERT(m_it2); |
|
59 } |
|
60 |
|
61 Item UnionIterator::next() |
|
62 { |
|
63 ++m_position; |
|
64 if(m_node1 && m_node2) |
|
65 { |
|
66 if(m_node1.asNode().model() != m_node2.asNode().model()) |
|
67 { |
|
68 m_current = m_node1; |
|
69 m_node1 = m_it1->next(); |
|
70 return m_current; |
|
71 } |
|
72 |
|
73 switch(m_node1.asNode().compareOrder(m_node2.asNode())) |
|
74 { |
|
75 case QXmlNodeModelIndex::Precedes: |
|
76 { |
|
77 m_current = m_node1; |
|
78 m_node1 = m_it1->next(); |
|
79 return m_current; |
|
80 } |
|
81 case QXmlNodeModelIndex::Follows: |
|
82 { |
|
83 m_current = m_node2; |
|
84 m_node2 = m_it2->next(); |
|
85 return m_current; |
|
86 } |
|
87 default: |
|
88 { |
|
89 m_current = m_node2; |
|
90 m_node1 = m_it1->next(); |
|
91 m_node2 = m_it2->next(); |
|
92 return m_current; |
|
93 } |
|
94 } |
|
95 } |
|
96 |
|
97 if(m_node1) |
|
98 { |
|
99 m_current = m_node1; |
|
100 m_node1 = m_it1->next(); |
|
101 return m_current; |
|
102 } |
|
103 |
|
104 if(m_node2) |
|
105 { |
|
106 m_current = m_node2; |
|
107 m_node2 = m_it2->next(); |
|
108 return m_current; |
|
109 } |
|
110 |
|
111 m_current.reset(); |
|
112 m_position = -1; |
|
113 return Item(); |
|
114 } |
|
115 |
|
116 Item UnionIterator::current() const |
|
117 { |
|
118 return m_current; |
|
119 } |
|
120 |
|
121 xsInteger UnionIterator::position() const |
|
122 { |
|
123 return m_position; |
|
124 } |
|
125 |
|
126 Item::Iterator::Ptr UnionIterator::copy() const |
|
127 { |
|
128 return Item::Iterator::Ptr(new UnionIterator(m_it1->copy(), m_it2->copy())); |
|
129 } |
|
130 |
|
131 QT_END_NAMESPACE |