[2] | 1 | /****************************************************************************
|
---|
| 2 | **
|
---|
[846] | 3 | ** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
|
---|
[561] | 4 | ** All rights reserved.
|
---|
| 5 | ** Contact: Nokia Corporation ([email protected])
|
---|
[2] | 6 | **
|
---|
| 7 | ** This file is part of the QtXmlPatterns module of the Qt Toolkit.
|
---|
| 8 | **
|
---|
| 9 | ** $QT_BEGIN_LICENSE:LGPL$
|
---|
| 10 | ** Commercial Usage
|
---|
| 11 | ** Licensees holding valid Qt Commercial licenses may use this file in
|
---|
| 12 | ** accordance with the Qt Commercial License Agreement provided with the
|
---|
| 13 | ** Software or, alternatively, in accordance with the terms contained in
|
---|
| 14 | ** a written agreement between you and Nokia.
|
---|
| 15 | **
|
---|
| 16 | ** GNU Lesser General Public License Usage
|
---|
| 17 | ** Alternatively, this file may be used under the terms of the GNU Lesser
|
---|
| 18 | ** General Public License version 2.1 as published by the Free Software
|
---|
| 19 | ** Foundation and appearing in the file LICENSE.LGPL included in the
|
---|
| 20 | ** packaging of this file. Please review the following information to
|
---|
| 21 | ** ensure the GNU Lesser General Public License version 2.1 requirements
|
---|
| 22 | ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
---|
| 23 | **
|
---|
[561] | 24 | ** In addition, as a special exception, Nokia gives you certain additional
|
---|
| 25 | ** rights. These rights are described in the Nokia Qt LGPL Exception
|
---|
| 26 | ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
---|
[2] | 27 | **
|
---|
| 28 | ** GNU General Public License Usage
|
---|
| 29 | ** Alternatively, this file may be used under the terms of the GNU
|
---|
| 30 | ** General Public License version 3.0 as published by the Free Software
|
---|
| 31 | ** Foundation and appearing in the file LICENSE.GPL included in the
|
---|
| 32 | ** packaging of this file. Please review the following information to
|
---|
| 33 | ** ensure the GNU General Public License version 3.0 requirements will be
|
---|
| 34 | ** met: http://www.gnu.org/copyleft/gpl.html.
|
---|
| 35 | **
|
---|
[561] | 36 | ** If you have questions regarding the use of this file, please contact
|
---|
| 37 | ** Nokia at [email protected].
|
---|
[2] | 38 | ** $QT_END_LICENSE$
|
---|
| 39 | **
|
---|
| 40 | ****************************************************************************/
|
---|
| 41 |
|
---|
| 42 | #include "qinteger_p.h"
|
---|
| 43 |
|
---|
| 44 | #include "qrangeiterator_p.h"
|
---|
| 45 |
|
---|
| 46 | QT_BEGIN_NAMESPACE
|
---|
| 47 |
|
---|
| 48 | using namespace QPatternist;
|
---|
| 49 |
|
---|
| 50 | RangeIterator::RangeIterator(const xsInteger start,
|
---|
| 51 | const Direction direction,
|
---|
| 52 | const xsInteger end)
|
---|
| 53 | : m_start(start),
|
---|
| 54 | m_end(end),
|
---|
| 55 | m_position(0),
|
---|
| 56 | m_count(start),
|
---|
| 57 | m_direction(direction),
|
---|
| 58 | m_increment(m_direction == Forward ? 1 : -1)
|
---|
| 59 | {
|
---|
| 60 | Q_ASSERT(m_start < m_end);
|
---|
| 61 | Q_ASSERT(m_direction == Backward || m_direction == Forward);
|
---|
| 62 |
|
---|
| 63 | if(m_direction == Backward)
|
---|
| 64 | {
|
---|
| 65 | qSwap(m_start, m_end);
|
---|
| 66 | m_count = m_start;
|
---|
| 67 | }
|
---|
| 68 | }
|
---|
| 69 |
|
---|
| 70 | Item RangeIterator::next()
|
---|
| 71 | {
|
---|
| 72 | if(m_position == -1)
|
---|
| 73 | return Item();
|
---|
| 74 | else if((m_direction == Forward && m_count > m_end) ||
|
---|
| 75 | (m_direction == Backward && m_count < m_end))
|
---|
| 76 | {
|
---|
| 77 | m_position = -1;
|
---|
| 78 | m_current.reset();
|
---|
| 79 | return Item();
|
---|
| 80 | }
|
---|
| 81 | else
|
---|
| 82 | {
|
---|
| 83 | m_current = Integer::fromValue(m_count);
|
---|
| 84 | m_count += m_increment;
|
---|
| 85 | ++m_position;
|
---|
| 86 | return m_current;
|
---|
| 87 | }
|
---|
| 88 | }
|
---|
| 89 |
|
---|
| 90 | xsInteger RangeIterator::count()
|
---|
| 91 | {
|
---|
| 92 | /* This complication is for handling that m_start & m_end may be reversed. */
|
---|
| 93 | xsInteger ret;
|
---|
| 94 |
|
---|
| 95 | if(m_start < m_end)
|
---|
| 96 | ret = m_end - m_start;
|
---|
| 97 | else
|
---|
| 98 | ret = m_start - m_end;
|
---|
| 99 |
|
---|
| 100 | return ret + 1;
|
---|
| 101 | }
|
---|
| 102 |
|
---|
| 103 | Item::Iterator::Ptr RangeIterator::toReversed()
|
---|
| 104 | {
|
---|
| 105 | return Item::Iterator::Ptr(new RangeIterator(m_start, Backward, m_end));
|
---|
| 106 | }
|
---|
| 107 |
|
---|
| 108 | Item RangeIterator::current() const
|
---|
| 109 | {
|
---|
| 110 | return m_current;
|
---|
| 111 | }
|
---|
| 112 |
|
---|
| 113 | xsInteger RangeIterator::position() const
|
---|
| 114 | {
|
---|
| 115 | return m_position;
|
---|
| 116 | }
|
---|
| 117 |
|
---|
| 118 | Item::Iterator::Ptr RangeIterator::copy() const
|
---|
| 119 | {
|
---|
| 120 | if(m_direction == Backward)
|
---|
| 121 | return Item::Iterator::Ptr(new RangeIterator(m_end, Backward, m_start));
|
---|
| 122 | else
|
---|
| 123 | return Item::Iterator::Ptr(new RangeIterator(m_start, Forward, m_end));
|
---|
| 124 | }
|
---|
| 125 |
|
---|
| 126 | QT_END_NAMESPACE
|
---|