![]() |
Pangolin
Header-only C++20 plane computational geometry library
|
Forward iterator flattening the region's rings into one vertex sequence: the outer boundary, then each hole in canonical order. More...
#include <polygonwithholes.hpp>
Public Types | |
| using | iterator_category = std::forward_iterator_tag |
| using | iterator_concept = std::forward_iterator_tag |
| using | value_type = PointType |
| using | difference_type = std::ptrdiff_t |
| using | reference = value_type |
Public Member Functions | |
| constexpr | VertexIterator ()=default |
| constexpr value_type | operator* () const |
| constexpr VertexIterator & | operator++ () |
| constexpr VertexIterator | operator++ (int) |
| constexpr bool | operator== (const VertexIterator &other) const =default |
Friends | |
| struct | PolygonWithHoles |
Forward iterator flattening the region's rings into one vertex sequence: the outer boundary, then each hole in canonical order.
The rings are separate Polygon objects, so this holds a ring index and a vertex index rather than a single underlying iterator. Ring index 0 is the outer boundary and ring i + 1 is hole i.
| using pgl::PolygonWithHoles< PointType_, TLabel >::VertexIterator::difference_type = std::ptrdiff_t |
| using pgl::PolygonWithHoles< PointType_, TLabel >::VertexIterator::iterator_category = std::forward_iterator_tag |
| using pgl::PolygonWithHoles< PointType_, TLabel >::VertexIterator::iterator_concept = std::forward_iterator_tag |
| using pgl::PolygonWithHoles< PointType_, TLabel >::VertexIterator::reference = value_type |
| using pgl::PolygonWithHoles< PointType_, TLabel >::VertexIterator::value_type = PointType |
|
constexprdefault |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
constexprdefault |
|
friend |