Dune::CompressedBlockVectorWindow< B, A > Class Template Reference

#include <bvector.hh>

Inheritance diagram for Dune::CompressedBlockVectorWindow< B, A >:

Dune::compressed_block_vector_unmanaged< B, A > Dune::compressed_base_array_unmanaged< B, A >

List of all members.


Detailed Description

template<class B, class A = ISTLAllocator>
class Dune::CompressedBlockVectorWindow< B, A >

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.

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!
CompressedBlockVectorWindowoperator= (const CompressedBlockVectorWindow &a)
 assignment
CompressedBlockVectorWindowoperator= (const compressed_block_vector_unmanaged< B, A > &a)
 assign from base class object
CompressedBlockVectorWindowoperator= (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_typegetindexptr ()
 get pointer
const B * getptr () const
 get pointer
const size_typegetindexptr () const
 get pointer
size_type getsize () const
 get size
template<class V>
compressed_block_vector_unmanagedoperator+= (const V &y)
 vector space addition
template<class V>
compressed_block_vector_unmanagedoperator-= (const V &y)
 vector space subtraction
template<class V>
compressed_block_vector_unmanagedaxpy (const field_type &a, const V &y)
 vector space axpy operation
compressed_block_vector_unmanagedoperator*= (const field_type &k)
 vector space multiplication with scalar
compressed_block_vector_unmanagedoperator/= (const field_type &k)
 vector space division by scalar
field_type operator* (const compressed_block_vector_unmanaged &y) const
 scalar product
double one_norm () const
 one norm (sum over absolute values of entries)
double one_norm_real () const
 simplified one norm (uses Manhattan norm for complex values)
double two_norm () const
 two norm sqrt(sum over squared values of entries)
double two_norm2 () const
 sqare of two norm (sum over squared values of entries), need for block recursion
double infinity_norm () const
 infinity norm (maximum of absolute values of entries)
double 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 rbegin ()
 begin reverse iterator
const_iterator rbegin () const
 begin reverse const_iterator
iterator rend ()
 end reverse iterator
const_iterator rend () const
 end reverse const_iterator
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


Member Enumeration Documentation

template<class B, class A = ISTLAllocator>
anonymous enum

increment block level counter

Enumerator:
blocklevel  The number of block level this vector contains.


The documentation for this class was generated from the following file:

Generated on Tue Jul 28 22:29:18 2009 for dune-istl by  doxygen 1.5.6