#include <gim_array.h>
Public Member Functions | |
| void | destroyData () |
| bool | resizeData (GUINT newsize) |
| bool | growingCheck () |
| bool | reserve (GUINT size) |
| void | clear_range (GUINT start_range) |
| void | clear () |
| void | clear_memory () |
| gim_array () | |
| gim_array (GUINT reservesize) | |
| ~gim_array () | |
| GUINT | size () const |
| GUINT | max_size () const |
| T & | operator[] (size_t i) |
| const T & | operator[] (size_t i) const |
| T * | pointer () |
| const T * | pointer () const |
| T * | get_pointer_at (GUINT i) |
| const T * | get_pointer_at (GUINT i) const |
| T & | at (GUINT i) |
| const T & | at (GUINT i) const |
| T & | front () |
| const T & | front () const |
| T & | back () |
| const T & | back () const |
| void | swap (GUINT i, GUINT j) |
| void | push_back (const T &obj) |
| void | push_back_mem () |
| Simply increase the m_size, doesn't call the new element constructor. | |
| void | push_back_memcpy (const T &obj) |
| void | pop_back () |
| void | pop_back_mem () |
| Simply decrease the m_size, doesn't call the deleted element destructor. | |
| void | erase (GUINT index) |
| fast erase | |
| void | erase_sorted_mem (GUINT index) |
| void | erase_sorted (GUINT index) |
| void | insert_mem (GUINT index) |
| void | insert (const T &obj, GUINT index) |
| void | resize (GUINT size, bool call_constructor=true) |
| void | refit () |
Public Attributes | |
| T * | m_data |
| GUINT | m_size |
| GUINT | m_allocated_size |
| void gim_array< T >::destroyData | ( | ) | [inline] |
protected operations
| bool gim_array< T >::resizeData | ( | GUINT | newsize | ) | [inline] |
| bool gim_array< T >::growingCheck | ( | ) | [inline] |
| bool gim_array< T >::reserve | ( | GUINT | size | ) | [inline] |
public operations
| void gim_array< T >::clear_range | ( | GUINT | start_range | ) | [inline] |
| void gim_array< T >::clear | ( | ) | [inline] |
| void gim_array< T >::clear_memory | ( | ) | [inline] |
| GUINT gim_array< T >::size | ( | ) | const [inline] |
| GUINT gim_array< T >::max_size | ( | ) | const [inline] |
| T& gim_array< T >::operator[] | ( | size_t | i | ) | [inline] |
| const T& gim_array< T >::operator[] | ( | size_t | i | ) | const [inline] |
| T* gim_array< T >::pointer | ( | ) | [inline] |
| const T* gim_array< T >::pointer | ( | ) | const [inline] |
| T* gim_array< T >::get_pointer_at | ( | GUINT | i | ) | [inline] |
| const T* gim_array< T >::get_pointer_at | ( | GUINT | i | ) | const [inline] |
| T& gim_array< T >::at | ( | GUINT | i | ) | [inline] |
| const T& gim_array< T >::at | ( | GUINT | i | ) | const [inline] |
| T& gim_array< T >::front | ( | ) | [inline] |
| const T& gim_array< T >::front | ( | ) | const [inline] |
| T& gim_array< T >::back | ( | ) | [inline] |
| const T& gim_array< T >::back | ( | ) | const [inline] |
| void gim_array< T >::swap | ( | GUINT | i, | |
| GUINT | j | |||
| ) | [inline] |
| void gim_array< T >::push_back | ( | const T & | obj | ) | [inline] |
| void gim_array< T >::push_back_mem | ( | ) | [inline] |
Simply increase the m_size, doesn't call the new element constructor.
| void gim_array< T >::push_back_memcpy | ( | const T & | obj | ) | [inline] |
| void gim_array< T >::pop_back | ( | ) | [inline] |
| void gim_array< T >::pop_back_mem | ( | ) | [inline] |
Simply decrease the m_size, doesn't call the deleted element destructor.
| void gim_array< T >::erase | ( | GUINT | index | ) | [inline] |
fast erase
| void gim_array< T >::erase_sorted_mem | ( | GUINT | index | ) | [inline] |
| void gim_array< T >::erase_sorted | ( | GUINT | index | ) | [inline] |
| void gim_array< T >::insert_mem | ( | GUINT | index | ) | [inline] |
| void gim_array< T >::insert | ( | const T & | obj, | |
| GUINT | index | |||
| ) | [inline] |
| void gim_array< T >::resize | ( | GUINT | size, | |
| bool | call_constructor = true | |||
| ) | [inline] |
| void gim_array< T >::refit | ( | ) | [inline] |
| GUINT gim_array< T >::m_allocated_size |
1.5.2