VertexSimplexInc< M > Class Template Reference

Vertex-simplex incidences in an M-D indexed simplex set. More...

#include <VertexSimplexInc.h>

List of all members.

Public Types
typedef IncidenceContainer::const_iterator	ConstIterator
	A const iterator on the vertex-simplex incidences.
typedef IncidenceContainer::size_type	SizeType
	The size type.
Public Member Functions
Constructors etc.
	VertexSimplexInc ()
	Default constructor. Empty incidence data.
template<typename IndexedSimplex , bool A>
	VertexSimplexInc (const int numVertices, const ads::Array< 1, IndexedSimplex, A > &simplices)
	Construct from the number of vertices and the array of indexed simplices.
template<typename IndexedSimplex , bool A>
void	build (const int numVertices, const ads::Array< 1, IndexedSimplex, A > &simplices)
	Build the vertex-simplex incidences structure.
	VertexSimplexInc (const VertexSimplexInc &other)
	Copy constructor.
VertexSimplexInc &	operator= (const VertexSimplexInc &other)
	Assignment operator.
void	swap (VertexSimplexInc &x)
	Swap data.
	~VertexSimplexInc ()
	Destructor. Leave cleaning up to the containers.
Accessors for the whole set of incidences.
SizeType	getNumVertices () const
	Return the number of vertices.
SizeType	getSize () const
	Return the total number of incidences.
bool	isEmpty () const
	Return true if the total number of incidences is zero.
SizeType	getMaxSize () const
	Return the size of the largest possible array.
SizeType	getMemoryUsage () const
	Return the memory size.
ConstIterator	getBeginning () const
	Return a const iterator to the first value.
ConstIterator	getEnd () const
	Return a const iterator to one past the last value.
Accessors.
SizeType	getSize (const int n) const
	Return the number of incident simplices to the n_th vertex.
bool	isEmpty (const int n) const
	Return true if the n_th vertex has no incident simplices.
ConstIterator	getBeginning (const int n) const
	Return a const iterator to the first incident cell to the n_th vertex.
ConstIterator	getEnd (const int n) const
	Return a const iterator to one past the last incident cell to the n_th vertex.
ConstIterator	operator[] (const int n) const
	Return a const iterator to the first incident cell to the n_th vertex.
ConstIterator	operator() (const int n) const
	Return a const iterator to the first incident cell to the n_th vertex.
int	operator() (const int n, const int m) const
	Return the m_th incident cell of the n_th vertex.
Manipulators.
void	clear ()
	Clear incidences data. Free the memory.
Equality.
bool	operator== (const VertexSimplexInc &x) const
	Return true if the incidences are the same.
bool	operator!= (const VertexSimplexInc &x) const
	Return true if the incidences are not the same.
File I/O.
void	put (std::ostream &out) const
	Write the vertex-simplex incidences.

---

Detailed Description

template<int M>
class VertexSimplexInc< M >

Vertex-simplex incidences in an M-D indexed simplex set.

Parameters:

M

is the simplex dimension.

Note that the space dimension is not relevant as this class deals only with topological information.

---

Constructor & Destructor Documentation

template<int M>

template<typename IndexedSimplex , bool A>

VertexSimplexInc< M >::VertexSimplexInc	(	const int	numVertices,
		const ads::Array< 1, IndexedSimplex, A > &	simplices
	)			[inline]

Construct from the number of vertices and the array of indexed simplices.

IndexedSimplex is an tuple of M+1 integers. It must be subscriptable.

References VertexSimplexInc< M >::build().

---

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

• VertexSimplexInc.h