Data storage primitives

Collaboration diagram for Data storage primitives:

Classes
class	ArrayView< ElementType, MemorySpaceType >
class	MGLevelObject< Object >
class	TableBase< N, T >
class	Table< N, T >
class	Table< 1, T >
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 >
class	TableIndices< N >
class	BlockIndices

Detailed Description

Here are a few simple classes that help in storage and viewing data. For example, the Table templates allow to use not only arrays of objects (for which one might want to use the std::vector class), but also two-dimensional (rectangular) tables of arbitrary objects, as well as higher-order analogs up to tables with (presently) seven indices.

Similarly, the VectorSlice function is a primitive that takes anything that has an interface that resembles a vector (for example the deal.II Vector or the std::vector classes) and presents a view on it as if it were a vector in itself.