dune-istl 3.0-git
|
#include <dune/istl/bvector.hh>
Public Types | |
enum | { blocklevel = B::blocklevel+1 } |
increment block level counter More... | |
typedef B::field_type | field_type |
export the type representing the field | |
typedef B | block_type |
export the type representing the components | |
typedef A | allocator_type |
export the allocator type | |
typedef A::size_type | size_type |
The type for the index access. | |
typedef compressed_block_vector_unmanaged< B, A >::Iterator | Iterator |
make iterators available as types | |
typedef compressed_block_vector_unmanaged< B, A >::ConstIterator | ConstIterator |
make iterators available as types | |
typedef B | member_type |
export the type representing the components | |
typedef RealIterator< B > | iterator |
The iterator type. | |
typedef RealIterator< const B > | const_iterator |
const_iterator class for sequential access | |
Public Member Functions | |
CompressedBlockVectorWindow () | |
makes empty array | |
CompressedBlockVectorWindow (B *_p, size_type *_j, size_type _n) | |
make array from given pointers and size | |
CompressedBlockVectorWindow (const CompressedBlockVectorWindow &a) | |
copy constructor, this has reference semantics! | |
CompressedBlockVectorWindow (const compressed_block_vector_unmanaged< B, A > &_a) | |
construct from base class object with reference semantics! | |
CompressedBlockVectorWindow & | operator= (const CompressedBlockVectorWindow &a) |
assignment | |
CompressedBlockVectorWindow & | operator= (const compressed_block_vector_unmanaged< B, A > &a) |
assign from base class object | |
CompressedBlockVectorWindow & | operator= (const field_type &k) |
assign from scalar | |
void | set (size_type _n, B *_p, size_type *_j) |
set size and pointer | |
void | setsize (size_type _n) |
set size only | |
void | setptr (B *_p) |
set pointer only | |
void | setindexptr (size_type *_j) |
set pointer only | |
B * | getptr () |
get pointer | |
size_type * | getindexptr () |
get pointer | |
const B * | getptr () const |
get pointer | |
const size_type * | getindexptr () const |
get pointer | |
size_type | getsize () const |
get size | |
template<class V > | |
compressed_block_vector_unmanaged & | operator+= (const V &y) |
vector space addition | |
template<class V > | |
compressed_block_vector_unmanaged & | operator-= (const V &y) |
vector space subtraction | |
template<class V > | |
compressed_block_vector_unmanaged & | axpy (const field_type &a, const V &y) |
vector space axpy operation | |
compressed_block_vector_unmanaged & | operator*= (const field_type &k) |
vector space multiplication with scalar | |
compressed_block_vector_unmanaged & | operator/= (const field_type &k) |
vector space division by scalar | |
field_type | operator* (const compressed_block_vector_unmanaged &y) const |
scalar product | |
FieldTraits< field_type >::real_type | one_norm () const |
one norm (sum over absolute values of entries) | |
FieldTraits< field_type >::real_type | one_norm_real () const |
simplified one norm (uses Manhattan norm for complex values) | |
FieldTraits< field_type >::real_type | two_norm () const |
two norm sqrt(sum over squared values of entries) | |
FieldTraits< field_type >::real_type | two_norm2 () const |
Square of the two-norm (the sum over the squared values of the entries) | |
template<typename ft = field_type, typename std::enable_if<!has_nan< ft >::value, int >::type = 0> | |
FieldTraits< ft >::real_type | infinity_norm () const |
infinity norm (maximum of absolute values of entries) | |
template<typename ft = field_type, typename std::enable_if< has_nan< ft >::value, int >::type = 0> | |
FieldTraits< ft >::real_type | infinity_norm () const |
infinity norm (maximum of absolute values of entries) | |
template<typename ft = field_type, typename std::enable_if<!has_nan< ft >::value, int >::type = 0> | |
FieldTraits< ft >::real_type | infinity_norm_real () const |
simplified infinity norm (uses Manhattan norm for complex values) | |
template<typename ft = field_type, typename std::enable_if< has_nan< ft >::value, int >::type = 0> | |
FieldTraits< ft >::real_type | infinity_norm_real () const |
simplified infinity norm (uses Manhattan norm for complex values) | |
size_type | N () const |
number of blocks in the vector (are of size 1 here) | |
size_type | dim () const |
dimension of the vector space | |
B & | operator[] (size_type i) |
random access to blocks, assumes ascending ordering | |
const B & | operator[] (size_type i) const |
same for read only access, assumes ascending ordering | |
iterator | begin () |
begin iterator | |
const_iterator | begin () const |
begin const_iterator | |
iterator | end () |
end iterator | |
const_iterator | end () const |
end const_iterator | |
iterator | beforeEnd () |
const_iterator | beforeEnd () const |
iterator | beforeBegin () |
const_iterator | beforeBegin () const |
iterator | find (size_type i) |
random access returning iterator (end if not contained) | |
const_iterator | find (size_type i) const |
random access returning iterator (end if not contained) | |
size_type | size () const |
number of blocks in the array (are of size 1 here) | |
Protected Member Functions | |
template<class V > | |
bool | includesindexset (const V &y) |
return true if index sets coincide | |
Protected Attributes | |
size_type | n |
B * | p |
size_type * | j |
CompressedBlockVectorWindow adds window manipulation functions to the compressed_block_vector_unmanaged template.
This class has no memory management. It assumes that the storage for the entries of the vector and its index set is maintained outside of this class.
But you can copy objects of this class and of the base class with reference semantics.
Assignment copies the data, if the format is incopmpatible with
the argument an exception is thrown in debug mode.
Error checking: no error checking is provided normally. Setting the compile time switch DUNE_ISTL_WITH_CHECKING enables error checking.
typedef A Dune::CompressedBlockVectorWindow< B, A >::allocator_type |
export the allocator type
typedef B Dune::CompressedBlockVectorWindow< B, A >::block_type |
export the type representing the components
|
inherited |
const_iterator class for sequential access
typedef compressed_block_vector_unmanaged<B,A>::ConstIterator Dune::CompressedBlockVectorWindow< B, A >::ConstIterator |
make iterators available as types
typedef B::field_type Dune::CompressedBlockVectorWindow< B, A >::field_type |
export the type representing the field
|
inherited |
The iterator type.
typedef compressed_block_vector_unmanaged<B,A>::Iterator Dune::CompressedBlockVectorWindow< B, A >::Iterator |
make iterators available as types
|
inherited |
export the type representing the components
typedef A::size_type Dune::CompressedBlockVectorWindow< B, A >::size_type |
The type for the index access.
|
inline |
makes empty array
|
inline |
make array from given pointers and size
|
inline |
copy constructor, this has reference semantics!
|
inline |
construct from base class object with reference semantics!
|
inlineinherited |
vector space axpy operation
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
begin iterator
|
inlineinherited |
begin const_iterator
|
inlineinherited |
dimension of the vector space
|
inlineinherited |
end iterator
|
inlineinherited |
end const_iterator
|
inlineinherited |
random access returning iterator (end if not contained)
|
inlineinherited |
random access returning iterator (end if not contained)
|
inline |
get pointer
|
inline |
get pointer
|
inline |
get pointer
|
inline |
get pointer
|
inline |
get size
|
inlineprotectedinherited |
return true if index sets coincide
|
inlineinherited |
infinity norm (maximum of absolute values of entries)
|
inlineinherited |
infinity norm (maximum of absolute values of entries)
|
inlineinherited |
simplified infinity norm (uses Manhattan norm for complex values)
|
inlineinherited |
simplified infinity norm (uses Manhattan norm for complex values)
|
inlineinherited |
number of blocks in the vector (are of size 1 here)
|
inlineinherited |
one norm (sum over absolute values of entries)
|
inlineinherited |
simplified one norm (uses Manhattan norm for complex values)
|
inlineinherited |
scalar product
|
inlineinherited |
vector space multiplication with scalar
|
inlineinherited |
vector space addition
|
inlineinherited |
vector space subtraction
|
inlineinherited |
vector space division by scalar
|
inline |
assign from base class object
|
inline |
assignment
|
inline |
assign from scalar
|
inlineinherited |
random access to blocks, assumes ascending ordering
|
inlineinherited |
same for read only access, assumes ascending ordering
|
inline |
set size and pointer
|
inline |
set pointer only
|
inline |
set pointer only
|
inline |
set size only
|
inlineinherited |
number of blocks in the array (are of size 1 here)
|
inlineinherited |
two norm sqrt(sum over squared values of entries)
|
inlineinherited |
Square of the two-norm (the sum over the squared values of the entries)
|
protectedinherited |
|
protectedinherited |
|
protectedinherited |