File: vtkQueueIterator.txx

package info (click to toggle)
volview 3.4-3
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 25,204 kB
  • sloc: cpp: 132,585; ansic: 11,612; tcl: 236; sh: 64; makefile: 25; xml: 8
file content (157 lines) | stat: -rw-r--r-- 4,564 bytes parent folder | download
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
145
146
147
148
149
150
151
152
153
154
155
156
157
/*=========================================================================

  Copyright (c) Kitware, Inc.
  All rights reserved.
  See Copyright.txt or http://www.kitware.com/VolViewCopyright.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 notice for more information.

=========================================================================*/
// Include blockers needed since vtkQueue.h includes this file
// when VTK_NO_EXPLICIT_TEMPLATE_INSTANTIATION is defined.

#ifndef __vtkQueueIterator_txx
#define __vtkQueueIterator_txx

#include "vtkQueueIterator.h"
#include "vtkAbstractIterator.txx"
#include "vtkQueue.h"

//----------------------------------------------------------------------------
template <class DType>
vtkQueueIterator<DType> *vtkQueueIterator<DType>::New()
{ 
#ifdef VTK_DEBUG_LEAKS
  vtkDebugLeaks::ConstructClass("vtkQueueIterator");
#endif
  return new vtkQueueIterator<DType>(); 
}

//----------------------------------------------------------------------------
template<class DType>
void vtkQueueIterator<DType>::InitTraversal()
{
  this->GoToFirstItem();
}

//----------------------------------------------------------------------------
template<class DType>
int vtkQueueIterator<DType>::GetKey(vtkIdType& key)
{
  if ( this->Index == -1 )
    {
    return VTK_ERROR;
    }
  vtkQueue<DType> *llist = static_cast<vtkQueue<DType>*>(this->Container);
  if ( this->Number == llist->NumberOfItems ) { return VTK_ERROR; }
  key = this->Number;
  return VTK_OK;
}

//----------------------------------------------------------------------------
template<class DType>
int vtkQueueIterator<DType>::GetData(DType& data)
{
  if ( this->Index == -1 )
    {
    return VTK_ERROR;
    }
  vtkQueue<DType> *llist = static_cast<vtkQueue<DType>*>(this->Container);
  if ( this->Index == llist->NumberOfItems ) { return VTK_ERROR; }
  data = llist->Array[this->Index];
  return VTK_OK;
}

//----------------------------------------------------------------------------
template<class DType>
int vtkQueueIterator<DType>::SetData(const DType& data)
{
  if ( this->Index == -1 )
    {
    return VTK_ERROR;
    }
  vtkQueue<DType> *llist = static_cast<vtkQueue<DType>*>(this->Container);
  if ( this->Index == llist->NumberOfItems ) { return VTK_ERROR; }
  llist->Array[this->Index] = data;
  return VTK_OK;
}

//----------------------------------------------------------------------------
template<class DType>
int vtkQueueIterator<DType>::IsDoneWithTraversal()
{
  if ( this->Index == -1 )
    {
    return 1;
    }
  vtkQueue<DType> *llist = static_cast<vtkQueue<DType>*>(this->Container);
  return (this->Number >= llist->NumberOfItems)? 1:0;
}

//----------------------------------------------------------------------------
template<class DType>
void vtkQueueIterator<DType>::GoToNextItem()
{
  vtkQueue<DType> *llist = static_cast<vtkQueue<DType>*>(this->Container);
  if(this->Number < llist->NumberOfItems)
    {
    this->Index = (this->Index + 1) % llist->GetSize();
    this->Number ++;
    }
  else
    {
    this->Index = llist->End;
    this->Number = 0;
    }
}

//----------------------------------------------------------------------------
template<class DType>
void vtkQueueIterator<DType>::GoToPreviousItem()
{
  vtkQueue<DType> *llist = static_cast<vtkQueue<DType>*>(this->Container);
  if(this->Number > 0)
    {
    this->Index = (this->Index - 1) % llist->GetSize();
    this->Number --;
    }
  else
    {
    this->Index = llist->Start;
    this->Number = llist->NumberOfItems-1;
    }
}

//----------------------------------------------------------------------------
template<class DType>
void vtkQueueIterator<DType>::GoToFirstItem()
{
  vtkQueue<DType> *llist = static_cast<vtkQueue<DType>*>(this->Container);
  this->Index = llist->End;
  this->Number = 0;
}

//----------------------------------------------------------------------------
template<class DType>
void vtkQueueIterator<DType>::GoToLastItem()
{
  vtkQueue<DType> *llist = static_cast<vtkQueue<DType>*>(this->Container);
  this->Index = llist->Start;  
  this->Number = llist->NumberOfItems-1;
}

//----------------------------------------------------------------------------

#if defined ( _MSC_VER )
template <class DType>
vtkQueueIterator<DType>::vtkQueueIterator(const vtkQueueIterator<DType>&){}
template <class DType>
void vtkQueueIterator<DType>::operator=(const vtkQueueIterator<DType>&){}
#endif

#endif