/**************************************************************************** ** ** 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 "qdeduplicateiterator_p.h" QT_BEGIN_NAMESPACE using namespace QPatternist; DeduplicateIterator::DeduplicateIterator(const Item::List &source) : ListIterator(source) , m_listPos(0) { Q_ASSERT(!Item()); Q_ASSERT(!Item().isNode()); Q_ASSERT(!Item().isAtomicValue()); } Item DeduplicateIterator::next() { if(m_listPos == m_list.count()) { m_current.reset(); m_position = -1; return Item(); } Item next(m_list.at(m_listPos)); while(next.asNode().is(m_current.asNode())) { ++m_listPos; if(m_listPos == m_list.count()) { m_current.reset(); m_position = -1; return Item(); } else next = m_list.at(m_listPos); } ++m_position; m_current = next; return next; } xsInteger DeduplicateIterator::count() { return QAbstractXmlForwardIterator::count(); } Item::Iterator::Ptr DeduplicateIterator::copy() const { return Item::Iterator::Ptr(new DeduplicateIterator(m_list)); } QT_END_NAMESPACE