3#ifndef DUNE_FUNCTIONS_FUNCTIONSPACEBASES_ISTLVECTORBACKEND_HH
4#define DUNE_FUNCTIONS_FUNCTIONSPACEBASES_ISTLVECTORBACKEND_HH
10#include <dune/common/std/type_traits.hh>
11#include <dune/common/indices.hh>
12#include <dune/common/hybridutilities.hh>
13#include <dune/common/concept.hh>
15#include <dune/functions/common/indexaccess.hh>
16#include <dune/functions/functionspacebases/concepts.hh>
25 std::enable_if_t<not Dune::models<Imp::Concept::HasStaticIndexAccess, V>() ,
int> = 0>
32 std::enable_if_t<Dune::models<Imp::Concept::HasStaticIndexAccess, V>(),
int> = 0>
35 return Hybrid::ifElse(Dune::models<Imp::Concept::HasDynamicIndexAccess<std::size_t>, V>(),
36 [&](
auto id) ->
decltype(
auto) {
37 return fieldTypes(
id(v)[std::size_t{0}]);
38 }, [&](
auto id) ->
decltype(
auto) {
39 auto indexRange =
typename decltype(range(Hybrid::size(
id(v))))::integer_sequence();
40 return unpackIntegerSequence([&](
auto... i) {
41 return uniqueTypeList(std::tuple_cat(fieldTypes(
id(v)[i])...));
63constexpr auto fieldTypes()
65 return decltype(Impl::fieldTypes(std::declval<V>())){};
74constexpr bool hasUniqueFieldType()
76 return std::tuple_size<std::decay_t<decltype(fieldTypes<V>())>>::value==1;
101class ISTLVectorBackend
106 using dynamicIndexAccess_t =
decltype(std::declval<C>()[0]);
109 using staticIndexAccess_t =
decltype(std::declval<C>()[Dune::Indices::_0]);
112 using resizeMethod_t =
decltype(std::declval<C>().resize(0));
118 using hasDynamicIndexAccess = Dune::Std::is_detected<dynamicIndexAccess_t, std::remove_reference_t<C>>;
121 using hasStaticIndexAccess = Dune::Std::is_detected<staticIndexAccess_t, std::remove_reference_t<C>>;
124 using hasResizeMethod = Dune::Std::is_detected<resizeMethod_t, std::remove_reference_t<C>>;
127 using isDynamicVector = Dune::Std::is_detected<dynamicIndexAccess_t, std::remove_reference_t<C>>;
130 using isStaticVector = Dune::Std::bool_constant<
131 Dune::Std::is_detected_v<staticIndexAccess_t, std::remove_reference_t<C>>
132 and not Dune::Std::is_detected_v<dynamicIndexAccess_t, std::remove_reference_t<C>>>;
135 using isScalar = Dune::Std::bool_constant<not Dune::Std::is_detected_v<staticIndexAccess_t, std::remove_reference_t<C>>>;
138 using isVector = Dune::Std::bool_constant<Dune::Std::is_detected_v<staticIndexAccess_t, std::remove_reference_t<C>>>;
142 template<
class... Args>
143 static void forwardToResize(Args&&... args)
145 resize(std::forward<Args>(args)...);
149 template<
class C,
class SizeProvider,
150 std::enable_if_t<hasResizeMethod<C>::value,
int> = 0>
151 static void resize(C&& c,
const SizeProvider& sizeProvider,
typename SizeProvider::SizePrefix prefix)
153 auto size = sizeProvider.size(prefix);
166 DUNE_THROW(RangeError,
"The vector entry v[" << prefix <<
"] should refer to a "
167 <<
"scalar coefficient, but is a dynamically sized vector of size==0");
176 for(std::size_t i=0; i<size; ++i)
179 resize(c[i], sizeProvider, prefix);
183 template<
class C,
class SizeProvider,
184 std::enable_if_t<not hasResizeMethod<C>::value,
int> = 0,
185 std::enable_if_t<isVector<C>::value,
int> = 0>
186 static void resize(C&& c,
const SizeProvider& sizeProvider,
typename SizeProvider::SizePrefix prefix)
188 auto size = sizeProvider.size(prefix);
203 if (c.size() != size)
204 DUNE_THROW(RangeError,
"Can't resize non-resizable entry v[" << prefix <<
"] of size " << c.size() <<
" to size(" << prefix <<
")=" << size);
207 using namespace Dune::Hybrid;
209 forEach(integralRange(Hybrid::size(c)), [&](
auto&& i) {
217 ISTLVectorBackend<V>::forwardToResize(c[i], sizeProvider, prefix);
221 template<
class C,
class SizeProvider,
222 std::enable_if_t<not hasResizeMethod<C>::value,
int> = 0,
223 std::enable_if_t<isScalar<C>::value,
int> = 0>
224 static void resize(C&& c,
const SizeProvider& sizeProvider,
typename SizeProvider::SizePrefix prefix)
226 auto size = sizeProvider.size(prefix);
228 DUNE_THROW(RangeError,
"Can't resize scalar vector entry v[" << prefix <<
"] to size(" << prefix <<
")=" << size);
231 template<
class C,
class T,
232 std::enable_if_t<std::is_assignable<C&,T>::value,
int> = 0>
233 void recursiveAssign(C& c,
const T& t)
238 template<
class C,
class T,
239 std::enable_if_t<not std::is_assignable<C&,T>::value,
int> = 0>
240 void recursiveAssign(C& c,
const T& t)
243 recursiveAssign(ci, t);
250 ISTLVectorBackend(Vector& vector) :
254 template<
class SizeProv
ider>
255 void resize(
const SizeProvider& sizeProvider)
257 auto prefix =
typename SizeProvider::SizePrefix();
259 resize(*vector_, sizeProvider, prefix);
262 template<
class MultiIndex>
263 decltype(
auto)
operator[](
const MultiIndex& index)
const
268 template<
class MultiIndex>
269 decltype(
auto)
operator[](
const MultiIndex& index)
283 void operator= (
const T& other)
285 recursiveAssign(vector(), other);
289 void operator= (
const ISTLVectorBackend<T>& other)
291 vector() = other.vector();
294 const Vector& vector()
const
344template<
class Vector>
347 static_assert(hasUniqueFieldType<Vector&>(),
"Vector type passed to istlVectorBackend() does not have a unique field type.");
348 return Impl::ISTLVectorBackend<Vector>(v);
382template<
class Vector>
385 static_assert(hasUniqueFieldType<const Vector&>(),
"Vector type passed to istlVectorBackend() does not have a unique field type.");
386 return Impl::ISTLVectorBackend<const Vector>(v);
auto istlVectorBackend(const Vector &v)
Return a vector backend wrapping const ISTL like containers.
Definition: istlvectorbackend.hh:383
constexpr decltype(auto) resolveDynamicMultiIndex(C &&c, const MultiIndex &multiIndex, const IsFinal &isFinal)
Provide multi-index access by chaining operator[].
Definition: indexaccess.hh:355
Definition: polynomial.hh:10