![]() |
Pangolin
Header-only C++20 plane computational geometry library
|
Forward iterator flattening every component's rings into one vertex sequence, components in canonical order. More...
#include <polygonset.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 | PolygonSet |
Forward iterator flattening every component's rings into one vertex sequence, components in canonical order.
Each component already flattens its own rings, so this pairs a component index with that component's PolygonWithHoles::VertexIterator and rolls over to the next component when the inner iterator runs out.
| using pgl::PolygonSet< PointType_, TLabel >::VertexIterator::difference_type = std::ptrdiff_t |
| using pgl::PolygonSet< PointType_, TLabel >::VertexIterator::iterator_category = std::forward_iterator_tag |
| using pgl::PolygonSet< PointType_, TLabel >::VertexIterator::iterator_concept = std::forward_iterator_tag |
| using pgl::PolygonSet< PointType_, TLabel >::VertexIterator::reference = value_type |
| using pgl::PolygonSet< PointType_, TLabel >::VertexIterator::value_type = PointType |
|
constexprdefault |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
constexprdefault |
|
friend |