|
| ~QDirIteratorPrivateIteratorStack () |
|
Iterator * | pop () |
| Removes the top item from the stack and returns it. More...
|
|
void | push (const Iterator * &t) |
| Adds element t to the top of the stack. More...
|
|
| QStack () |
| Constructs an empty stack. More...
|
|
void | swap (QStack< Iterator * > &other) |
| Swaps stack other with this stack. More...
|
|
Iterator * & | top () |
| Returns a reference to the stack's top item. More...
|
|
const Iterator * & | top () const |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
|
|
| ~QStack () |
| Destroys the stack. More...
|
|
void | append (const T &t) |
| Inserts value at the end of the vector. More...
|
|
const T & | at (int i) const |
| Returns the item at index position i in the vector. More...
|
|
reference | back () |
| This function is provided for STL compatibility. More...
|
|
const_reference | back () const |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
|
|
iterator | begin () |
| Returns an STL-style iterator pointing to the first item in the vector. More...
|
|
const_iterator | begin () const |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
|
|
int | capacity () const |
| Returns the maximum number of items that can be stored in the vector without forcing a reallocation. More...
|
|
void | clear () |
| Removes all the elements from the vector and releases the memory used by the vector. More...
|
|
const_iterator | constBegin () const |
| Returns a const STL-style iterator pointing to the first item in the vector. More...
|
|
const T * | constData () const |
| Returns a const pointer to the data stored in the vector. More...
|
|
const_iterator | constEnd () const |
| Returns a const STL-style iterator pointing to the imaginary item after the last item in the vector. More...
|
|
bool | contains (const T &t) const |
| Returns true if the vector contains an occurrence of value; otherwise returns false. More...
|
|
int | count (const T &t) const |
| Returns the number of occurrences of value in the vector. More...
|
|
int | count () const |
| Same as size(). More...
|
|
T * | data () |
| Returns a pointer to the data stored in the vector. More...
|
|
const T * | data () const |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
|
|
void | detach () |
|
bool | empty () const |
| This function is provided for STL compatibility. More...
|
|
iterator | end () |
| Returns an STL-style iterator pointing to the imaginary item after the last item in the vector. More...
|
|
const_iterator | end () const |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
|
|
bool | endsWith (const T &t) const |
| Returns true if this vector is not empty and its last item is equal to value; otherwise returns false. More...
|
|
iterator | erase (iterator begin, iterator end) |
| Removes all the items from begin up to (but not including) end. More...
|
|
iterator | erase (iterator pos) |
| Removes the item pointed to by the iterator pos from the vector, and returns an iterator to the next item in the vector (which may be end()). More...
|
|
QVector< T > & | fill (const T &t, int size=-1) |
| Assigns value to all items in the vector. More...
|
|
T & | first () |
| Returns a reference to the first item in the vector. More...
|
|
const T & | first () const |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
|
|
T & | front () |
| This function is provided for STL compatibility. More...
|
|
const_reference | front () const |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
|
|
int | indexOf (const T &t, int from=0) const |
| Returns the index position of the first occurrence of value in the vector, searching forward from index position from. More...
|
|
void | insert (int i, const T &t) |
| Inserts value at index position i in the vector. More...
|
|
void | insert (int i, int n, const T &t) |
| Inserts count copies of value at index position i in the vector. More...
|
|
iterator | insert (iterator before, int n, const T &x) |
| Inserts count copies of value in front of the item pointed to by the iterator before. More...
|
|
iterator | insert (iterator before, const T &x) |
| Inserts value in front of the item pointed to by the iterator before. More...
|
|
bool | isDetached () const |
|
bool | isEmpty () const |
| Returns true if the vector has size 0; otherwise returns false. More...
|
|
bool | isSharedWith (const QVector< T > &other) const |
|
T & | last () |
| Returns a reference to the last item in the vector. More...
|
|
const T & | last () const |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. More...
|
|
int | lastIndexOf (const T &t, int from=-1) const |
| Returns the index position of the last occurrence of the value value in the vector, searching backward from index position from. More...
|
|
QVector< T > | mid (int pos, int length=-1) const |
| Returns a vector whose elements are copied from this vector, starting at position pos. More...
|
|
bool | operator!= (const QVector< T > &v) const |
| Returns true if other is not equal to this vector; otherwise returns false. More...
|
|
QVector< T > | operator+ (const QVector< T > &l) const |
| Returns a vector that contains all the items in this vector followed by all the items in the other vector. More...
|
|
QVector< T > & | operator+= (const QVector< T > &l) |
| Appends the items of the other vector to this vector and returns a reference to this vector. More...
|
|
QVector< T > & | operator+= (const T &t) |
| Appends value to the vector. More...
|
|
QVector< T > & | operator<< (const QVector< T > &l) |
| Appends other to the vector and returns a reference to the vector. More...
|
|
QVector< T > & | operator<< (const T &t) |
| Appends value to the vector and returns a reference to this vector. More...
|
|
QVector< T > & | operator= (const QVector< T > &v) |
| Assigns other to this vector and returns a reference to this vector. More...
|
|
bool | operator== (const QVector< T > &v) const |
| Returns true if other is equal to this vector; otherwise returns false. More...
|
|
T & | operator[] (int i) |
| Returns the item at index position i as a modifiable reference. More...
|
|
const T & | operator[] (int i) const |
| Same as at(i). More...
|
|
void | pop_back () |
| This function is provided for STL compatibility. More...
|
|
void | pop_front () |
| This function is provided for STL compatibility. More...
|
|
void | prepend (const T &t) |
| Inserts value at the beginning of the vector. More...
|
|
void | push_back (const T &t) |
| This function is provided for STL compatibility. More...
|
|
void | push_front (const T &t) |
| This function is provided for STL compatibility. More...
|
|
| QVector () |
| Constructs an empty vector. More...
|
|
| QVector (int size) |
| Constructs a vector with an initial size of size elements. More...
|
|
| QVector (int size, const T &t) |
| Constructs a vector with an initial size of size elements. More...
|
|
| QVector (const QVector< T > &v) |
| Constructs a copy of other. More...
|
|
void | remove (int i) |
| Removes the element at index position i. More...
|
|
void | remove (int i, int n) |
| Removes count elements from the middle of the vector, starting at index position i. More...
|
|
void | replace (int i, const T &t) |
| Replaces the item at index position i with value. More...
|
|
void | reserve (int size) |
| Attempts to allocate memory for at least size elements. More...
|
|
void | resize (int size) |
| Sets the size of the vector to size. More...
|
|
void | setSharable (bool sharable) |
|
int | size () const |
| Returns the number of items in the vector. More...
|
|
void | squeeze () |
| Releases any memory not required to store the items. More...
|
|
bool | startsWith (const T &t) const |
| Returns true if this vector is not empty and its first item is equal to value; otherwise returns false. More...
|
|
void | swap (QVector< T > &other) |
| Swaps vector other with this vector. More...
|
|
QList< T > | toList () const |
| Returns a QList object with the data contained in this QVector. More...
|
|
std::vector< T > | toStdVector () const |
| Returns a std::vector object with the data contained in this QVector. More...
|
|
T | value (int i) const |
| Returns the value at index position i in the vector. More...
|
|
T | value (int i, const T &defaultValue) const |
| If the index i is out of bounds, the function returns defaultValue. More...
|
|
| ~QVector () |
| Destroys the vector. More...
|
|
template<class Iterator>
class QDirIteratorPrivateIteratorStack< Iterator >
Definition at line 117 of file qdiriterator.cpp.