/usr/include/ITK-4.5/itkQuadEdgeMeshBaseIterator.h is in libinsighttoolkit4-dev 4.5.0-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 | /*=========================================================================
*
* Copyright Insight Software Consortium
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#ifndef __itkQuadEdgeMeshBaseIterator_h
#define __itkQuadEdgeMeshBaseIterator_h
#include "itkMacro.h"
// -------------------------------------------------------------------------
#define itkQEDefineIteratorMethodsMacro(Op) \
virtual Iterator Begin##Op() \
{ \
return Iterator(this, Self::Iterator::Operator##Op, true); \
} \
\
virtual ConstIterator Begin##Op() const \
{ \
return ConstIterator(this, Self::ConstIterator::Operator##Op, \
true); \
} \
\
virtual Iterator End##Op() \
{ \
return Iterator(this, Self::Iterator::Operator##Op, false); \
} \
\
virtual ConstIterator End##Op() const \
{ \
return ConstIterator(this, Self::ConstIterator::Operator##Op, \
false); \
}
// -------------------------------------------------------------------------
#define itkQEDefineIteratorGeomMethodsMacro(Op) \
virtual IteratorGeom BeginGeom##Op() \
{ \
return IteratorGeom(this, Self::IteratorGeom::Operator##Op, \
true); \
} \
\
virtual ConstIteratorGeom BeginGeom##Op() const \
{ \
return ConstIteratorGeom(this, \
Self::ConstIteratorGeom::Operator##Op, true); \
} \
\
virtual IteratorGeom EndGeom##Op() \
{ \
return IteratorGeom(this, Self::IteratorGeom::Operator##Op, \
false); \
} \
\
virtual ConstIteratorGeom EndGeom##Op() const \
{ \
return ConstIteratorGeom(this, \
Self::ConstIteratorGeom::Operator##Op, false); \
}
namespace itk
{
/**
* \class QuadEdgeMeshBaseIterator
*
* \brief Base iterator class for QuadEdgeMesh
* \ingroup ITKQuadEdgeMesh
*/
template< typename TQuadEdge >
class QuadEdgeMeshBaseIterator
{
public:
// Hierarchy typedefs & values.
typedef QuadEdgeMeshBaseIterator Self;
typedef TQuadEdge QuadEdgeType;
// Different types of iterators, one for each basic QE operation.
enum {
OperatorOnext = 0,
OperatorSym = 1,
OperatorLnext = 2,
OperatorRnext = 3,
OperatorDnext = 4,
OperatorOprev = 5,
OperatorLprev = 6,
OperatorRprev = 7,
OperatorDprev = 8,
OperatorInvOnext = 9,
OperatorInvLnext = 10,
OperatorInvRnext = 11,
OperatorInvDnext = 12
};
public:
// Object creation methods.
QuadEdgeMeshBaseIterator(QuadEdgeType *e,
int op = OperatorOnext,
bool start = true):
m_StartEdge(e), m_Iterator(e),
m_OpType(op), m_Start(start) {}
virtual ~QuadEdgeMeshBaseIterator() {}
Self & operator=(const Self & r)
{
if(this != &r)
{
m_StartEdge = r.m_StartEdge;
m_Iterator = r.m_Iterator;
m_OpType = r.m_OpType;
m_Start = r.m_Start;
}
return ( *this );
}
QuadEdgeType * GetStartEdge() const { return ( m_StartEdge ); }
QuadEdgeType * GetIterator() const { return ( m_Iterator ); }
int GetOpType() const { return ( m_OpType ); }
bool GetStart() const { return ( m_Start ); }
/** Iteration methods. */
bool operator==(Self & r)
{
return ( ( m_StartEdge == r.m_StartEdge )
&& ( m_Iterator == r.m_Iterator )
&& ( m_OpType == r.m_OpType )
&& ( m_Start == r.m_Start ) );
}
bool operator==(const Self & r) const
{
return ( ( m_StartEdge == r.m_StartEdge )
&& ( m_Iterator == r.m_Iterator )
&& ( m_OpType == r.m_OpType )
&& ( m_Start == r.m_Start ) );
}
bool operator!=(Self & r)
{
return ( !( this->operator==(r) ) );
}
bool operator!=(const Self & r) const
{
return ( !( this->operator==(r) ) );
}
Self & operator++()
{
if ( m_Start )
{
this->GoToNext();
m_Start = !( m_Iterator == m_StartEdge );
}
return ( *this );
}
Self & operator++(int)
{
if ( m_Start )
{
this->GoToNext();
m_Start = !( m_Iterator == m_StartEdge );
}
return ( *this );
}
protected:
/** Method that should do all the iteration work. */
virtual void GoToNext()
{
switch ( m_OpType )
{
case OperatorOnext:
m_Iterator = m_Iterator->GetOnext();
break;
case OperatorSym:
m_Iterator = m_Iterator->GetSym();
break;
case OperatorLnext:
m_Iterator = m_Iterator->GetLnext();
break;
case OperatorRnext:
m_Iterator = m_Iterator->GetRnext();
break;
case OperatorDnext:
m_Iterator = m_Iterator->GetDnext();
break;
case OperatorOprev:
m_Iterator = m_Iterator->GetOprev();
break;
case OperatorLprev:
m_Iterator = m_Iterator->GetLprev();
break;
case OperatorRprev:
m_Iterator = m_Iterator->GetRprev();
break;
case OperatorDprev:
m_Iterator = m_Iterator->GetDprev();
break;
case OperatorInvOnext:
m_Iterator = m_Iterator->GetInvOnext();
break;
case OperatorInvLnext:
m_Iterator = m_Iterator->GetInvLnext();
break;
case OperatorInvRnext:
m_Iterator = m_Iterator->GetInvRnext();
break;
case OperatorInvDnext:
m_Iterator = m_Iterator->GetInvDnext();
break;
default:
break;
}
}
protected:
QuadEdgeType *m_StartEdge; /**< Start edge */
QuadEdgeType *m_Iterator; /**< Current iteration position */
int m_OpType; /**< Operation type */
bool m_Start; /**< Indicates iteration has just started */
};
/**
* \class QuadEdgeMeshIterator
*
* \brief Non const iterator for QuadMesh
* \ingroup ITKQuadEdgeMesh
*/
template< typename TQuadEdge >
class QuadEdgeMeshIterator:
public QuadEdgeMeshBaseIterator< TQuadEdge >
{
public:
/** Hierarchy typedefs and values. */
typedef QuadEdgeMeshIterator Self;
typedef QuadEdgeMeshBaseIterator< TQuadEdge > Superclass;
typedef TQuadEdge QuadEdgeType;
public:
/** Object creation methods. */
QuadEdgeMeshIterator(QuadEdgeType *e = (QuadEdgeType *)0,
int op = Superclass::OperatorOnext,
bool start = true):
Superclass(e, op, start) {}
virtual ~QuadEdgeMeshIterator() {}
QuadEdgeType * Value() { return ( this->m_Iterator ); }
const QuadEdgeType * Value() const { return ( this->m_Iterator ); }
};
/**
* \class QuadEdgeMeshIteratorGeom
*
* \brief Non const geometrical iterator
* \ingroup ITKQuadEdgeMesh
*/
template< typename TGeometricalQuadEdge >
class QuadEdgeMeshIteratorGeom:
public QuadEdgeMeshIterator< TGeometricalQuadEdge >
{
public:
/** Hierarchy typedefs and values. */
typedef QuadEdgeMeshIterator< TGeometricalQuadEdge > Superclass;
typedef TGeometricalQuadEdge QuadEdgeType;
/** Geometric value type. */
typedef typename QuadEdgeType::OriginRefType OriginRefType;
public:
QuadEdgeMeshIteratorGeom(QuadEdgeType *e = (QuadEdgeType *)0,
int op = Superclass::OperatorOnext,
bool start = true):
Superclass(e, op, start) {}
OriginRefType operator*() { return ( this->m_Iterator->GetOrigin() ); }
};
/**
* \class QuadEdgeMeshConstIterator
*
* \brief Const iterator for QuadEdgeMesh
* \ingroup ITKQuadEdgeMesh
*/
template< typename TQuadEdge >
class QuadEdgeMeshConstIterator:
public QuadEdgeMeshBaseIterator< TQuadEdge >
{
public:
/** Hierarchy typedefs & values. */
typedef QuadEdgeMeshConstIterator Self;
typedef QuadEdgeMeshBaseIterator< TQuadEdge > Superclass;
typedef QuadEdgeMeshIterator< TQuadEdge > NoConstType;
typedef TQuadEdge QuadEdgeType;
public:
/** Object creation methods. */
QuadEdgeMeshConstIterator(const QuadEdgeType *e = (QuadEdgeType *)0,
int op = Superclass::OperatorOnext,
bool start = true):
Superclass(const_cast< QuadEdgeType * >( e ), op, start) {}
virtual ~QuadEdgeMeshConstIterator() {}
Self & operator=(const NoConstType & r)
{
this->m_StartEdge = r.GetStartEdge();
this->m_Iterator = r.GetIterator();
this->m_OpType = r.GetOpType();
this->m_Start = r.GetStart();
return ( *this );
}
const QuadEdgeType * Value() const { return ( this->m_Iterator ); }
};
/**
* \class QuadEdgeMeshConstIteratorGeom
*
* \brief Const geometrical iterator
* \ingroup ITKQuadEdgeMesh
*/
template< typename TGeometricalQuadEdge >
class QuadEdgeMeshConstIteratorGeom:
public QuadEdgeMeshConstIterator< TGeometricalQuadEdge >
{
public:
/** Hierarchy typedefs and values. */
typedef QuadEdgeMeshConstIteratorGeom Self;
typedef QuadEdgeMeshConstIterator< TGeometricalQuadEdge > Superclass;
typedef QuadEdgeMeshIteratorGeom< TGeometricalQuadEdge > NoConstType;
typedef TGeometricalQuadEdge QuadEdgeType;
/** Geometric value type. */
typedef typename QuadEdgeType::OriginRefType OriginRefType;
public:
QuadEdgeMeshConstIteratorGeom(const QuadEdgeType *e = (QuadEdgeType *)0,
int op = Superclass::OperatorOnext,
bool start = true):
Superclass(e, op, start) {}
virtual ~QuadEdgeMeshConstIteratorGeom() {}
Self & operator=(const NoConstType & r)
{
this->m_StartEdge = r.GetStartEdge();
this->m_Iterator = r.GetIterator();
this->m_OpType = r.GetOpType();
this->m_Start = r.GetStart();
return ( *this );
}
const OriginRefType operator*() const
{
return ( this->m_Iterator->GetOrigin() );
}
};
}
#endif
|