Reference documentation for deal.II version GIT relicensing-1262-g480f56a2fa 2024-07-23 19:40:02+00:00
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
No Matches
Classes | Public Types | Public Member Functions | Protected Member Functions | Protected Attributes | Friends | List of all members
TrilinosWrappers::SparseMatrixIterators::Accessor< false > Class Reference

#include <deal.II/lac/trilinos_sparse_matrix.h>

Inheritance diagram for TrilinosWrappers::SparseMatrixIterators::Accessor< false >:
Inheritance graph


class  Reference

Public Types

using MatrixType = SparseMatrix
using size_type = ::types::global_dof_index

Public Member Functions

 Accessor (MatrixType *matrix, const size_type row, const size_type index)
Reference value () const
size_type row () const
size_type index () const
size_type column () const

Protected Member Functions

void visit_present_row ()

Protected Attributes

size_type a_row
size_type a_index
std::shared_ptr< std::vector< size_type > > colnum_cache
std::shared_ptr< std::vector< TrilinosScalar > > value_cache


template<bool >
class Iterator
class Reference

Detailed Description

The specialization for a mutable Accessor.

Definition at line 256 of file trilinos_sparse_matrix.h.

Member Typedef Documentation

◆ MatrixType

Typedef for the type (including constness) of the matrix to be used here.

Definition at line 314 of file trilinos_sparse_matrix.h.

◆ size_type

Declare the type for container size.

Definition at line 113 of file trilinos_sparse_matrix.h.

Constructor & Destructor Documentation

◆ Accessor()

TrilinosWrappers::SparseMatrixIterators::Accessor< false >::Accessor ( MatrixType matrix,
const size_type  row,
const size_type  index 

Constructor. Since we use accessors only for read access, a const matrix pointer is sufficient.

Member Function Documentation

◆ value()

Value of this matrix entry.

◆ row()

size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::row ( ) const

Row number of the element represented by this object.

◆ index()

size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::index ( ) const

Index in row of the element represented by this object.

◆ column()

size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::column ( ) const

Column number of the element represented by this object.

◆ visit_present_row()

void TrilinosWrappers::SparseMatrixIterators::AccessorBase::visit_present_row ( )

Discard the old row caches (they may still be used by other accessors) and generate new ones for the row pointed to presently by this accessor.

Definition at line 141 of file

Friends And Related Symbol Documentation

◆ Iterator

template<bool >
friend class Iterator

Definition at line 331 of file trilinos_sparse_matrix.h.

◆ Reference

friend class Reference

Definition at line 334 of file trilinos_sparse_matrix.h.

Member Data Documentation

◆ matrix

SparseMatrix* TrilinosWrappers::SparseMatrixIterators::AccessorBase::matrix

Pointer to the matrix object. This object should be handled as a const pointer or non-const by the appropriate derived classes. In order to be able to implement both, it is not const here, so handle with care!

Definition at line 147 of file trilinos_sparse_matrix.h.

◆ a_row

size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::a_row

Current row number.

Definition at line 151 of file trilinos_sparse_matrix.h.

◆ a_index

size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::a_index

Current index in row.

Definition at line 156 of file trilinos_sparse_matrix.h.

◆ colnum_cache

std::shared_ptr<std::vector<size_type> > TrilinosWrappers::SparseMatrixIterators::AccessorBase::colnum_cache

Cache where we store the column indices of the present row. This is necessary, since Trilinos makes access to the elements of its matrices rather hard, and it is much more efficient to copy all column entries of a row once when we enter it than repeatedly asking Trilinos for individual ones. This also makes some sense since it is likely that we will access them sequentially anyway.

In order to make copying of iterators/accessor of acceptable performance, we keep a shared pointer to these entries so that more than one accessor can access this data if necessary.

Definition at line 178 of file trilinos_sparse_matrix.h.

◆ value_cache

std::shared_ptr<std::vector<TrilinosScalar> > TrilinosWrappers::SparseMatrixIterators::AccessorBase::value_cache

Cache for the values of this row.

Definition at line 183 of file trilinos_sparse_matrix.h.

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