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
116
117
118
119
120
121
122
123
124
|
/****************************************************************************
**
** Copyright (C) 2021 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:COMM$
**
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** $QT_END_LICENSE$
**
**
**
**
**
**
**
**
**
**
**
**
**
**
**
**
**
**
**
****************************************************************************/
#include "qinteger_p.h"
#include "qrangeiterator_p.h"
QT_BEGIN_NAMESPACE
using namespace QPatternist;
RangeIterator::RangeIterator(const xsInteger start,
const Direction direction,
const xsInteger end)
: m_start(start),
m_end(end),
m_position(0),
m_count(start),
m_direction(direction),
m_increment(m_direction == Forward ? 1 : -1)
{
Q_ASSERT(m_start < m_end);
Q_ASSERT(m_direction == Backward || m_direction == Forward);
if(m_direction == Backward)
{
qSwap(m_start, m_end);
m_count = m_start;
}
}
Item RangeIterator::next()
{
if(m_position == -1)
return Item();
else if((m_direction == Forward && m_count > m_end) ||
(m_direction == Backward && m_count < m_end))
{
m_position = -1;
m_current.reset();
return Item();
}
else
{
m_current = Integer::fromValue(m_count);
m_count += m_increment;
++m_position;
return m_current;
}
}
xsInteger RangeIterator::count()
{
/* This complication is for handling that m_start & m_end may be reversed. */
xsInteger ret;
if(m_start < m_end)
ret = m_end - m_start;
else
ret = m_start - m_end;
return ret + 1;
}
Item::Iterator::Ptr RangeIterator::toReversed()
{
return Item::Iterator::Ptr(new RangeIterator(m_start, Backward, m_end));
}
Item RangeIterator::current() const
{
return m_current;
}
xsInteger RangeIterator::position() const
{
return m_position;
}
Item::Iterator::Ptr RangeIterator::copy() const
{
if(m_direction == Backward)
return Item::Iterator::Ptr(new RangeIterator(m_end, Backward, m_start));
else
return Item::Iterator::Ptr(new RangeIterator(m_start, Forward, m_end));
}
QT_END_NAMESPACE
|