Reference documentation for deal.II version 9.2.0
\(\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\}}\)
Public Types | Public Member Functions | List of all members
MatrixTableIterators::Iterator< TableType, Constness, storage_order > Class Template Reference

Iterator class for both matrix-like tables, i.e., Table<2, T> and TransposeTable. More...

#include <deal.II/base/table.h>

Public Types

using size_type = typename TableType::size_type
 
using container_pointer_type = typename std::conditional< Constness, const TableType *, TableType * >::type
 

Public Member Functions

 Iterator (const Accessor< TableType, Constness, storage_order > &accessor)
 
 Iterator (const container_pointer_type object)
 
 Iterator (const container_pointer_type object, const size_type row, const size_type column)
 
 Iterator (const Iterator< TableType, false, storage_order > &i)
 
 Iterator (const container_pointer_type container, const std::ptrdiff_t linear_index)
 

Detailed Description

template<typename TableType, bool Constness, Storage storage_order>
class MatrixTableIterators::Iterator< TableType, Constness, storage_order >

Iterator class for both matrix-like tables, i.e., Table<2, T> and TransposeTable.

Template Parameters
TableTypethe type of the Table, e.g., Table<2, T> or TransposeTable.
Constnesswhether or not this is a constant iterator.
storage_orderThe storage scheme of the underlying table, e.g., Storage::row_major for Table<2, T>.

Definition at line 848 of file table.h.

Member Typedef Documentation

◆ size_type

template<typename TableType , bool Constness, Storage storage_order>
using MatrixTableIterators::Iterator< TableType, Constness, storage_order >::size_type = typename TableType::size_type

Size type used by the underlying table.

Definition at line 1074 of file table.h.

◆ container_pointer_type

template<typename TableType , bool Constness, Storage storage_order>
using MatrixTableIterators::Iterator< TableType, Constness, storage_order >::container_pointer_type = typename std:: conditional<Constness, const TableType *, TableType *>::type

Type of the stored pointer to the table.

Definition at line 1080 of file table.h.

Constructor & Destructor Documentation

◆ Iterator() [1/5]

template<typename TableType , bool Constness, Storage storage_order>
MatrixTableIterators::Iterator< TableType, Constness, storage_order >::Iterator ( const Accessor< TableType, Constness, storage_order > &  accessor)

Constructor from an accessor.

◆ Iterator() [2/5]

template<typename TableType , bool Constness, Storage storage_order>
MatrixTableIterators::Iterator< TableType, Constness, storage_order >::Iterator ( const container_pointer_type  object)

Constructor. Create the end iterator for a table.

◆ Iterator() [3/5]

template<typename TableType , bool Constness, Storage storage_order>
MatrixTableIterators::Iterator< TableType, Constness, storage_order >::Iterator ( const container_pointer_type  object,
const size_type  row,
const size_type  column 
)

Constructor for a particular table entry.

◆ Iterator() [4/5]

template<typename TableType , bool Constness, Storage storage_order>
MatrixTableIterators::Iterator< TableType, Constness, storage_order >::Iterator ( const Iterator< TableType, false, storage_order > &  i)

Copy constructor from a non-const iterator.

◆ Iterator() [5/5]

template<typename TableType , bool Constness, Storage storage_order>
MatrixTableIterators::Iterator< TableType, Constness, storage_order >::Iterator ( const container_pointer_type  container,
const std::ptrdiff_t  linear_index 
)

Constructor for an entry with a particular linear index.


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