Generic class for iterator ranges. More...
#include <OpenMesh/Core/Mesh/PolyConnectivity_inline_impl.hh>


Public Types | |
| typedef CirculatorRangeTraitT::ITER_TYPE | ITER_TYPE |
| typedef CirculatorRangeTraitT::CENTER_ENTITY_TYPE | CENTER_ENTITY_TYPE |
| typedef CirculatorRangeTraitT::CONTAINER_TYPE | CONTAINER_TYPE |
| typedef ITER_TYPE | iterator |
| typedef ITER_TYPE | const_iterator |
| Public Types inherited from OpenMesh::SmartRangeT< CirculatorRange< CirculatorRangeTraitT >, SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type > | |
| using | Handle |
| using | SmartRange |
| using | Range |
Public Member Functions | |
| CirculatorRange (const CONTAINER_TYPE &container, CENTER_ENTITY_TYPE center) | |
| CirculatorRange (const CONTAINER_TYPE &container, HalfedgeHandle heh, int) | |
| ITER_TYPE | begin () const |
| ITER_TYPE | end () const |
| Public Member Functions inherited from OpenMesh::SmartRangeT< CirculatorRange< CirculatorRangeTraitT >, SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type > | |
| auto | sum (Functor &&f) -> typename std::decay< decltype(f(std::declval< SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type >()))>::type |
| Computes the sum of elements. | |
| auto | avg (Functor &&f) -> typename std::decay< decltype(f(std::declval< SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type >()))>::type |
| Computes the average of elements. | |
| auto | any_of (Functor &&f) -> bool |
| Check if any element fulfils condition. | |
| auto | all_of (Functor &&f) -> bool |
| Check if all elements fulfil condition. | |
| auto | to_array (Functor &&f={}) -> std::array< typename std::decay< decltype(f(std::declval< SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type >()))>::type, n > |
| Convert range to array. | |
| auto | to_vector (Functor &&f={}) -> std::vector< typename std::decay< decltype(f(std::declval< SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type >()))>::type > |
| Convert range to vector. | |
| auto | to_set (Functor &&f={}) -> std::set< typename std::decay< decltype(f(std::declval< SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type >()))>::type > |
| Convert range to set. | |
| auto | first (Functor &&f={}) -> SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type |
| Get the first element that fulfills a condition. | |
| auto | min (Functor &&f) -> typename std::decay< decltype(f(std::declval< SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type >()))>::type |
| Compute minimum. | |
| auto | argmin (Functor &&f) -> SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type |
| Compute minimal element. | |
| auto | max (Functor &&f) -> typename std::decay< decltype(f(std::declval< SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type >()))>::type |
| Compute maximum. | |
| auto | argmax (Functor &&f) -> SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type |
| Compute maximal element. | |
| auto | minmax (Functor &&f) -> std::pair< typename std::decay< decltype(f(std::declval< SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type >()))>::type, typename std::decay< decltype(f(std::declval< SmartHandle< CirculatorRangeTraitT::TO_ENTITYE_TYPE >::type >()))>::type > |
| Computes minimum and maximum. | |
| auto | count_if (Functor &&f) -> int |
| Compute number of elements that satisfy a given predicate. | |
| auto | for_each (Functor &&f) -> void |
| Apply a functor to each element. | |
| auto | filtered (Functor &&f) -> FilteredSmartRangeT< SmartRange, Handle, Functor > |
| Only iterate over a subset of elements. | |
Generic class for iterator ranges.