rangeutilities.hh File Reference

Utilities for reduction like operations on ranges. More...

#include <dune/common/typetraits.hh>
#include <algorithm>
#include <utility>
#include <type_traits>
#include <bitset>

Go to the source code of this file.

Classes
class	Dune::IntegralRange< T >
	dynamic integer range for use in range-based for loops More...
class	Dune::StaticIntegralRange< T, to, from >
	static integer range for use in range-based for loops 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<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<class T , class U , std::enable_if_t< std::is_same< std::decay_t< T >, std::decay_t< U >>::value, int > = 0, std::enable_if_t< std::is_integral< std::decay_t< T >>::value, int > = 0>
static IntegralRange< std::decay_t< T > >	Dune::range (T &&from, U &&to) noexcept
	free standing function for setting up a range based for loop over an integer range for (auto i: range(0,10)) // 0,1,2,3,4,5,6,7,8,9 or for (auto i: range(-10,10)) // -10,-9,..,8,9 or for (auto i: range(10)) // 0,1,2,3,4,5,6,7,8,9

Detailed Description

Utilities for reduction like operations on ranges.

Author

Christian Engwer