class TVector

class TVector: public MatrixStructure

Structure TVector

Inheritance:

Public
SymmetricSkylineIterator Explanation
Constructor(s), Destructors(s)
operations on profil
Access to element
TVectorIterator iterator_t: required typedef iterator_t
public members

Protected
protected constructors
protected members

Private Fields
size_t my_data_length: number of elements asked by user
Bool my_profil_is_set: is profil set ?
Bool my_matrix_is_factored: is matrix factored ?
VectorUInt my_diag: diagonal index
VectorUInt my_haut: haut index
Index my_n: number of rows

Private Methods
Index map( Index const& i, Index const& j ) const: map(i,j) find the position in the data array
Index map_fast( Index const& i, Index const& j ) const: same as map(i,j) but without any control

Documentation

Structure TVector

SymmetricSkylineIterator Explanation

This sparse storage is based on the following idea:

Constructor(s), Destructors(s) SymmetricSkyline() default constructor explicit SymmetricSkyline( Index const& n ) build a matrix SymmetricSkyline( Index const& n, Index const& p ) build a matrix, with . SymmetricSkyline( Index const& n, Index const& p, UInt const& nb_store ) build a by matrix and store at least nb_store datas. ~SymmetricSkyline() destructor

operations on profil size_t size() const get size void resize( Index const n ) resize: almost impossible void resize( Index const n, Index const p ) resize: almost impossible void compute_profil( VectorUInt const& haut ) if you already have computed the profil void compute_profil( MatrixUInt const& noda, MatrixUInt const& connex ) from finite element method std::ostream& display( std::ostream& os, bool const verbose = false ) const display informations on profil

Access to element Index rows() const get number of rows Index cols() const get number of cols Index n() const get number of rows Index p() const get number of cols Index firstInRow( Index const i ) const get first element in the i-th row Index firstInCol( Index const j ) const get first element in the j-th column Index lastInRow( Index const i ) const get last element in the i-th row Index lastInCol( Index const j ) const get last element in the i-th column Bool isRowMajor() true if the storage is row major (C-like) Bool isColumnMajor() true if the storage is column major (fortran-like) T_value& get( T_value* const data, Index const i, Index const j ) get value T_value get( T_value const* const data, Index const i, Index const j ) const get value T_value& get_fast( T_value* const data, Index const i, Index const j ) get value fast T_value get_fast( T_value const* const data, Index const i, Index const j ) const get value fast UInt haut( Index const& i ) const get value of haut (should not be public) UInt diag( Index const& i ) const get value of diag (should not be public) const& haut() const get haut (should not be public) const& diag() const get diag (should not be public) Bool isFactored() const true if matrix is factored void setIsFactored() set isFactored to true void setIsNotFactored() set isFactored to false bool isInProfile( Index i, Index j) const true if (i,j) is in profile

size_t my_data_length

number of elements asked by user

Bool my_profil_is_set

is profil set ?

Bool my_matrix_is_factored

is matrix factored ?

Index map( Index const& i, Index const& j ) const

map(i,j) find the position in the data array

Index map_fast( Index const& i, Index const& j ) const

same as map(i,j) but without any control

VectorUInt my_diag

VectorUInt my_haut

TVectorIterator iterator_t

required typedef iterator_t

public members size_t size() const return size Index rows() const return number of rows Index cols() const return number of cols Index firstInRow( Index const i ) const return index of the first element in row Index firstInCol( Index const j ) const return index of the first element in col Index lastInRow( Index const i ) const return index of the last element in row Index lastInCol( Index const j ) const return index of the last element in row Bool isRowMajor() return true if structure is row major orientated

protected constructors explicit TVector() default constructor explicit TVector( Index const n ) constructor size equal TVector( Index const n, Index const p ) rectangular constructor (should raise an exception)

protected members ptrdiff_t offset() const map(MinIndex,MinIndex) void resize( Index const n, Index const p=MinIndex ) resize to size and (should raise an exception) T_value& get( T_value* const data, Index const i, Index const j=MinIndex ) set value at T_value& getI( T_value const* data ) set value at T_value get( T_value const* const data, Index const i, Index const j=MinIndex ) const get value at T_value getI( T_value const* const data ) const get value at void initialize( T_value* const data, LoopIndex const& l ) Loopindex initialization void initialize( T_value* const data, Range const& r ) Range initialization void initialize( T_value* const data, Range const& r1, Range const& r2 ) Ranged Range initialization

Index my_n

Direct child classes:: Vector
TinyVector

Alphabetic index HTML hierarchy of classes or Java

This page was generated with the help of DOC++.