1 /****************************************************************************
3 ** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
4 ** Contact: http://www.qt-project.org/
6 ** This file is part of the QtXmlPatterns module of the Qt Toolkit.
8 ** $QT_BEGIN_LICENSE:LGPL$
9 ** GNU Lesser General Public License Usage
10 ** This file may be used under the terms of the GNU Lesser General Public
11 ** License version 2.1 as published by the Free Software Foundation and
12 ** appearing in the file LICENSE.LGPL included in the packaging of this
13 ** file. Please review the following information to ensure the GNU Lesser
14 ** General Public License version 2.1 requirements will be met:
15 ** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
17 ** In addition, as a special exception, Nokia gives you certain additional
18 ** rights. These rights are described in the Nokia Qt LGPL Exception
19 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
21 ** GNU General Public License Usage
22 ** Alternatively, this file may be used under the terms of the GNU General
23 ** Public License version 3.0 as published by the Free Software Foundation
24 ** and appearing in the file LICENSE.GPL included in the packaging of this
25 ** file. Please review the following information to ensure the GNU General
26 ** Public License version 3.0 requirements will be met:
27 ** http://www.gnu.org/copyleft/gpl.html.
30 ** Alternatively, this file may be used in accordance with the terms and
31 ** conditions contained in a signed written agreement between you and Nokia.
40 ****************************************************************************/
44 #include "qintersectiterator_p.h"
48 using namespace QPatternist;
50 IntersectIterator::IntersectIterator(const Item::Iterator::Ptr &it1,
51 const Item::Iterator::Ptr &it2) : m_it1(it1),
54 m_node1(m_it1->next()),
55 m_node2(m_it2->next())
61 Item IntersectIterator::next()
63 if(!m_node1 || !m_node2)
68 if(m_node1.asNode().model() == m_node2.asNode().model())
70 switch(m_node1.asNode().compareOrder(m_node2.asNode()))
72 case QXmlNodeModelIndex::Precedes:
74 m_node1 = m_it1->next();
77 case QXmlNodeModelIndex::Follows:
79 m_node2 = m_it2->next();
85 m_node1 = m_it1->next();
86 m_node2 = m_it2->next();
93 m_node2 = m_it2->next();
95 while(m_node1 && m_node2);
100 Item IntersectIterator::current() const
105 xsInteger IntersectIterator::position() const
110 Item::Iterator::Ptr IntersectIterator::copy() const
112 return Item::Iterator::Ptr(new IntersectIterator(m_it1->copy(), m_it2->copy()));