|
| void | insert (int idx, const T &t) |
| |
| | QPodList (int size=0) |
| |
| void | removeAll (const T &t) |
| |
| void | removeAt (int idx) |
| |
| T | takeFirst () |
| |
| void | append (const T &t) |
| |
| void | append (const T *buf, int size) |
| |
| const T & | at (int idx) const |
| |
| iterator | begin () |
| |
| const_iterator | begin () const |
| |
| int | capacity () const |
| |
| void | clear () |
| |
| const_iterator | constBegin () const |
| |
| const T * | constData () const |
| |
| const_iterator | constEnd () const |
| |
| int | count () const |
| |
| T * | data () |
| |
| const T * | data () const |
| |
| iterator | end () |
| |
| const_iterator | end () const |
| |
| iterator | erase (iterator begin, iterator end) |
| |
| iterator | erase (iterator pos) |
| |
| void | insert (int i, const T &t) |
| |
| void | insert (int i, int n, const T &t) |
| |
| iterator | insert (iterator before, int n, const T &x) |
| |
| iterator | insert (iterator before, const T &x) |
| |
| bool | isEmpty () const |
| |
| QVarLengthArray< T, Prealloc > & | operator+= (const T &t) |
| |
| QVarLengthArray< T, Prealloc > & | operator<< (const T &t) |
| |
| QVarLengthArray< T, Prealloc > & | operator= (const QVarLengthArray< T, Prealloc > &other) |
| |
| T & | operator[] (int idx) |
| |
| const T & | operator[] (int idx) const |
| |
| void | prepend (const T &t) |
| |
| | QVarLengthArray (int size=0) |
| |
| | QVarLengthArray (const QVarLengthArray< T, Prealloc > &other) |
| |
| void | remove (int i) |
| |
| void | remove (int i, int n) |
| |
| void | removeLast () |
| |
| void | replace (int i, const T &t) |
| |
| void | reserve (int size) |
| |
| void | resize (int size) |
| |
| int | size () const |
| |
| T | value (int i) const |
| |
| T | value (int i, const T &defaultValue) const |
| |
| | ~QVarLengthArray () |
| |
template<typename T, int Prealloc>
class QPodList< T, Prealloc >
Definition at line 65 of file qpodlist_p.h.