src/xmlpatterns/iterators/qintersectiterator.cpp

   1 /****************************************************************************
   2 **
   3 ** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
   4 ** All rights reserved.
   5 ** Contact: http://www.qt-project.org/
   6 **
   7 ** This file is part of the QtXmlPatterns module of the Qt Toolkit.
   8 **
   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.
  17 **
  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.
  21 **
  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.
  29 **
  30 ** Other Usage
  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.
  33 **
  34 **
  35 **
  36 **
  37 **
  38 ** $QT_END_LICENSE$
  39 **
  40 ****************************************************************************/
  41
  42 #include "qitem_p.h"
  43
  44 #include "qintersectiterator_p.h"
  45
  46 QT_BEGIN_NAMESPACE
  47
  48 using namespace QPatternist;
  49
  50 IntersectIterator::IntersectIterator(const Item::Iterator::Ptr &it1,
  51                                      const Item::Iterator::Ptr &it2) : m_it1(it1),
  52                                                                        m_it2(it2),
  53                                                                        m_position(0),
  54                                                                        m_node1(m_it1->next()),
  55                                                                        m_node2(m_it2->next())
  56 {
  57     Q_ASSERT(m_it1);
  58     Q_ASSERT(m_it2);
  59 }
  60
  61 Item IntersectIterator::next()
  62 {
  63     if(!m_node1 || !m_node2)
  64         return closedExit();
  65
  66     do
  67     {
  68         if(m_node1.asNode().model() == m_node2.asNode().model())
  69         {
  70             switch(m_node1.asNode().compareOrder(m_node2.asNode()))
  71             {
  72                 case QXmlNodeModelIndex::Precedes:
  73                 {
  74                     m_node1 = m_it1->next();
  75                     break;
  76                 }
  77                 case QXmlNodeModelIndex::Follows:
  78                 {
  79                     m_node2 = m_it2->next();
  80                     break;
  81                 }
  82                 default:
  83                 {
  84                     m_current = m_node2;
  85                     m_node1 = m_it1->next();
  86                     m_node2 = m_it2->next();
  87                     ++m_position;
  88                     return m_current;
  89                 }
  90             }
  91         }
  92         else
  93             m_node2 = m_it2->next();
  94     }
  95     while(m_node1 && m_node2);
  96
  97     return Item();
  98 }
  99
 100 Item IntersectIterator::current() const
 101 {
 102     return m_current;
 103 }
 104
 105 xsInteger IntersectIterator::position() const
 106 {
 107     return m_position;
 108 }
 109
 110 Item::Iterator::Ptr IntersectIterator::copy() const
 111 {
 112     return Item::Iterator::Ptr(new IntersectIterator(m_it1->copy(), m_it2->copy()));
 113 }
 114
 115 QT_END_NAMESPACE