3#ifndef DUNE_COMMON_HYBRIDUTILITIES_HH
4#define DUNE_COMMON_HYBRIDUTILITIES_HH
21 template<
class T,
int i>
23 ->
decltype(std::integral_constant<std::size_t,i>())
29 template<
class T, T... t,
class Index>
32 using sizeAsType = std::tuple_size<
decltype(std::make_tuple(t...))>;
33 return std::integral_constant<std::size_t, sizeAsType::value>();
39 ->
decltype(std::integral_constant<std::size_t,std::tuple_size<T>::value>())
47 ->
decltype(std::integral_constant<std::size_t,T::size()>())
85constexpr auto size(
const T& t)
94 template<
class Container,
class Index,
95 std::enable_if_t<IsTuple<std::decay_t<Container>>::value,
int> = 0>
98 return std::get<std::decay_t<Index>::value>(c);
101 template<
class T, T... t,
class Index>
104 return std::get<std::decay_t<Index>::value>(std::make_tuple(std::integral_constant<T, t>()...));
107 template<
class Container,
class Index>
137template<
class Container,
class Index>
138constexpr decltype(
auto)
elementAt(Container&& c, Index&& i)
147 template<
class Begin,
class End>
152 template<std::
size_t i>
160 return std::integral_constant<
typename Begin::value_type, End::value - Begin::value>();
175 return end_ - begin_;
186 template<
class Begin,
class End,
190 static_assert(Begin::value <= End::value,
"You cannot create an integralRange where end<begin");
198 template<
class Begin,
class End>
201 assert(begin <= end);
226template<
class Begin,
class End>
256 void evaluateFoldExpression(std::initializer_list<T>&&)
259 template<
class Range,
class F,
class Index, Index... i>
260 constexpr void forEachIndex(Range&& range, F&& f, std::integer_sequence<Index, i...>)
262 evaluateFoldExpression<int>({(f(
Hybrid::elementAt(range, std::integral_constant<Index,i>())), 0)...});
265 template<
class Range,
class F,
266 std::enable_if_t<IsIntegralConstant<decltype(Hybrid::size(std::declval<Range>()))>::value,
int> = 0>
267 constexpr void forEach(Range&& range, F&& f, PriorityTag<1>)
270 auto indices = std::make_index_sequence<size>();
271 forEachIndex(std::forward<Range>(range), std::forward<F>(f), indices);
274 template<
class Range,
class F>
275 constexpr void forEach(Range&& range, F&& f, PriorityTag<0>)
277 for(std::size_t i=0; i<range.size(); ++i)
306template<
class Range,
class F>
309 Impl::forEach(std::forward<Range>(range), std::forward<F>(f),
PriorityTag<42>());
329template<
class Range,
class T,
class F>
332 forEach(std::forward<Range>(range), [&](
auto&& entry) {
333 value = f(value, entry);
342 template<
class IfFunc,
class ElseFunc>
343 constexpr decltype(
auto) ifElse(std::true_type, IfFunc&& ifFunc, ElseFunc&& elseFunc)
345 return ifFunc([](
auto&& x) ->
decltype(
auto) {
return std::forward<decltype(x)>(x);});
348 template<
class IfFunc,
class ElseFunc>
349 constexpr decltype(
auto) ifElse(std::false_type, IfFunc&& ifFunc, ElseFunc&& elseFunc)
351 return elseFunc([](
auto&& x) ->
decltype(
auto) {
return std::forward<decltype(x)>(x);});
354 template<
class IfFunc,
class ElseFunc>
355 decltype(
auto) ifElse(
const bool& condition, IfFunc&& ifFunc, ElseFunc&& elseFunc)
358 return ifFunc([](
auto&& x) ->
decltype(
auto) {
return std::forward<decltype(x)>(x);});
360 return elseFunc([](
auto&& x) ->
decltype(
auto) {
return std::forward<decltype(x)>(x);});
387template<
class Condition,
class IfFunc,
class ElseFunc>
388decltype(
auto)
ifElse(
const Condition& condition, IfFunc&& ifFunc, ElseFunc&& elseFunc)
390 return Impl::ifElse(condition, std::forward<IfFunc>(ifFunc), std::forward<ElseFunc>(elseFunc));
400template<
class Condition,
class IfFunc>
401void ifElse(
const Condition& condition, IfFunc&& ifFunc)
403 ifElse(condition, std::forward<IfFunc>(ifFunc), [](
auto&& i) {});
410 template<
class T1,
class T2>
411 constexpr auto equals(
const T1& t1,
const T2& t2,
PriorityTag<1>) ->
decltype(T1::value, T2::value, std::integral_constant<bool,T1::value == T2::value>())
414 template<
class T1,
class T2>
415 constexpr auto equals(
const T1& t1,
const T2& t2, PriorityTag<0>)
433template<
class T1,
class T2>
436 return Impl::equals(std::forward<T1>(t1), std::forward<T2>(t2),
PriorityTag<1>());
443 template<
class Result,
class T,
class Value,
class Branches,
class ElseBranch>
444 constexpr Result switchCases(std::integer_sequence<T>,
const Value& value, Branches&& branches, ElseBranch&& elseBranch)
449 template<
class Result,
class T, T t0, T... tt,
class Value,
class Branches,
class ElseBranch>
450 constexpr Result switchCases(std::integer_sequence<T, t0, tt...>,
const Value& value, Branches&& branches, ElseBranch&& elseBranch)
454 [&](
auto id) ->
decltype(
auto) {
455 return id(branches)(std::integral_constant<T, t0>());
456 }, [&](
auto id) ->
decltype(
auto) {
457 return Impl::switchCases<Result>(
id(std::integer_sequence<T, tt...>()), value, branches, elseBranch);
492template<
class Cases,
class Value,
class Branches,
class ElseBranch>
493constexpr decltype(
auto)
switchCases(
const Cases& cases,
const Value& value, Branches&& branches, ElseBranch&& elseBranch)
495 return Impl::switchCases<decltype(elseBranch())>(cases, value, std::forward<Branches>(branches), std::forward<ElseBranch>(elseBranch));
518template<
class Cases,
class Value,
class Branches>
519constexpr void switchCases(
const Cases& cases,
const Value& value, Branches&& branches)
521 return Impl::switchCases<void>(cases, value, std::forward<Branches>(branches), []() {});
Implements a vector constructed from a given type representing a field and a compile-time given size.
Utilities for type computations, constraining overloads, ...
constexpr index_constant< 0 > _0
Compile time index with value 0.
Definition indices.hh:49
std::integral_constant< std::size_t, i > index_constant
An index constant with value i.
Definition indices.hh:26
constexpr auto size(const T &t)
Size query.
Definition hybridutilities.hh:85
constexpr auto equals(T1 &&t1, T2 &&t2)
Equality comparison.
Definition hybridutilities.hh:434
constexpr void forEach(Range &&range, F &&f)
Range based for loop.
Definition hybridutilities.hh:307
constexpr decltype(auto) switchCases(const Cases &cases, const Value &value, Branches &&branches, ElseBranch &&elseBranch)
Switch statement.
Definition hybridutilities.hh:493
T accumulate(Range &&range, T value, F &&f)
Accumulate values.
Definition hybridutilities.hh:330
decltype(auto) ifElse(const Condition &condition, IfFunc &&ifFunc, ElseFunc &&elseFunc)
A conditional expression.
Definition hybridutilities.hh:388
constexpr auto integralRange(const Begin &begin, const End &end)
Create an integral range.
Definition hybridutilities.hh:227
constexpr decltype(auto) elementAt(Container &&c, Index &&i)
Get element at given position from container.
Definition hybridutilities.hh:138
Dune namespace.
Definition alignment.hh:11
constexpr auto integralRange(const Begin &begin, const End &end, const PriorityTag< 1 > &)
Definition hybridutilities.hh:188
constexpr decltype(auto) elementAt(Container &&c, Index &&, PriorityTag< 2 >)
Definition hybridutilities.hh:96
constexpr auto size(const Dune::FieldVector< T, i > *, const PriorityTag< 5 > &) -> decltype(std::integral_constant< std::size_t, i >())
Definition hybridutilities.hh:22
vector space out of a tensor product of fields.
Definition fvector.hh:93
Definition hybridutilities.hh:149
static constexpr auto size()
Definition hybridutilities.hh:158
constexpr auto operator[](Dune::index_constant< i >) const
Definition hybridutilities.hh:153
Definition hybridutilities.hh:166
constexpr T operator[](const T &i) const
Definition hybridutilities.hh:178
constexpr DynamicIntegralRange(const T &begin, const T &end)
Definition hybridutilities.hh:168
constexpr auto size() const
Definition hybridutilities.hh:173
Check if T is an std::integral_constant<I, i>
Definition typetraits.hh:532
Helper class for tagging priorities.
Definition typeutilities.hh:60