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 "qinteger_p.h" |
41 | |
42 | #include "qrangeiterator_p.h" |
43 | |
44 | QT_BEGIN_NAMESPACE |
45 | |
46 | using namespace QPatternist; |
47 | |
48 | RangeIterator::RangeIterator(const xsInteger start, |
49 | const Direction direction, |
50 | const xsInteger end) |
51 | : m_start(start), |
52 | m_end(end), |
53 | m_position(0), |
54 | m_count(start), |
55 | m_direction(direction), |
56 | m_increment(m_direction == Forward ? 1 : -1) |
57 | { |
58 | Q_ASSERT(m_start < m_end); |
59 | Q_ASSERT(m_direction == Backward || m_direction == Forward); |
60 | |
61 | if(m_direction == Backward) |
62 | { |
63 | qSwap(value1&: m_start, value2&: m_end); |
64 | m_count = m_start; |
65 | } |
66 | } |
67 | |
68 | Item RangeIterator::next() |
69 | { |
70 | if(m_position == -1) |
71 | return Item(); |
72 | else if((m_direction == Forward && m_count > m_end) || |
73 | (m_direction == Backward && m_count < m_end)) |
74 | { |
75 | m_position = -1; |
76 | m_current.reset(); |
77 | return Item(); |
78 | } |
79 | else |
80 | { |
81 | m_current = Integer::fromValue(num: m_count); |
82 | m_count += m_increment; |
83 | ++m_position; |
84 | return m_current; |
85 | } |
86 | } |
87 | |
88 | xsInteger RangeIterator::count() |
89 | { |
90 | /* This complication is for handling that m_start & m_end may be reversed. */ |
91 | xsInteger ret; |
92 | |
93 | if(m_start < m_end) |
94 | ret = m_end - m_start; |
95 | else |
96 | ret = m_start - m_end; |
97 | |
98 | return ret + 1; |
99 | } |
100 | |
101 | Item::Iterator::Ptr RangeIterator::toReversed() |
102 | { |
103 | return Item::Iterator::Ptr(new RangeIterator(m_start, Backward, m_end)); |
104 | } |
105 | |
106 | Item RangeIterator::current() const |
107 | { |
108 | return m_current; |
109 | } |
110 | |
111 | xsInteger RangeIterator::position() const |
112 | { |
113 | return m_position; |
114 | } |
115 | |
116 | Item::Iterator::Ptr RangeIterator::copy() const |
117 | { |
118 | if(m_direction == Backward) |
119 | return Item::Iterator::Ptr(new RangeIterator(m_end, Backward, m_start)); |
120 | else |
121 | return Item::Iterator::Ptr(new RangeIterator(m_start, Forward, m_end)); |
122 | } |
123 | |
124 | QT_END_NAMESPACE |
125 | |