|
dune-pdelab 2.10-git
|
Loading...
Searching...
No Matches
Dune Namespace Reference
For backward compatibility – Do not use this! More...
Functions | |
| std::ostream & | operator<< (std::ostream &s, const bigunsignedint< k > &x) |
| bigunsignedint< k > | operator+ (const bigunsignedint< k > &x, std::uintmax_t y) |
| bigunsignedint< k > | operator- (const bigunsignedint< k > &x, std::uintmax_t y) |
| bigunsignedint< k > | operator* (const bigunsignedint< k > &x, std::uintmax_t y) |
| bigunsignedint< k > | operator/ (const bigunsignedint< k > &x, std::uintmax_t y) |
| bigunsignedint< k > | operator% (const bigunsignedint< k > &x, std::uintmax_t y) |
| bigunsignedint< k > | operator+ (std::uintmax_t x, const bigunsignedint< k > &y) |
| bigunsignedint< k > | operator- (std::uintmax_t x, const bigunsignedint< k > &y) |
| bigunsignedint< k > | operator* (std::uintmax_t x, const bigunsignedint< k > &y) |
| bigunsignedint< k > | operator/ (std::uintmax_t x, const bigunsignedint< k > &y) |
| bigunsignedint< k > | operator% (std::uintmax_t x, const bigunsignedint< k > &y) |
| std::string | className () |
| std::string | className (T &&v) |
| constexpr auto | models () |
| const T1 | cond (bool b, const T1 &v1, const T2 &v2) |
| static void | defaultViolatedAlignment (const char *className, std::size_t expectedAlignment, const void *address) |
| ViolatedAlignmentHandler & | violatedAlignmentHandler () |
| void | violatedAlignment (const char *className, std::size_t expectedAlignment, const void *address) |
| bool | isAligned (const void *p, std::size_t align) |
| AlignedNumber< T, align > | aligned (T value) |
| AlignedNumber< T, align > | cond (const AlignedNumber< bool, align > &b, const AlignedNumber< T, align > &v1, const AlignedNumber< T, align > &v2) |
| T | max_value (const AlignedNumber< T, align > &val) |
| T | min_value (const AlignedNumber< T, align > &val) |
| bool | any_true (const AlignedNumber< bool, align > &val) |
| bool | all_true (const AlignedNumber< bool, align > &val) |
| std::ostream & | operator<< (std::ostream &s, const DenseMatrix< MAT > &a) |
| auto | dot (const A &a, const B &b) -> typename std::enable_if< IsNumber< A >::value &&!IsVector< A >::value &&!std::is_same< typename FieldTraits< A >::field_type, typename FieldTraits< A >::real_type > ::value, decltype(conj(a) *b)>::type |
| auto | dotT (const A &a, const B &b) -> decltype(a *b) |
| std::ostream & | operator<< (std::ostream &os, const EnumItem< TA, i > &) |
| std::ostream & | operator<< (std::ostream &os, const EnumRange< TA, from, to > &) |
| Combine< TI1, TI2, typename TI1::Type > | combine (const TI1 &set1, const TI2 &set2) |
| std::ostream & | operator<< (std::ostream &os, const Combine< TI1, TI2, T > &) |
| std::ostream & | operator<< (std::ostream &stream, const Exception &e) |
| constexpr std::array< T, n > | filledArray (const T &t) |
| std::ostream & | operator<< (std::ostream &s, const FieldMatrix< K, 1, 1 > &a) |
| void | hash_combine (std::size_t &seed, const T &arg) |
| std::size_t | hash_range (It first, It last) |
| void | hash_range (std::size_t &seed, It first, It last) |
| HybridMultiIndex (I... i) -> HybridMultiIndex< decltype(Impl::castToHybridSizeT(i))... > | |
| HybridMultiIndex (std::tuple< I... >) -> HybridMultiIndex< I... > | |
| std::ostream & | operator<< (std::ostream &s, const Indent &indent) |
| decltype(auto) constexpr | unpackIntegerSequence (F &&f, std::integer_sequence< I, i... > sequence) |
| constexpr auto | get (std::integer_sequence< T, II... >, std::integral_constant< std::size_t, pos >={}) |
| constexpr T | get (std::integer_sequence< T, II... >, std::size_t pos) |
| constexpr std::integral_constant< T, I0 > | front (std::integer_sequence< T, I0, II... >) |
| constexpr auto | back (std::integer_sequence< T, II... > seq) |
| constexpr std::integral_constant< T, I0 > | head (std::integer_sequence< T, I0, II... >) |
| constexpr std::integer_sequence< T, II... > | tail (std::integer_sequence< T, I0, II... >) |
| constexpr std::integer_sequence< T, T(I0), II... > | push_front (std::integer_sequence< T, II... >, std::integral_constant< T, I0 >={}) |
| constexpr std::integer_sequence< T, II..., T(IN)> | push_back (std::integer_sequence< T, II... >, std::integral_constant< T, IN >={}) |
| constexpr std::integral_constant< std::size_t, sizeof...(II)> | size (std::integer_sequence< T, II... >) |
| constexpr std::bool_constant<(sizeof...(II)==0)> | empty (std::integer_sequence< T, II... >) |
| constexpr auto | sorted (std::integer_sequence< T, II... >, Compare comp) |
| constexpr auto | sorted (std::integer_sequence< T, II... > seq) |
| constexpr std::bool_constant<((II==value)||...)> | contains (std::integer_sequence< T, II... >, std::integral_constant< T, value >) |
| constexpr auto | difference (std::integer_sequence< T, II... > iSeq, std::integer_sequence< T, JJ... > jSeq) |
| constexpr auto | difference (std::integer_sequence< T, JJ... > jSeq) |
| constexpr std::is_same< std::integer_sequence< bool, true,(ST(II)==ST(JJ))... >, std::integer_sequence< bool,(ST(II)==ST(JJ))..., true > > | equal (std::integer_sequence< S, II... >, std::integer_sequence< T, JJ... >) |
| constexpr auto | filter (std::integer_sequence< T > jSeq) |
| constexpr auto | filter (std::integer_sequence< T, J0, JJ... > jSeq) |
| constexpr auto | filter (Filter, std::integer_sequence< T > jSeq) |
| constexpr auto | filter (Filter f, std::integer_sequence< T, J0, JJ... > jSeq) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator== (const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator!= (const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr std::enable_if< std::is_convertible< T2, T1 >::value, bool >::type | operator== (const BidirectionalIteratorFacade< T1, V1, R1, D > &lhs, const BidirectionalIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator!= (const BidirectionalIteratorFacade< T1, V1, R1, D > &lhs, const BidirectionalIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator== (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator!= (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator< (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator<= (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator> (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator>= (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, D >::type | operator- (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr auto | operator== (const IteratorFacade< T1, C, V1, R1, P1, D1 > &it1, const IteratorFacade< T2, C, V2, R2, P2, D2 > &it2) |
| constexpr bool | operator!= (const IteratorFacade< T1, C, V1, R1, P1, D1 > &it1, const IteratorFacade< T2, C, V2, R2, P2, D2 > &it2) |
| constexpr auto | operator- (const IteratorFacade< T1, C, V1, R1, P1, D > &it1, const IteratorFacade< T2, C, V2, R2, P2, D > &it2) |
| constexpr bool | operator< (const IteratorFacade< T1, C, V1, R1, P1, D1 > &it1, const IteratorFacade< T2, C, V2, R2, P2, D2 > &it2) |
| constexpr bool | operator<= (const IteratorFacade< T1, C, V1, R1, P1, D1 > &it1, const IteratorFacade< T2, C, V2, R2, P2, D2 > &it2) |
| constexpr bool | operator> (const IteratorFacade< T1, C, V1, R1, P1, D1 > &it1, const IteratorFacade< T2, C, V2, R2, P2, D2 > &it2) |
| constexpr bool | operator>= (const IteratorFacade< T1, C, V1, R1, P1, D1 > &it1, const IteratorFacade< T2, C, V2, R2, P2, D2 > &it2) |
| constexpr bool | operator== (const MallocAllocator< T > &, const MallocAllocator< T > &) |
| constexpr bool | operator!= (const MallocAllocator< T > &, const MallocAllocator< T > &) |
| constexpr Base | power (Base m, Exponent p) |
| static constexpr T | factorial (const T &n) noexcept |
| static constexpr auto | factorial (std::integral_constant< T, n >) noexcept |
| static constexpr T | binomial (const T &n, const T &k) noexcept |
| static constexpr auto | binomial (std::integral_constant< T, n >, std::integral_constant< T, k >) noexcept |
| static constexpr auto | binomial (std::integral_constant< T, n >, std::integral_constant< T, n >) noexcept |
| constexpr K | conjugateComplex (const K &x) |
| constexpr int | sign (const T &val) |
| auto | overload (F &&... f) |
| auto | orderedOverload (F &&... f) |
| bool | operator== (const No_Comm &, const No_Comm &) |
| bool | operator!= (const No_Comm &, const No_Comm &) |
| std::ostream & | operator<< (std::ostream &os, const IndexPair< TG, TL > &pair) |
| bool | operator== (const IndexPair< TG, TL > &, const IndexPair< TG, TL > &) |
| bool | operator!= (const IndexPair< TG, TL > &, const IndexPair< TG, TL > &) |
| bool | operator< (const IndexPair< TG, TL > &, const IndexPair< TG, TL > &) |
| bool | operator> (const IndexPair< TG, TL > &, const IndexPair< TG, TL > &) |
| bool | operator<= (const IndexPair< TG, TL > &, const IndexPair< TG, TL > &) |
| bool | operator>= (const IndexPair< TG, TL > &, const IndexPair< TG, TL > &) |
| bool | operator== (const IndexPair< TG, TL > &, const TG &) |
| bool | operator!= (const IndexPair< TG, TL > &, const TG &) |
| bool | operator< (const IndexPair< TG, TL > &, const TG &) |
| bool | operator> (const IndexPair< TG, TL > &, const TG &) |
| bool | operator<= (const IndexPair< TG, TL > &, const TG &) |
| bool | operator>= (const IndexPair< TG, TL > &, const TG &) |
| std::ostream & | operator<< (std::ostream &os, const ParallelIndexSet< TG, TL, N > &indexSet) |
| bool | operator< (const IndexPair< TG, ParallelLocalIndex< TA > > &i1, const std::pair< TG, TA > &i2) |
| bool | operator< (const std::pair< TG, TA > &i1, const IndexPair< TG, ParallelLocalIndex< TA > > &i2) |
| bool | operator== (const IndexPair< TG, ParallelLocalIndex< TA > > &i1, const std::pair< TG, TA > &i2) |
| bool | operator!= (const IndexPair< TG, ParallelLocalIndex< TA > > &i1, const std::pair< TG, TA > &i2) |
| bool | operator== (const std::pair< TG, TA > &i2, const IndexPair< TG, ParallelLocalIndex< TA > > &i1) |
| bool | operator!= (const std::pair< TG, TA > &i2, const IndexPair< TG, ParallelLocalIndex< TA > > &i1) |
| void | storeGlobalIndicesOfRemoteIndices (std::map< int, SLList< std::pair< typename T::GlobalIndex, typename T::LocalIndex::Attribute >, A > > &globalMap, const RemoteIndices< T, A1 > &remoteIndices) |
| void | repairLocalIndexPointers (std::map< int, SLList< std::pair< typename T::GlobalIndex, typename T::LocalIndex::Attribute >, A > > &globalMap, RemoteIndices< T, A1 > &remoteIndices, const T &indexSet) |
| std::ostream & | operator<< (std::ostream &os, const Interface &interface) |
| ComposeMPIOp (std::plus, MPI_SUM) | |
| ComposeMPIOp (std::multiplies, MPI_PROD) | |
| ComposeMPIOp (Min, MPI_MIN) | |
| ComposeMPIOp (Max, MPI_MAX) | |
| auto | getMPIData (T &t) |
| std::ostream & | operator<< (std::ostream &os, const ParallelLocalIndex< T > &index) |
| bool | operator== (const ParallelLocalIndex< T > &p1, const ParallelLocalIndex< T > &p2) |
| bool | operator!= (const ParallelLocalIndex< T > &p1, const ParallelLocalIndex< T > &p2) |
| std::ostream & | operator<< (std::ostream &os, const RemoteIndex< T1, T2 > &index) |
| std::ostream & | operator<< (std::ostream &os, const RemoteIndices< T, A > &indices) |
| std::ostream & | operator<< (std::ostream &os, const RemoteIndex< TG, TA > &index) |
| std::string | concatPaths (const std::string &base, const std::string &p) |
| std::string | processPath (const std::string &p) |
| bool | pathIndicatesDirectory (const std::string &p) |
| std::string | prettyPath (const std::string &p, bool isDirectory) |
| std::string | prettyPath (const std::string &p) |
| std::string | relativePath (const std::string &newbase, const std::string &p) |
| bool | operator== (const PoolAllocator< T1, t1 > &, const PoolAllocator< T2, t2 > &) |
| bool | operator!= (const PoolAllocator< T1, t1 > &, const PoolAllocator< T2, t2 > &) |
| bool | operator== (const PoolAllocator< T, t1 > &p1, const PoolAllocator< T, t2 > &p2) |
| bool | operator!= (const PoolAllocator< T, t1 > &p1, const PoolAllocator< T, t2 > &p2) |
| bool | operator== (const PoolAllocator< void, t1 > &, const PoolAllocator< T, t2 > &) |
| bool | operator!= (const PoolAllocator< void, t1 > &, const PoolAllocator< T, t2 > &) |
| bool | operator== (const PoolAllocator< void, t1 > &p1, const PoolAllocator< void, t2 > &p2) |
| bool | operator!= (const PoolAllocator< void, t1 > &p1, const PoolAllocator< void, t2 > &p2) |
| Reference | get (const RAPropertyMapHelper< Reference, PropertyMap > &pmap, const Key &key) |
| void | put (const RAPropertyMapHelper< Reference, PropertyMap > &pmap, const Key &key, const Value &value) |
| pointer_or_proxy_holder | handle_proxy_member_access (T &&t) |
| T::value_type | max_value (const T &v) |
| T::value_type | min_value (const T &v) |
| bool | any_true (const T &v) |
| bool | any_true (const std::bitset< N > &b) |
| bool | all_true (const T &v) |
| bool | all_true (const std::bitset< N > &b) |
| static constexpr IntegralRange< std::decay_t< T > > | range (T &&from, U &&to) noexcept |
| static constexpr IntegralRange< std::decay_t< T > > | range (T &&to) noexcept |
| static constexpr StaticIntegralRange< T, to, from > | range (std::integral_constant< T, from >, std::integral_constant< T, to >) noexcept |
| static constexpr StaticIntegralRange< T, to > | range (std::integral_constant< T, to >) noexcept |
| auto | transformedRangeView (R &&range, F &&f) |
| auto | iteratorTransformedRangeView (R &&range, F &&f) |
| auto | sparseRange (Range &&range) |
| constexpr T & | resolveRef (T &gf) noexcept |
| const auto & | resolveRef (T &&gf)=delete |
| constexpr T & | resolveRef (std::reference_wrapper< T > gf) noexcept |
| std::shared_ptr< T > | stackobject_to_shared_ptr (T &t) |
| auto | wrap_or_move (T &&t) |
| auto | wrap_or_move (T &t) |
| std::size_t | lanes (const T &) |
| T | lane (std::size_t l, const T &v) |
| T & | lane (std::size_t l, T &v) |
| void | assign (T &dst, const T &src, bool mask) |
| void | swap (T &v1, T &v2, bool mask) |
| DUNE_SIMD_LOOP_BINARY_OP (+) | |
| DUNE_SIMD_LOOP_BINARY_OP (-) | |
| DUNE_SIMD_LOOP_BINARY_OP * | DUNE_SIMD_LOOP_BINARY_OP (/);DUNE_SIMD_LOOP_BINARY_OP(% |
| DUNE_SIMD_LOOP_BINARY_OP & | DUNE_SIMD_LOOP_BINARY_OP (|);DUNE_SIMD_LOOP_BINARY_OP(^ |
| DUNE_SIMD_LOOP_BITSHIFT_OP (<<) | |
| DUNE_SIMD_LOOP_BITSHIFT_OP (> >) | |
| DUNE_SIMD_LOOP_COMPARISON_OP (<) | |
| DUNE_SIMD_LOOP_COMPARISON_OP (<=) | |
| DUNE_SIMD_LOOP_COMPARISON_OP (>=) | |
| DUNE_SIMD_LOOP_COMPARISON_OP (!=) | |
| DUNE_SIMD_LOOP_BOOLEAN_OP && | DUNE_SIMD_LOOP_BOOLEAN_OP (||);template< class T, std::size_t S, std::size_t A > std::ostream &operator<<(std::ostream &os, const LoopSIMD< T, S, A > &v |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (cos) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (sin) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (tan) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (acos) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (asin) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (atan) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (cosh) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (sinh) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (tanh) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (acosh) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (asinh) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (atanh) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (exp) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (log) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (log10) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (exp2) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (expm1) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN (ilogb, int) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (log1p) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (log2) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (logb) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (sqrt) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (cbrt) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (erf) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (erfc) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (tgamma) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (lgamma) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (ceil) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (floor) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (trunc) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (round) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN (lround, long) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN (llround, long long) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (rint) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN (lrint, long) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP_WITH_RETURN (llrint, long long) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (nearbyint) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (fabs) | |
| DUNE_SIMD_LOOP_CMATH_UNARY_OP (abs) | |
| DUNE_SIMD_LOOP_STD_UNARY_OP (real) | |
| DUNE_SIMD_LOOP_STD_UNARY_OP (imag) | |
| DUNE_SIMD_LOOP_STD_BINARY_OP (max) | |
| DUNE_SIMD_LOOP_STD_BINARY_OP (min) | |
| std::ostream & | operator<< (std::ostream &os, const SLList< T, A > &sllist) |
| DVVerbType | dvverb (std::cout) |
| DVerbType | dverb (std::cout) |
| DInfoType | dinfo (std::cout) |
| DWarnType | dwarn (std::cerr) |
| DGraveType | dgrave (std::cerr) |
| DErrType | derr (std::cerr) |
| void | doAssertCallOnce (const char *file, int line, const char *function) |
| void | assertCallOnce (const char *file=nullptr, int line=-1, const char *function=nullptr) |
| std::ostream & | operator<< (std::ostream &stream, const std::tuple< Ts... > &t) |
| std::istream & | operator>> (std::istream &stream, std::tuple< Ts... > &t) |
| std::ostream & | operator<< (std::ostream &stream, const std::array< T, N > &a) |
| bool | hasPrefix (const C &c, const char *prefix) |
| bool | hasSuffix (const C &c, const char *suffix) |
| static std::string | formatString (const std::string &s, const T &... args) |
| auto | transpose (const Matrix &matrix) |
| auto | transpose (Matrix &&matrix) |
| auto | transpose (const std::reference_wrapper< Matrix > &matrix) |
| auto | transposedView (const Matrix &matrix) |
| decltype(auto) | applyPartial (F &&f, ArgTuple &&args, std::integer_sequence< I, i... >) |
| auto | genericTransformTuple (Tuple &&t, Functor &&f) -> decltype(genericTransformTupleBackend(t, f)) |
| TransformTupleFunctor< TE, Args... > | makeTransformTupleFunctor (Args &&... args) |
| auto | transformTuple (Tuple &&orig, Args &&... args) -> decltype(genericTransformTuple(orig, makeTransformTupleFunctor< TypeEvaluator >(args...))) |
| constexpr auto | uniqueTypeList (TypeList< T... >) |
| constexpr auto | integerSequenceEntry (std::integer_sequence< T, t... >, std::integral_constant< std::size_t, index > i) |
| constexpr AutonomousValue< T > | autoCopy (T &&v) |
| auto | dot (const A &a, const B &b) -> typename std::enable_if< IsNumber< A >::value &&!IsVector< A >::value &&!std::is_same< typename FieldTraits< A >::field_type, typename FieldTraits< A >::real_type > ::value, decltype(conj(a) *b)>::type |
| auto | dotT (const A &a, const B &b) -> decltype(a *b) |
| std::ostream & | operator<< (std::ostream &os, const EnumItem< TA, i > &) |
| std::ostream & | operator<< (std::ostream &os, const EnumRange< TA, from, to > &) |
| Combine< TI1, TI2, typename TI1::Type > | combine (const TI1 &set1, const TI2 &set2) |
| std::ostream & | operator<< (std::ostream &os, const Combine< TI1, TI2, T > &) |
| constexpr std::array< T, n > | filledArray (const T &t) |
| std::ostream & | operator<< (std::ostream &s, const Indent &indent) |
| std::ostream & | operator<< (std::ostream &os, const SLList< T, A > &sllist) |
| std::ostream & | operator<< (std::ostream &stream, const std::tuple< Ts... > &t) |
| std::istream & | operator>> (std::istream &stream, std::tuple< Ts... > &t) |
| std::ostream & | operator<< (std::ostream &stream, const std::array< T, N > &a) |
| bool | operator== (const PoolAllocator< T1, t1 > &, const PoolAllocator< T2, t2 > &) |
| bool | operator!= (const PoolAllocator< T1, t1 > &, const PoolAllocator< T2, t2 > &) |
| bool | operator== (const PoolAllocator< T, t1 > &p1, const PoolAllocator< T, t2 > &p2) |
| bool | operator!= (const PoolAllocator< T, t1 > &p1, const PoolAllocator< T, t2 > &p2) |
| bool | operator== (const PoolAllocator< void, t1 > &, const PoolAllocator< T, t2 > &) |
| bool | operator!= (const PoolAllocator< void, t1 > &, const PoolAllocator< T, t2 > &) |
| bool | operator== (const PoolAllocator< void, t1 > &p1, const PoolAllocator< void, t2 > &p2) |
| bool | operator!= (const PoolAllocator< void, t1 > &p1, const PoolAllocator< void, t2 > &p2) |
| decltype(auto) | applyPartial (F &&f, ArgTuple &&args, std::integer_sequence< I, i... >) |
| std::string | concatPaths (const std::string &base, const std::string &p) |
| std::string | processPath (const std::string &p) |
| bool | pathIndicatesDirectory (const std::string &p) |
| std::string | prettyPath (const std::string &p, bool isDirectory) |
| std::string | prettyPath (const std::string &p) |
| std::string | relativePath (const std::string &newbase, const std::string &p) |
| T::value_type | max_value (const T &v) |
| T::value_type | min_value (const T &v) |
| bool | any_true (const T &v) |
| bool | any_true (const std::bitset< N > &b) |
| bool | all_true (const T &v) |
| bool | all_true (const std::bitset< N > &b) |
| static constexpr IntegralRange< std::decay_t< T > > | range (T &&from, U &&to) noexcept |
| static constexpr IntegralRange< std::decay_t< T > > | range (T &&to) noexcept |
| static constexpr StaticIntegralRange< T, to, from > | range (std::integral_constant< T, from >, std::integral_constant< T, to >) noexcept |
| static constexpr StaticIntegralRange< T, to > | range (std::integral_constant< T, to >) noexcept |
| auto | transformedRangeView (R &&range, F &&f) |
| auto | iteratorTransformedRangeView (R &&range, F &&f) |
| auto | sparseRange (Range &&range) |
| bool | hasPrefix (const C &c, const char *prefix) |
| bool | hasSuffix (const C &c, const char *suffix) |
| static std::string | formatString (const std::string &s, const T &... args) |
| auto | genericTransformTuple (Tuple &&t, Functor &&f) -> decltype(genericTransformTupleBackend(t, f)) |
| TransformTupleFunctor< TE, Args... > | makeTransformTupleFunctor (Args &&... args) |
| auto | transformTuple (Tuple &&orig, Args &&... args) -> decltype(genericTransformTuple(orig, makeTransformTupleFunctor< TypeEvaluator >(args...))) |
| HybridMultiIndex (I... i) -> HybridMultiIndex< decltype(Impl::castToHybridSizeT(i))... > | |
| HybridMultiIndex (std::tuple< I... >) -> HybridMultiIndex< I... > | |
| decltype(auto) constexpr | unpackIntegerSequence (F &&f, std::integer_sequence< I, i... > sequence) |
| auto | overload (F &&... f) |
| auto | orderedOverload (F &&... f) |
| pointer_or_proxy_holder | handle_proxy_member_access (T &&t) |
| constexpr T & | resolveRef (T &gf) noexcept |
| constexpr T & | resolveRef (std::reference_wrapper< T > gf) noexcept |
| constexpr auto | integerSequenceEntry (std::integer_sequence< T, t... >, std::integral_constant< std::size_t, index > i) |
| constexpr AutonomousValue< T > | autoCopy (T &&v) |
| constexpr auto | models () |
| std::ostream & | operator<< (std::ostream &s, const bigunsignedint< k > &x) |
| bigunsignedint< k > | operator+ (const bigunsignedint< k > &x, std::uintmax_t y) |
| bigunsignedint< k > | operator- (const bigunsignedint< k > &x, std::uintmax_t y) |
| bigunsignedint< k > | operator* (const bigunsignedint< k > &x, std::uintmax_t y) |
| bigunsignedint< k > | operator/ (const bigunsignedint< k > &x, std::uintmax_t y) |
| bigunsignedint< k > | operator% (const bigunsignedint< k > &x, std::uintmax_t y) |
| bigunsignedint< k > | operator+ (std::uintmax_t x, const bigunsignedint< k > &y) |
| bigunsignedint< k > | operator- (std::uintmax_t x, const bigunsignedint< k > &y) |
| bigunsignedint< k > | operator* (std::uintmax_t x, const bigunsignedint< k > &y) |
| bigunsignedint< k > | operator/ (std::uintmax_t x, const bigunsignedint< k > &y) |
| bigunsignedint< k > | operator% (std::uintmax_t x, const bigunsignedint< k > &y) |
| std::ostream & | operator<< (std::ostream &s, const DenseMatrix< MAT > &a) |
| std::ostream & | operator<< (std::ostream &s, const FieldMatrix< K, 1, 1 > &a) |
| std::ostream & | operator<< (std::ostream &stream, const Exception &e) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator== (const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator!= (const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr std::enable_if< std::is_convertible< T2, T1 >::value, bool >::type | operator== (const BidirectionalIteratorFacade< T1, V1, R1, D > &lhs, const BidirectionalIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator!= (const BidirectionalIteratorFacade< T1, V1, R1, D > &lhs, const BidirectionalIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator== (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator!= (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator< (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator<= (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator> (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, bool >::type | operator>= (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr EnableIfInterOperable< T1, T2, D >::type | operator- (const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs) |
| constexpr auto | operator== (const IteratorFacade< T1, C, V1, R1, P1, D1 > &it1, const IteratorFacade< T2, C, V2, R2, P2, D2 > &it2) |
| constexpr bool | operator!= (const IteratorFacade< T1, C, V1, R1, P1, D1 > &it1, const IteratorFacade< T2, C, V2, R2, P2, D2 > &it2) |
| constexpr auto | operator- (const IteratorFacade< T1, C, V1, R1, P1, D > &it1, const IteratorFacade< T2, C, V2, R2, P2, D > &it2) |
| constexpr bool | operator< (const IteratorFacade< T1, C, V1, R1, P1, D1 > &it1, const IteratorFacade< T2, C, V2, R2, P2, D2 > &it2) |
| constexpr bool | operator<= (const IteratorFacade< T1, C, V1, R1, P1, D1 > &it1, const IteratorFacade< T2, C, V2, R2, P2, D2 > &it2) |
| constexpr bool | operator> (const IteratorFacade< T1, C, V1, R1, P1, D1 > &it1, const IteratorFacade< T2, C, V2, R2, P2, D2 > &it2) |
| constexpr bool | operator>= (const IteratorFacade< T1, C, V1, R1, P1, D1 > &it1, const IteratorFacade< T2, C, V2, R2, P2, D2 > &it2) |
| std::ostream & | operator<< (std::ostream &os, const IndexPair< TG, TL > &pair) |
| bool | operator== (const IndexPair< TG, TL > &, const IndexPair< TG, TL > &) |
| bool | operator!= (const IndexPair< TG, TL > &, const IndexPair< TG, TL > &) |
| bool | operator< (const IndexPair< TG, TL > &, const IndexPair< TG, TL > &) |
| bool | operator> (const IndexPair< TG, TL > &, const IndexPair< TG, TL > &) |
| bool | operator<= (const IndexPair< TG, TL > &, const IndexPair< TG, TL > &) |
| bool | operator>= (const IndexPair< TG, TL > &, const IndexPair< TG, TL > &) |
| bool | operator== (const IndexPair< TG, TL > &, const TG &) |
| bool | operator!= (const IndexPair< TG, TL > &, const TG &) |
| bool | operator< (const IndexPair< TG, TL > &, const TG &) |
| bool | operator> (const IndexPair< TG, TL > &, const TG &) |
| bool | operator<= (const IndexPair< TG, TL > &, const TG &) |
| bool | operator>= (const IndexPair< TG, TL > &, const TG &) |
| std::ostream & | operator<< (std::ostream &os, const ParallelIndexSet< TG, TL, N > &indexSet) |
| bool | operator< (const IndexPair< TG, ParallelLocalIndex< TA > > &i1, const std::pair< TG, TA > &i2) |
| bool | operator< (const std::pair< TG, TA > &i1, const IndexPair< TG, ParallelLocalIndex< TA > > &i2) |
| bool | operator== (const IndexPair< TG, ParallelLocalIndex< TA > > &i1, const std::pair< TG, TA > &i2) |
| bool | operator!= (const IndexPair< TG, ParallelLocalIndex< TA > > &i1, const std::pair< TG, TA > &i2) |
| bool | operator== (const std::pair< TG, TA > &i2, const IndexPair< TG, ParallelLocalIndex< TA > > &i1) |
| bool | operator!= (const std::pair< TG, TA > &i2, const IndexPair< TG, ParallelLocalIndex< TA > > &i1) |
| void | storeGlobalIndicesOfRemoteIndices (std::map< int, SLList< std::pair< typename T::GlobalIndex, typename T::LocalIndex::Attribute >, A > > &globalMap, const RemoteIndices< T, A1 > &remoteIndices) |
| void | repairLocalIndexPointers (std::map< int, SLList< std::pair< typename T::GlobalIndex, typename T::LocalIndex::Attribute >, A > > &globalMap, RemoteIndices< T, A1 > &remoteIndices, const T &indexSet) |
| std::ostream & | operator<< (std::ostream &os, const ParallelLocalIndex< T > &index) |
| bool | operator== (const ParallelLocalIndex< T > &p1, const ParallelLocalIndex< T > &p2) |
| bool | operator!= (const ParallelLocalIndex< T > &p1, const ParallelLocalIndex< T > &p2) |
| std::ostream & | operator<< (std::ostream &os, const RemoteIndex< T1, T2 > &index) |
| std::ostream & | operator<< (std::ostream &os, const RemoteIndices< T, A > &indices) |
| std::ostream & | operator<< (std::ostream &os, const RemoteIndex< TG, TA > &index) |
| unspecified value type | referenceElement (T &&... t) |
| auto | referenceElement (const Dune::GeometryType >, Dune::Dim< dim >={}) |
| auto | referenceElement (const T &, const Dune::GeometryType >, Dune::Dim< dim >) |
| RefinementIntervals | refinementIntervals (int intervals) |
| RefinementIntervals | refinementLevels (int levels) |
| static void | checkAlbertaDimensions () |
| auto | referenceElement (const Geometry< mydim, cdim, GridImp, GeometryImp > &geo) -> decltype(referenceElement(geo, geo.impl())) |
| Grid< dim, dimworld, ct, GridFamily >::LevelGridView | levelGridView (const Grid< dim, dimworld, ct, GridFamily > &grid, int level) |
| Grid< dim, dimworld, ct, GridFamily >::LeafGridView | leafGridView (const Grid< dim, dimworld, ct, GridFamily > &grid) |
| std::string | PartitionName (PartitionType type) |
| std::ostream & | operator<< (std::ostream &out, const PartitionType &type) |
| std::ostream & | operator<< (std::ostream &out, const InterfaceType &type) |
| std::ostream & | operator<< (std::ostream &out, const PartitionIteratorType &type) |
| void | gridinfo (const G &grid, std::string prefix="") |
| void | gridlevellist (const G &grid, int level, std::string prefix) |
| void | gridleaflist (const G &grid, std::string prefix) |
| MCMGLayout | mcmgElementLayout () |
| MCMGLayout | mcmgVertexLayout () |
| void | printGrid (const GridType &grid, std::string output_file, int size=2000, bool execute_plot=true, bool png=true, bool local_corner_indices=true, bool local_intersection_indices=true, bool outer_normals=true) |
| void | printGrid (const GridType &grid, const Dune::MPIHelper &helper, std::string output_file="printgrid", int size=2000, bool execute_plot=true, bool png=true, bool local_corner_indices=true, bool local_intersection_indices=true, bool outer_normals=true) |
| void | fillGridViewInfoSerial (const GV &gv, GridViewInfo< typename GV::ctype > &gridViewInfo) |
| YaspGrid (FieldVector< ctype, dim >, std::array< int, std::size_t{dim}>, std::bitset< std::size_t{dim}>=std::bitset< std::size_t{dim}>{0ULL}, int=1, YaspCommunication=YaspCommunication(), const Yasp::Partitioning< dim > *=YaspGrid< dim, EquidistantCoordinates< ctype, dim > >::defaultPartitioner()) -> YaspGrid< dim, EquidistantCoordinates< ctype, dim > > | |
| YaspGrid (FieldVector< ctype, dim >, FieldVector< ctype, dim >, std::array< int, std::size_t{dim}>, std::bitset< std::size_t{dim}>=std::bitset< std::size_t{dim}>{0ULL}, int=1, YaspCommunication=YaspCommunication(), const Yasp::Partitioning< dim > *=YaspGrid< dim, EquidistantOffsetCoordinates< ctype, dim > >::defaultPartitioner()) -> YaspGrid< dim, EquidistantOffsetCoordinates< ctype, dim > > | |
| YaspGrid (std::array< std::vector< ctype >, dim >, std::bitset< dim >=std::bitset< dim >{0ULL}, int=1, YaspCommunication=YaspCommunication(), const Yasp::Partitioning< dim > *=YaspGrid< int{dim}, TensorProductCoordinates< ctype, int{dim}> >::defaultPartitioner()) -> YaspGrid< int | |
| std::ostream & | operator<< (std::ostream &s, const YaspGrid< d, CC > &grid) |
| std::ostream & | operator<< (std::ostream &s, EquidistantCoordinates< ct, dim > &c) |
| std::ostream & | operator<< (std::ostream &s, EquidistantOffsetCoordinates< ct, dim > &c) |
| std::ostream & | operator<< (std::ostream &s, TensorProductCoordinates< ct, dim > &c) |
| std::ostream & | operator<< (std::ostream &s, const Torus< Communication, d > &t) |
| std::ostream & | operator<< (std::ostream &s, YGridComponent< Coordinates > e) |
| std::ostream & | operator<< (std::ostream &s, typename YGridComponent< Coordinates >::Iterator &e) |
| std::ostream & | operator<< (std::ostream &s, const YGrid< Coordinates > &e) |
| void | gridinfo (const G &grid, std::string prefix="") |
| void | gridlevellist (const G &grid, int level, std::string prefix) |
| void | gridleaflist (const G &grid, std::string prefix) |
| std::string | PartitionName (PartitionType type) |
| std::ostream & | operator<< (std::ostream &out, const PartitionType &type) |
| std::ostream & | operator<< (std::ostream &out, const InterfaceType &type) |
| std::ostream & | operator<< (std::ostream &out, const PartitionIteratorType &type) |
| Grid< dim, dimworld, ct, GridFamily >::LevelGridView | levelGridView (const Grid< dim, dimworld, ct, GridFamily > &grid, int level) |
| Grid< dim, dimworld, ct, GridFamily >::LeafGridView | leafGridView (const Grid< dim, dimworld, ct, GridFamily > &grid) |
| MCMGLayout | mcmgLayout (Dim< dim >) |
| MCMGLayout | mcmgElementLayout () |
| MCMGLayout | mcmgVertexLayout () |
| DUNE_REGISTER_SOLVER ("ldl",[](auto opTraits, const auto &op, const Dune::ParameterTree &config) -> std::shared_ptr< typename decltype(opTraits)::solver_type > { using OpTraits=decltype(opTraits);using M=typename OpTraits::matrix_type;if constexpr(OpTraits::isParallel){ if(opTraits.getCommOrThrow(op).communicator().size() > 1) DUNE_THROW(Dune::InvalidStateException, "LDL works only for sequential operators.");} if constexpr(std::is_convertible_v< LDL< M > *, Dune::InverseOperator< typename OpTraits::domain_type, typename OpTraits::range_type > * > &&std::is_same_v< typename FieldTraits< M >::field_type, double >){ const auto &A=opTraits.getAssembledOpOrThrow(op);const M &mat=A->getmat();int verbose=config.get("verbose", 0);return std::make_shared< LDL< M > >(mat, verbose);} DUNE_THROW(UnsupportedType, "Unsupported Type in LDL (only FieldMatrix<double,...> supported)");}) | |
| DUNE_REGISTER_SOLVER ("spqr",[](auto opTraits, const auto &op, const Dune::ParameterTree &config) -> std::shared_ptr< typename decltype(opTraits)::solver_type > { using OpTraits=decltype(opTraits);using M=typename OpTraits::matrix_type;if constexpr(OpTraits::isParallel){ if(opTraits.getCommOrThrow(op).communicator().size() > 1) DUNE_THROW(Dune::InvalidStateException, "SPQR works only for sequential operators.");} if constexpr(std::is_convertible_v< SPQR< M > *, Dune::InverseOperator< typename OpTraits::domain_type, typename OpTraits::range_type > * > &&std::is_same_v< typename FieldTraits< M >::field_type, double >){ const auto &A=opTraits.getAssembledOpOrThrow(op);const M &mat=A->getmat();int verbose=config.get("verbose", 0);return std::make_shared< Dune::SPQR< M > >(mat, verbose);} DUNE_THROW(UnsupportedType, "Unsupported Type in SPQR (only FieldMatrix<double,...> supported)");}) | |
| DUNE_REGISTER_SOLVER ("umfpack",[](auto opTraits, const auto &op, const Dune::ParameterTree &config) -> std::shared_ptr< typename decltype(opTraits)::solver_type > { using OpTraits=decltype(opTraits);if constexpr(OpTraits::isParallel){ if(opTraits.getCommOrThrow(op).communicator().size() > 1) DUNE_THROW(Dune::InvalidStateException, "UMFPack works only for sequential operators.");} if constexpr(OpTraits::isAssembled){ using M=typename OpTraits::matrix_type;if constexpr(UMFPackImpl::isValidBlock< OpTraits >::value) { const auto &A=opTraits.getAssembledOpOrThrow(op);const M &mat=A->getmat();return std::make_shared< Dune::UMFPack< M > >(mat, config);} } DUNE_THROW(UnsupportedType, "Unsupported Type in UMFPack (only double and std::complex<double> supported)");return nullptr;}) | |
| DUNE_REGISTER_SOLVER ("loopsolver", defaultIterativeSolverCreator< Dune::LoopSolver >()) | |
| DUNE_REGISTER_SOLVER ("gradientsolver", defaultIterativeSolverCreator< Dune::GradientSolver >()) | |
| DUNE_REGISTER_SOLVER ("cgsolver", defaultIterativeSolverCreator< Dune::CGSolver >()) | |
| DUNE_REGISTER_SOLVER ("bicgstabsolver", defaultIterativeSolverCreator< Dune::BiCGSTABSolver >()) | |
| DUNE_REGISTER_SOLVER ("minressolver", defaultIterativeSolverCreator< Dune::MINRESSolver >()) | |
| DUNE_REGISTER_SOLVER ("restartedgmressolver", defaultIterativeSolverCreator< Dune::RestartedGMResSolver >()) | |
| DUNE_REGISTER_SOLVER ("restartedflexiblegmressolver", defaultIterativeSolverCreator< Dune::RestartedFlexibleGMResSolver >()) | |
| DUNE_REGISTER_SOLVER ("generalizedpcgsolver", defaultIterativeSolverCreator< Dune::GeneralizedPCGSolver >()) | |
| DUNE_REGISTER_SOLVER ("restartedfcgsolver", defaultIterativeSolverCreator< Dune::RestartedFCGSolver >()) | |
| DUNE_REGISTER_SOLVER ("completefcgsolver", defaultIterativeSolverCreator< Dune::CompleteFCGSolver >()) | |
| void | matMultTransposeMat (BCRSMatrix< FieldMatrix< T, n, k >, A > &res, const BCRSMatrix< FieldMatrix< T, n, m >, A1 > &mat, const BCRSMatrix< FieldMatrix< T, k, m >, A2 > &matt, bool=false) |
| void | matMultMat (BCRSMatrix< FieldMatrix< T, n, m >, A > &res, const BCRSMatrix< FieldMatrix< T, n, k >, A1 > &mat, const BCRSMatrix< FieldMatrix< T, k, m >, A2 > &matt, bool=false) |
| void | transposeMatMultMat (BCRSMatrix< FieldMatrix< T, n, m >, A > &res, const BCRSMatrix< FieldMatrix< T, k, n >, A1 > &mat, const BCRSMatrix< FieldMatrix< T, k, m >, A2 > &matt, bool=false) |
| auto | countNonZeros (const M &, typename std::enable_if_t< Dune::IsNumber< M >::value > *sfinae=nullptr) |
| auto | countNonZeros (const M &matrix, typename std::enable_if_t<!Dune::IsNumber< M >::value > *sfinae=nullptr) |
| std::ostream & | operator<< (std::ostream &s, const MultiTypeBlockVector< Args... > &v) |
| DUNE_REGISTER_PRECONDITIONER ("ssor", defaultPreconditionerBlockLevelCreator< Dune::SeqSSOR >()) | |
| DUNE_REGISTER_PRECONDITIONER ("sor", defaultPreconditionerBlockLevelCreator< Dune::SeqSOR >()) | |
| DUNE_REGISTER_PRECONDITIONER ("gs", defaultPreconditionerBlockLevelCreator< Dune::SeqGS >()) | |
| DUNE_REGISTER_PRECONDITIONER ("jac", defaultPreconditionerBlockLevelCreator< Dune::SeqJac >()) | |
| DUNE_REGISTER_PRECONDITIONER ("dilu", defaultPreconditionerBlockLevelCreator< Dune::SeqDILU >()) | |
| DUNE_REGISTER_PRECONDITIONER ("ilu", defaultPreconditionerBlockLevelCreator< Dune::SeqILU >()) | |
| DUNE_REGISTER_PRECONDITIONER ("richardson",[](auto opTraits, const auto &, const ParameterTree &config){ using OpTraits=std::decay_t< decltype(opTraits)>;using D=typename OpTraits::domain_type;using R=typename OpTraits::range_type;return std::make_shared< Richardson< D, R > >(config);}) | |
| DUNE_REGISTER_PRECONDITIONER ("ildl", defaultPreconditionerCreator< Dune::SeqILDL >()) | |
| std::ostream & | operator<< (std::ostream &s, const MultiTypeBlockMatrix< T1, Args... > &m) |
| void | bltsolve (const M &A, X &v, const Y &d) |
| void | bltsolve (const M &A, X &v, const Y &d, const K &w) |
| void | ubltsolve (const M &A, X &v, const Y &d) |
| void | ubltsolve (const M &A, X &v, const Y &d, const K &w) |
| void | butsolve (const M &A, X &v, const Y &d) |
| void | butsolve (const M &A, X &v, const Y &d, const K &w) |
| void | ubutsolve (const M &A, X &v, const Y &d) |
| void | ubutsolve (const M &A, X &v, const Y &d, const K &w) |
| void | bltsolve (const M &A, X &v, const Y &d, BL< l >) |
| void | bltsolve (const M &A, X &v, const Y &d, const K &w, BL< l >) |
| void | ubltsolve (const M &A, X &v, const Y &d, BL< l >) |
| void | ubltsolve (const M &A, X &v, const Y &d, const K &w, BL< l >) |
| void | butsolve (const M &A, X &v, const Y &d, BL< l >) |
| void | butsolve (const M &A, X &v, const Y &d, const K &w, BL< l >) |
| void | ubutsolve (const M &A, X &v, const Y &d, BL< l >) |
| void | ubutsolve (const M &A, X &v, const Y &d, const K &w, BL< l >) |
| void | bdsolve (const M &A, X &v, const Y &d) |
| void | bdsolve (const M &A, X &v, const Y &d, const K &w) |
| void | bdsolve (const M &A, X &v, const Y &d, BL< l >) |
| void | bdsolve (const M &A, X &v, const Y &d, const K &w, BL< l >) |
| void | dbgs (const M &A, X &x, const Y &b, const K &w) |
| void | dbgs (const M &A, X &x, const Y &b, const K &w, BL< l >) |
| void | bsorf (const M &A, X &x, const Y &b, const K &w) |
| void | bsorf (const M &A, X &x, const Y &b, const K &w, BL< l >) |
| void | bsorb (const M &A, X &x, const Y &b, const K &w) |
| void | bsorb (const M &A, X &x, const Y &b, const K &w, BL< l >) |
| void | dbjac (const M &A, X &x, const Y &b, const K &w) |
| void | dbjac (const M &A, X &x, const Y &b, const K &w, BL< l >) |
| void | recursive_printvector (std::ostream &s, const V &v, std::string rowtext, int &counter, int columns, int width) |
| void | printvector (std::ostream &s, const V &v, std::string title, std::string rowtext, int columns=1, int width=10, int precision=2) |
| void | fill_row (std::ostream &s, int m, int width, int precision) |
| void | print_row (std::ostream &s, const K &value, typename FieldMatrix< K, 1, 1 >::size_type I, typename FieldMatrix< K, 1, 1 >::size_type J, typename FieldMatrix< K, 1, 1 >::size_type therow, int width, int precision) |
| void | print_row (std::ostream &s, const M &A, typename M::size_type I, typename M::size_type J, typename M::size_type therow, int width, int precision) |
| void | printmatrix (std::ostream &s, const M &A, std::string title, std::string rowtext, int width=10, int precision=2) |
| void | printSparseMatrix (std::ostream &s, const BCRSMatrix< InnerMatrixType, A > &mat, std::string title, std::string rowtext, int width=3, int precision=2) |
| void | writeMatrixToMatlabHelper (const FieldType &value, int rowOffset, int colOffset, std::ostream &s) |
| void | writeMatrixToMatlabHelper (const MatrixType &matrix, int externalRowOffset, int externalColOffset, std::ostream &s) |
| void | writeMatrixToMatlab (const MatrixType &matrix, const std::string &filename, int outputPrecision=18) |
| void | writeVectorToMatlabHelper (const V &v, std::ostream &stream) |
| void | writeVectorToMatlab (const VectorType &vector, const std::string &filename, int outputPrecision=18) |
| void | writeSVGMatrix (std::ostream &out, const Mat &mat, SVGOptions opts={}) |
| void | mm_read_header (std::size_t &rows, std::size_t &cols, MatrixMarketImpl::MMHeader &header, std::istream &istr, bool isVector) |
| void | mm_read_vector_entries (Dune::BlockVector< T, A > &vector, std::size_t size, std::istream &istr, size_t lane) |
| void | mm_read_vector_entries (Dune::BlockVector< Dune::FieldVector< T, entries >, A > &vector, std::size_t size, std::istream &istr, size_t lane) |
| void | readMatrixMarket (Dune::BlockVector< T, A > &vector, std::istream &istr) |
| void | readMatrixMarket (Dune::BCRSMatrix< T, A > &matrix, std::istream &istr) |
| void | mm_print_entry (const B &entry, std::size_t rowidx, std::size_t colidx, std::ostream &ostr) |
| void | mm_print_vector_entry (const V &entry, std::ostream &ostr, const std::integral_constant< int, 1 > &, size_t lane) |
| void | mm_print_vector_entry (const V &vector, std::ostream &ostr, const std::integral_constant< int, 0 > &, size_t lane) |
| std::size_t | countEntries (const BlockVector< T, A > &vector) |
| std::size_t | countEntries (const BlockVector< FieldVector< T, i >, A > &vector) |
| void | writeMatrixMarket (const V &vector, std::ostream &ostr, const std::integral_constant< int, 0 > &) |
| void | writeMatrixMarket (const M &matrix, std::ostream &ostr, const std::integral_constant< int, 1 > &) |
| void | writeMatrixMarket (const M &matrix, std::ostream &ostr) |
| void | storeMatrixMarket (const M &matrix, std::string filename, int prec=default_precision) |
| void | storeMatrixMarket (const M &matrix, std::string filename, const OwnerOverlapCopyCommunication< G, L > &comm, bool storeIndices=true, int prec=default_precision) |
| void | loadMatrixMarket (M &matrix, const std::string &filename, OwnerOverlapCopyCommunication< G, L > &comm, bool readIndices=true) |
| void | loadMatrixMarket (M &matrix, const std::string &filename) |
| std::shared_ptr< InverseOperator< typename Operator::domain_type, typename Operator::range_type > > | getSolverFromFactory (std::shared_ptr< Operator > op, const ParameterTree &config, std::shared_ptr< Preconditioner< typename Operator::domain_type, typename Operator::range_type > > prec=nullptr) |
| std::shared_ptr< Preconditioner< typename Operator::domain_type, typename Operator::range_type > > | getPreconditionerFromFactory (std::shared_ptr< Operator > op, const ParameterTree &config) |
| auto | defaultPreconditionerBlockLevelCreator () |
| auto | defaultPreconditionerCreator () |
| auto | defaultIterativeSolverCreator () |
Detailed Description
For backward compatibility – Do not use this!
- Todo:
update quadrature order to work with lfsv != lfsu
update alpha_* to work with lfsv != lfsu (./)
update jacobian_* to work with lfsv != lfsu
update caches to work with lfsv != lfsu
Legal Statements / Impressum | Hosted by TU Dresden & Uni Heidelberg | Generated by
1.9.8