KiCad PCB EDA Suite
SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T > Class Template Reference

Class SEGMENT_ITERATOR_TEMPLATE. More...

#include <shape_poly_set.h>

Public Member Functions

bool IsLastPolygon () const
 Function IsLastOutline. More...
 
 operator bool () const
 
void Advance ()
 Function Advance advances the indices of the current vertex/outline/contour, checking whether the vertices in the holes have to be iterated through. More...
 
void operator++ (int dummy)
 
void operator++ ()
 
Get ()
 
operator * ()
 
VERTEX_INDEX GetIndex ()
 Function GetIndex. More...
 
bool IsAdjacent (SEGMENT_ITERATOR_TEMPLATE< T > aOther)
 Function IsAdjacent. More...
 

Private Attributes

SHAPE_POLY_SETm_poly
 
int m_currentPolygon
 
int m_currentContour
 
int m_currentSegment
 
int m_lastPolygon
 
bool m_iterateHoles
 

Friends

class SHAPE_POLY_SET
 

Detailed Description

template<class T>
class SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >

Class SEGMENT_ITERATOR_TEMPLATE.

Base class for iterating over all segments in a given SHAPE_POLY_SET.

Definition at line 280 of file shape_poly_set.h.

Member Function Documentation

◆ Advance()

template<class T>
void SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::Advance ( )
inline

Function Advance advances the indices of the current vertex/outline/contour, checking whether the vertices in the holes have to be iterated through.

Definition at line 302 of file shape_poly_set.h.

303  {
304  // Advance vertex index
306  int last;
307 
308  // Check whether the user wants to iterate through the vertices of the holes
309  // and behave accordingly
310  if( m_iterateHoles )
311  {
312  last = m_poly->CPolygon( m_currentPolygon )[m_currentContour].SegmentCount();
313 
314  // If the last vertex of the contour was reached, advance the contour index
315  if( m_currentSegment >= last )
316  {
317  m_currentSegment = 0;
319 
320  // If the last contour of the current polygon was reached, advance the
321  // outline index
322  int totalContours = m_poly->CPolygon( m_currentPolygon ).size();
323 
324  if( m_currentContour >= totalContours )
325  {
326  m_currentContour = 0;
328  }
329  }
330  }
331  else
332  {
333  last = m_poly->CPolygon( m_currentPolygon )[0].SegmentCount();
334  // If the last vertex of the outline was reached, advance to the following
335  // polygon
336  if( m_currentSegment >= last )
337  {
338  m_currentSegment = 0;
340  }
341  }
342  }
const POLYGON & CPolygon(int aIndex) const

References SHAPE_POLY_SET::CPolygon(), SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentContour, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentPolygon, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentSegment, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_iterateHoles, and SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_poly.

Referenced by SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::operator++().

◆ Get()

◆ GetIndex()

◆ IsAdjacent()

template<class T>
bool SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::IsAdjacent ( SEGMENT_ITERATOR_TEMPLATE< T >  aOther)
inline

Function IsAdjacent.

Parameters
aOtheris an iterator pointing to another segment.
Returns
bool - true if both iterators point to the same segment of the same contour of the same polygon of the same polygon set; false otherwise.

Definition at line 386 of file shape_poly_set.h.

387  {
388  // Check that both iterators point to the same contour of the same polygon of the
389  // same polygon set
390  if( m_poly == aOther.m_poly && m_currentPolygon == aOther.m_currentPolygon &&
391  m_currentContour == aOther.m_currentContour )
392  {
393  // Compute the total number of segments
394  int numSeg;
395  numSeg = m_poly->CPolygon( m_currentPolygon )[m_currentContour].SegmentCount();
396 
397  // Compute the difference of the segment indices. If it is exactly one, they
398  // are adjacent. The only missing case where they also are adjacent is when
399  // the segments are the first and last one, in which case the difference
400  // always equals the total number of segments minus one.
401  int indexDiff = abs( m_currentSegment - aOther.m_currentSegment );
402 
403  return ( indexDiff == 1 ) || ( indexDiff == (numSeg - 1) );
404  }
405 
406  return false;
407  }
const POLYGON & CPolygon(int aIndex) const
#define abs(a)
Definition: auxiliary.h:84

References abs, SHAPE_POLY_SET::CPolygon(), SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentContour, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentPolygon, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentSegment, and SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_poly.

Referenced by SHAPE_POLY_SET::IsPolygonSelfIntersecting().

◆ IsLastPolygon()

template<class T>
bool SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::IsLastPolygon ( ) const
inline

Function IsLastOutline.

Returns
bool - true if the current outline is the last one.

Definition at line 287 of file shape_poly_set.h.

References SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentPolygon, and SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_lastPolygon.

◆ operator *()

template<class T>
T SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::operator * ( )
inline

Definition at line 359 of file shape_poly_set.h.

360  {
361  return Get();
362  }

References SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::Get().

◆ operator bool()

◆ operator++() [1/2]

template<class T>
void SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::operator++ ( int  dummy)
inline

Definition at line 344 of file shape_poly_set.h.

345  {
346  Advance();
347  }
void Advance()
Function Advance advances the indices of the current vertex/outline/contour, checking whether the ver...

References SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::Advance().

◆ operator++() [2/2]

template<class T>
void SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::operator++ ( )
inline

Definition at line 349 of file shape_poly_set.h.

350  {
351  Advance();
352  }
void Advance()
Function Advance advances the indices of the current vertex/outline/contour, checking whether the ver...

References SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::Advance().

Friends And Related Function Documentation

◆ SHAPE_POLY_SET

template<class T>
friend class SHAPE_POLY_SET
friend

Definition at line 410 of file shape_poly_set.h.

Member Data Documentation

◆ m_currentContour

◆ m_currentPolygon

◆ m_currentSegment

◆ m_iterateHoles

◆ m_lastPolygon

◆ m_poly


The documentation for this class was generated from the following file: