|
|
| FilteredSmartRangeT (Functor &&f, BaseIterator begin, BaseIterator end) |
| |
|
FilteredIterator | begin () const |
| |
|
FilteredIterator | end () const |
| |
| auto | sum (Functor &&f) -> typename std::decay< decltype(f(std::declval< HandleT >()))>::type |
| | Computes the sum of elements. More...
|
| |
| auto | avg (Functor &&f) -> typename std::decay< decltype(f(std::declval< HandleT >()))>::type |
| | Computes the average of elements. More...
|
| |
| auto | avg (Functor &&f, WeightFunctor &&w) -> typename std::decay< decltype((1.0/(w(std::declval< HandleT >())+w(std::declval< HandleT >()))) *f(std::declval< HandleT >()))>::type |
| | Computes the weighted average of elements. More...
|
| |
| auto | any_of (Functor &&f) -> bool |
| | Check if any element fulfils condition. More...
|
| |
| auto | all_of (Functor &&f) -> bool |
| | Check if all elements fulfil condition. More...
|
| |
| auto | to_array (Functor &&f={}) -> std::array< typename std::decay< decltype(f(std::declval< HandleT >()))>::type, n > |
| | Convert range to array. More...
|
| |
| auto | to_vector (Functor &&f={}) -> std::vector< typename std::decay< decltype(f(std::declval< HandleT >()))>::type > |
| | Convert range to vector. More...
|
| |
| auto | to_set (Functor &&f={}) -> std::set< typename std::decay< decltype(f(std::declval< HandleT >()))>::type > |
| | Convert range to set. More...
|
| |
| auto | first (Functor &&f={}) -> HandleT |
| | Get the first element that fulfills a condition. More...
|
| |
| auto | min (Functor &&f) -> typename std::decay< decltype(f(std::declval< HandleT >()))>::type |
| | Compute minimum. More...
|
| |
| auto | argmin (Functor &&f) -> HandleT |
| | Compute minimal element. More...
|
| |
| auto | max (Functor &&f) -> typename std::decay< decltype(f(std::declval< HandleT >()))>::type |
| | Compute maximum. More...
|
| |
| auto | argmax (Functor &&f) -> HandleT |
| | Compute maximal element. More...
|
| |
| auto | minmax (Functor &&f) -> std::pair< typename std::decay< decltype(f(std::declval< HandleT >()))>::type, typename std::decay< decltype(f(std::declval< HandleT >()))>::type > |
| | Computes minimum and maximum. More...
|
| |
| auto | count_if (Functor &&f) -> int |
| | Compute number of elements that satisfy a given predicate. More...
|
| |
| auto | for_each (Functor &&f) -> void |
| | Apply a functor to each element. More...
|
| |
| auto | filtered (Functor &&f) -> FilteredSmartRangeT< SmartRange, Handle, Functor > |
| | Only iterate over a subset of elements. More...
|
| |
template<typename RangeT, typename HandleT, typename Functor>
struct OpenMesh::FilteredSmartRangeT< RangeT, HandleT, Functor >
Class which applies a filter when iterating over elements.