summaryrefslogtreecommitdiffstats
path: root/kpovmodeler/pmrecursiveobjectiterator.cpp
blob: 423e0556667f77f42e24aa3849477356f35f43b4 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
/*
**************************************************************************
                                 description
                             --------------------
    copyright            : (C) 2000-2001 by Andreas Zehender
    email                : zehender@kde.org
**************************************************************************

**************************************************************************
*                                                                        *
*  This program is free software; you can redistribute it and/or modify  *
*  it under the terms of the GNU General Public License as published by  *
*  the Free Software Foundation; either version 2 of the License, or     *
*  (at your option) any later version.                                   *
*                                                                        *
**************************************************************************/

#include "pmobject.h"
#include "pmrecursiveobjectiterator.h"

PMRecursiveObjectIterator::PMRecursiveObjectIterator( PMObject* obj )
{
   m_pObject = obj;
   m_pCurrent = obj;
}

PMObject* PMRecursiveObjectIterator::operator++( )
{
   if( m_pCurrent )
   {
      if( m_pCurrent->firstChild( ) )
         m_pCurrent = m_pCurrent->firstChild( );
      else if( m_pCurrent == m_pObject )
         m_pCurrent = 0;
      else if( m_pCurrent->nextSibling( ) )
         m_pCurrent = m_pCurrent->nextSibling( );
      else
      {
         bool stop = false;
         do
         {
            m_pCurrent = m_pCurrent->tqparent( );
            if( !m_pCurrent )
               stop = true;
            else if( m_pCurrent == m_pObject )
            {
               // finished
               stop = true;
               m_pCurrent = 0;
            }
            else if( m_pCurrent->nextSibling( ) )
            {
               m_pCurrent = m_pCurrent->nextSibling( );
               stop = true;
            }
         }
         while( !stop );
      }
   }
   
   return m_pCurrent;
}