|
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 "qinteger_p.h" |
|
43 |
|
44 #include "qindexofiterator_p.h" |
|
45 |
|
46 QT_BEGIN_NAMESPACE |
|
47 |
|
48 using namespace QPatternist; |
|
49 |
|
50 IndexOfIterator::IndexOfIterator(const Item::Iterator::Ptr &seq, |
|
51 const Item &searchParam, |
|
52 const AtomicComparator::Ptr &comp, |
|
53 const DynamicContext::Ptr &context, |
|
54 const Expression::ConstPtr &expr) |
|
55 : m_seq(seq) |
|
56 , m_searchParam(searchParam) |
|
57 , m_context(context) |
|
58 , m_expr(expr) |
|
59 , m_position(0) |
|
60 , m_seqPos(0) |
|
61 { |
|
62 Q_ASSERT(seq); |
|
63 Q_ASSERT(searchParam); |
|
64 prepareComparison(comp); |
|
65 } |
|
66 |
|
67 Item IndexOfIterator::next() |
|
68 { |
|
69 if(m_position == -1) |
|
70 return Item(); |
|
71 |
|
72 const Item item(m_seq->next()); |
|
73 ++m_seqPos; |
|
74 |
|
75 if(!item) |
|
76 { |
|
77 m_current.reset(); |
|
78 m_position = -1; |
|
79 return Item(); |
|
80 } |
|
81 |
|
82 if(flexibleCompare(item, m_searchParam, m_context)) |
|
83 { |
|
84 ++m_position; |
|
85 return Integer::fromValue(m_seqPos); |
|
86 } |
|
87 |
|
88 return next(); |
|
89 } |
|
90 |
|
91 Item IndexOfIterator::current() const |
|
92 { |
|
93 return m_current; |
|
94 } |
|
95 |
|
96 xsInteger IndexOfIterator::position() const |
|
97 { |
|
98 return m_position; |
|
99 } |
|
100 |
|
101 Item::Iterator::Ptr IndexOfIterator::copy() const |
|
102 { |
|
103 return Item::Iterator::Ptr(new IndexOfIterator(m_seq->copy(), |
|
104 m_searchParam, |
|
105 comparator(), |
|
106 m_context, |
|
107 m_expr)); |
|
108 } |
|
109 |
|
110 const SourceLocationReflection *IndexOfIterator::actualReflection() const |
|
111 { |
|
112 return m_expr.data(); |
|
113 } |
|
114 |
|
115 QT_END_NAMESPACE |