Fiber::UniformCartesianArray Class Reference [Multidimensional arrays whose values are direct products.]

Convenience class for procedural linear arrays in cartesian coordinates. More...

#include <UniformCartesianArray.hpp>

List of all members.

Classes

• struct Exception

Public Member Functions

• UniformCartesianArray (const Eagle::point3 &start, const MultiIndex< 3 > &dims, const Eagle::point3 &end, const MemBase::Creator_t &C=MemCore::NullPtr()) throw (const Exception&)

  Construct a uniform cartesian array from corner coordinates.
  

• UniformCartesianArray (const Eagle::BoundingBox &BBox, const MultiIndex< 3 > &dims, const MemBase::Creator_t &C=MemCore::NullPtr()) throw (const Exception&)

  Construct a uniform cartesian array from bounding box.
  

• UniformCartesianArray (const MultiIndex< 3 > &dims, const Eagle::point3 &start, const Eagle::tvector3 &delta, const MemBase::Creator_t &C=MemCore::NullPtr())

  Construct a uniform cartesian array from origin start and tangential vector expressing the diagonal of a grid cell.
  

• UniformCartesianArray (const MultiIndex< 3 > &dims, const Eagle::point3 &start, const Eagle::point3 &delta, const MemBase::Creator_t &C=MemCore::NullPtr())

  Construct a uniform cartesian array from origin point and the first point of the one grid cell diagonally across.
  

• ~UniformCartesianArray ()

  Destructor, a necessary evil.
  

• Eagle::tvector3 cell_diagonal () const

  Return the "size" of a cell as a tangential vector that crosses the diagonal corners of a cell.
  

---

Detailed Description

Convenience class for procedural linear arrays in cartesian coordinates.

---

Constructor & Destructor Documentation

Fiber::UniformCartesianArray::UniformCartesianArray	(	const Eagle::point3 &	start,
		const MultiIndex< 3 > &	dims,
		const Eagle::point3 &	end,
		const MemBase::Creator_t &	C = MemCore::NullPtr()
	)			throw (const Exception&) [inline]

Construct a uniform cartesian array from corner coordinates.

Note: dims must be larger than two in each dimension, we must have at least two points here to cover a volume, otherwise it's all nuts.

Fiber::UniformCartesianArray::UniformCartesianArray	(	const Eagle::BoundingBox &	BBox,
		const MultiIndex< 3 > &	dims,
		const MemBase::Creator_t &	C = MemCore::NullPtr()
	)			throw (const Exception&) [inline]

Construct a uniform cartesian array from bounding box.

Note: dims must be larger than two in each dimension, we must have at least two points here to cover a volume, otherwise it's all nuts.

Fiber::UniformCartesianArray::UniformCartesianArray	(	const MultiIndex< 3 > &	dims,
		const Eagle::point3 &	start,
		const Eagle::point3 &	delta,
		const MemBase::Creator_t &	C = MemCore::NullPtr()
	)			[inline]

Construct a uniform cartesian array from origin point and the first point of the one grid cell diagonally across.

Same as using a tangential vector for expressing the cell size.