|
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 "qdeduplicateiterator_p.h" |
|
43 |
|
44 QT_BEGIN_NAMESPACE |
|
45 |
|
46 using namespace QPatternist; |
|
47 |
|
48 DeduplicateIterator::DeduplicateIterator(const Item::List &source) : ListIterator<Item>(source) |
|
49 , m_listPos(0) |
|
50 { |
|
51 Q_ASSERT(!Item()); |
|
52 Q_ASSERT(!Item().isNode()); |
|
53 Q_ASSERT(!Item().isAtomicValue()); |
|
54 } |
|
55 |
|
56 Item DeduplicateIterator::next() |
|
57 { |
|
58 if(m_listPos == m_list.count()) |
|
59 { |
|
60 m_current.reset(); |
|
61 m_position = -1; |
|
62 return Item(); |
|
63 } |
|
64 |
|
65 Item next(m_list.at(m_listPos)); |
|
66 |
|
67 while(next.asNode().is(m_current.asNode())) |
|
68 { |
|
69 ++m_listPos; |
|
70 if(m_listPos == m_list.count()) |
|
71 { |
|
72 m_current.reset(); |
|
73 m_position = -1; |
|
74 return Item(); |
|
75 } |
|
76 else |
|
77 next = m_list.at(m_listPos); |
|
78 } |
|
79 |
|
80 ++m_position; |
|
81 m_current = next; |
|
82 return next; |
|
83 } |
|
84 |
|
85 xsInteger DeduplicateIterator::count() |
|
86 { |
|
87 return QAbstractXmlForwardIterator<Item>::count(); |
|
88 } |
|
89 |
|
90 Item::Iterator::Ptr DeduplicateIterator::copy() const |
|
91 { |
|
92 return Item::Iterator::Ptr(new DeduplicateIterator(m_list)); |
|
93 } |
|
94 |
|
95 QT_END_NAMESPACE |