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 Member Functions | Static Private Member Functions | Private Attributes | Static Private Attributes | List of all members
CellDataStorage< CellIteratorType, DataType > Class Template Reference

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

Inheritance diagram for CellDataStorage< CellIteratorType, DataType >:
[legend]

Public Member Functions

 CellDataStorage ()=default
 
 ~CellDataStorage () override=default
 
template<typename T = DataType>
void initialize (const CellIteratorType &cell, const unsigned int number_of_data_points_per_cell)
 
template<typename T = DataType>
void initialize (const CellIteratorType &cell_start, const CellIteratorType &cell_end, const unsigned int number_of_data_points_per_cell)
 
bool erase (const CellIteratorType &cell)
 
void clear ()
 
template<typename T = DataType>
std::vector< std::shared_ptr< T > > get_data (const CellIteratorType &cell)
 
template<typename T = DataType>
std::vector< std::shared_ptr< const T > > get_data (const CellIteratorType &cell) const
 
template<typename T = DataType>
std_cxx17::optional< std::vector< std::shared_ptr< T > > > try_get_data (const CellIteratorType &cell)
 
template<typename T = DataType>
std_cxx17::optional< std::vector< std::shared_ptr< const T > > > try_get_data (const CellIteratorType &cell) const
 
- Public Member Functions inherited from Subscriptor
 Subscriptor ()
 
 Subscriptor (const Subscriptor &)
 
 Subscriptor (Subscriptor &&) noexcept
 
virtual ~Subscriptor ()
 
Subscriptoroperator= (const Subscriptor &)
 
Subscriptoroperator= (Subscriptor &&) noexcept
 
void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
 
void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
 
unsigned int n_subscriptions () const
 
template<typename StreamType >
void list_subscribers (StreamType &stream) const
 
void list_subscribers () const
 
template<class Archive >
void serialize (Archive &ar, const unsigned int version)
 

Static Private Member Functions

static ::ExceptionBaseExcCellDataTypeMismatch ()
 
static ::ExceptionBaseExcTriangulationMismatch ()
 

Private Attributes

SmartPointer< const Triangulation< dimension, space_dimension >, CellDataStorage< CellIteratorType, DataType > > tria
 
std::map< CellId, std::vector< std::shared_ptr< DataType > > > map
 

Static Private Attributes

static constexpr unsigned int dimension
 
static constexpr unsigned int space_dimension
 

Additional Inherited Members

- Static Public Member Functions inherited from Subscriptor
static ::ExceptionBaseExcInUse (int arg1, std::string arg2, std::string arg3)
 
static ::ExceptionBaseExcNoSubscriber (std::string arg1, std::string arg2)
 

Detailed Description

template<typename CellIteratorType, typename DataType>
class CellDataStorage< CellIteratorType, DataType >

A class for storing at each cell represented by iterators of type CellIteratorType a vector of data DataType . The underlying structure and the initialize() method of this class are designed in such a way that one could use different child classes derived from the base DataType class to store data on a given cell. This implies the usage of pointers, in our case – std::shared_ptr.

The type DataType is arbitrary, but when using a class derived from TransferableQuadraturePointData one can use the facilities of parallel::distributed::ContinuousQuadratureDataTransfer.

Note
The data type stored on each cell can be different. However, within the cell this class stores a vector of objects of a single data type. For this reason, this class may not be sufficiently flexible when, for example, adopting a level-set approach to describe material behavior.
Author
Denis Davydov, Jean-Paul Pelteret, 2016

Definition at line 64 of file quadrature_point_data.h.

Constructor & Destructor Documentation

◆ CellDataStorage()

template<typename CellIteratorType , typename DataType >
CellDataStorage< CellIteratorType, DataType >::CellDataStorage ( )
default

Default constructor.

◆ ~CellDataStorage()

template<typename CellIteratorType , typename DataType >
CellDataStorage< CellIteratorType, DataType >::~CellDataStorage ( )
overridedefault

Default destructor.

Member Function Documentation

◆ initialize() [1/2]

template<typename CellIteratorType , typename DataType >
template<typename T = DataType>
void CellDataStorage< CellIteratorType, DataType >::initialize ( const CellIteratorType &  cell,
const unsigned int  number_of_data_points_per_cell 
)

Initialize data on the cell to store number_of_data_points_per_cell of objects of type T . The typename T is possibly another class which is derived from the base DataType class. In order to initialize the vector of objects we have to assume that the class T has a default constructor. This function has to be called on every cell where data is to be stored.

After the data is initialized, it can be modified using the get_data() function.

Note
Subsequent calls of this function with the same cell will not alter the objects associated with it. In order to remove the stored data, use the erase() function.
It is possible to use different types T for different cells which may reflect, for example, different constitutive models of continuum mechanics in different parts of the domain.
The first time this method is called, it stores a SmartPointer to the Triangulation object that owns the cell. The future invocations of this method expects the cell to be from the same stored triangulation.
Precondition
The type T needs to either equal DataType, or be a class derived from DataType. T needs to be default constructible.

◆ initialize() [2/2]

template<typename CellIteratorType , typename DataType >
template<typename T = DataType>
void CellDataStorage< CellIteratorType, DataType >::initialize ( const CellIteratorType &  cell_start,
const CellIteratorType &  cell_end,
const unsigned int  number_of_data_points_per_cell 
)

Same as above but for a range of iterators starting at cell_start until, but not including, cell_end for all locally owned cells, i.e. for which cell->is_locally_owned()==true .

◆ erase()

template<typename CellIteratorType , typename DataType >
bool CellDataStorage< CellIteratorType, DataType >::erase ( const CellIteratorType &  cell)

Removes data stored at the cell. Returns true if the data was removed. If no data is attached to the cell, this function will not do anything and returns false.

Note
This function will also check that there are no outstanding references to the data stored on this cell. That is to say, that the only references to the stored data are that made by this class.

◆ clear()

template<typename CellIteratorType , typename DataType >
void CellDataStorage< CellIteratorType, DataType >::clear ( )

Clear all the data stored in this object.

◆ get_data() [1/2]

template<typename CellIteratorType , typename DataType >
template<typename T = DataType>
std::vector<std::shared_ptr<T> > CellDataStorage< CellIteratorType, DataType >::get_data ( const CellIteratorType &  cell)

Get a vector of the data located at cell . A possible additional typename T is the class to which the base class DataType could be cast. Since DataType is stored as shared pointers, there is minimal overhead in returning a vector by value instead of by reference. This allows flexibility if class T is not the same as DataType on a cell-by-cell basis.

Precondition
The type T needs to match the class provided to initialize() .
cell must be from the same Triangulation that is used to initialize() the cell data.

◆ get_data() [2/2]

template<typename CellIteratorType , typename DataType >
template<typename T = DataType>
std::vector<std::shared_ptr<const T> > CellDataStorage< CellIteratorType, DataType >::get_data ( const CellIteratorType &  cell) const

Get a vector of constant pointers to data located at cell . A possible additional typename T is the class to which the base class DataType could be cast. Since DataType is stored as shared pointers, there is minimal overhead in returning a vector by value instead of by reference. This allows flexibility if class T is not the same as DataType on a cell-by-cell basis.

Precondition
The type T needs to match the class provided to initialize() .
cell must be from the same Triangulation that is used to initialize() the cell data.

◆ try_get_data() [1/2]

template<typename CellIteratorType , typename DataType >
template<typename T = DataType>
std_cxx17::optional<std::vector<std::shared_ptr<T> > > CellDataStorage< CellIteratorType, DataType >::try_get_data ( const CellIteratorType &  cell)

Returns a std_cxx17::optional indicating whether cell contains an associated data or not. If data is available, dereferencing the std_cxx17::optional reveals a vector of pointers to the underlying data at the quadrature points. A possible additional typename T is the class to which the base class DataType could be cast. Since DataType is stored as shared pointers, there is minimal overhead in returning a vector by value instead of by reference. This allows flexibility if class T is not the same as DataType on a cell-by-cell basis.

Precondition
The type T needs to match the class provided to initialize().
cell must be from the same Triangulation that is used to initialize() the cell data.

◆ try_get_data() [2/2]

template<typename CellIteratorType , typename DataType >
template<typename T = DataType>
std_cxx17::optional<std::vector<std::shared_ptr<const T> > > CellDataStorage< CellIteratorType, DataType >::try_get_data ( const CellIteratorType &  cell) const

Returns a std_cxx17::optional indicating whether cell contains an associated data or not. If data is available, dereferencing the std_cxx17::optional reveals a vector of constant pointers to the underlying data at the quadrature points. A possible additional typename T is the class to which the base class DataType could be cast. Since DataType is stored as shared pointers, there is minimal overhead in returning a vector by value instead of by reference. This allows flexibility if class T is not the same as DataType on a cell-by-cell basis.

Precondition
The type T needs to match the class provided to initialize().
cell must be from the same Triangulation that is used to initialize() the cell data.

Member Data Documentation

◆ dimension

template<typename CellIteratorType , typename DataType >
constexpr unsigned int CellDataStorage< CellIteratorType, DataType >::dimension
staticconstexprprivate
Initial value:
=
CellIteratorType::AccessorType::dimension

Number of dimensions

Definition at line 216 of file quadrature_point_data.h.

◆ space_dimension

template<typename CellIteratorType , typename DataType >
constexpr unsigned int CellDataStorage< CellIteratorType, DataType >::space_dimension
staticconstexprprivate
Initial value:
=
CellIteratorType::AccessorType::space_dimension

Number of space dimensions

Definition at line 222 of file quadrature_point_data.h.

◆ tria

template<typename CellIteratorType , typename DataType >
SmartPointer<const Triangulation<dimension, space_dimension>, CellDataStorage<CellIteratorType, DataType> > CellDataStorage< CellIteratorType, DataType >::tria
private

To ensure that all the cells in the CellDataStorage come from the same Triangulation, we need to store a reference to that Triangulation within the class.

Definition at line 232 of file quadrature_point_data.h.

◆ map

template<typename CellIteratorType , typename DataType >
std::map<CellId, std::vector<std::shared_ptr<DataType> > > CellDataStorage< CellIteratorType, DataType >::map
private

A map to store a vector of data on each cell. We need to use CellId as the key because it remains unique during adaptive refinement.

Definition at line 239 of file quadrature_point_data.h.


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