blob: 79ba8e22f28495248b4871874d6b9b204dc5940a [file] [log] [blame]
/****************************************************************************
**
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qremovaliterator_p.h"
QT_BEGIN_NAMESPACE
using namespace QPatternist;
RemovalIterator::RemovalIterator(const Item::Iterator::Ptr &target,
const xsInteger pos) : m_target(target),
m_removalPos(pos),
m_position(0)
{
Q_ASSERT(target);
Q_ASSERT(pos >= 1);
}
Item RemovalIterator::next()
{
if(m_position == -1)
return Item();
m_current = m_target->next();
if(!m_current)
{
m_position = -1;
m_current.reset();
return Item();
}
++m_position;
if(m_position == m_removalPos)
{
next(); /* Recurse, return the next item. */
--m_position; /* Don't count the one we removed. */
return m_current;
}
return m_current;
}
xsInteger RemovalIterator::count()
{
const xsInteger itc = m_target->count();
if(itc < m_removalPos)
return itc;
else
return itc - 1;
}
Item RemovalIterator::current() const
{
return m_current;
}
xsInteger RemovalIterator::position() const
{
return m_position;
}
Item::Iterator::Ptr RemovalIterator::copy() const
{
return Item::Iterator::Ptr(new RemovalIterator(m_target->copy(), m_removalPos));
}
QT_END_NAMESPACE