dune-common 2.9.0
|
foundation classes More...
Modules | |
Allocators | |
Implementations of the STL allocator concept. | |
Utilities | |
Collection of helper classes, type traits, etc. | |
Numbers | |
Class implementing different number representations and helper functions. | |
Debug output | |
Dense Matrix and Vector Template Library | |
Type traits to retrieve the field and the real type of classes. | |
Exception handling | |
Iterator facades | |
Iterator facades for writing stl conformant iterators. | |
Parallel Communication | |
Abstractions for parallel computing. | |
Vectorization | |
Abstractions for using vectorization libraries. | |
Files | |
file | function.hh |
Simple base class templates for functions. | |
file | indent.hh |
Utility class for handling nested indentation in output. | |
file | ios_state.hh |
Utility class for storing and resetting stream attributes. | |
file | sllist.hh |
Implements a singly linked list together with the necessary iterators. | |
file | timer.hh |
A simple timing class. | |
Namespaces | |
namespace | Dune::Indices |
Namespace with predefined compile time indices for the range [0,19]. | |
Classes | |
class | Dune::ArrayList< T, N, A > |
A dynamically growing random access list. More... | |
class | Dune::ArrayListIterator< T, N, A > |
A random access iterator for the Dune::ArrayList class. More... | |
class | Dune::ConstArrayListIterator< T, N, A > |
A constant random access iterator for the Dune::ArrayList class. More... | |
struct | Dune::ImplementationDefined |
Dummy struct used for documentation purposes. More... | |
struct | Dune::IsVector< T, class > |
struct | Dune::IsVector< T, std::void_t< typename T::field_type > > |
class | Dune::EmptySet< TA > |
An empty set. More... | |
class | Dune::AllSet< TA > |
A set containing everything. More... | |
class | Dune::EnumItem< TA, item > |
A set consisting only of one item. More... | |
class | Dune::EnumRange< TA, from, end > |
A set representing a range including the borders. More... | |
class | Dune::NegateSet< S > |
The negation of a set. An item is contained in the set if and only if it is not contained in the negated set. More... | |
class | Dune::Combine< TI1, TI2, TA > |
A set combining two other sets. More... | |
class | Dune::Function< Domain, Range > |
Base class template for function classes. More... | |
class | Dune::VirtualFunction< DomainType, RangeType > |
Virtual base class template for function classes. More... | |
class | Dune::Indent |
Utility class for handling nested indentation in output. More... | |
class | Dune::ios_base_all_saver |
Utility class for storing and resetting stream attributes. More... | |
class | Dune::ParameterTree |
Hierarchical structure of string parameters. More... | |
class | Dune::ParameterTreeParser |
Parsers to set up a ParameterTree from various input sources. More... | |
struct | Dune::StaticPower< b, p > |
Calculates b^p at compile time. More... | |
struct | Dune::Power< p > |
Compute power for a run-time base and a compile-time integer exponent. More... | |
struct | Dune::PromotionTraits< T1, T2 > |
Compute type of the result of an arithmetic operation involving two different number types. More... | |
struct | Dune::PromotionTraits< T1, T1 > |
class | Dune::SLListIterator< T, A > |
A mutable iterator for the SLList. More... | |
class | Dune::SLListConstIterator< T, A > |
A constant iterator for the SLList. More... | |
class | Dune::SLListModifyIterator< T, A > |
A mutable iterator for the SLList. More... | |
class | Dune::SLList< T, A > |
A single linked list. More... | |
class | Dune::Timer |
A simple stop watch. More... | |
Macros | |
#define | DUNE_ASSERT_BOUNDS(cond) |
If DUNE_CHECK_BOUNDS is defined: check if condition cond holds; otherwise, do nothing. | |
Typedefs | |
template<std::size_t i> | |
using | Dune::index_constant = std::integral_constant< std::size_t, i > |
An index constant with value i. | |
typedef std::ios_base | Dune::ios_base_all_saver::state_type |
Export type of object we save the state for. | |
typedef A::size_type | Dune::SLList< T, A >::size_type |
The size type. | |
typedef T | Dune::SLList< T, A >::MemberType |
The type we store. | |
using | Dune::SLList< T, A >::Allocator = typename std::allocator_traits< A >::template rebind_alloc< Element > |
The allocator to use. | |
typedef SLListIterator< T, A > | Dune::SLList< T, A >::iterator |
The mutable iterator of the list. | |
typedef SLListConstIterator< T, A > | Dune::SLList< T, A >::const_iterator |
The constant iterator of the list. | |
typedef SLListModifyIterator< T, A > | Dune::SLList< T, A >::ModifyIterator |
The type of the iterator capable of deletion and insertion. | |
Functions | |
template<class A , class B > | |
auto | Dune::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 |
computes the dot product for fundamental data types according to Petsc's VectDot function: dot(a,b) := std::conj(a)*b | |
template<typename TA , int i> | |
std::ostream & | Dune::operator<< (std::ostream &os, const EnumItem< TA, i > &) |
template<typename TA , int from, int to> | |
std::ostream & | Dune::operator<< (std::ostream &os, const EnumRange< TA, from, to > &) |
template<class TI1 , class TI2 > | |
Combine< TI1, TI2, typename TI1::Type > | Dune::combine (const TI1 &set1, const TI2 &set2) |
template<class TI1 , class TI2 , class T > | |
std::ostream & | Dune::operator<< (std::ostream &os, const Combine< TI1, TI2, T > &) |
template<std::size_t n, class T > | |
constexpr std::array< T, n > | Dune::filledArray (const T &t) |
Return an array filled with the provided value. | |
template<typename Domain , typename Range , typename F > | |
Impl::LambdaVirtualFunction< Domain, Range, std::decay_t< F > > | Dune::makeVirtualFunction (F &&f) |
make VirtualFunction out of a function object | |
Dune::Indent::Indent (const std::string &basic_indent_=" ", unsigned level_=0) | |
setup without parent | |
Dune::Indent::Indent (unsigned level_) | |
setup without parent and basic_indentation of two spaces | |
Dune::Indent::Indent (const Indent *parent_, const std::string &basic_indent_=" ", unsigned level_=1) | |
setup with parent | |
Dune::Indent::Indent (const Indent *parent_, unsigned level_) | |
setup with parent | |
Indent | Dune::Indent::operator+ (const std::string &newindent) const |
create new indentation object with this one as parent | |
Indent | Dune::Indent::operator+ (unsigned morelevel) const |
create a copy of this indentation object with raised level | |
Indent & | Dune::Indent::operator++ () |
raise indentation level | |
Indent & | Dune::Indent::operator-- () |
lower indentation level | |
std::ostream & | Dune::operator<< (std::ostream &s, const Indent &indent) |
write indentation to a stream | |
template<class F , class I , I... i> | |
decltype(auto) constexpr | Dune::unpackIntegerSequence (F &&f, std::integer_sequence< I, i... > sequence) |
Unpack an std::integer_sequence<I,i...> to std::integral_constant<I,i>... | |
Dune::ios_base_all_saver::ios_base_all_saver (state_type &ios_) | |
Constructor that stores the currently used flags. | |
Dune::ios_base_all_saver::~ios_base_all_saver () | |
Destructor that restores the flags stored by the constructor. | |
void | Dune::ios_base_all_saver::restore () |
Restore flags now. | |
template<typename T > | |
static constexpr auto | Dune::Power< p >::eval (const T &a) |
Dune::SLList< T, A >::SLList () | |
Constructor. | |
template<typename T1 , typename A1 > | |
Dune::SLList< T, A >::SLList (const SLList< T1, A1 > &other) | |
Copy constructor with type conversion. | |
Dune::SLList< T, A >::SLList (const SLList< T, A > &other) | |
Copy constructor. | |
Dune::SLList< T, A >::~SLList () | |
Destructor. | |
SLList< T, A > & | Dune::SLList< T, A >::operator= (const SLList< T, A > &other) |
Assignment operator. | |
void | Dune::SLList< T, A >::push_back (const MemberType &item) |
Add a new entry to the end of the list. | |
void | Dune::SLList< T, A >::push_front (const MemberType &item) |
Add a new entry to the beginning of the list. | |
void | Dune::SLList< T, A >::pop_front () |
Remove the first item in the list. | |
void | Dune::SLList< T, A >::clear () |
Remove all elements from the list. | |
iterator | Dune::SLList< T, A >::begin () |
Get an iterator pointing to the first element in the list. | |
const_iterator | Dune::SLList< T, A >::begin () const |
Get an iterator pointing to the first element in the list. | |
ModifyIterator | Dune::SLList< T, A >::beginModify () |
Get an iterator capable of deleting and inserting elements. | |
ModifyIterator | Dune::SLList< T, A >::endModify () |
Get an iterator capable of deleting and inserting elements. | |
iterator | Dune::SLList< T, A >::end () |
Get an iterator pointing to the end of the list. | |
const_iterator | Dune::SLList< T, A >::end () const |
Get an iterator pointing to the end of the list. | |
bool | Dune::SLList< T, A >::empty () const |
Check whether the list is empty. | |
int | Dune::SLList< T, A >::size () const |
Get the number of elements the list contains. | |
bool | Dune::SLList< T, A >::operator== (const SLList &sl) const |
bool | Dune::SLList< T, A >::operator!= (const SLList &sl) const |
Dune::SLList< T, A >::Element::Element (const MemberType &item, Element *next_=0) | |
Dune::SLList< T, A >::Element::Element () | |
Dune::SLList< T, A >::Element::~Element () | |
Dune::SLListIterator< T, A >::SLListIterator (typename SLList< T, A >::Element *item, SLList< T, A > *sllist) | |
Dune::SLListIterator< T, A >::SLListIterator () | |
Dune::SLListIterator< T, A >::SLListIterator (const SLListModifyIterator< T, A > &other) | |
T & | Dune::SLListIterator< T, A >::dereference () const |
Dereferencing function for the iterator facade. | |
bool | Dune::SLListIterator< T, A >::equals (const SLListConstIterator< T, A > &other) const |
Equality test for the iterator facade. | |
bool | Dune::SLListIterator< T, A >::equals (const SLListIterator< T, A > &other) const |
Equality test for the iterator facade. | |
bool | Dune::SLListIterator< T, A >::equals (const SLListModifyIterator< T, A > &other) const |
Equality test for the iterator facade. | |
void | Dune::SLListIterator< T, A >::increment () |
Increment function for the iterator facade. | |
void | Dune::SLListIterator< T, A >::insertAfter (const T &v) const |
Insert an element in the underlying list after the current position. | |
void | Dune::SLListIterator< T, A >::deleteNext () const |
Delete the entry after the current position. | |
Dune::SLListConstIterator< T, A >::SLListConstIterator () | |
Dune::SLListConstIterator< T, A >::SLListConstIterator (typename SLList< T, A >::Element *item) | |
Dune::SLListConstIterator< T, A >::SLListConstIterator (const SLListIterator< T, A > &other) | |
Dune::SLListConstIterator< T, A >::SLListConstIterator (const SLListModifyIterator< T, A > &other) | |
const T & | Dune::SLListConstIterator< T, A >::dereference () const |
Dereferencing function for the facade. | |
bool | Dune::SLListConstIterator< T, A >::equals (const SLListConstIterator< T, A > &other) const |
Equality test for the iterator facade. | |
void | Dune::SLListConstIterator< T, A >::increment () |
Increment function for the iterator facade. | |
Dune::SLListModifyIterator< T, A >::SLListModifyIterator (SLListIterator< T, A > beforeIterator, SLListIterator< T, A > _iterator) | |
Dune::SLListModifyIterator< T, A >::SLListModifyIterator () | |
T & | Dune::SLListModifyIterator< T, A >::dereference () const |
Dereferencing function for the iterator facade. | |
bool | Dune::SLListModifyIterator< T, A >::equals (const SLListConstIterator< T, A > &other) const |
Test whether another iterator is equal. | |
bool | Dune::SLListModifyIterator< T, A >::equals (const SLListIterator< T, A > &other) const |
Test whether another iterator is equal. | |
bool | Dune::SLListModifyIterator< T, A >::equals (const SLListModifyIterator< T, A > &other) const |
Test whether another iterator is equal. | |
void | Dune::SLListModifyIterator< T, A >::increment () |
Increment function for the iterator facade. | |
void | Dune::SLListModifyIterator< T, A >::insert (const T &v) |
Insert an element at the current position. | |
void | Dune::SLListModifyIterator< T, A >::remove () |
Delete the entry at the current position. | |
template<typename T , typename A > | |
std::ostream & | Dune::operator<< (std::ostream &os, const SLList< T, A > &sllist) |
template<typename Stream , typename... Ts> | |
Stream & | Dune::operator<< (Stream &stream, const std::tuple< Ts... > &t) |
Print a std::tuple. | |
template<typename Stream , typename... Ts> | |
Stream & | Dune::operator>> (Stream &stream, std::tuple< Ts... > &t) |
Read a std::tuple. | |
template<typename Stream , typename T , std::size_t N> | |
Stream & | Dune::operator<< (Stream &stream, const std::array< T, N > &a) |
Print a std::array. | |
Dune::ArrayList< T, N, A >::ArrayList () | |
Constructs an Array list with one chunk. | |
void | Dune::ArrayList< T, N, A >::clear () |
Delete all entries from the list. | |
size_type | Dune::ArrayList< T, N, A >::size () const |
Get the number of elements in the list. | |
void | Dune::ArrayList< T, N, A >::push_back (const_reference entry) |
Append an entry to the list. | |
reference | Dune::ArrayList< T, N, A >::operator[] (size_type i) |
Get the element at specific position. | |
const_reference | Dune::ArrayList< T, N, A >::operator[] (size_type i) const |
Get the element at specific position. | |
iterator | Dune::ArrayList< T, N, A >::begin () |
Get an iterator that is positioned at the first element. | |
const_iterator | Dune::ArrayList< T, N, A >::begin () const |
Get a random access iterator that is positioned at the first element. | |
iterator | Dune::ArrayList< T, N, A >::end () |
Get a random access iterator positioned after the last element. | |
const_iterator | Dune::ArrayList< T, N, A >::end () const |
Get a random access iterator positioned after the last element. | |
void | Dune::ArrayList< T, N, A >::purge () |
Purge the list. | |
void | Dune::ArrayListIterator< T, N, A >::advance (difference_type n) |
void | Dune::ConstArrayListIterator< T, N, A >::advance (difference_type n) |
bool | Dune::ArrayListIterator< T, N, A >::equals (const ArrayListIterator< MemberType, N, A > &other) const |
Comares two iterators. | |
bool | Dune::ArrayListIterator< T, N, A >::equals (const ConstArrayListIterator< MemberType, N, A > &other) const |
Comares two iterators. | |
bool | Dune::ConstArrayListIterator< T, N, A >::equals (const ConstArrayListIterator< MemberType, N, A > &other) const |
Comares to iterators. | |
void | Dune::ArrayListIterator< T, N, A >::increment () |
Increment the iterator. | |
void | Dune::ConstArrayListIterator< T, N, A >::increment () |
Increment the iterator. | |
void | Dune::ArrayListIterator< T, N, A >::decrement () |
decrement the iterator. | |
void | Dune::ConstArrayListIterator< T, N, A >::decrement () |
decrement the iterator. | |
reference | Dune::ArrayListIterator< T, N, A >::elementAt (size_type i) const |
Get the value of the list at an arbitrary position. | |
const_reference | Dune::ConstArrayListIterator< T, N, A >::elementAt (size_type i) const |
Get the value of the list at an arbitrary position. | |
reference | Dune::ArrayListIterator< T, N, A >::dereference () const |
Access the element at the current position. | |
const_reference | Dune::ConstArrayListIterator< T, N, A >::dereference () const |
Access the element at the current position. | |
difference_type | Dune::ArrayListIterator< T, N, A >::distanceTo (const ArrayListIterator< T, N, A > &other) const |
difference_type | Dune::ConstArrayListIterator< T, N, A >::distanceTo (const ConstArrayListIterator< T, N, A > &other) const |
void | Dune::ArrayListIterator< T, N, A >::eraseToHere () |
Erase all entries before the current position and the one at the current position. | |
Dune::ConstArrayListIterator< T, N, A >::ConstArrayListIterator (const ArrayListIterator< T, N, A > &other) | |
static bool | Dune::EmptySet< TA >::contains (const Type &attribute) |
Always returns false. | |
static bool | Dune::AllSet< TA >::contains (const Type &attribute) |
Always returns true. | |
static bool | Dune::EnumItem< TA, item >::contains (const Type &attribute) |
Tests whether an item is in the set. | |
static bool | Dune::EnumRange< TA, from, end >::contains (const Type &item) |
static bool | Dune::Combine< TI1, TI2, TA >::contains (const TA &item) |
Variables | |
constexpr index_constant< 0 > | Dune::Indices::_0 = {} |
Compile time index with value 0. | |
constexpr index_constant< 1 > | Dune::Indices::_1 = {} |
Compile time index with value 1. | |
constexpr index_constant< 2 > | Dune::Indices::_2 = {} |
Compile time index with value 2. | |
constexpr index_constant< 3 > | Dune::Indices::_3 = {} |
Compile time index with value 3. | |
constexpr index_constant< 4 > | Dune::Indices::_4 = {} |
Compile time index with value 4. | |
constexpr index_constant< 5 > | Dune::Indices::_5 = {} |
Compile time index with value 5. | |
constexpr index_constant< 6 > | Dune::Indices::_6 = {} |
Compile time index with value 6. | |
constexpr index_constant< 7 > | Dune::Indices::_7 = {} |
Compile time index with value 7. | |
constexpr index_constant< 8 > | Dune::Indices::_8 = {} |
Compile time index with value 8. | |
constexpr index_constant< 9 > | Dune::Indices::_9 = {} |
Compile time index with value 9. | |
constexpr index_constant< 10 > | Dune::Indices::_10 = {} |
Compile time index with value 10. | |
constexpr index_constant< 11 > | Dune::Indices::_11 = {} |
Compile time index with value 11. | |
constexpr index_constant< 12 > | Dune::Indices::_12 = {} |
Compile time index with value 12. | |
constexpr index_constant< 13 > | Dune::Indices::_13 = {} |
Compile time index with value 13. | |
constexpr index_constant< 14 > | Dune::Indices::_14 = {} |
Compile time index with value 14. | |
constexpr index_constant< 15 > | Dune::Indices::_15 = {} |
Compile time index with value 15. | |
constexpr index_constant< 16 > | Dune::Indices::_16 = {} |
Compile time index with value 16. | |
constexpr index_constant< 17 > | Dune::Indices::_17 = {} |
Compile time index with value 17. | |
constexpr index_constant< 18 > | Dune::Indices::_18 = {} |
Compile time index with value 18. | |
constexpr index_constant< 19 > | Dune::Indices::_19 = {} |
Compile time index with value 19. | |
static constexpr int | Dune::StaticPower< b, p >::power = Dune::power(b,p) |
power stores b^p | |
Element * | Dune::SLList< T, A >::Element::next_ |
The next element in the list. | |
MemberType | Dune::SLList< T, A >::Element::item_ |
The element we hold. | |
foundation classes
#define DUNE_ASSERT_BOUNDS | ( | cond | ) |
If DUNE_CHECK_BOUNDS
is defined: check if condition cond holds; otherwise, do nothing.
Meant to be used for conditions that assure writes and reads do not occur outside of memory limits or pre-defined patterns and related conditions.
using Dune::SLList< T, A >::Allocator = typename std::allocator_traits<A>::template rebind_alloc<Element> |
The allocator to use.
typedef SLListConstIterator<T,A> Dune::SLList< T, A >::const_iterator |
The constant iterator of the list.
using Dune::index_constant = typedef std::integral_constant<std::size_t, i> |
An index constant with value i.
An index constant is a simple type alias for an integral_constant. Its main advantages are clarity (it is easier to see that code uses it as an index) and the fact that the integral type is fixed, reducing verbosity and avoiding the problem of maybe trying to overload / specialize using a different integral type.
typedef SLListIterator<T,A> Dune::SLList< T, A >::iterator |
The mutable iterator of the list.
typedef T Dune::SLList< T, A >::MemberType |
The type we store.
typedef SLListModifyIterator<T,A> Dune::SLList< T, A >::ModifyIterator |
The type of the iterator capable of deletion and insertion.
typedef A::size_type Dune::SLList< T, A >::size_type |
The size type.
typedef std::ios_base Dune::ios_base_all_saver::state_type |
Export type of object we save the state for.
|
inline |
|
inline |
Dune::ArrayList< T, N, A >::ArrayList | ( | ) |
Constructs an Array list with one chunk.
ArrayListIterator< T, N, A > Dune::ArrayList< T, N, A >::begin | ( | ) |
Get an iterator that is positioned at the first element.
|
inline |
Get an iterator pointing to the first element in the list.
ConstArrayListIterator< T, N, A > Dune::ArrayList< T, N, A >::begin | ( | ) | const |
Get a random access iterator that is positioned at the first element.
|
inline |
Get an iterator pointing to the first element in the list.
|
inline |
Get an iterator capable of deleting and inserting elements.
|
inline |
Delete all entries from the list.
|
inline |
Remove all elements from the list.
|
inline |
|
inline |
|
inlinestatic |
|
inlinestatic |
Always returns false.
|
inlinestatic |
Always returns true.
|
inlinestatic |
Tests whether an item is in the set.
|
inlinestatic |
|
inline |
decrement the iterator.
|
inline |
decrement the iterator.
|
inline |
Delete the entry after the current position.
|
inline |
Access the element at the current position.
|
inline |
Access the element at the current position.
|
inline |
Dereferencing function for the iterator facade.
|
inline |
Dereferencing function for the facade.
|
inline |
Dereferencing function for the iterator facade.
|
inline |
|
inline |
auto Dune::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 |
computes the dot product for fundamental data types according to Petsc's VectDot function: dot(a,b) := std::conj(a)*b
computes the dot product for various dune vector types according to Petsc's VectDot function: dot(a,b) := std::conj(a)*b
a | |
b |
Specialization for real first arguments which replaces conj(a) by a.
a | |
b |
Specialization for real first arguments which replaces conj(a) by a.
a | |
b |
Dune::SLList< T, A >::Element::Element | ( | ) |
Dune::SLList< T, A >::Element::Element | ( | const MemberType & | item, |
Element * | next_ = 0 |
||
) |
|
inline |
Get the value of the list at an arbitrary position.
|
inline |
Get the value of the list at an arbitrary position.
|
inline |
Check whether the list is empty.
ArrayListIterator< T, N, A > Dune::ArrayList< T, N, A >::end | ( | ) |
Get a random access iterator positioned after the last element.
|
inline |
Get an iterator pointing to the end of the list.
ConstArrayListIterator< T, N, A > Dune::ArrayList< T, N, A >::end | ( | ) | const |
Get a random access iterator positioned after the last element.
|
inline |
Get an iterator pointing to the end of the list.
|
inline |
Get an iterator capable of deleting and inserting elements.
|
inline |
Comares two iterators.
|
inline |
Comares two iterators.
|
inline |
Comares to iterators.
|
inline |
Equality test for the iterator facade.
other | The other iterator to check. |
|
inline |
Equality test for the iterator facade.
other | The other iterator to check. |
|
inline |
Test whether another iterator is equal.
|
inline |
Equality test for the iterator facade.
other | The other iterator to check. |
|
inline |
Test whether another iterator is equal.
|
inline |
Equality test for the iterator facade.
other | The other iterator to check. |
|
inline |
Test whether another iterator is equal.
|
inline |
Erase all entries before the current position and the one at the current position.
Afterwards the iterator will be positioned at the next unerased entry or the end if the list is empty. This does not invalidate any iterators positioned after the current position but those positioned at previous ones.
|
inlinestaticconstexpr |
|
constexpr |
Return an array filled with the provided value.
constexpr
only in C++17, or, more precisely, when std::array::begin()
and std::array::end()
are constexpr
.n | Size of the returned array. |
T | Value type of the returned array. This is usually deduced from t . |
|
inline |
Increment the iterator.
|
inline |
Increment the iterator.
|
inline |
Increment function for the iterator facade.
|
inline |
Increment function for the iterator facade.
|
inline |
Increment function for the iterator facade.
|
inline |
setup with parent
|
inline |
setup with parent
|
inline |
setup without parent
|
inline |
setup without parent and basic_indentation of two spaces
|
inline |
Insert an element at the current position.
Starting from the element at the current position all elements will be shifted by one position to the back. The iterator will point to the same element as before after the insertion, i.e the number of increments to reach the same position from a begin iterator increases by one. This means the inserted element is the one before the one the iterator points to.
v | The value to insert. |
|
inline |
Insert an element in the underlying list after the current position.
v | The value to insert. |
Dune::ios_base_all_saver::ios_base_all_saver | ( | state_type & | ios_ | ) |
Constructor that stores the currently used flags.
ios_ | The ios_base object whose flags are to be saved and restored. Any stream object should work here. |
Impl::LambdaVirtualFunction< Domain, Range, std::decay_t< F > > Dune::makeVirtualFunction | ( | F && | f | ) |
make VirtualFunction
out of a function object
This helper function wraps a function object into a class implementing the VirtualFunction
interface. It allows for easy use of lambda expressions in places that expect a VirtualFunction
:
VirtualFunction<Domain, Range>
Domain | domain of the function |
Range | range of the function |
bool Dune::SLList< T, A >::operator!= | ( | const SLList< T, A > & | sl | ) | const |
|
inline |
create new indentation object with this one as parent
|
inline |
create a copy of this indentation object with raised level
|
inline |
raise indentation level
|
inline |
lower indentation level
|
inline |
|
inline |
|
inline |
std::ostream & Dune::operator<< | ( | std::ostream & | os, |
const SLList< T, A > & | sllist | ||
) |
|
inline |
write indentation to a stream
|
inline |
Print a std::array.
|
inline |
Print a std::tuple.
SLList< T, A > & Dune::SLList< T, A >::operator= | ( | const SLList< T, A > & | other | ) |
Assignment operator.
bool Dune::SLList< T, A >::operator== | ( | const SLList< T, A > & | sl | ) | const |
|
inline |
Read a std::tuple.
|
inline |
Get the element at specific position.
i | The index of the position. |
|
inline |
Get the element at specific position.
i | The index of the position. |
|
inline |
Remove the first item in the list.
|
inline |
Purge the list.
If there are empty chunks at the front all nonempty chunks will be moved towards the front and the capacity increases.
|
inline |
Add a new entry to the end of the list.
item | The item to add. |
|
inline |
Append an entry to the list.
entry | The new entry. |
|
inline |
Add a new entry to the beginning of the list.
item | The item to add. |
|
inline |
Delete the entry at the current position.
The iterator will be positioned at the next position after the deletion
void Dune::ios_base_all_saver::restore | ( | ) |
Restore flags now.
The flags will also be restored at destruction time even if this method was used.
|
inline |
Get the number of elements in the list.
|
inline |
Get the number of elements the list contains.
Dune::SLList< T, A >::SLList | ( | ) |
Constructor.
Dune::SLList< T, A >::SLList | ( | const SLList< T, A > & | other | ) |
Copy constructor.
Dune::SLList< T, A >::SLList | ( | const SLList< T1, A1 > & | other | ) |
Copy constructor with type conversion.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
constexpr |
Unpack an std::integer_sequence<I,i...> to std::integral_constant<I,i>...
This forward all entries of the given std::integer_sequence as individual std::integral_constant arguments to the given callback.
f | Callback which has to accept unpacked values |
sequence | Packed std::integer_sequence of values |
Dune::SLList< T, A >::Element::~Element | ( | ) |
Dune::ios_base_all_saver::~ios_base_all_saver | ( | ) |
Destructor that restores the flags stored by the constructor.
Dune::SLList< T, A >::~SLList | ( | ) |
Destructor.
Deallocates all elements in the list.
|
constexpr |
Compile time index with value 0.
|
constexpr |
Compile time index with value 1.
|
constexpr |
Compile time index with value 10.
|
constexpr |
Compile time index with value 11.
|
constexpr |
Compile time index with value 12.
|
constexpr |
Compile time index with value 13.
|
constexpr |
Compile time index with value 14.
|
constexpr |
Compile time index with value 15.
|
constexpr |
Compile time index with value 16.
|
constexpr |
Compile time index with value 17.
|
constexpr |
Compile time index with value 18.
|
constexpr |
Compile time index with value 19.
|
constexpr |
Compile time index with value 2.
|
constexpr |
Compile time index with value 3.
|
constexpr |
Compile time index with value 4.
|
constexpr |
Compile time index with value 5.
|
constexpr |
Compile time index with value 6.
|
constexpr |
Compile time index with value 7.
|
constexpr |
Compile time index with value 8.
|
constexpr |
Compile time index with value 9.
MemberType Dune::SLList< T, A >::Element::item_ |
The element we hold.
Element* Dune::SLList< T, A >::Element::next_ |
The next element in the list.
|
staticconstexpr |
power stores b^p