Provides a generic multi-component array, contained in Sidre. More...

#include </home/docs/checkouts/readthedocs.org/user_builds/axom/checkouts/main/src/axom/sidre/core/Array.hpp>

Inheritance diagram for axom::sidre::Array< T, DIM >:

[legend]

Public Types
using	value_type = T

using	ArrayIterator = ArrayIteratorBase< Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >, T >

using	ConstArrayIterator = ArrayIteratorBase< const Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >, const T >

using	ArrayViewType = ArrayView< T, DIM, SPACE >

using	ConstArrayViewType = ArrayView< const T, DIM, SPACE >

using	RealConstT = typename std::conditional< is_array_view, T, const T >::type

template<int IdxDim>
using	SliceType = typename std::conditional< DIM==IdxDim, T &, typename detail::SubsliceProxy< T, DIM - IdxDim, ArrayType >::type >::type

template<int IdxDim>
using	ConstSliceType = typename std::conditional< DIM==IdxDim, RealConstT &, typename detail::SubsliceProxy< T, DIM - IdxDim, const ArrayType >::type >::type

Public Member Functions
	Array ()=delete
	Default constructor. Disabled. More...

	Array (const Array &)=delete
	Copy constructor. More...

	Array (Array &&other)
	Move constructor. More...

virtual	~Array ()

Array &	operator= (const Array &)=delete
	Copy assignment. More...

Array &	operator= (Array &&other)
	Move assignment. More...

std::enable_if< TDIM==1, axom::StackArray< TT, LENGTH1D > >::type	to_stack_array () const
	Convert 1D Array into a StackArray. More...

Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::ArrayIterator	emplace (Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::ArrayIterator pos, Args &&... args)

void	emplace_back_device (Args &&... args)
	Inserts new element at the end of the Array. More...

void	swap (ArrayBase &other)
	Swaps two ArrayBases. More...

template<typename... Args>
AXOM_HOST_DEVICE SliceType< sizeof...(Args)>	operator() (Args... args)
	Dimension-aware accessor; with N=DIM indices, returns a reference to the given value at that index. Otherwise, returns a sub-array pointed to by the given sub-index. More...

template<typename... Args>
AXOM_HOST_DEVICE ConstSliceType< sizeof...(Args)>	operator() (Args... args) const
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...

AXOM_HOST_DEVICE SliceType< 1 >	operator[] (const IndexType idx)
	Scalar accessor; returns a sub-array referenced by the given sub- index, beginning at array(idx, 0...) More...

AXOM_HOST_DEVICE ConstSliceType< 1 >	operator[] (const IndexType idx) const
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...

template<int UDim>
AXOM_HOST_DEVICE SliceType< UDim >	operator[] (const StackArray< IndexType, UDim > &idx)
	Dimension-aware accessor; with UDim=DIM indices, returns a reference to the given value at that index. Otherwise, returns a sub-array pointed to by the given sub-index. More...

template<int UDim>
AXOM_HOST_DEVICE ConstSliceType< UDim >	operator[] (const StackArray< IndexType, UDim > &idx) const
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...

AXOM_HOST_DEVICE const StackArray< IndexType, DIM > &	shape () const
	Returns the dimensions of the Array. More...

AXOM_HOST_DEVICE const MDMapping< DIM > &	mapping () const
	Returns the multidimensional mapping for the Array. More...

AXOM_HOST_DEVICE const StackArray< IndexType, DIM > &	strides () const
	Returns the memory strides of the Array. More...

AXOM_HOST_DEVICE IndexType	minStride () const
	Returns the minimum stride between adjacent items. More...

Sidre Array constructors
template<int SFINAE = DIM, typename std::enable_if< SFINAE==1 >::type * = nullptr>
	Array (View *view)
	Creates an Array instance from a View that already has data. More...

template<int SFINAE = DIM, typename std::enable_if< SFINAE==2 >::type * = nullptr>
	Array (View *view)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...

template<int SFINAE = DIM, typename std::enable_if< SFINAE==1 >::type * = nullptr>
	Array (View *view, axom::IndexType num_elements, axom::IndexType capacity=0)
	Creates an Array instance of `num_elements` size and populates the associated View. More...

template<int SFINAE = DIM, typename std::enable_if< SFINAE==2 >::type * = nullptr>
	Array (View *view, axom::IndexType num_tuples, axom::IndexType num_components=1, axom::IndexType capacity=0)
	Creates an Array instance of `num_tuples` size, where each tuple consists of `num_components` values and populates the associated View. More...

Array methods to query and set attributes
virtual bool	isExternal () const
	Return true iff the external buffer constructor was called. More...

const View *	getView () const
	Return a pointer to the View that this Array wraps. More...

Array element access operators
T *	data ()
	Return a pointer to the array of data. More...

const T *	data () const

Array methods to modify the data.
void	fill (const T &value)
	Set all the values of the array. More...

void	fill (const T &value, IndexType n, IndexType pos)
	Set a range of elements to a given value. More...

void	set (const T *elements, IndexType n, IndexType pos)
	Modify the values of existing elements. More...

void	assign (axom::IndexType count, const T &value)
	Set the array contents. More...

void	assign (InputIt first, InputIt last)
	Replaces contents with copies of objects in [first, last). More...

void	assign (std::initializer_list< T > elems)
	Set the array contents using an initializer list. More...

void	clear ()
	Clears the contents of the array. More...

void	insert (IndexType pos, const T &value)
	Insert an element into the array at the given position. More...

ArrayIterator	insert (ArrayIterator pos, const T &value)
	Insert an element into the array at the value before pos. More...

void	insert (IndexType pos, IndexType n, const T *values)
	Insert elements into the array at the given position. More...

ArrayIterator	insert (ArrayIterator pos, IndexType n, const T *values)
	Insert elements into the array at the value before pos. More...

void	insert (IndexType pos, IndexType n, const T &value)
	Insert n copies of element into the array at the given position. More...

ArrayIterator	insert (ArrayIterator pos, IndexType n, const T &value)
	Insert n copies of element into the array at the value before pos. More...

void	insert (IndexType pos, ArrayView< const T, DIM, OtherSpace > other)
	Inserts an Array to the end of the calling object. More...

void	insert (IndexType pos, ArrayView< T, DIM, OtherSpace > other)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...

void	append (ArrayView< const T, DIM, OtherSpace > other)
	Appends an Array to the end of the calling object. More...

void	append (ArrayView< T, DIM, OtherSpace > other)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...

ArrayIterator	erase (ArrayIterator pos)
	Erases an element from the Array. More...

ArrayIterator	erase (ArrayIterator first, ArrayIterator last)
	Erases elements in the range [first, last) from the Array. More...

void	emplace (IndexType pos, Args &&... args)
	Inserts new element into Array at the given position. More...

ArrayIterator	emplace (ArrayIterator pos, Args &&... args)
	Inserts new element into Array before pos. More...

void	push_back (const T &value)
	Push a value to the back of the array. More...

void	push_back (T &&value)
	Push a value to the back of the array. More...

void	emplace_back (Args &&... args)
	Inserts new element at the end of the Array. More...

void	push_back_device (const T &value)
	Push a value to the back of the array. More...

void	push_back_device (T &&value)

Array methods to query and set attributes
IndexType	capacity () const
	Return the number of elements allocated for the data array. More...

void	reserve (IndexType capacity)
	Increase the capacity. Does nothing if the new capacity is less than the current capacity. More...

ArrayIterator	begin ()
	Returns an ArrayIterator to the first element of the Array. More...

ConstArrayIterator	begin () const
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...

ArrayIterator	end ()
	Returns an ArrayIterator to the element following the last element of the Array. More...

ConstArrayIterator	end () const
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...

T &	front ()
	Returns a reference to the first element in the Array. More...

const T &	front () const
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...

T &	back ()
	Returns a reference to the last element in the Array. More...

const T &	back () const
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...

void	shrink ()
	Shrink the capacity to be equal to the size. More...

bool	empty () const
	Returns true iff the Array stores no elements. More...

IndexType	size () const
	Return the number of elements stored in the data array. More...

void	resize (Args... args)
	Update the number of elements stored in the data array. More...

void	resize (ArrayOptions::Uninitialized, Args... args)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...

void	resize (IndexType size, const T &value)

void	resize (const StackArray< IndexType, DIM > &size, const T &value)

void	swap (Array &other)
	Exchanges the contents of this Array with the other. More...

double	getResizeRatio () const
	Get the ratio by which the capacity increases upon dynamic resize. More...

void	setResizeRatio (double ratio)
	Set the ratio by which the capacity increases upon dynamic resize. More...

int	getAllocatorID () const
	Get the ID for the umpire allocator. More...

void	setDevicePreference (bool on_device)
	Sets the preferred space where operations on this array should be performed. More...

ArrayViewType	view ()
	Returns a view of the array. More...

ConstArrayViewType	view () const
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...


AXOM_HOST_DEVICE T &	flatIndex (const IndexType idx)
	Accessor, returns a reference to the given value. For multidimensional arrays, indexes into the (flat) raw data. More...

AXOM_HOST_DEVICE RealConstT &	flatIndex (const IndexType idx) const
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...

Static Public Attributes
static constexpr double	DEFAULT_RESIZE_RATIO

static constexpr IndexType	MIN_DEFAULT_CAPACITY

static constexpr MemorySpace	space

constexpr static int	Dims = DIM

Protected Types
using	BaseArray = axom::Array< T, DIM, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >

Protected Member Functions
axom::IndexType	getViewShape (int dim) const
	Given a non-empty View of dimension 2, returns the length of the given dimension. More...

void	initialize (IndexType num_elements, IndexType capacity, bool should_default_construct=true)
	Initialize an Array instance with the given number of elements. More...

void	initialize_from_other (const T *data, IndexType num_elements, MemorySpace data_space, bool user_provided_allocator)
	Helper function for initializing an Array instance with an existing range of elements. More...

void	resizeImpl (const StackArray< IndexType, DIM > &dims, bool construct_with_values, const T *value=nullptr)
	Updates the number of elements stored in the data array. More...

T *	reserveForInsert (IndexType n, IndexType pos)
	Make space for a subsequent insertion into the array. More...

IndexType	reserveForPushBack ()
	Make space for a subsequent insertion into the array. More...

void	updateNumElements (IndexType new_num_elements)
	Update the number of elements. More...

void	setCapacity (IndexType new_capacity)
	Set the number of elements allocated for the data array. More...

void	dynamicRealloc (IndexType new_num_elements)
	Reallocates the data array when the size exceeds the capacity. More...

AXOM_HOST_DEVICE void	setShape (const StackArray< IndexType, DIM > &shape_)
	Set the shape. More...

AXOM_SUPPRESS_HD_WARN AXOM_HOST_DEVICE void	setShapeAndStride (const StackArray< IndexType, DIM > &shape, const StackArray< IndexType, DIM > &stride)
	Set the shape and stride. More...

IndexType	blockSize () const
	Returns the minimum "chunk size" that should be allocated For example, 2 would be the chunk size of a 2D array whose second dimension is of size 2. This is used when resizing/reallocating; it wouldn't make sense to have a capacity of 3 in the array described above. More...

AXOM_HOST_DEVICE void	updateStrides (int min_stride=1)
	Updates the internal striding information to a row-major format Intended to be called after shape is updated. More...

void	updateShapeOnInsert (const StackArray< IndexType, DIM > &range_shape)
	Updates the internal dimensions and striding based on the insertion of a range of elements. Intended to be called after the insertion of a multidimensional subslice. More...

Static Protected Member Functions
static constexpr TypeID	sidreTypeId ()
	Return the TypeID corresponding to T. More...

Protected Attributes
T *	m_data

IndexType	m_num_elements
	The full number of elements in the array i.e., 3 for a 1D Array of size 3, 9 for a 3x3 2D array, etc. More...

IndexType	m_capacity

double	m_resize_ratio

int	m_allocator_id

bool	m_executeOnGPU

OpHelper	m_arrayOps

StackArray< IndexType, DIM >	m_shape
	The extent in each direction. More...

MDMapping< DIM >	m_mapping
	For converting between multidim indices and offset. More...

IndexType	m_minStride
	Cached value for optimization. More...

Detailed Description

template<typename T, int DIM = 1>
class axom::sidre::Array< T, DIM >

Provides a generic multi-component array, contained in Sidre.

This sidre::Array class extends axom::Array by storing data in a Sidre DataStore. This class provides a generic multi-component array container with dynamic re-allocation and insertion. Each element in the array is a tuple consisting of 1 or more components, which are stored contiguously.

Objects of the sidre::Array class may be constructed from a View. All array operations can be performed as with the base axom::Array class. The size of the Array can grow as needed, and all memory management is delegated to Sidre.

Note: When the Array object is deleted, it does not delete the associated data in Sidre, since, Sidre owns the data.

Warning: Reallocations tend to be costly operations in terms of performance. Use reserve() when the number of nodes is known a priori, or opt to use a constructor that takes an actual size and capacity when possible.

Template Parameters

T	the type of the values to hold.

See also: Group; View

Member Typedef Documentation

◆ BaseArray

template<typename T , int DIM = 1>

using axom::sidre::Array< T, DIM >::BaseArray = axom::Array<T, DIM, MemorySpace::Dynamic, detail::SidreStoragePolicy<T> >

protected

◆ value_type

using axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::value_type = T

inherited

◆ ArrayIterator

using axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::ArrayIterator = ArrayIteratorBase<Array<T, DIM, SPACE, detail::SidreStoragePolicy< T > >, T>

inherited

◆ ConstArrayIterator

using axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::ConstArrayIterator = ArrayIteratorBase<const Array<T, DIM, SPACE, detail::SidreStoragePolicy< T > >, const T>

inherited

◆ ArrayViewType

using axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::ArrayViewType = ArrayView<T, DIM, SPACE>

inherited

◆ ConstArrayViewType

using axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::ConstArrayViewType = ArrayView<const T, DIM, SPACE>

inherited

◆ RealConstT

template<typename T , int DIM, typename ArrayType >

using axom::ArrayBase< T, DIM, ArrayType >::RealConstT = typename std::conditional<is_array_view, T, const T>::type

inherited

◆ SliceType

template<typename T , int DIM, typename ArrayType >

template<int IdxDim>

using axom::ArrayBase< T, DIM, ArrayType >::SliceType = typename std::conditional<DIM == IdxDim, T&, typename detail::SubsliceProxy<T, DIM - IdxDim, ArrayType>::type>::type

inherited

◆ ConstSliceType

template<typename T , int DIM, typename ArrayType >

template<int IdxDim>

using axom::ArrayBase< T, DIM, ArrayType >::ConstSliceType = typename std::conditional<DIM == IdxDim, RealConstT&, typename detail::SubsliceProxy<T, DIM - IdxDim, const ArrayType>::type>::type

inherited

Constructor & Destructor Documentation

◆ Array() [1/7]

template<typename T , int DIM = 1>

axom::sidre::Array< T, DIM >::Array ( )

delete

Default constructor. Disabled.

◆ Array() [2/7]

template<typename T , int DIM = 1>

axom::sidre::Array< T, DIM >::Array ( const Array< T, DIM > & )

delete

Copy constructor.

Deleted because copies would have to reference the same underlying Sidre buffer, which does not match the underlying axom::Array ownership model

◆ Array() [3/7]

template<typename T , int DIM>

axom::sidre::Array< T, DIM >::Array ( Array< T, DIM > && other )

Move constructor.

Parameters

[in] other The array to move from

◆ Array() [4/7]

template<typename T , int DIM>

template<int SFINAE, typename std::enable_if< SFINAE==2 >::type * >

axom::sidre::Array< T, DIM >::Array ( View * view )

Creates an Array instance from a View that already has data.

Parameters

[in] view the View that holds this Array's data.

Note: The Sidre view shape has two dimensions. The first dimension corresponds to the max capacity of the array and the second corresponds to the number of components per tuple.

Precondition: view != nullptr; view->isEmpty() == false.; view->getNumDimensions() == 2

Postcondition: capacity() == view->getDimension(0); numComponents() == view->getDimension(1); getResizeRatio() == DEFAULT_RESIZE_RATIO

References axom::sidre::View::getBuffer(), axom::sidre::Buffer::getNumElements(), axom::sidre::View::getTypeID(), axom::sidre::Array< T, DIM >::getView(), axom::sidre::Array< T, DIM >::getViewShape(), axom::sidre::View::getVoidPtr(), axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::m_capacity, axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::m_data, axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::m_num_elements, axom::ArrayBase< T, DIM, ArrayType >::setShape(), axom::sidre::Array< T, DIM >::sidreTypeId(), SLIC_ERROR_IF, and axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::view().

◆ Array() [5/7]

template<typename T , int DIM = 1>

template<int SFINAE = DIM, typename std::enable_if< SFINAE==2 >::type * = nullptr>

axom::sidre::Array< T, DIM >::Array ( View * view )

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ Array() [6/7]

template<typename T , int DIM>

template<int SFINAE, typename std::enable_if< SFINAE==1 >::type * >

axom::sidre::Array< T, DIM >::Array	(	View *	view,
		axom::IndexType	num_elements,
		axom::IndexType	capacity = `0`
	)

Creates an Array instance of num_elements size and populates the associated View.

Parameters

[in]	view	the View that will hold this Array's data.
[in]	num_elements	the number of values.
[in]	capacity	the number of values to allocate space for.

Note: The capacity argument is optional. If not specified or if less than num_elements, the capacity of the array will be initialized to num_elements * DEFAULT_RESIZE_RATIO.; The non-null view is expected to be empty and will be populated to hold this Array's data.; The Sidre view shape has one dimension.

Precondition: view != nullptr; view->isEmpty() == true; num_elements >= 1

Postcondition: view->getNumDimensions() == 1; view->isEmpty() == false; size() == num_elements.; numComponents() == num_components; getResizeRatio() == DEFAULT_RESIZE_RATIO

References axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::capacity(), axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::m_capacity, axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::m_data, axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::m_num_elements, axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::setCapacity(), SLIC_ASSERT, SLIC_ERROR_IF, and axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::view().

◆ Array() [7/7]

template<typename T , int DIM>

template<int SFINAE, typename std::enable_if< SFINAE==2 >::type * >

axom::sidre::Array< T, DIM >::Array	(	View *	view,
		axom::IndexType	num_tuples,
		axom::IndexType	num_components = `1`,
		axom::IndexType	capacity = `0`
	)

Creates an Array instance of num_tuples size, where each tuple consists of num_components values and populates the associated View.

Parameters

[in]	view	the View that will hold this Array's data.
[in]	num_tuples	the number of tuples accounted for in the Array.
[in]	num_components	the number of values per tuple. If not specified defaults to 1.
[in]	capacity	the number of tuples to allocate space for.

Note: The capacity argument is optional. If not specified or if less than num_tuples, the capacity of the Array will be initialized to num_tuples * DEFAULT_RESIZE_RATIO.; The non-null view is expected to be empty and will be populated to hold this Array's data.; The Sidre view shape has two dimensions. The first dimension corresponds to the number of tuples and the second corresponds to the number of components per tuple.

Precondition: view != nullptr; view->isEmpty() == true; num_tuples >= 1; num_components >= 1

Postcondition: view->getNumDimensions() == 2; view->isEmpty() == false; size() == num_tuples.; numComponents() == num_components; getResizeRatio() == DEFAULT_RESIZE_RATIO

References axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::capacity(), axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::m_capacity, axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::m_data, axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::m_num_elements, axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::setCapacity(), SLIC_ASSERT, SLIC_ERROR_IF, axom::ArrayBase< T, DIM, ArrayType >::updateStrides(), and axom::Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > >::view().

◆ ~Array()

template<typename T , int DIM>

axom::sidre::Array< T, DIM >::~Array

virtual

Destructor. Frees the associated buffer unless owned by Sidre.

Member Function Documentation

◆ operator=() [1/2]

template<typename T , int DIM = 1>

Array& axom::sidre::Array< T, DIM >::operator= ( const Array< T, DIM > & )

delete

Copy assignment.

Deleted because copies would have to reference the same underlying Sidre buffer, which does not match the underlying axom::Array ownership model

◆ operator=() [2/2]

template<typename T , int DIM>

Array< T, DIM > & axom::sidre::Array< T, DIM >::operator= ( Array< T, DIM > && other )

Move assignment.

Parameters

[in] other The Array to move from

◆ isExternal()

template<typename T , int DIM = 1>

virtual bool axom::sidre::Array< T, DIM >::isExternal ( ) const

inlinevirtual

Return true iff the external buffer constructor was called.

◆ getView()

template<typename T , int DIM = 1>

const View* axom::sidre::Array< T, DIM >::getView ( ) const

inline

Return a pointer to the View that this Array wraps.

References axom::sidre::detail::SidreStoragePolicy< T >::getView().

◆ sidreTypeId()

template<typename T , int DIM = 1>

static constexpr TypeID axom::sidre::Array< T, DIM >::sidreTypeId ( )

inlinestaticconstexprprotected

Return the TypeID corresponding to T.

References axom::sidre::detail::SidreStoragePolicy< T >::sidreTypeId().

◆ getViewShape()

template<typename T , int DIM>

axom::IndexType axom::sidre::Array< T, DIM >::getViewShape ( int dim ) const

inlineprotected

Given a non-empty View of dimension 2, returns the length of the given dimension.

Parameters

[in]	view	the View to examine.
[in]	dim	the dimension (0 or 1) to return the length of.

Precondition: 0 <= dim <= 1

◆ data() [1/2]

T* axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::data ( )

inlineinherited

Return a pointer to the array of data.

◆ data() [2/2]

const T* axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::data ( ) const

inlineinherited

◆ to_stack_array()

std::enable_if<TDIM == 1, axom::StackArray<TT, LENGTH1D> >::type axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::to_stack_array ( ) const

inlineinherited

Convert 1D Array into a StackArray.

◆ fill() [1/2]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::fill ( const T & value )

inlineinherited

Set all the values of the array.

Parameters

[in] value the value to set to.

◆ fill() [2/2]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::fill	(	const T &	value,
		IndexType	n,
		IndexType	pos
	)

inlineinherited

Set a range of elements to a given value.

Parameters

[in]	value	the value to set to.
[in]	n	the number of elements to write.
[in]	pos	the position at which to begin writing.

Note: The size is unchanged by calls to fill.

Precondition: pos + n <= m_num_elements.

◆ set()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::set	(	const T *	elements,
		IndexType	n,
		IndexType	pos
	)

inlineinherited

Modify the values of existing elements.

Parameters

[in]	elements	the new elements to write.
[in]	n	the number of elements to write.
[in]	pos	the position at which to begin writing.

Note: It's assumed that elements is of length n.; The size is unchanged by calls to set.

Precondition: pos + n <= m_num_elements.

◆ assign() [1/3]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::assign	(	axom::IndexType	count,
		const T &	value
	)

inlineinherited

Set the array contents.

Parameters

[in]	count	The new number of elements.
[in]	value	The value to store in the elements.

Postcondition: Size of Array is count, all elements contain value.

◆ assign() [2/3]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::assign	(	InputIt	first,
		InputIt	last
	)

inlineinherited

Replaces contents with copies of objects in [first, last).

Parameters

[in]	first	The iterator for the first value to use in a container.
[in]	last	The last iterator to use in a container.

Postcondition: Size of Array is changed to the number of items in the range designated by the iterators (last-first), and values referenced by the iterator range are copied into the Array.

◆ assign() [3/3]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::assign ( std::initializer_list< T > elems )

inlineinherited

Set the array contents using an initializer list.

Parameters

[in] elems An initializer list containing the new array values.

Postcondition: The Array contains copies of the initializer list elements.

◆ clear()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::clear

inlineinherited

Clears the contents of the array.

Postcondition: size of Array is 0; capacity is unchanged

◆ insert() [1/8]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::insert	(	IndexType	pos,
		const T &	value
	)

inlineinherited

Insert an element into the array at the given position.

Parameters

[in]	pos	the position at which to insert.
[in]	value	the element value to insert.

Note: Reallocation is done if the new size will exceed the capacity.; The size increases by 1.

◆ insert() [2/8]

ArrayIterator axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::insert	(	ArrayIterator	pos,
		const T &	value
	)

inherited

Insert an element into the array at the value before pos.

Parameters

[in]	pos	the ArrayIterator before which value will be inserted.
[in]	value	the element value to insert.

Note: Reallocation is done if the new size will exceed the capacity.; The size increases by 1.

Returns: ArrayIterator to inserted value

◆ insert() [3/8]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::insert	(	IndexType	pos,
		IndexType	n,
		const T *	values
	)

inlineinherited

Insert elements into the array at the given position.

Parameters

[in]	pos	the position at which to begin the insertion.
[in]	n	the number of elements to insert.
[in]	values	the element values to insert.

Note: It's assumed that elements is of length n.; Reallocation is done if the new size will exceed the capacity.; The size increases by n.

Precondition: pos <= m_num_elements.

◆ insert() [4/8]

ArrayIterator axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::insert	(	ArrayIterator	pos,
		IndexType	n,
		const T *	values
	)

inherited

Insert elements into the array at the value before pos.

Parameters

[in]	pos	the ArrayIterator before which value will be inserted.
[in]	n	the number of elements to insert.
[in]	values	the element values to insert.

Note: It's assumed that elements is of length n.; Reallocation is done if the new size will exceed the capacity.; The size increases by n.

Precondition: pos <= end()

Returns: ArrayIterator to first element inserted (pos if n == 0)

◆ insert() [5/8]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::insert	(	IndexType	pos,
		IndexType	n,
		const T &	value
	)

inlineinherited

Insert n copies of element into the array at the given position.

Parameters

[in]	pos	the position at which to begin the insertion.
[in]	n	the number of elements to insert.
[in]	value	the element value to insert.

Note: Reallocation is done if the new size will exceed the capacity.; The size increases by n.; This method is used to create space for elements in the middle of the array.

Precondition: pos <= m_num_elements.

◆ insert() [6/8]

ArrayIterator axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::insert	(	ArrayIterator	pos,
		IndexType	n,
		const T &	value
	)

inherited

Insert n copies of element into the array at the value before pos.

Parameters

[in]	pos	the ArrayIterator before which value will be inserted.
[in]	n	the number of elements to insert.
[in]	value	the element value to insert.

Note: Reallocation is done if the new size will exceed the capacity.; The size increases by n.; This method is used to create space for elements in the middle of the array.

Precondition: pos <= end()

Returns: ArrayIterator to first element inserted (pos if n == 0)

◆ insert() [7/8]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::insert	(	IndexType	pos,
		ArrayView< const T, DIM, OtherSpace >	other
	)

inlineinherited

Inserts an Array to the end of the calling object.

Parameters

[in] other The Array to append

Precondition: The shapes of the calling Array and other are the same (excluding the leading dimension), i.e., shape()[1:] == other.shape()[1:]

Note: Reallocation is done if the new size will exceed the capacity.

◆ insert() [8/8]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::insert	(	IndexType	pos,
		ArrayView< T, DIM, OtherSpace >	other
	)

inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ append() [1/2]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::append ( ArrayView< const T, DIM, OtherSpace > other )

inlineinherited

Appends an Array to the end of the calling object.

Parameters

[in] other The Array to append

Template Parameters

OtherArrayType The underlying type of the other array

Note: Reallocation is done if the new size will exceed the capacity.

◆ append() [2/2]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::append ( ArrayView< T, DIM, OtherSpace > other )

inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ erase() [1/2]

ArrayIterator axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::erase ( ArrayIterator pos )

inherited

Erases an element from the Array.

Parameters

[in] pos the ArrayIterator to the element in the Array

Returns: An ArrayIterator following the last element removed.

◆ erase() [2/2]

ArrayIterator axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::erase	(	ArrayIterator	first,
		ArrayIterator	last
	)

inherited

Erases elements in the range [first, last) from the Array.

Parameters

[in]	first	the ArrayIterator to the beginning of the range.
[in]	last	the ArrayIterator to end of range.

Returns: An ArrayIterator following the last element removed.

◆ emplace() [1/3]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::emplace	(	IndexType	pos,
		Args &&...	args
	)

inlineinherited

Inserts new element into Array at the given position.

Parameters

[in]	pos	the position to insert element at.
[in]	args	the arguments to forward to constructor of the element.

Note: Reallocation is done if the new size will exceed the capacity.; The size increases by 1.

Precondition: T must be MoveAssignable

◆ emplace() [2/3]

ArrayIterator axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::emplace	(	ArrayIterator	pos,
		Args &&...	args
	)

inherited

Inserts new element into Array before pos.

Parameters

[in]	pos	the ArrayIterator to insert element before.
[in]	args	the arguments to forward to constructor of the element.

Note: Reallocation is done if the new size will exceed the capacity.; The size increases by 1.

Precondition: T must be MoveAssignable

Returns: An ArrayIterator to the emplaced element.

◆ emplace() [3/3]

Array<T, DIM, SPACE, detail::SidreStoragePolicy< T > >::ArrayIterator axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::emplace	(	Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::ArrayIterator	pos,
		Args &&...	args
	)

inlineinherited

◆ push_back() [1/2]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::push_back ( const T & value )

inlineinherited

Push a value to the back of the array.

Parameters

[in] value the value to be added to the back.

Note: Reallocation is done if the new size will exceed the capacity.

Precondition: DIM == 1

◆ push_back() [2/2]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::push_back ( T && value )

inlineinherited

Push a value to the back of the array.

Parameters

[in] value the value to move to the back.

Note: Reallocation is done if the new size will exceed the capacity.

Precondition: DIM == 1

◆ emplace_back()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::emplace_back ( Args &&... args )

inlineinherited

Inserts new element at the end of the Array.

Parameters

[in] args the arguments to forward to constructor of the element.

Note: Reallocation is done if the new size will exceed the capacity.; The size increases by 1.

Precondition: DIM == 1

◆ push_back_device() [1/2]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::push_back_device ( const T & value )

inlineinherited

Push a value to the back of the array.

Parameters

[in] value the value to move to the back.

Note: Reallocation is done if the new size will exceed the capacity.; If used in a device kernel, the number of push_backs must not exceed the capacity, since device-side reallocations aren't supported.; Array must be allocated in unified memory if calling on the device.

Precondition: DIM == 1

◆ push_back_device() [2/2]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::push_back_device ( T && value )

inlineinherited

◆ emplace_back_device()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::emplace_back_device ( Args &&... args )

inlineinherited

Inserts new element at the end of the Array.

Parameters

[in] args the arguments to forward to constructor of the element.

Note: Reallocation is done if the new size will exceed the capacity.; The size increases by 1.; If used in a device kernel, the number of push_backs must not exceed the capacity, since device-side reallocations aren't supported.; Array must be allocated in unified memory if calling on the device.

Precondition: DIM == 1

◆ capacity()

IndexType axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::capacity ( ) const

inlineinherited

Return the number of elements allocated for the data array.

◆ reserve()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::reserve ( IndexType capacity )

inlineinherited

Increase the capacity. Does nothing if the new capacity is less than the current capacity.

Parameters

[in] capacity the new number of elements to allocate.

◆ begin() [1/2]

ArrayIterator axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::begin ( )

inlineinherited

Returns an ArrayIterator to the first element of the Array.

◆ begin() [2/2]

ConstArrayIterator axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::begin ( ) const

inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ end() [1/2]

ArrayIterator axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::end ( )

inlineinherited

Returns an ArrayIterator to the element following the last element of the Array.

◆ end() [2/2]

ConstArrayIterator axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::end ( ) const

inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ front() [1/2]

T& axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::front ( )

inlineinherited

Returns a reference to the first element in the Array.

Precondition: array.empty() == false

◆ front() [2/2]

const T& axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::front ( ) const

inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ back() [1/2]

T& axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::back ( )

inlineinherited

Returns a reference to the last element in the Array.

Precondition: array.size() > 0

◆ back() [2/2]

const T& axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::back ( ) const

inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ shrink()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::shrink ( )

inlineinherited

Shrink the capacity to be equal to the size.

◆ empty()

bool axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::empty ( ) const

inlineinherited

Returns true iff the Array stores no elements.

Note: If the Array is empty the capacity can still be greater than zero.

◆ size()

IndexType axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::size ( ) const

inlineinherited

Return the number of elements stored in the data array.

◆ resize() [1/4]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::resize ( Args... args )

inlineinherited

Update the number of elements stored in the data array.

Note: Reallocation is done if the new size will exceed the capacity.

◆ resize() [2/4]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::resize	(	ArrayOptions::Uninitialized	,
		Args...	args
	)

inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ resize() [3/4]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::resize	(	IndexType	size,
		const T &	value
	)

inlineinherited

◆ resize() [4/4]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::resize	(	const StackArray< IndexType, DIM > &	size,
		const T &	value
	)

inlineinherited

◆ swap() [1/2]

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::swap ( Array< T, 1, MemorySpace::Dynamic, detail::SidreStoragePolicy< T > > & other )

inlineinherited

Exchanges the contents of this Array with the other.

◆ swap() [2/2]

template<typename T , int DIM, typename ArrayType >

void axom::ArrayBase< T, DIM, ArrayType >::swap ( ArrayBase< T, DIM, ArrayType > & other )

inlineinherited

Swaps two ArrayBases.

References axom::ArrayBase< T, DIM, ArrayType >::m_mapping, axom::ArrayBase< T, DIM, ArrayType >::m_minStride, axom::ArrayBase< T, DIM, ArrayType >::m_shape, and axom::utilities::swap().

◆ getResizeRatio()

double axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::getResizeRatio ( ) const

inlineinherited

Get the ratio by which the capacity increases upon dynamic resize.

◆ setResizeRatio()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::setResizeRatio ( double ratio )

inlineinherited

Set the ratio by which the capacity increases upon dynamic resize.

Parameters

[in] ratio the new resize ratio.

◆ getAllocatorID()

int axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::getAllocatorID ( ) const

inlineinherited

Get the ID for the umpire allocator.

◆ setDevicePreference()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::setDevicePreference ( bool on_device )

inlineinherited

Sets the preferred space where operations on this array should be performed.

This option only has an effect for memory which is both accessible on the CPU and the GPU. For CUDA this is the Unified and Pinned memory spaces, while for HIP this is the Unified, Pinned, and Device memory spaces.

◆ view() [1/2]

ArrayViewType axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::view ( )

inlineinherited

Returns a view of the array.

See also: ArrayView

◆ view() [2/2]

ConstArrayViewType axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::view ( ) const

inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ initialize()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::initialize	(	IndexType	num_elements,
		IndexType	capacity,
		bool	should_default_construct = `true`
	)

inlineprotectedinherited

Initialize an Array instance with the given number of elements.

Parameters

[in]	num_elements	the number of elements the Array holds.
[in]	capacity	the number of elements to allocate space for.
[in]	should_default_construct	whether to create default-constructed objects in the region [0, num_elements). Defaults to true.

Note: If no capacity or capacity less than num_elements is specified then it will default to at least num_elements * DEFAULT_RESIZE_RATIO.; a capacity is specified for the number of elements to store in the array and does not correspond to the actual bytesize.

Precondition: num_elements >= 0

Postcondition: capacity() >= size(); size() == num_elements; getResizeRatio() == DEFAULT_RESIZE_RATIO

◆ initialize_from_other()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::initialize_from_other	(	const T *	data,
		IndexType	num_elements,
		MemorySpace	data_space,
		bool	user_provided_allocator
	)

inlineprotectedinherited

Helper function for initializing an Array instance with an existing range of elements.

Parameters

[in]	data	pointer to the existing array of elements
[in]	num_elements	the number of elements in the existing array
[in]	data_space	the memory space in which data has been allocated
[in]	user_provided_allocator	true if the Array's allocator ID was provided by the user

◆ resizeImpl()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::resizeImpl	(	const StackArray< IndexType, DIM > &	dims,
		bool	construct_with_values,
		const T *	value = `nullptr`
	)

inlineprotectedinherited

Updates the number of elements stored in the data array.

Parameters

[in]	dims	the number of elements to allocate in each dimension
[in]	construct_with_values	if true, sets new elements in the array to a specified value
[in]	value	pointer to the value to fill new elements in the array with. If null, will default-construct elements in place.

◆ reserveForInsert()

T * axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::reserveForInsert	(	IndexType	n,
		IndexType	pos
	)

inlineprotectedinherited

Make space for a subsequent insertion into the array.

Parameters

[in]	n	the number of elements to insert.
[in]	pos	the position at which to begin the insertion.

Returns: a pointer to the beginning of the insertion space.

Note: Reallocation is done if the new size will exceed the capacity.

◆ reserveForPushBack()

IndexType axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::reserveForPushBack

inlineprotectedinherited

Make space for a subsequent insertion into the array.

Note: This version supports concurrent GPU insertions.; Reallocation is not supported on the GPU.

◆ updateNumElements()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::updateNumElements ( IndexType new_num_elements )

inlineprotectedinherited

Update the number of elements.

Parameters

[in] new_num_elements the new number of elements.

◆ setCapacity()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::setCapacity ( IndexType new_capacity )

inlineprotectedinherited

Set the number of elements allocated for the data array.

Parameters

[in] capacity the new number of elements to allocate.

◆ dynamicRealloc()

void axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::dynamicRealloc ( IndexType new_num_elements )

inlineprotectedinherited

Reallocates the data array when the size exceeds the capacity.

Parameters

[in] new_num_elements the number of elements which exceeds the current capacity.

◆ operator()() [1/2]

template<typename T , int DIM, typename ArrayType >

template<typename... Args>

AXOM_HOST_DEVICE SliceType<sizeof...(Args)> axom::ArrayBase< T, DIM, ArrayType >::operator() ( Args... args )

inlineinherited

Dimension-aware accessor; with N=DIM indices, returns a reference to the given value at that index. Otherwise, returns a sub-array pointed to by the given sub-index.

Parameters

[in] args the parameter pack of indices in each dimension.

Note: equivalent to *(array.data() + idx).

Precondition: sizeof...(Args) <= DIM; 0 <= args[i] < shape()[i] for i in [0, sizeof...(Args))

◆ operator()() [2/2]

template<typename T , int DIM, typename ArrayType >

template<typename... Args>

AXOM_HOST_DEVICE ConstSliceType<sizeof...(Args)> axom::ArrayBase< T, DIM, ArrayType >::operator() ( Args... args ) const

inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ operator[]() [1/4]

template<typename T , int DIM, typename ArrayType >

AXOM_HOST_DEVICE SliceType<1> axom::ArrayBase< T, DIM, ArrayType >::operator[] ( const IndexType idx )

inlineinherited

Scalar accessor; returns a sub-array referenced by the given sub- index, beginning at array(idx, 0...)

Parameters

[in] idx the index of the first dimension.

Precondition: 0 <= idx < shape()[0]

◆ operator[]() [2/4]

template<typename T , int DIM, typename ArrayType >

AXOM_HOST_DEVICE ConstSliceType<1> axom::ArrayBase< T, DIM, ArrayType >::operator[] ( const IndexType idx ) const

inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ operator[]() [3/4]

template<typename T , int DIM, typename ArrayType >

template<int UDim>

AXOM_HOST_DEVICE SliceType<UDim> axom::ArrayBase< T, DIM, ArrayType >::operator[] ( const StackArray< IndexType, UDim > & idx )

inlineinherited

Dimension-aware accessor; with UDim=DIM indices, returns a reference to the given value at that index. Otherwise, returns a sub-array pointed to by the given sub-index.

Parameters

[in] args a stack array of indices in each dimension.

Note: equivalent to *(array.data() + idx).

Precondition: UDim <= DIM; 0 <= args[i] < shape()[i] for i in [0, UDim)

◆ operator[]() [4/4]

template<typename T , int DIM, typename ArrayType >

template<int UDim>

AXOM_HOST_DEVICE ConstSliceType<UDim> axom::ArrayBase< T, DIM, ArrayType >::operator[] ( const StackArray< IndexType, UDim > & idx ) const

inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ flatIndex() [1/2]

template<typename T , int DIM, typename ArrayType >

AXOM_HOST_DEVICE T& axom::ArrayBase< T, DIM, ArrayType >::flatIndex ( const IndexType idx )

inlineinherited

Accessor, returns a reference to the given value. For multidimensional arrays, indexes into the (flat) raw data.

Parameters

[in] idx the position of the value to return.

Note: equivalent to *(array.data() + idx * minStride()).

Precondition: 0 <= idx < asDerived().size()

◆ flatIndex() [2/2]

template<typename T , int DIM, typename ArrayType >

AXOM_HOST_DEVICE RealConstT& axom::ArrayBase< T, DIM, ArrayType >::flatIndex ( const IndexType idx ) const

inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

◆ shape()

template<typename T , int DIM, typename ArrayType >

AXOM_HOST_DEVICE const StackArray<IndexType, DIM>& axom::ArrayBase< T, DIM, ArrayType >::shape ( ) const

inlineinherited

Returns the dimensions of the Array.

References axom::ArrayBase< T, DIM, ArrayType >::m_shape.

◆ mapping()

template<typename T , int DIM, typename ArrayType >

AXOM_HOST_DEVICE const MDMapping<DIM>& axom::ArrayBase< T, DIM, ArrayType >::mapping ( ) const

inlineinherited

Returns the multidimensional mapping for the Array.

References axom::ArrayBase< T, DIM, ArrayType >::m_mapping.

◆ strides()

template<typename T , int DIM, typename ArrayType >

AXOM_HOST_DEVICE const StackArray<IndexType, DIM>& axom::ArrayBase< T, DIM, ArrayType >::strides ( ) const

inlineinherited

Returns the memory strides of the Array.

References axom::ArrayBase< T, DIM, ArrayType >::m_mapping.

◆ minStride()

template<typename T , int DIM, typename ArrayType >

AXOM_HOST_DEVICE IndexType axom::ArrayBase< T, DIM, ArrayType >::minStride ( ) const

inlineinherited

Returns the minimum stride between adjacent items.

References axom::ArrayBase< T, DIM, ArrayType >::m_minStride.

◆ setShape()

template<typename T , int DIM, typename ArrayType >

AXOM_HOST_DEVICE void axom::ArrayBase< T, DIM, ArrayType >::setShape ( const StackArray< IndexType, DIM > & shape_ )

inlineprotectedinherited

Set the shape.

References axom::ArrayBase< T, DIM, ArrayType >::m_shape, and axom::ArrayBase< T, DIM, ArrayType >::updateStrides().

◆ setShapeAndStride()

template<typename T , int DIM, typename ArrayType >

AXOM_SUPPRESS_HD_WARN AXOM_HOST_DEVICE void axom::ArrayBase< T, DIM, ArrayType >::setShapeAndStride	(	const StackArray< IndexType, DIM > &	shape,
		const StackArray< IndexType, DIM > &	stride
	)

inlineprotectedinherited

Set the shape and stride.

References axom::ArrayBase< T, DIM, ArrayType >::m_mapping, axom::ArrayBase< T, DIM, ArrayType >::m_minStride, axom::ArrayBase< T, DIM, ArrayType >::m_shape, and axom::ArrayBase< T, DIM, ArrayType >::shape().

◆ blockSize()

template<typename T , int DIM, typename ArrayType >

IndexType axom::ArrayBase< T, DIM, ArrayType >::blockSize ( ) const

inlineprotectedinherited

Returns the minimum "chunk size" that should be allocated For example, 2 would be the chunk size of a 2D array whose second dimension is of size 2. This is used when resizing/reallocating; it wouldn't make sense to have a capacity of 3 in the array described above.

References axom::ArrayBase< T, DIM, ArrayType >::m_mapping.

◆ updateStrides()

template<typename T , int DIM, typename ArrayType >

AXOM_HOST_DEVICE void axom::ArrayBase< T, DIM, ArrayType >::updateStrides ( int min_stride = 1 )

inlineprotectedinherited

Updates the internal striding information to a row-major format Intended to be called after shape is updated.

References axom::ArrayBase< T, DIM, ArrayType >::m_mapping, axom::ArrayBase< T, DIM, ArrayType >::m_minStride, and axom::ArrayBase< T, DIM, ArrayType >::m_shape.

◆ updateShapeOnInsert()

template<typename T , int DIM, typename ArrayType >

void axom::ArrayBase< T, DIM, ArrayType >::updateShapeOnInsert ( const StackArray< IndexType, DIM > & range_shape )

inlineprotectedinherited

Updates the internal dimensions and striding based on the insertion of a range of elements. Intended to be called after the insertion of a multidimensional subslice.

References axom::StackArray< T, N >::begin(), axom::StackArray< T, N >::end(), axom::ArrayBase< T, DIM, ArrayType >::m_shape, axom::utilities::processAbort(), and axom::ArrayBase< T, DIM, ArrayType >::updateStrides().

Member Data Documentation

◆ DEFAULT_RESIZE_RATIO

constexpr double axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::DEFAULT_RESIZE_RATIO

staticconstexprinherited

◆ MIN_DEFAULT_CAPACITY

constexpr IndexType axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::MIN_DEFAULT_CAPACITY

staticconstexprinherited

◆ space

constexpr MemorySpace axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::space

staticconstexprinherited

◆ m_data

T* axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::m_data

protectedinherited

◆ m_num_elements

IndexType axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::m_num_elements

protectedinherited

The full number of elements in the array i.e., 3 for a 1D Array of size 3, 9 for a 3x3 2D array, etc.

◆ m_capacity

IndexType axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::m_capacity

protectedinherited

◆ m_resize_ratio

double axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::m_resize_ratio

protectedinherited

◆ m_allocator_id

int axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::m_allocator_id

protectedinherited

◆ m_executeOnGPU

bool axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::m_executeOnGPU

protectedinherited

◆ m_arrayOps

OpHelper axom::Array< T, DIM, SPACE, detail::SidreStoragePolicy< T > >::m_arrayOps

protectedinherited

◆ Dims

template<typename T , int DIM, typename ArrayType >

constexpr static int axom::ArrayBase< T, DIM, ArrayType >::Dims = DIM

staticconstexprinherited

◆ m_shape

template<typename T , int DIM, typename ArrayType >

StackArray<IndexType, DIM> axom::ArrayBase< T, DIM, ArrayType >::m_shape

protectedinherited

The extent in each direction.

◆ m_mapping

template<typename T , int DIM, typename ArrayType >

MDMapping<DIM> axom::ArrayBase< T, DIM, ArrayType >::m_mapping

protectedinherited

For converting between multidim indices and offset.

◆ m_minStride

template<typename T , int DIM, typename ArrayType >

IndexType axom::ArrayBase< T, DIM, ArrayType >::m_minStride

protectedinherited

Cached value for optimization.

See also: minStride()

For some reason, computing min stride in minStride() slows down flatIndex() for CUDA and HIP, even though it doesn't seem tricky to optimize. As a work around, we cache the value in m_minStrides and update it when m_mapping changes. BTNG, March 2024.

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

/home/docs/checkouts/readthedocs.org/user_builds/axom/checkouts/main/src/axom/sidre/core/Array.hpp

Public Types

Public Member Functions

Static Public Attributes

Protected Types

Protected Member Functions

Static Protected Member Functions

Protected Attributes

Detailed Description

template<typename T, int DIM = 1> class axom::sidre::Array< T, DIM >

Member Typedef Documentation

◆ BaseArray

◆ value_type

◆ ArrayIterator

◆ ConstArrayIterator

◆ ArrayViewType

◆ ConstArrayViewType

◆ RealConstT

◆ SliceType

◆ ConstSliceType

Constructor & Destructor Documentation

◆ Array() [1/7]

◆ Array() [2/7]

◆ Array() [3/7]

◆ Array() [4/7]

◆ Array() [5/7]

◆ Array() [6/7]

◆ Array() [7/7]

◆ ~Array()

Member Function Documentation

◆ operator=() [1/2]

◆ operator=() [2/2]

◆ isExternal()

◆ getView()

◆ sidreTypeId()

◆ getViewShape()

◆ data() [1/2]

◆ data() [2/2]

◆ to_stack_array()

◆ fill() [1/2]

◆ fill() [2/2]

◆ set()

◆ assign() [1/3]

◆ assign() [2/3]

◆ assign() [3/3]

◆ clear()

◆ insert() [1/8]

◆ insert() [2/8]

◆ insert() [3/8]

◆ insert() [4/8]

◆ insert() [5/8]

◆ insert() [6/8]

◆ insert() [7/8]

◆ insert() [8/8]

◆ append() [1/2]

◆ append() [2/2]

◆ erase() [1/2]

◆ erase() [2/2]

◆ emplace() [1/3]

◆ emplace() [2/3]

◆ emplace() [3/3]

◆ push_back() [1/2]

◆ push_back() [2/2]

◆ emplace_back()

◆ push_back_device() [1/2]

◆ push_back_device() [2/2]

◆ emplace_back_device()

◆ capacity()

◆ reserve()

◆ begin() [1/2]

◆ begin() [2/2]

◆ end() [1/2]

◆ end() [2/2]

◆ front() [1/2]

◆ front() [2/2]

◆ back() [1/2]

◆ back() [2/2]

◆ shrink()

◆ empty()

◆ size()

◆ resize() [1/4]

template<typename T, int DIM = 1>
class axom::sidre::Array< T, DIM >