Data structure for partitioning with a constant interval grid.

#include <Mesh/DataStructures/partitionconstantdata.h>

Inheritance diagram for PartitionConstantData< T, StoragePolicy >:

Protected Member Functions
	PartitionConstantData (const Vector3d &minDim, const Vector3d &maxDim, double spacing)
	Construct the array without initializing each element.

StoragePolicy::iterator	erase (typename StoragePolicy::iterator iter)

bool	Exists (long x, long y, long z) const

Protected Member Functions inherited from PartitionConstantBase
long	FindCellIndex (const Vector3d &pos, int axis) const
	Find the axis index of the cell that encompasses pos.

long	FindCellIndex (double d, int axis) const
	Find the axis index of the cell that encompasses d, which is the co-ordinate in the axis direction.

Additional Inherited Members
Public Member Functions inherited from PartitionConstantBase
	PartitionConstantBase (const Vector3d &minDim, const Vector3d &maxDim, double spacing)

double	GetGridSpacing () const

long	GetKey (const Vector3d &v) const

long	GetKey (long x, long y, long z) const

const Vector3d &	GetMaxControlVolume () const

const Vector3d &	GetMinControlVolume () const

long	GetNumCellsX () const

long	GetNumCellsY () const

long	GetNumCellsZ () const

bool	ValidIndexes (long x, long y, long z) const

Constructor & Destructor Documentation

◆ PartitionConstantData()

inlineprotected

StoragePolicy::iterator erase ( typename StoragePolicy::iterator iter )

inlineprotected

Erase just the cell pointed to by iter. Note that for a sorted vector storage policy, this will usually be quite expensive.

inlineprotected