/****************************************************************************+
−
**+
−
** Copyright (C) 2010 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$+
−
** No Commercial Usage+
−
** This file contains pre-release code and may not be distributed.+
−
** You may use this file in accordance with the terms and conditions+
−
** contained in the Technology Preview License Agreement accompanying+
−
** this package.+
−
**+
−
** GNU Lesser General Public License Usage+
−
** Alternatively, 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.+
−
**+
−
** If you have questions regarding the use of this file, please contact+
−
** Nokia at qt-info@nokia.com.+
−
**+
−
**+
−
**+
−
**+
−
**+
−
**+
−
**+
−
**+
−
** $QT_END_LICENSE$+
−
**+
−
****************************************************************************/+
−
+
−
#include <QtDebug>+
−
+
−
#include "qacceliterators_p.h"+
−
+
−
QT_BEGIN_NAMESPACE+
−
+
−
using namespace QPatternist;+
−
+
−
xsInteger AccelIterator::position() const+
−
{+
−
    return m_position;+
−
}+
−
+
−
QXmlNodeModelIndex AccelIterator::current() const+
−
{+
−
    return m_current;+
−
}+
−
+
−
QXmlNodeModelIndex FollowingIterator::next()+
−
{+
−
    /* "the following axis contains all nodes that are descendants+
−
     *  of the root of the tree in which the context node is found,+
−
     *  are not descendants of the context node, and occur after+
−
     *  the context node in document order." */+
−
+
−
    if(m_position == 0)+
−
    {+
−
        /* Skip the descendants. */+
−
        m_currentPre += m_document->size(m_preNumber) + 1;+
−
    }+
−
+
−
    if(m_currentPre > m_document->maximumPreNumber())+
−
        return closedExit();+
−
+
−
    while(m_document->kind(m_currentPre) == QXmlNodeModelIndex::Attribute)+
−
    {+
−
        ++m_currentPre;+
−
        if(m_currentPre > m_document->maximumPreNumber())+
−
            return closedExit();+
−
    }+
−
+
−
    m_current = m_document->createIndex(m_currentPre);+
−
    ++m_position;+
−
    ++m_currentPre;+
−
    return m_current;+
−
}+
−
+
−
QXmlNodeModelIndex PrecedingIterator::next()+
−
{+
−
    if(m_currentPre == -1)+
−
        return closedExit();+
−
+
−
    /* We skip ancestors and attributes and take into account that they can be intermixed. If one+
−
     * skips them in two separate loops, one can end up with skipping all the attributes to then+
−
     * be positioned at an ancestor(which will be accepted because the ancestor loop was before the+
−
     * attributes loop).  */+
−
    while(m_document->kind(m_currentPre) == QXmlNodeModelIndex::Attribute ||+
−
          m_document->postNumber(m_currentPre) > m_postNumber)+
−
    {+
−
        --m_currentPre;+
−
        if(m_currentPre == -1)+
−
            return closedExit();+
−
    }+
−
+
−
    if(m_currentPre == -1)+
−
    {+
−
        m_currentPre = -1;+
−
        return closedExit();+
−
    }+
−
+
−
    /* Phew, m_currentPre is now 1) not an ancestor; and+
−
     * 2) not an attribute; and 3) preceds the context node. */+
−
+
−
    m_current = m_document->createIndex(m_currentPre);+
−
    ++m_position;+
−
    --m_currentPre;+
−
+
−
    return m_current;+
−
}+
−
+
−
QXmlNodeModelIndex::Iterator::Ptr PrecedingIterator::copy() const+
−
{+
−
    return QXmlNodeModelIndex::Iterator::Ptr(new PrecedingIterator(m_document, m_preNumber));+
−
}+
−
+
−
QXmlNodeModelIndex::Iterator::Ptr FollowingIterator::copy() const+
−
{+
−
    return QXmlNodeModelIndex::Iterator::Ptr(new FollowingIterator(m_document, m_preNumber));+
−
}+
−
+
−
QXmlNodeModelIndex ChildIterator::next()+
−
{+
−
    if(m_currentPre == -1)+
−
        return closedExit();+
−
+
−
    ++m_position;+
−
    m_current = m_document->createIndex(m_currentPre);+
−
+
−
    /* We get the count of the descendants, and increment m_currentPre. After+
−
     * this, m_currentPre is the node after the descendants. */+
−
    m_currentPre += m_document->size(m_currentPre);+
−
    ++m_currentPre;+
−
+
−
    if(m_currentPre > m_document->maximumPreNumber() || m_document->depth(m_currentPre) != m_depth)+
−
        m_currentPre = -1;+
−
+
−
    return m_current;+
−
}+
−
+
−
QXmlNodeModelIndex::Iterator::Ptr ChildIterator::copy() const+
−
{+
−
    return QXmlNodeModelIndex::Iterator::Ptr(new ChildIterator(m_document, m_preNumber));+
−
}+
−
+
−
QXmlNodeModelIndex AttributeIterator::next()+
−
{+
−
    if(m_currentPre == -1)+
−
        return closedExit();+
−
    else+
−
    {+
−
        m_current = m_document->createIndex(m_currentPre);+
−
        ++m_position;+
−
+
−
        ++m_currentPre;+
−
+
−
        if(m_currentPre > m_document->maximumPreNumber() ||+
−
           m_document->kind(m_currentPre) != QXmlNodeModelIndex::Attribute)+
−
            m_currentPre = -1;+
−
+
−
        return m_current;+
−
    }+
−
}+
−
+
−
QXmlNodeModelIndex::Iterator::Ptr AttributeIterator::copy() const+
−
{+
−
    return QXmlNodeModelIndex::Iterator::Ptr(new AttributeIterator(m_document, m_preNumber));+
−
}+
−
+
−
QT_END_NAMESPACE+
−
+
−