PartitionConstantTraits< T, StorageArrayT > Class Template Reference

Traits for the storage policy (also defines the data data member).

#include <Mesh/DataStructures/partitionconstantdata.h>

Inheritance diagram for PartitionConstantTraits< T, StorageArrayT >:

Public Types
typedef std::vector< T * >	CellType
using	const_iterator = typename container_type::const_iterator
using	const_reference = typename container_type::const_reference
using	const_reverse_iterator = typename container_type::const_reverse_iterator
using	container_type = StorageArrayT
	Make the type of this array easy to refer to in client code.
using	iterator = typename container_type::iterator
using	reference = typename container_type::reference
using	reverse_iterator = typename container_type::reverse_iterator
using	size_type = typename container_type::size_type
using	value_type = typename container_type::value_type

Public Member Functions
reference	back ()
const_reference	back () const
iterator	begin ()
const_iterator	begin () const
void	clear ()
unsigned	count (long key) const
bool	empty () const
iterator	end ()
const_iterator	end () const
reference	front ()
const_reference	front () const
iterator	lower_bound (long key)
const_iterator	lower_bound (long key) const
size_type	max_size () const
void	push_back (const value_type &c)
reverse_iterator	rbegin ()
const_reverse_iterator	rbegin () const
reverse_iterator	rend ()
const_reverse_iterator	rend () const
void	reserve (size_type s)
	Reserve space for s items (if the data type supports it).
size_type	size () const
iterator	upper_bound (long key)
const_iterator	upper_bound (long key) const

Protected Member Functions
iterator	erase (iterator iter)
iterator	FindKeyCell (long key)
const_iterator	FindKeyCell (long key) const
CellType &	GetKeyCell (long key)
const CellType &	GetKeyCell (long key) const

Member Typedef Documentation

CellType

typedef std::vector<T*> CellType

const_iterator

using const_iterator = typename container_type::const_iterator

const_reference

using const_reference = typename container_type::const_reference

const_reverse_iterator

using const_reverse_iterator = typename container_type::const_reverse_iterator

container_type

using container_type = StorageArrayT

iterator

using iterator = typename container_type::iterator

reference

using reference = typename container_type::reference

reverse_iterator

using reverse_iterator = typename container_type::reverse_iterator

size_type

using size_type = typename container_type::size_type

value_type

using value_type = typename container_type::value_type

Member Function Documentation

back() [1/2]

reference back ( )

inline

back() [2/2]

const_reference back ( ) const

inline

begin() [1/2]

iterator begin ( )

inline

begin() [2/2]

const_iterator begin ( ) const

inline

clear()

void clear ( )

inline

count()

unsigned count ( long  key ) const

inline

Returns

The number of key items in the container. Depending on the container type, this may be an efficient way to test if key is in the container (such as for std::map).

empty()

bool empty ( ) const

inline

end() [1/2]

iterator end ( )

inline

end() [2/2]

const_iterator end ( ) const

inline

erase()

iterator erase ( iterator  iter )

inlineprotected

FindKeyCell() [1/2]

iterator FindKeyCell ( long  key )

inlineprotected

FindKeyCell() [2/2]

const_iterator FindKeyCell ( long  key ) const

inlineprotected

front() [1/2]

reference front ( )

inline

front() [2/2]

const_reference front ( ) const

inline

GetKeyCell() [1/2]

CellType & GetKeyCell ( long  key )

inlineprotected

GetKeyCell() [2/2]

const CellType & GetKeyCell ( long  key ) const

inlineprotected

lower_bound() [1/2]

iterator lower_bound ( long  key )

inline

lower_bound() [2/2]

const_iterator lower_bound ( long  key ) const

inline

max_size()

size_type max_size ( ) const

inline

push_back()

void push_back ( const value_type &  c )

inline

Add c to the end of the array. This should only be used to add items before the array is sorted, which usually occurs when the array is first built. Not all data types support this.

rbegin() [1/2]

reverse_iterator rbegin ( )

inline

rbegin() [2/2]

const_reverse_iterator rbegin ( ) const

inline

rend() [1/2]

reverse_iterator rend ( )

inline

rend() [2/2]

const_reverse_iterator rend ( ) const

inline

reserve()

void reserve ( size_type  s )

inline

size()

size_type size ( ) const

inline

upper_bound() [1/2]

iterator upper_bound ( long  key )

inline

upper_bound() [2/2]

const_iterator upper_bound ( long  key ) const

inline