#include <qcontainerfwd.h>
Definition at line 63 of file qcontainerfwd.h.
Public Member Functions | |
QStack () | |
~QStack () | |
void | swap (QStack< T > &other) |
void | push (const T &t) |
T | pop () |
T & | top () |
const T & | top () const |
![]() | |
QVector () | |
QVector (int size) | |
QVector (int size, const T &t) | |
QVector (const QVector< T > &v) | |
~QVector () | |
QVector< T > & | operator= (const QVector< T > &v) |
void | swap (QVector< T > &other) |
bool | operator== (const QVector< T > &v) const |
bool | operator!= (const QVector< T > &v) const |
int | size () const |
bool | isEmpty () const |
void | resize (int size) |
int | capacity () const |
void | reserve (int size) |
void | squeeze () |
void | detach () |
bool | isDetached () const |
void | setSharable (bool sharable) |
bool | isSharedWith (const QVector< T > &other) const |
T * | data () |
const T * | data () const |
const T * | constData () const |
void | clear () |
const T & | at (int i) const |
T & | operator[] (int i) |
const T & | operator[] (int i) const |
void | append (const T &t) |
void | prepend (const T &t) |
void | insert (int i, const T &t) |
void | insert (int i, int n, const T &t) |
void | replace (int i, const T &t) |
void | remove (int i) |
void | remove (int i, int n) |
QVector< T > & | fill (const T &t, int size=-1) |
int | indexOf (const T &t, int from=0) const |
int | lastIndexOf (const T &t, int from=-1) const |
bool | contains (const T &t) const |
int | count (const T &t) const |
iterator | begin () |
const_iterator | begin () const |
const_iterator | constBegin () const |
iterator | end () |
const_iterator | end () const |
const_iterator | constEnd () const |
iterator | insert (iterator before, int n, const T &x) |
iterator | insert (iterator before, const T &x) |
iterator | erase (iterator begin, iterator end) |
iterator | erase (iterator pos) |
int | count () const |
T & | first () |
const T & | first () const |
T & | last () |
const T & | last () const |
bool | startsWith (const T &t) const |
bool | endsWith (const T &t) const |
QVector< T > | mid (int pos, int length=-1) const |
T | value (int i) const |
T | value (int i, const T &defaultValue) const |
void | push_back (const T &t) |
void | push_front (const T &t) |
void | pop_back () |
void | pop_front () |
bool | empty () const |
T & | front () |
const_reference | front () const |
reference | back () |
const_reference | back () const |
QVector< T > & | operator+= (const QVector< T > &l) |
QVector< T > | operator+ (const QVector< T > &l) const |
QVector< T > & | operator+= (const T &t) |
QVector< T > & | operator<< (const T &t) |
QVector< T > & | operator<< (const QVector< T > &l) |
QList< T > | toList () const |
std::vector< T > | toStdVector () const |
Additional Inherited Members | |
![]() | |
typedef T * | iterator |
typedef const T * | const_iterator |
typedef T | value_type |
typedef value_type * | pointer |
typedef const value_type * | const_pointer |
typedef value_type & | reference |
typedef const value_type & | const_reference |
typedef qptrdiff | difference_type |
typedef iterator | Iterator |
typedef const_iterator | ConstIterator |
typedef int | size_type |
![]() | |
static QVector< T > | fromList (const QList< T > &list) |
static QVector< T > | fromStdVector (const std::vector< T > &vector) |