![]() |
OGRE 14.3
Object-Oriented Graphics Rendering Engine
|
VectorSet is basically a helper to use a vector as a small set container. More...
#include <OgreVectorSet.h>
Public Types | |
typedef SmallVector< T, S >::iterator | iterator |
![]() | |
typedef SuperClass::iterator | iterator |
typedef SuperClass::size_type | size_type |
![]() | |
typedef const T * | const_iterator |
typedef const T * | const_pointer |
typedef const T & | const_reference |
typedef std::reverse_iterator< const_iterator > | const_reverse_iterator |
typedef ptrdiff_t | difference_type |
typedef T * | iterator |
typedef T * | pointer |
typedef T & | reference |
typedef std::reverse_iterator< iterator > | reverse_iterator |
typedef size_t | size_type |
typedef T | value_type |
Public Member Functions | |
iterator | add (const T &item) |
void | addNotExists (const T &item) |
iterator | find (const T &item) |
iterator | findExists (const T &item) |
bool | has (const T &item) |
bool | remove (const T &item) |
void | remove (iterator it) |
void | removeExists (const T &item) |
void | replaceExists (const T &oldItem, const T &newItem) |
![]() | |
SmallVector () | |
SmallVector (const SmallVector &RHS) | |
SmallVector (ItTy S, ItTy E) | |
SmallVector (unsigned Size, const T &Value=T()) | |
const SmallVector & | operator= (const SmallVector &RHS) |
![]() | |
SmallVectorImpl (unsigned N) | |
~SmallVectorImpl () | |
template<typename in_iter> | |
void | append (in_iter in_start, in_iter in_end) |
append - Add the specified range to the end of the SmallVector. | |
void | append (size_type NumInputs, const T &Elt) |
append - Add the specified range to the end of the SmallVector. | |
void | assign (unsigned NumElts, const T &Elt) |
void | clear () |
iterator | erase (iterator I) |
iterator | erase (iterator S, iterator E) |
iterator | insert (iterator I, const T &Elt) |
template<typename ItTy> | |
iterator | insert (iterator I, ItTy From, ItTy To) |
iterator | insert (iterator I, size_type NumToInsert, const T &Elt) |
bool | operator!= (const SmallVectorImpl &RHS) const |
bool | operator< (const SmallVectorImpl &RHS) const |
const SmallVectorImpl & | operator= (const SmallVectorImpl &RHS) |
bool | operator== (const SmallVectorImpl &RHS) const |
void | pop_back () |
T | pop_back_val () |
void | push_back (const T &Elt) |
void | reserve (unsigned N) |
void | resize (unsigned N) |
void | resize (unsigned N, const T &NV) |
void | set_size (unsigned N) |
set_size - Set the array size to | |
void | swap (SmallVectorImpl &RHS) |
![]() | |
SmallVectorTemplateBase (size_t Size) | |
SmallVectorTemplateBase (size_t Size) | |
void | grow (size_t MinSize=0) |
grow - double the size of the allocated memory, guaranteeing space for at least one more element or MinSize if specified. | |
void | grow (size_t MinSize=0) |
grow - double the size of the allocated memory, guaranteeing space for at least one more element or MinSize if specified. | |
![]() | |
SmallVectorTemplateCommon (size_t Size) | |
reference | back () |
const_reference | back () const |
iterator | begin () |
const_iterator | begin () const |
size_t | capacity () const |
capacity - Return the total number of elements in the currently allocated buffer. | |
pointer | data () |
data - Return a pointer to the vector's buffer, even if empty(). | |
const_pointer | data () const |
data - Return a pointer to the vector's buffer, even if empty(). | |
iterator | end () |
const_iterator | end () const |
reference | front () |
const_reference | front () const |
size_type | max_size () const |
reference | operator[] (unsigned idx) |
const_reference | operator[] (unsigned idx) const |
reverse_iterator | rbegin () |
const_reverse_iterator | rbegin () const |
reverse_iterator | rend () |
const_reverse_iterator | rend () const |
size_type | size () const |
![]() | |
bool | empty () const |
Additional Inherited Members | |
![]() | |
static void | destroy_range (T *S, T *E) |
static void | destroy_range (T *S, T *E) |
static void | uninitialized_copy (It1 I, It1 E, It2 Dest) |
uninitialized_copy - Copy the range [I, E) onto the uninitialized memory starting with "Dest", constructing elements into it as needed. | |
static void | uninitialized_copy (It1 I, It1 E, It2 Dest) |
uninitialized_copy - Copy the range [I, E) onto the uninitialized memory starting with "Dest", constructing elements into it as needed. | |
VectorSet is basically a helper to use a vector as a small set container.
Also these functions keep the code clean and fast. You can insert in O(1) time, if you know that it doesn't exists. You can remove in O(1) time, if you know the position of the item.
typedef SmallVector<T,S>::iterator Ogre::VectorSet< T, S >::iterator |
void Ogre::VectorSet< T, S >::addNotExists | ( | const T & | item | ) |
void Ogre::VectorSet< T, S >::remove | ( | iterator | it | ) |
Referenced by remove(), and removeExists().
VectorSet< T, S >::iterator Ogre::VectorSet< T, S >::add | ( | const T & | item | ) |
void Ogre::VectorSet< T, S >::removeExists | ( | const T & | item | ) |
References Ogre::SmallVectorTemplateCommon< T >::end(), find(), OgreAssertDbg, and remove().
bool Ogre::VectorSet< T, S >::remove | ( | const T & | item | ) |
References Ogre::SmallVectorTemplateCommon< T >::end(), find(), and remove().
void Ogre::VectorSet< T, S >::replaceExists | ( | const T & | oldItem, |
const T & | newItem ) |
References Ogre::SmallVectorTemplateCommon< T >::end(), find(), and OgreAssertDbg.
bool Ogre::VectorSet< T, S >::has | ( | const T & | item | ) |
References Ogre::SmallVectorTemplateCommon< T >::end(), and find().
VectorSet< T, S >::iterator Ogre::VectorSet< T, S >::find | ( | const T & | item | ) |
References Ogre::SmallVectorTemplateCommon< T >::begin(), and Ogre::SmallVectorTemplateCommon< T >::end().
Referenced by add(), addNotExists(), findExists(), has(), remove(), removeExists(), and replaceExists().
VectorSet< T, S >::iterator Ogre::VectorSet< T, S >::findExists | ( | const T & | item | ) |
References Ogre::SmallVectorTemplateCommon< T >::end(), find(), and OgreAssertDbg.