|
dune-common
2.5.0
|
Utilities for reduction like operations on ranges. More...
|
Namespaces | |
| Dune | |
| Dune namespace. | |
Functions | |
| template<typename T , typename std::enable_if< is_range< T >::value, int >::type = 0> | |
| T::value_type | Dune::max_value (const T &v) |
| compute the maximum value over a range More... | |
| template<typename T , typename std::enable_if< is_range< T >::value, int >::type = 0> | |
| T::value_type | Dune::min_value (const T &v) |
| compute the minimum value over a range More... | |
| template<typename T , typename std::enable_if< is_range< T >::value, int >::type = 0> | |
| bool | Dune::any_true (const T &v) |
| similar to std::bitset<N>::any() return true, if any entries is true More... | |
| template<std::size_t N> | |
| bool | Dune::any_true (const std::bitset< N > &b) |
| template<typename T , typename std::enable_if< is_range< T >::value, int >::type = 0> | |
| bool | Dune::all_true (const T &v) |
| similar to std::bitset<N>::all() return true, if any entries is true More... | |
| template<std::size_t N> | |
| bool | Dune::all_true (const std::bitset< N > &b) |
Utilities for reduction like operations on ranges.
All these reduction operations work for appropriate ranges and scalar values
| bool Dune::all_true | ( | const T & | v | ) |
similar to std::bitset<N>::all() return true, if any entries is true
overloads for scalar values, ranges, and std::bitset<N> exist
| bool Dune::all_true | ( | const std::bitset< N > & | b | ) |
| bool Dune::any_true | ( | const T & | v | ) |
similar to std::bitset<N>::any() return true, if any entries is true
overloads for scalar values, ranges, and std::bitset<N> exist
| bool Dune::any_true | ( | const std::bitset< N > & | b | ) |
| T::value_type Dune::max_value | ( | const T & | v | ) |
compute the maximum value over a range
overloads for scalar values, and ranges exist
| T::value_type Dune::min_value | ( | const T & | v | ) |
compute the minimum value over a range
overloads for scalar values, and ranges exist
1.8.12