Elaztek Developer Hub
Switch Project...
Blamite Game Engine - blam!  00346.12.11.21.0529.blamite
The core library for the Blamite Game Engine.
Public Types | Public Member Functions | Public Attributes | List of all members
ImVector< T > Struct Template Reference

#include <imgui.h>

Public Types

typedef T value_type
 
typedef value_type * iterator
 

Public Member Functions

 ImVector ()
 
 ImVector (const ImVector< T > &src)
 
ImVector< T > & operator= (const ImVector< T > &src)
 
 ~ImVector ()
 
bool empty () const
 
int size () const
 
int size_in_bytes () const
 
int capacity () const
 
T & operator[] (int i)
 
const T & operator[] (int i) const
 
void clear ()
 
T * begin ()
 
const T * begin () const
 
T * end ()
 
const T * end () const
 
T & front ()
 
const T & front () const
 
T & back ()
 
const T & back () const
 
void swap (ImVector< T > &rhs)
 
int _grow_capacity (int sz) const
 
void resize (int new_size)
 
void resize (int new_size, const T &v)
 
void reserve (int new_capacity)
 
void push_back (const T &v)
 
void pop_back ()
 
void push_front (const T &v)
 
T * erase (const T *it)
 
T * erase (const T *it, const T *it_last)
 
T * erase_unsorted (const T *it)
 
T * insert (const T *it, const T &v)
 
bool contains (const T &v) const
 
T * find (const T &v)
 
const T * find (const T &v) const
 
bool find_erase (const T &v)
 
bool find_erase_unsorted (const T &v)
 
int index_from_ptr (const T *it) const
 

Public Attributes

const typedef value_type * const_iterator
 
int Size
 
int Capacity
 
T * Data
 

Member Typedef Documentation

◆ iterator

template<typename T >
typedef value_type* ImVector< T >::iterator

◆ value_type

template<typename T >
typedef T ImVector< T >::value_type

Constructor & Destructor Documentation

◆ ImVector() [1/2]

template<typename T >
ImVector< T >::ImVector ( )
inline

◆ ImVector() [2/2]

template<typename T >
ImVector< T >::ImVector ( const ImVector< T > &  src)
inline

◆ ~ImVector()

template<typename T >
ImVector< T >::~ImVector ( )
inline

Member Function Documentation

◆ _grow_capacity()

template<typename T >
int ImVector< T >::_grow_capacity ( int  sz) const
inline

◆ back() [1/2]

template<typename T >
T& ImVector< T >::back ( )
inline

◆ back() [2/2]

template<typename T >
const T& ImVector< T >::back ( ) const
inline

◆ begin() [1/2]

template<typename T >
T* ImVector< T >::begin ( )
inline

◆ begin() [2/2]

template<typename T >
const T* ImVector< T >::begin ( ) const
inline

◆ capacity()

template<typename T >
int ImVector< T >::capacity ( ) const
inline

◆ clear()

template<typename T >
void ImVector< T >::clear ( )
inline

◆ contains()

template<typename T >
bool ImVector< T >::contains ( const T &  v) const
inline

◆ empty()

template<typename T >
bool ImVector< T >::empty ( ) const
inline

◆ end() [1/2]

template<typename T >
T* ImVector< T >::end ( )
inline

◆ end() [2/2]

template<typename T >
const T* ImVector< T >::end ( ) const
inline

◆ erase() [1/2]

template<typename T >
T* ImVector< T >::erase ( const T *  it)
inline

◆ erase() [2/2]

template<typename T >
T* ImVector< T >::erase ( const T *  it,
const T *  it_last 
)
inline

◆ erase_unsorted()

template<typename T >
T* ImVector< T >::erase_unsorted ( const T *  it)
inline

◆ find() [1/2]

template<typename T >
T* ImVector< T >::find ( const T &  v)
inline

◆ find() [2/2]

template<typename T >
const T* ImVector< T >::find ( const T &  v) const
inline

◆ find_erase()

template<typename T >
bool ImVector< T >::find_erase ( const T &  v)
inline

◆ find_erase_unsorted()

template<typename T >
bool ImVector< T >::find_erase_unsorted ( const T &  v)
inline

◆ front() [1/2]

template<typename T >
T& ImVector< T >::front ( )
inline

◆ front() [2/2]

template<typename T >
const T& ImVector< T >::front ( ) const
inline

◆ index_from_ptr()

template<typename T >
int ImVector< T >::index_from_ptr ( const T *  it) const
inline

◆ insert()

template<typename T >
T* ImVector< T >::insert ( const T *  it,
const T &  v 
)
inline

◆ operator=()

template<typename T >
ImVector<T>& ImVector< T >::operator= ( const ImVector< T > &  src)
inline

◆ operator[]() [1/2]

template<typename T >
T& ImVector< T >::operator[] ( int  i)
inline

◆ operator[]() [2/2]

template<typename T >
const T& ImVector< T >::operator[] ( int  i) const
inline

◆ pop_back()

template<typename T >
void ImVector< T >::pop_back ( )
inline

◆ push_back()

template<typename T >
void ImVector< T >::push_back ( const T &  v)
inline

◆ push_front()

template<typename T >
void ImVector< T >::push_front ( const T &  v)
inline

◆ reserve()

template<typename T >
void ImVector< T >::reserve ( int  new_capacity)
inline

◆ resize() [1/2]

template<typename T >
void ImVector< T >::resize ( int  new_size)
inline

◆ resize() [2/2]

template<typename T >
void ImVector< T >::resize ( int  new_size,
const T &  v 
)
inline

◆ size()

template<typename T >
int ImVector< T >::size ( ) const
inline

◆ size_in_bytes()

template<typename T >
int ImVector< T >::size_in_bytes ( ) const
inline

◆ swap()

template<typename T >
void ImVector< T >::swap ( ImVector< T > &  rhs)
inline

Member Data Documentation

◆ Capacity

template<typename T >
int ImVector< T >::Capacity

◆ const_iterator

template<typename T >
const typedef value_type* ImVector< T >::const_iterator

◆ Data

template<typename T >
T* ImVector< T >::Data

◆ Size

template<typename T >
int ImVector< T >::Size
The documentation for this struct was generated from the following file: