1 | /****************************************************************************
|
---|
2 | **
|
---|
3 | ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
---|
4 | ** Contact: Qt Software Information ([email protected])
|
---|
5 | **
|
---|
6 | ** This file is part of the QtXmlPatterns module of the Qt Toolkit.
|
---|
7 | **
|
---|
8 | ** $QT_BEGIN_LICENSE:LGPL$
|
---|
9 | ** Commercial Usage
|
---|
10 | ** Licensees holding valid Qt Commercial licenses may use this file in
|
---|
11 | ** accordance with the Qt Commercial License Agreement provided with the
|
---|
12 | ** Software or, alternatively, in accordance with the terms contained in
|
---|
13 | ** a written agreement between you and Nokia.
|
---|
14 | **
|
---|
15 | ** GNU Lesser General Public License Usage
|
---|
16 | ** Alternatively, this file may be used under the terms of the GNU Lesser
|
---|
17 | ** General Public License version 2.1 as published by the Free Software
|
---|
18 | ** Foundation and appearing in the file LICENSE.LGPL included in the
|
---|
19 | ** packaging of this file. Please review the following information to
|
---|
20 | ** ensure the GNU Lesser General Public License version 2.1 requirements
|
---|
21 | ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
---|
22 | **
|
---|
23 | ** In addition, as a special exception, Nokia gives you certain
|
---|
24 | ** additional rights. These rights are described in the Nokia Qt LGPL
|
---|
25 | ** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
|
---|
26 | ** package.
|
---|
27 | **
|
---|
28 | ** GNU General Public License Usage
|
---|
29 | ** Alternatively, this file may be used under the terms of the GNU
|
---|
30 | ** General Public License version 3.0 as published by the Free Software
|
---|
31 | ** Foundation and appearing in the file LICENSE.GPL included in the
|
---|
32 | ** packaging of this file. Please review the following information to
|
---|
33 | ** ensure the GNU General Public License version 3.0 requirements will be
|
---|
34 | ** met: http://www.gnu.org/copyleft/gpl.html.
|
---|
35 | **
|
---|
36 | ** If you are unsure which license is appropriate for your use, please
|
---|
37 | ** contact the sales department at [email protected].
|
---|
38 | ** $QT_END_LICENSE$
|
---|
39 | **
|
---|
40 | ****************************************************************************/
|
---|
41 |
|
---|
42 | #include "qitem_p.h"
|
---|
43 |
|
---|
44 | #include "qexceptiterator_p.h"
|
---|
45 |
|
---|
46 | QT_BEGIN_NAMESPACE
|
---|
47 |
|
---|
48 | using namespace QPatternist;
|
---|
49 |
|
---|
50 | ExceptIterator::ExceptIterator(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 ExceptIterator::fromFirstOperand()
|
---|
62 | {
|
---|
63 | ++m_position;
|
---|
64 | m_current = m_node1;
|
---|
65 | m_node1 = m_it1->next();
|
---|
66 |
|
---|
67 | return m_current;
|
---|
68 | }
|
---|
69 |
|
---|
70 | Item ExceptIterator::next()
|
---|
71 | {
|
---|
72 | while(true)
|
---|
73 | {
|
---|
74 | if(!m_node1)
|
---|
75 | {
|
---|
76 | m_position = -1;
|
---|
77 | m_current = Item();
|
---|
78 | return Item();
|
---|
79 | }
|
---|
80 | else if(!m_node2)
|
---|
81 | return fromFirstOperand();
|
---|
82 |
|
---|
83 | if(m_node1.asNode().model() != m_node2.asNode().model())
|
---|
84 | return fromFirstOperand();
|
---|
85 |
|
---|
86 | switch(m_node1.asNode().compareOrder(m_node2.asNode()))
|
---|
87 | {
|
---|
88 | case QXmlNodeModelIndex::Precedes:
|
---|
89 | return fromFirstOperand();
|
---|
90 | case QXmlNodeModelIndex::Follows:
|
---|
91 | {
|
---|
92 | m_node2 = m_it2->next();
|
---|
93 | if(m_node2)
|
---|
94 | continue;
|
---|
95 | else
|
---|
96 | return fromFirstOperand();
|
---|
97 | }
|
---|
98 | default:
|
---|
99 | {
|
---|
100 | m_node1 = m_it1->next();
|
---|
101 | m_node2 = m_it2->next();
|
---|
102 | }
|
---|
103 | }
|
---|
104 | }
|
---|
105 | }
|
---|
106 |
|
---|
107 | Item ExceptIterator::current() const
|
---|
108 | {
|
---|
109 | return m_current;
|
---|
110 | }
|
---|
111 |
|
---|
112 | xsInteger ExceptIterator::position() const
|
---|
113 | {
|
---|
114 | return m_position;
|
---|
115 | }
|
---|
116 |
|
---|
117 | Item::Iterator::Ptr ExceptIterator::copy() const
|
---|
118 | {
|
---|
119 | return Item::Iterator::Ptr(new ExceptIterator(m_it1->copy(), m_it2->copy()));
|
---|
120 | }
|
---|
121 |
|
---|
122 | QT_END_NAMESPACE
|
---|