Intrepid_FieldContainer.hpp File Reference

Header file for utility class to provide multidimensional containers. More...

#include "Intrepid_ConfigDefs.hpp"
#include "Intrepid_Types.hpp"
#include "Intrepid_Utils.hpp"
#include "Teuchos_Array.hpp"
#include "Teuchos_ArrayRCP.hpp"
#include "Teuchos_ArrayView.hpp"
#include "Shards_Array.hpp"
#include "Teuchos_RCP.hpp"
#include "Teuchos_BLAS.hpp"
#include "Teuchos_oblackholestream.hpp"
#include "Teuchos_Assert.hpp"
#include <Intrepid_FieldContainerDef.hpp>

Go to the source code of this file.

Classes
class	Intrepid::FieldContainer< Scalar, ArrayTypeId >
	Implementation of a templated lexicographical container for a multi-indexed scalar quantity. FieldContainer object stores a multi-indexed scalar value using the lexicographical index ordering: the rightmost index changes first and the leftmost index changes last. FieldContainer can be viewed as a dynamic multidimensional array whose values can be accessed in two ways: by their multi-index or by their enumeration, using an overloaded [] operator. The enumeration of a value gives the sequential order of the multi-indexed value in the container. The number of indices, i.e., the rank of the container is unlimited. For containers with ranks up to 5 many of the methods are optimized for faster execution. An overloaded () operator is also provided for such low-rank containers to allow element access by multi-index without having to create an auxiliary array for the multi-index. More...
struct	Return_Type< Intrepid::FieldContainer< FadType >, Scalar >
struct	Return_Type< const Intrepid::FieldContainer< FadType >, Scalar >

Detailed Description

Header file for utility class to provide multidimensional containers.

Author

Created by P. Bochev and D. Ridzal.

Definition in file Intrepid_FieldContainer.hpp.