blob: 2420566eebce1d240fcaf0348efd29287cb62843 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.1, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qitem_p.h"
#include "qintersectiterator_p.h"
QT_BEGIN_NAMESPACE
using namespace QPatternist;
IntersectIterator::IntersectIterator(const Item::Iterator::Ptr &it1,
const Item::Iterator::Ptr &it2) : m_it1(it1),
m_it2(it2),
m_position(0),
m_node1(m_it1->next()),
m_node2(m_it2->next())
{
Q_ASSERT(m_it1);
Q_ASSERT(m_it2);
}
Item IntersectIterator::next()
{
if(!m_node1 || !m_node2)
return closedExit();
do
{
if(m_node1.asNode().model() == m_node2.asNode().model())
{
switch(m_node1.asNode().compareOrder(m_node2.asNode()))
{
case QXmlNodeModelIndex::Precedes:
{
m_node1 = m_it1->next();
break;
}
case QXmlNodeModelIndex::Follows:
{
m_node2 = m_it2->next();
break;
}
default:
{
m_current = m_node2;
m_node1 = m_it1->next();
m_node2 = m_it2->next();
++m_position;
return m_current;
}
}
}
else
m_node2 = m_it2->next();
}
while(m_node1 && m_node2);
return Item();
}
Item IntersectIterator::current() const
{
return m_current;
}
xsInteger IntersectIterator::position() const
{
return m_position;
}
Item::Iterator::Ptr IntersectIterator::copy() const
{
return Item::Iterator::Ptr(new IntersectIterator(m_it1->copy(), m_it2->copy()));
}
QT_END_NAMESPACE
|
