1 /****************************************************************************
2 **
3 ** Copyright (C) 2016 The Qt Company Ltd.
4 ** Contact: https://www.qt.io/licensing/
5 **
6 ** This file is part of the QtXmlPatterns module of the Qt Toolkit.
7 **
8 ** $QT_BEGIN_LICENSE:LGPL$
9 ** Commercial License Usage
10 ** Licensees holding valid commercial Qt licenses may use this file in
11 ** accordance with the commercial license agreement provided with the
12 ** Software or, alternatively, in accordance with the terms contained in
13 ** a written agreement between you and The Qt Company. For licensing terms
14 ** and conditions see https://www.qt.io/terms-conditions. For further
15 ** information use the contact form at https://www.qt.io/contact-us.
16 **
17 ** GNU Lesser General Public License Usage
18 ** Alternatively, this file may be used under the terms of the GNU Lesser
19 ** General Public License version 3 as published by the Free Software
20 ** Foundation and appearing in the file LICENSE.LGPL3 included in the
21 ** packaging of this file. Please review the following information to
22 ** ensure the GNU Lesser General Public License version 3 requirements
23 ** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
24 **
25 ** GNU General Public License Usage
26 ** Alternatively, this file may be used under the terms of the GNU
27 ** General Public License version 2.0 or (at your option) the GNU General
28 ** Public license version 3 or any later version approved by the KDE Free
29 ** Qt Foundation. The licenses are as published by the Free Software
30 ** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
31 ** included in the packaging of this file. Please review the following
32 ** information to ensure the GNU General Public License requirements will
33 ** be met: https://www.gnu.org/licenses/gpl-2.0.html and
34 ** https://www.gnu.org/licenses/gpl-3.0.html.
35 **
36 ** $QT_END_LICENSE$
37 **
38 ****************************************************************************/
39 
40 #include "qitem_p.h"
41 
42 #include "qunioniterator_p.h"
43 
44 QT_BEGIN_NAMESPACE
45 
46 using namespace QPatternist;
47 
UnionIterator(const Item::Iterator::Ptr & it1,const Item::Iterator::Ptr & it2)48 UnionIterator::UnionIterator(const Item::Iterator::Ptr &it1,
49                              const Item::Iterator::Ptr &it2) : m_it1(it1),
50                                                                m_it2(it2),
51                                                                m_position(0),
52                                                                m_node1(m_it1->next()),
53                                                                m_node2(m_it2->next())
54 {
55     Q_ASSERT(m_it1);
56     Q_ASSERT(m_it2);
57 }
58 
next()59 Item UnionIterator::next()
60 {
61     ++m_position;
62     if(m_node1 && m_node2)
63     {
64         if(m_node1.asNode().model() != m_node2.asNode().model())
65         {
66             m_current = m_node1;
67             m_node1 = m_it1->next();
68             return m_current;
69         }
70 
71         switch(m_node1.asNode().compareOrder(m_node2.asNode()))
72         {
73             case QXmlNodeModelIndex::Precedes:
74             {
75                 m_current = m_node1;
76                 m_node1 = m_it1->next();
77                 return m_current;
78             }
79             case QXmlNodeModelIndex::Follows:
80             {
81                 m_current = m_node2;
82                 m_node2 = m_it2->next();
83                 return m_current;
84             }
85             default:
86             {
87                 m_current = m_node2;
88                 m_node1 = m_it1->next();
89                 m_node2 = m_it2->next();
90                 return m_current;
91             }
92         }
93     }
94 
95     if(m_node1)
96     {
97         m_current = m_node1;
98         m_node1 = m_it1->next();
99         return m_current;
100     }
101 
102     if(m_node2)
103     {
104         m_current = m_node2;
105         m_node2 = m_it2->next();
106         return m_current;
107     }
108 
109     m_current.reset();
110     m_position = -1;
111     return Item();
112 }
113 
current() const114 Item UnionIterator::current() const
115 {
116     return m_current;
117 }
118 
position() const119 xsInteger UnionIterator::position() const
120 {
121     return m_position;
122 }
123 
copy() const124 Item::Iterator::Ptr UnionIterator::copy() const
125 {
126     return Item::Iterator::Ptr(new UnionIterator(m_it1->copy(), m_it2->copy()));
127 }
128 
129 QT_END_NAMESPACE
130