Reference documentation for deal.II version GIT 6bdf9a4b6c 2022-08-12 19:20: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\}}\)
Classes | Namespaces | Enumerations | Functions
table.h File Reference
#include <deal.II/base/config.h>
#include <deal.II/base/aligned_vector.h>
#include <deal.II/base/exceptions.h>
#include <deal.II/base/linear_index_iterator.h>
#include <deal.II/base/memory_consumption.h>
#include <deal.II/base/subscriptor.h>
#include <deal.II/base/table_indices.h>
#include <algorithm>
#include <cstddef>

Go to the source code of this file.


struct  internal::TableBaseAccessors::Types< N, T, Constness >
struct  internal::TableBaseAccessors::Types< N, T, true >
struct  internal::TableBaseAccessors::Types< N, T, false >
class  internal::TableBaseAccessors::Accessor< N, T, C, P >
class  internal::TableBaseAccessors::Accessor< N, T, C, 1 >
class  TableBase< N, T >
class  Table< 1, T >
class  MatrixTableIterators::AccessorBase< TableType, Constness, storage_order >
 Accessor base class for Table<2, T> and TransposeTable. More...
class  MatrixTableIterators::Accessor< TableType, true, storage_order >
 Accessor class offering read-only access to elements of a table. This is the same as the base class. More...
class  MatrixTableIterators::Accessor< TableType, false, storage_order >
 Accessor class offering read and write access to the elements of a table. More...
class  MatrixTableIterators::Iterator< TableType, Constness, storage_order >
 Iterator class for both matrix-like tables, i.e., Table<2, T> and TransposeTable. More...
class  Table< 2, T >
class  Table< 3, T >
class  Table< 4, T >
class  Table< 5, T >
class  Table< 6, T >
class  Table< 7, T >
class  TransposeTable< T >




enum class  MatrixTableIterators::Storage { MatrixTableIterators::row_major , MatrixTableIterators::column_major }
 Enumeration describing the storage order (i.e., the in-memory layout) of a table class. More...


template<int N, typename T >
void swap (TableBase< N, T > &u, TableBase< N, T > &v)

Function Documentation

◆ swap()

template<int N, typename T >
void swap ( TableBase< N, T > &  u,
TableBase< N, T > &  v 

Global function swap which overloads the default implementation of the C++ standard library which uses a temporary object. The function simply exchanges the data of the two tables.

Definition at line 3715 of file table.h.