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 ****************************************************************************/
42 #include "qinteger_p.h"
44 #include "qrangeiterator_p.h"
48 using namespace QPatternist;
50 RangeIterator::RangeIterator(const xsInteger start,
51 const Direction direction,
57 m_direction(direction),
58 m_increment(m_direction == Forward ? 1 : -1)
60 Q_ASSERT(m_start < m_end);
61 Q_ASSERT(m_direction == Backward || m_direction == Forward);
63 if(m_direction == Backward)
65 qSwap(m_start, m_end);
70 Item RangeIterator::next()
74 else if((m_direction == Forward && m_count > m_end) ||
75 (m_direction == Backward && m_count < m_end))
83 m_current = Integer::fromValue(m_count);
84 m_count += m_increment;
90 xsInteger RangeIterator::count()
92 /* This complication is for handling that m_start & m_end may be reversed. */
96 ret = m_end - m_start;
98 ret = m_start - m_end;
103 Item::Iterator::Ptr RangeIterator::toReversed()
105 return Item::Iterator::Ptr(new RangeIterator(m_start, Backward, m_end));
108 Item RangeIterator::current() const
113 xsInteger RangeIterator::position() const
118 Item::Iterator::Ptr RangeIterator::copy() const
120 if(m_direction == Backward)
121 return Item::Iterator::Ptr(new RangeIterator(m_end, Backward, m_start));
123 return Item::Iterator::Ptr(new RangeIterator(m_start, Forward, m_end));