Steppable 0.0.1
A CAS project written from scratch in C++
Loading...
Searching...
No Matches
ImVector< T > Struct Template Reference

#include <imgui.h>

Public Types

typedef T value_type
 
typedef value_typeiterator
 
typedef const value_typeconst_iterator
 

Public Member Functions

 ImVector ()
 
 ImVector (const ImVector< T > &src)
 
ImVector< T > & operator= (const ImVector< T > &src)
 
 ~ImVector ()
 
void clear ()
 
void clear_delete ()
 
void clear_destruct ()
 
bool empty () const
 
int size () const
 
int size_in_bytes () const
 
int max_size () const
 
int capacity () const
 
T & operator[] (int i)
 
const T & operator[] (int i) const
 
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 shrink (int new_size)
 
void reserve (int new_capacity)
 
void reserve_discard (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
 
int find_index (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

int Size
 
int Capacity
 
T * Data
 

Member Typedef Documentation

◆ const_iterator

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

◆ 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
Here is the caller graph for this function:

◆ ImVector() [2/2]

template<typename T>
ImVector< T >::ImVector ( const ImVector< T > & src)
inline
Here is the call graph for this function:

◆ ~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
Here is the caller graph for this function:

◆ back() [1/2]

template<typename T>
T & ImVector< T >::back ( )
inline
Here is the caller graph for this function:

◆ back() [2/2]

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

◆ begin() [1/2]

template<typename T>
T * ImVector< T >::begin ( )
inline
Here is the caller graph for this function:

◆ 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
Here is the caller graph for this function:

◆ clear_delete()

template<typename T>
void ImVector< T >::clear_delete ( )
inline
Here is the call graph for this function:
Here is the caller graph for this function:

◆ clear_destruct()

template<typename T>
void ImVector< T >::clear_destruct ( )
inline
Here is the call graph for this function:
Here is the caller graph for this function:

◆ contains()

template<typename T>
bool ImVector< T >::contains ( const T & v) const
inline
Here is the caller graph for this function:

◆ empty()

template<typename T>
bool ImVector< T >::empty ( ) const
inline
Here is the caller graph for this function:

◆ 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
Here is the caller graph for this function:

◆ 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
Here is the caller graph for this function:

◆ find() [1/2]

template<typename T>
T * ImVector< T >::find ( const T & v)
inline
Here is the caller graph for this function:

◆ 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
Here is the call graph for this function:
Here is the caller graph for this function:

◆ find_erase_unsorted()

template<typename T>
bool ImVector< T >::find_erase_unsorted ( const T & v)
inline
Here is the call graph for this function:

◆ find_index()

template<typename T>
int ImVector< T >::find_index ( const T & v) const
inline
Here is the call graph for this function:

◆ 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
Here is the caller graph for this function:

◆ insert()

template<typename T>
T * ImVector< T >::insert ( const T * it,
const T & v )
inline
Here is the call graph for this function:
Here is the caller graph for this function:

◆ max_size()

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

◆ operator=()

template<typename T>
ImVector< T > & ImVector< T >::operator= ( const ImVector< T > & src)
inline
Here is the call graph for this function:
Here is the caller graph for this function:

◆ 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
Here is the caller graph for this function:

◆ push_back()

template<typename T>
void ImVector< T >::push_back ( const T & v)
inline
Here is the call graph for this function:

◆ push_front()

template<typename T>
void ImVector< T >::push_front ( const T & v)
inline
Here is the call graph for this function:
Here is the caller graph for this function:

◆ reserve()

template<typename T>
void ImVector< T >::reserve ( int new_capacity)
inline
Here is the caller graph for this function:

◆ reserve_discard()

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

◆ resize() [1/2]

template<typename T>
void ImVector< T >::resize ( int new_size)
inline
Here is the call graph for this function:
Here is the caller graph for this function:

◆ resize() [2/2]

template<typename T>
void ImVector< T >::resize ( int new_size,
const T & v )
inline
Here is the call graph for this function:

◆ shrink()

template<typename T>
void ImVector< T >::shrink ( int new_size)
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
Here is the caller graph for this function:

◆ swap()

template<typename T>
void ImVector< T >::swap ( ImVector< T > & rhs)
inline
Here is the call graph for this function:
Here is the caller graph for this function:

Member Data Documentation

◆ Capacity

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

◆ 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:
Untitled