|
|
|
|
|
|
|
|
Modules Namespace List Class Hierarchy Alphabetical List Compound List Namespace Members Compound Members Related Pages
acdk::lang::sys::core_vector< T > Class Template Reference#include <core_vector.h>
List of all members.
Detailed Description
template<class T>
class acdk::lang::sys::core_vector< T >
replacement for the std::vector class.
access outside valid range will throw acdk::lang::RIndexOutOfBoundsException
|
Public Types |
| typedef T | value_type |
| typedef T * | iterator |
| typedef const T * | const_iterator |
typedef core_vector_reverse_iterator<
T > | reverse_iterator |
typedef core_vector_iterator<
T > | const_reverse_iterator |
Public Member Functions |
| | core_vector () |
| | core_vector (int initsize, const T &fillwith=T()) |
| | core_vector (int initsize, int initcap, const T &fillwith) |
| | core_vector (const core_vector< T > &other) |
| | copy constructor
|
| | ~core_vector () |
| core_vector< T > & | operator= (const core_vector< T > &other) |
| bool | operator== (const core_vector< T > &other) const |
| bool | operator!= (const core_vector< T > &other) const |
| void | assign (const_iterator b, const_iterator e) |
| void | insert (iterator it, const_iterator first, const_iterator last) |
| void | insert (int idx, const T &elem) |
| void | ensureSize (int newsize, const T &fillwith=T()) |
| | ensure that the size of the vector is at least given newize.
|
| void | resize (int newsize, const T &fillwith=T()) |
| | resize the array on given newsize if newsize > as size() new slots will be filled with fillwith
|
| void | ensureCapacity (int newcap) |
| void | reserve (int newcap) |
| | STL compatibility.
|
| void | _ensureCapacity (int newcap) |
| T & | operator[] (int idx) |
| const T & | operator[] (int idx) const |
| T & | at (int idx) |
| const T & | at (int idx) const |
| void | add (const T &el) |
| void | push_back (const T &el) |
| void | addLast (const T &el) |
| void | addFirst (const T &el) |
| int | size () const |
| int | capacity () const |
| bool | empty () const |
| T & | front () |
| const T & | front () const |
| T & | back () |
| const T & | back () const |
| void | pop_back () |
| void | pop_front () |
| bool | hasElement (const T &el) const |
| void | clear () |
| iterator | erase (iterator it) |
| iterator | erase (iterator it, iterator eit) |
| bool | deleteElement (const T &el) |
| const_iterator | find (const T &t) const |
| iterator | find (const T &t) |
| iterator | begin () |
| iterator | end () |
| const_iterator | begin () const |
| const_iterator | end () const |
| reverse_iterator | rbegin () |
| reverse_iterator | rend () |
| T * | data () |
| void | swap (iterator first, iterator second) |
| void | check_range (int idx) const |
Protected Member Functions |
| void | _destroy () |
| void | _destroy (iterator s, iterator e) |
| T * | _allocData (int elemcount) |
| void | _freeData () |
| void | _copy2end (const_iterator oit, const_iterator eit) |
Private Attributes |
| T * | _begin |
| T * | _end |
| int | _capacity |
Friends |
| class | core_vector_iterator< T > |
| class | core_vector_reverse_iterator< T > |
Member Typedef Documentation
Constructor & Destructor Documentation
Member Function Documentation
|
|
ensure that the size of the vector is at least given newize.
Fills new empty elements with fillwi th |
|
|
resize the array on given newsize if newsize > as size() new slots will be filled with fillwith
|
Friends And Related Function Documentation
|
template<class T> |
friend class core_vector_iterator< T > [friend]
|
|
Member Data Documentation
|
|