A hashed vector. More...

#include <OgreCommon.h>

Public Types
typedef VectorImpl::const_iterator	const_iterator

typedef VectorImpl::const_reference	const_reference

typedef VectorImpl::const_reverse_iterator	const_reverse_iterator

typedef VectorImpl::difference_type	difference_type

typedef VectorImpl::iterator	iterator

typedef VectorImpl::pointer	pointer

typedef VectorImpl::reference	reference

typedef VectorImpl::reverse_iterator	reverse_iterator

typedef VectorImpl::size_type	size_type

typedef VectorImpl::value_type	value_type

typedef std::vector< T, STLAllocator< T, GeneralAllocPolicy > >	VectorImpl

Public Member Functions
	HashedVector ()

	HashedVector (const HashedVector< T > &rhs)

template<class InputIterator >
	HashedVector (InputIterator a, InputIterator b)

	HashedVector (size_type n)

	HashedVector (size_type n, const T &t)

	~HashedVector ()

reference	at (size_type n)

const_reference	at (size_type n) const

reference	back ()

const_reference	back () const

iterator	begin ()

const_iterator	begin () const

size_type	capacity () const

void	clear ()

void	dirtyHash ()

bool	empty () const

iterator	end ()

const_iterator	end () const

iterator	erase (iterator first, iterator last)

iterator	erase (iterator pos)

reference	front ()

const_reference	front () const

uint32	getHash () const
	Get the hash value. More...

iterator	insert (iterator pos, const T &t)

template<class InputIterator >
void	insert (iterator pos, InputIterator f, InputIterator l)

void	insert (iterator pos, size_type n, const T &x)

bool	isHashDirty () const

size_type	max_size () const

bool	operator< (const HashedVector< T > &b)

HashedVector< T > &	operator= (const HashedVector< T > &rhs)

bool	operator== (const HashedVector< T > &b)

reference	operator[] (size_type n)

const_reference	operator[] (size_type n) const

void	pop_back ()

void	push_back (const T &t)

reverse_iterator	rbegin ()

const_reverse_iterator	rbegin () const

reverse_iterator	rend ()

const_reverse_iterator	rend () const

void	reserve (size_t t)

void	resize (size_type n, const T &t=T())

size_type	size () const

void	swap (HashedVector< T > &rhs)

Detailed Description

template<typename T>
class Ogre::HashedVector< T >

A hashed vector.

Member Typedef Documentation

◆ const_iterator

template<typename T>

typedef VectorImpl::const_iterator Ogre::HashedVector< T >::const_iterator

◆ const_reference

template<typename T>

typedef VectorImpl::const_reference Ogre::HashedVector< T >::const_reference

◆ const_reverse_iterator

template<typename T>

typedef VectorImpl::const_reverse_iterator Ogre::HashedVector< T >::const_reverse_iterator

◆ difference_type

template<typename T>

typedef VectorImpl::difference_type Ogre::HashedVector< T >::difference_type

◆ iterator

template<typename T>

typedef VectorImpl::iterator Ogre::HashedVector< T >::iterator

◆ pointer

template<typename T>

typedef VectorImpl::pointer Ogre::HashedVector< T >::pointer

◆ reference

template<typename T>

typedef VectorImpl::reference Ogre::HashedVector< T >::reference

◆ reverse_iterator

template<typename T>

typedef VectorImpl::reverse_iterator Ogre::HashedVector< T >::reverse_iterator

◆ size_type

template<typename T>

typedef VectorImpl::size_type Ogre::HashedVector< T >::size_type

◆ value_type

template<typename T>

typedef VectorImpl::value_type Ogre::HashedVector< T >::value_type

◆ VectorImpl

template<typename T>

typedef std::vector<T, STLAllocator<T, GeneralAllocPolicy> > Ogre::HashedVector< T >::VectorImpl

Constructor & Destructor Documentation

◆ HashedVector() [1/5]

template<typename T>

Ogre::HashedVector< T >::HashedVector ( )

inline

◆ HashedVector() [2/5]

template<typename T>

Ogre::HashedVector< T >::HashedVector ( size_type n )

inline

◆ HashedVector() [3/5]

template<typename T>

Ogre::HashedVector< T >::HashedVector	(	size_type	n,
		const T &	t
	)

inline

◆ HashedVector() [4/5]

template<typename T>

Ogre::HashedVector< T >::HashedVector ( const HashedVector< T > & rhs )

inline

◆ HashedVector() [5/5]

template<typename T>

template<class InputIterator >

Ogre::HashedVector< T >::HashedVector	(	InputIterator	a,
		InputIterator	b
	)

inline

◆ ~HashedVector()

template<typename T>

Ogre::HashedVector< T >::~HashedVector ( )

inline

Member Function Documentation

◆ at() [1/2]

template<typename T>

reference Ogre::HashedVector< T >::at ( size_type n )

inline

◆ at() [2/2]

template<typename T>

const_reference Ogre::HashedVector< T >::at ( size_type n ) const

inline

◆ back() [1/2]

template<typename T>

reference Ogre::HashedVector< T >::back ( )

inline

◆ back() [2/2]

template<typename T>

const_reference Ogre::HashedVector< T >::back ( ) const

inline

◆ begin() [1/2]

template<typename T>

iterator Ogre::HashedVector< T >::begin ( )

inline

◆ begin() [2/2]

template<typename T>

const_iterator Ogre::HashedVector< T >::begin ( ) const

inline

◆ capacity()

template<typename T>

size_type Ogre::HashedVector< T >::capacity ( ) const

inline

◆ clear()

template<typename T>

void Ogre::HashedVector< T >::clear ( )

inline

◆ dirtyHash()

template<typename T>

void Ogre::HashedVector< T >::dirtyHash ( )

inline

◆ empty()

template<typename T>

bool Ogre::HashedVector< T >::empty ( ) const

inline

◆ end() [1/2]

template<typename T>

iterator Ogre::HashedVector< T >::end ( )

inline

Referenced by Ogre::HashedVector< LightClosest >::insert().

◆ end() [2/2]

template<typename T>

const_iterator Ogre::HashedVector< T >::end ( ) const

inline

◆ erase() [1/2]

template<typename T>

iterator Ogre::HashedVector< T >::erase	(	iterator	first,
		iterator	last
	)

inline

◆ erase() [2/2]

template<typename T>

iterator Ogre::HashedVector< T >::erase ( iterator pos )

inline

◆ front() [1/2]

template<typename T>

reference Ogre::HashedVector< T >::front ( )

inline

◆ front() [2/2]

template<typename T>

const_reference Ogre::HashedVector< T >::front ( ) const

inline

◆ getHash()

template<typename T>

uint32 Ogre::HashedVector< T >::getHash ( ) const

inline

Get the hash value.

◆ insert() [1/3]

template<typename T>

iterator Ogre::HashedVector< T >::insert	(	iterator	pos,
		const T &	t
	)

inline

◆ insert() [2/3]

template<typename T>

template<class InputIterator >

void Ogre::HashedVector< T >::insert	(	iterator	pos,
		InputIterator	f,
		InputIterator	l
	)

inline

◆ insert() [3/3]

template<typename T>

void Ogre::HashedVector< T >::insert	(	iterator	pos,
		size_type	n,
		const T &	x
	)

inline

◆ isHashDirty()

template<typename T>

bool Ogre::HashedVector< T >::isHashDirty ( ) const

inline

Referenced by Ogre::HashedVector< LightClosest >::getHash(), and Ogre::HashedVector< LightClosest >::push_back().

◆ max_size()

template<typename T>

size_type Ogre::HashedVector< T >::max_size ( ) const

inline

◆ operator<()

template<typename T>

bool Ogre::HashedVector< T >::operator< ( const HashedVector< T > & b )

inline

◆ operator=()

template<typename T>

HashedVector<T>& Ogre::HashedVector< T >::operator= ( const HashedVector< T > & rhs )

inline

◆ operator==()

template<typename T>

bool Ogre::HashedVector< T >::operator== ( const HashedVector< T > & b )

inline

◆ operator[]() [1/2]

template<typename T>

reference Ogre::HashedVector< T >::operator[] ( size_type n )

inline

◆ operator[]() [2/2]

template<typename T>

const_reference Ogre::HashedVector< T >::operator[] ( size_type n ) const

inline

◆ pop_back()

template<typename T>

void Ogre::HashedVector< T >::pop_back ( )

inline

◆ push_back()

template<typename T>

void Ogre::HashedVector< T >::push_back ( const T & t )

inline

◆ rbegin() [1/2]

template<typename T>

reverse_iterator Ogre::HashedVector< T >::rbegin ( )

inline

◆ rbegin() [2/2]

template<typename T>

const_reverse_iterator Ogre::HashedVector< T >::rbegin ( ) const

inline

◆ rend() [1/2]

template<typename T>

reverse_iterator Ogre::HashedVector< T >::rend ( )

inline

◆ rend() [2/2]

template<typename T>

const_reverse_iterator Ogre::HashedVector< T >::rend ( ) const

inline

◆ reserve()

template<typename T>

void Ogre::HashedVector< T >::reserve ( size_t t )

inline

◆ resize()

template<typename T>

void Ogre::HashedVector< T >::resize	(	size_type	n,
		const T &	t = `T()`
	)

inline

◆ size()

template<typename T>

size_type Ogre::HashedVector< T >::size ( ) const

inline

Referenced by Ogre::HashedVector< LightClosest >::resize().

◆ swap()

template<typename T>

void Ogre::HashedVector< T >::swap ( HashedVector< T > & rhs )

inline

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

OgreCommon.h

Public Types

Public Member Functions

Detailed Description

template<typename T> class Ogre::HashedVector< T >

Member Typedef Documentation

◆ const_iterator

◆ const_reference

◆ const_reverse_iterator

◆ difference_type

◆ iterator

◆ pointer

◆ reference

◆ reverse_iterator

◆ size_type

◆ value_type

◆ VectorImpl

Constructor & Destructor Documentation

◆ HashedVector() [1/5]

◆ HashedVector() [2/5]

◆ HashedVector() [3/5]

◆ HashedVector() [4/5]

◆ HashedVector() [5/5]

◆ ~HashedVector()

Member Function Documentation

◆ at() [1/2]

◆ at() [2/2]

◆ back() [1/2]

◆ back() [2/2]

◆ begin() [1/2]

◆ begin() [2/2]

◆ capacity()

◆ clear()

◆ dirtyHash()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ erase() [1/2]

◆ erase() [2/2]

◆ front() [1/2]

◆ front() [2/2]

◆ getHash()

◆ insert() [1/3]

◆ insert() [2/3]

◆ insert() [3/3]

◆ isHashDirty()

◆ max_size()

◆ operator<()

◆ operator=()

◆ operator==()

◆ operator[]() [1/2]

◆ operator[]() [2/2]

◆ pop_back()

◆ push_back()

◆ rbegin() [1/2]

◆ rbegin() [2/2]

◆ rend() [1/2]

◆ rend() [2/2]

◆ reserve()

◆ resize()

◆ size()

◆ swap()

template<typename T>
class Ogre::HashedVector< T >