1 /****************************************************************************
3 ** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
4 ** All rights reserved.
5 ** Contact: Nokia Corporation (qt-info@nokia.com)
7 ** This file is part of the QtXmlPatterns module of the Qt Toolkit.
9 ** $QT_BEGIN_LICENSE:LGPL$
10 ** GNU Lesser General Public License Usage
11 ** This file may be used under the terms of the GNU Lesser General Public
12 ** License version 2.1 as published by the Free Software Foundation and
13 ** appearing in the file LICENSE.LGPL included in the packaging of this
14 ** file. Please review the following information to ensure the GNU Lesser
15 ** General Public License version 2.1 requirements will be met:
16 ** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
18 ** In addition, as a special exception, Nokia gives you certain additional
19 ** rights. These rights are described in the Nokia Qt LGPL Exception
20 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
22 ** GNU General Public License Usage
23 ** Alternatively, this file may be used under the terms of the GNU General
24 ** Public License version 3.0 as published by the Free Software Foundation
25 ** and appearing in the file LICENSE.GPL included in the packaging of this
26 ** file. Please review the following information to ensure the GNU General
27 ** Public License version 3.0 requirements will be met:
28 ** http://www.gnu.org/copyleft/gpl.html.
31 ** Alternatively, this file may be used in accordance with the terms and
32 ** conditions contained in a signed written agreement between you and Nokia.
40 ****************************************************************************/
44 #include "qcachingiterator_p.h"
48 using namespace QPatternist;
50 CachingIterator::CachingIterator(ItemSequenceCacheCell::Vector &cacheCells,
51 const VariableSlotID slot,
52 const DynamicContext::Ptr &context) : m_position(0),
55 m_cacheCells(cacheCells),
58 Q_ASSERT(m_varSlot > -1);
60 Q_ASSERT(m_cacheCells.at(m_varSlot).sourceIterator);
61 Q_ASSERT_X((m_cacheCells.at(m_varSlot).cachedItems.isEmpty() && m_cacheCells.at(m_varSlot).cacheState == ItemSequenceCacheCell::Empty) ||
62 m_cacheCells.at(m_varSlot).cacheState == ItemSequenceCacheCell::PartiallyPopulated,
64 "It makes no sense to construct a CachingIterator for a cache that is ItemSequenceCacheCell::Full.");
67 Item CachingIterator::next()
69 ItemSequenceCacheCell &cell = m_cacheCells[m_varSlot];
77 /* QAbstractXmlForwardIterator::position() starts at 1, while Qt's container classes
79 if(m_position - 1 < cell.cachedItems.count())
81 m_current = cell.cachedItems.at(m_position - 1);
86 cell.cacheState = ItemSequenceCacheCell::PartiallyPopulated;
88 /* We decrement here so we don't have to add a branch for this
89 * when using the source QAbstractXmlForwardIterator below. */
94 m_current = cell.sourceIterator->next();
98 cell.cachedItems.append(m_current);
99 Q_ASSERT(cell.cacheState == ItemSequenceCacheCell::PartiallyPopulated);
106 cell.cacheState = ItemSequenceCacheCell::Full;
111 Item CachingIterator::current() const
116 xsInteger CachingIterator::position() const
121 Item::Iterator::Ptr CachingIterator::copy() const
123 const ItemSequenceCacheCell &cell = m_cacheCells.at(m_varSlot);
124 if(cell.cacheState == ItemSequenceCacheCell::Full)
125 return makeListIterator(cell.cachedItems);
127 return Item::Iterator::Ptr(new CachingIterator(m_cacheCells, m_varSlot, m_context));