Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::Polygon::Iterator Class Reference

STL/Aleph-compatible iterator over polygon vertices as Points. More...

#include <polygon.H>

Collaboration diagram for Aleph::Polygon::Iterator:
[legend]

Public Member Functions

 Iterator () noexcept=default
 
 Iterator (const Polygon &poly) noexcept
 
bool has_curr () const noexcept
 
void next ()
 
void next_ne () noexcept
 
void prev ()
 
void prev_ne () noexcept
 
void reset_first () noexcept
 
void end () noexcept
 
const Point & get_curr () const
 
Dlink * get_pos () const noexcept
 
bool operator== (const Iterator &o) const noexcept
 
bool operator!= (const Iterator &o) const noexcept
 

Private Attributes

Dlink::Iterator dit_
 

Detailed Description

STL/Aleph-compatible iterator over polygon vertices as Points.

Wraps the internal Dlink::Iterator and yields const Point& via get_curr(). Compatible with StlAlephIterator, GenericTraverse, and FunctionalMethods.

Definition at line 317 of file polygon.H.

Constructor & Destructor Documentation

◆ Iterator() [1/2]

Aleph::Polygon::Iterator::Iterator ( )
defaultnoexcept

◆ Iterator() [2/2]

Aleph::Polygon::Iterator::Iterator ( const Polygon &  poly)
inlinenoexcept

Definition at line 324 of file polygon.H.

Member Function Documentation

◆ end()

void Aleph::Polygon::Iterator::end ( )
inlinenoexcept

Definition at line 339 of file polygon.H.

References dit_, and Aleph::Dlink::Iterator::end().

◆ get_curr()

const Point & Aleph::Polygon::Iterator::get_curr ( ) const
inline

Definition at line 341 of file polygon.H.

References dit_, Aleph::Vertex::dlink_to_vertex(), and Aleph::Dlink::Iterator::get_curr().

Referenced by TEST_F().

◆ get_pos()

Dlink * Aleph::Polygon::Iterator::get_pos ( ) const
inlinenoexcept

Definition at line 346 of file polygon.H.

References dit_, and Aleph::Dlink::Iterator::get_curr_ne().

◆ has_curr()

bool Aleph::Polygon::Iterator::has_curr ( ) const
inlinenoexcept

Definition at line 327 of file polygon.H.

References dit_, and Aleph::Dlink::Iterator::has_curr().

Referenced by TEST_F().

◆ next()

void Aleph::Polygon::Iterator::next ( )
inline

Definition at line 329 of file polygon.H.

References dit_, and Aleph::Dlink::Iterator::next().

Referenced by TEST_F().

◆ next_ne()

void Aleph::Polygon::Iterator::next_ne ( )
inlinenoexcept

Definition at line 331 of file polygon.H.

References dit_, and Aleph::Dlink::Iterator::next_ne().

◆ operator!=()

bool Aleph::Polygon::Iterator::operator!= ( const Iterator &  o) const
inlinenoexcept

Definition at line 356 of file polygon.H.

References Aleph::blossom_maximum_cardinality_matching(), and dit_.

◆ operator==()

bool Aleph::Polygon::Iterator::operator== ( const Iterator &  o) const
inlinenoexcept

Definition at line 351 of file polygon.H.

References Aleph::blossom_maximum_cardinality_matching(), and dit_.

◆ prev()

void Aleph::Polygon::Iterator::prev ( )
inline

Definition at line 333 of file polygon.H.

References dit_, and Aleph::Dlink::Iterator::prev().

◆ prev_ne()

void Aleph::Polygon::Iterator::prev_ne ( )
inlinenoexcept

Definition at line 335 of file polygon.H.

References dit_, and Aleph::Dlink::Iterator::prev_ne().

◆ reset_first()

void Aleph::Polygon::Iterator::reset_first ( )
inlinenoexcept

Definition at line 337 of file polygon.H.

References dit_, and Aleph::Dlink::Iterator::reset_first().

Member Data Documentation

◆ dit_

Dlink::Iterator Aleph::Polygon::Iterator::dit_
private

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