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 ****************************************************************************/
43 #include "qinsertioniterator_p.h"
47 using namespace QPatternist;
49 InsertionIterator::InsertionIterator(const Item::Iterator::Ptr &target,
51 const Item::Iterator::Ptr &inserts)
56 m_isInserting(pos == 1)
60 Q_ASSERT(m_insertPos >= 1);
63 Item InsertionIterator::next()
67 m_current = m_inserts->next();
75 else if(m_position == (m_insertPos - 1) && !m_isInserting)
76 { /* Entered only the first time insertion starts. */
82 m_current = m_target->next();
86 else if(m_inserts->position() == -1) /* We're at the end of the both iterators. */
93 /* Insert the insertion iterator, since it's still left. */
94 Q_ASSERT(m_target->position() < m_insertPos);
96 m_current = m_inserts->next();
102 /* m_current is already null, so no need to reset it. */
108 xsInteger InsertionIterator::count()
110 return m_target->count() + m_inserts->count();
113 Item InsertionIterator::current() const
118 xsInteger InsertionIterator::position() const
123 Item::Iterator::Ptr InsertionIterator::copy() const
125 return Item::Iterator::Ptr(new InsertionIterator(m_target->copy(), m_insertPos, m_inserts->copy()));