|
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 #include "qinsertioniterator_p.h" |
|
44 |
|
45 QT_BEGIN_NAMESPACE |
|
46 |
|
47 using namespace QPatternist; |
|
48 |
|
49 InsertionIterator::InsertionIterator(const Item::Iterator::Ptr &target, |
|
50 const xsInteger pos, |
|
51 const Item::Iterator::Ptr &inserts) |
|
52 : m_target(target), |
|
53 m_insertPos(pos), |
|
54 m_inserts(inserts), |
|
55 m_position(0), |
|
56 m_isInserting(pos == 1) |
|
57 { |
|
58 Q_ASSERT(target); |
|
59 Q_ASSERT(inserts); |
|
60 Q_ASSERT(m_insertPos >= 1); |
|
61 } |
|
62 |
|
63 Item InsertionIterator::next() |
|
64 { |
|
65 if(m_isInserting) |
|
66 { |
|
67 m_current = m_inserts->next(); |
|
68 |
|
69 if(m_current) |
|
70 { |
|
71 ++m_position; |
|
72 return m_current; |
|
73 } |
|
74 } |
|
75 else if(m_position == (m_insertPos - 1) && !m_isInserting) |
|
76 { /* Entered only the first time insertion starts. */ |
|
77 m_isInserting = true; |
|
78 return next(); |
|
79 } |
|
80 |
|
81 ++m_position; |
|
82 m_current = m_target->next(); |
|
83 |
|
84 if(m_current) |
|
85 return m_current; |
|
86 else if(m_inserts->position() == -1) /* We're at the end of the both iterators. */ |
|
87 { |
|
88 m_position = -1; |
|
89 m_current.reset(); |
|
90 return Item(); |
|
91 } |
|
92 |
|
93 /* Insert the insertion iterator, since it's still left. */ |
|
94 Q_ASSERT(m_target->position() < m_insertPos); |
|
95 m_isInserting = true; |
|
96 m_current = m_inserts->next(); |
|
97 |
|
98 if(m_current) |
|
99 return m_current; |
|
100 else |
|
101 { |
|
102 /* m_current is already null, so no need to reset it. */ |
|
103 m_position = -1; |
|
104 return Item(); |
|
105 } |
|
106 } |
|
107 |
|
108 xsInteger InsertionIterator::count() |
|
109 { |
|
110 return m_target->count() + m_inserts->count(); |
|
111 } |
|
112 |
|
113 Item InsertionIterator::current() const |
|
114 { |
|
115 return m_current; |
|
116 } |
|
117 |
|
118 xsInteger InsertionIterator::position() const |
|
119 { |
|
120 return m_position; |
|
121 } |
|
122 |
|
123 Item::Iterator::Ptr InsertionIterator::copy() const |
|
124 { |
|
125 return Item::Iterator::Ptr(new InsertionIterator(m_target->copy(), m_insertPos, m_inserts->copy())); |
|
126 } |
|
127 |
|
128 QT_END_NAMESPACE |