File: itkCorrespondenceDataStructureIterator.txx

package info (click to toggle)
insighttoolkit 3.6.0-3
  • links: PTS
  • area: main
  • in suites: lenny
  • size: 94,956 kB
  • ctags: 74,981
  • sloc: cpp: 355,621; ansic: 195,070; fortran: 28,713; python: 3,802; tcl: 1,996; sh: 1,175; java: 583; makefile: 415; csh: 184; perl: 175
file content (144 lines) | stat: -rw-r--r-- 4,559 bytes parent folder | download | duplicates (2)
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
/*=========================================================================

  Program:   Insight Segmentation & Registration Toolkit
  Module:    $RCSfile: itkCorrespondenceDataStructureIterator.txx,v $
  Language:  C++
  Date:      $Date: 2006-03-19 23:23:19 $
  Version:   $Revision: 1.3 $

  Copyright (c) Insight Software Consortium. All rights reserved.
  See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.

     This software is distributed WITHOUT ANY WARRANTY; without even 
     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR 
     PURPOSE.  See the above copyright notices for more information.

=========================================================================*/
#ifndef __itkCorrespondenceDataStructureIterator_txx
#define __itkCorrespondenceDataStructureIterator_txx

#include "itkCorrespondenceDataStructureIterator.h"

namespace itk
{
/** Constructor.  Initializes iterators, pointers, and m_IsAtEnd. */
template <typename TStructureType>
CorrespondenceDataStructureIterator<TStructureType>
::CorrespondenceDataStructureIterator(TStructureType *StructurePtr)
{
  m_Structure = StructurePtr;
  m_NodeListPointer = StructurePtr->m_NodeList;
  m_NodeListIterator = m_NodeListPointer->begin();
  m_SecondaryListPointer = &(*m_NodeListIterator);
  m_SecondaryListIterator = m_SecondaryListPointer->begin();
  m_CorrespondingListPointer = &(*m_SecondaryListIterator);
  m_CorrespondingListIterator = m_CorrespondingListPointer->begin();
  
  m_IsAtEnd = false;
}

/** Destructor. */
template <typename TStructureType>
CorrespondenceDataStructureIterator<TStructureType>
::~CorrespondenceDataStructureIterator()
{
}

/** Used to verify that the iterator is at the end of the data structure. */
template <typename TStructureType>
bool
CorrespondenceDataStructureIterator<TStructureType>
::IsAtEnd()
{
  return m_IsAtEnd;
}

/** Goes to the next corresponding node clique in the structure, 
 *  moving on to the next base node clique if necessary. */
template <typename TStructureType>
void
CorrespondenceDataStructureIterator<TStructureType>
::GoToNext()
{
  m_CorrespondingListIterator++;
  
  if(m_CorrespondingListIterator == m_CorrespondingListPointer->end())
    {
    m_SecondaryListIterator++;
    if(m_SecondaryListIterator != m_SecondaryListPointer->end())
      {
      m_CorrespondingListPointer = &(*m_SecondaryListIterator);
      m_CorrespondingListIterator = m_CorrespondingListPointer->begin();
      }
    else if(m_SecondaryListIterator == m_SecondaryListPointer->end())
      {
      m_NodeListIterator++;

      if(m_NodeListIterator != m_NodeListPointer->end())
        {
        m_SecondaryListPointer = &(*m_NodeListIterator);
        m_SecondaryListIterator = m_SecondaryListPointer->begin();
    
        m_CorrespondingListPointer = &(*m_SecondaryListIterator);
        m_CorrespondingListIterator = m_CorrespondingListPointer->begin();
        }
      else if(m_NodeListIterator == m_NodeListPointer->end())
        {
        m_IsAtEnd = true;
        }
      }
    }
}

/** Goes to the next base node clique. */
template <typename TStructureType>
void
CorrespondenceDataStructureIterator<TStructureType>
::GoToNextBaseGroup()
{
  m_SecondaryListIterator++;
  if(m_SecondaryListIterator != m_SecondaryListPointer->end())
    {
    m_CorrespondingListPointer = &(*m_SecondaryListIterator);
    m_CorrespondingListIterator = m_CorrespondingListPointer->begin();
    }
  else if(m_SecondaryListIterator == m_SecondaryListPointer->end())
    {
    m_NodeListIterator++;

    if(m_NodeListIterator != m_NodeListPointer->end())
      {
      m_SecondaryListPointer = &(*m_NodeListIterator);
      m_SecondaryListIterator = m_SecondaryListPointer->begin();
    
      m_CorrespondingListPointer = &(*m_SecondaryListIterator);
      m_CorrespondingListIterator = m_CorrespondingListPointer->begin();
      }
    else if(m_NodeListIterator == m_NodeListPointer->end())
      {
      m_IsAtEnd = true;
      }
    }
}

/** Resets the iterator to the default settings/placement.*/
template <typename TStructureType>
void
CorrespondenceDataStructureIterator<TStructureType>
::Reset()
{
  m_IsAtEnd = false;

  m_NodeListPointer = m_Structure->m_NodeList;
  m_NodeListIterator = m_NodeListPointer->begin();

  m_SecondaryListPointer = &(*m_NodeListIterator);
  m_SecondaryListIterator = m_SecondaryListPointer->begin();

  m_CorrespondingListPointer = &(*m_SecondaryListIterator);
  m_CorrespondingListIterator = m_CorrespondingListPointer->begin();
}

} // end namespace itk

#endif