| 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 |  | 
| 41 | #include "qinsertioniterator_p.h" | 
| 42 |  | 
| 43 | QT_BEGIN_NAMESPACE | 
| 44 |  | 
| 45 | using namespace QPatternist; | 
| 46 |  | 
| 47 | InsertionIterator::InsertionIterator(const Item::Iterator::Ptr &target, | 
| 48 |                                      const xsInteger pos, | 
| 49 |                                      const Item::Iterator::Ptr &inserts) | 
| 50 |                                     : m_target(target), | 
| 51 |                                       m_insertPos(pos), | 
| 52 |                                       m_inserts(inserts), | 
| 53 |                                       m_position(0), | 
| 54 |                                       m_isInserting(pos == 1) | 
| 55 | { | 
| 56 |     Q_ASSERT(target); | 
| 57 |     Q_ASSERT(inserts); | 
| 58 |     Q_ASSERT(m_insertPos >= 1); | 
| 59 | } | 
| 60 |  | 
| 61 | Item InsertionIterator::next() | 
| 62 | { | 
| 63 |     if(m_isInserting) | 
| 64 |     { | 
| 65 |         m_current = m_inserts->next(); | 
| 66 |  | 
| 67 |         if(m_current) | 
| 68 |         { | 
| 69 |             ++m_position; | 
| 70 |             return m_current; | 
| 71 |         } | 
| 72 |     } | 
| 73 |     else if(m_position == (m_insertPos - 1) && !m_isInserting) | 
| 74 |     { /* Entered only the first time insertion starts. */ | 
| 75 |         m_isInserting = true; | 
| 76 |         return next(); | 
| 77 |     } | 
| 78 |  | 
| 79 |     ++m_position; | 
| 80 |     m_current = m_target->next(); | 
| 81 |  | 
| 82 |     if(m_current) | 
| 83 |         return m_current; | 
| 84 |     else if(m_inserts->position() == -1) /* We're at the end of the both iterators. */ | 
| 85 |     { | 
| 86 |         m_position = -1; | 
| 87 |         m_current.reset(); | 
| 88 |         return Item(); | 
| 89 |     } | 
| 90 |  | 
| 91 |     /* Insert the insertion iterator, since it's still left. */ | 
| 92 |     Q_ASSERT(m_target->position() < m_insertPos); | 
| 93 |     m_isInserting = true; | 
| 94 |     m_current = m_inserts->next(); | 
| 95 |  | 
| 96 |     if(m_current) | 
| 97 |         return m_current; | 
| 98 |     else | 
| 99 |     { | 
| 100 |         /* m_current is already null, so no need to reset it. */ | 
| 101 |         m_position = -1; | 
| 102 |         return Item(); | 
| 103 |     } | 
| 104 | } | 
| 105 |  | 
| 106 | xsInteger InsertionIterator::count() | 
| 107 | { | 
| 108 |     return m_target->count() + m_inserts->count(); | 
| 109 | } | 
| 110 |  | 
| 111 | Item InsertionIterator::current() const | 
| 112 | { | 
| 113 |     return m_current; | 
| 114 | } | 
| 115 |  | 
| 116 | xsInteger InsertionIterator::position() const | 
| 117 | { | 
| 118 |     return m_position; | 
| 119 | } | 
| 120 |  | 
| 121 | Item::Iterator::Ptr InsertionIterator::copy() const | 
| 122 | { | 
| 123 |     return Item::Iterator::Ptr(new InsertionIterator(m_target->copy(), m_insertPos, m_inserts->copy())); | 
| 124 | } | 
| 125 |  | 
| 126 | QT_END_NAMESPACE | 
| 127 |  |