Typedef for const T *.

Typedef for const T *.

Typedef for const T &.

Typedef for const T *.

Typedef for ptrdiff_t.

Typedef for T *.

Typedef for T *.

Typedef for T &.

Typedef for T *.

Typedef for int.

Typedef for T.

Constructs an array with an initial size of size elements.

If the type has a user defined constructor the new elements are default initialized. Otherwise the elements are uninitialized. Refer to default constructed elements for additional information.

Constructs a copy of other.

Destroys the array.

Appends item value to the array, extending the array if necessary.

See also

removeLast()

Appends length amount of items referenced by buffer to this array.

Returns a reference to the item at index position index. The given index must be a valid position in the array.

See also

value(), operator[]()

Equivalent to calling removeLast().

Equivalent to calling removeLast().

Returns an STL-style iterator pointing to the first item in the array.

See also

constBegin(), end()

Returns an STL-style iterator pointing to the first item in the array.

Returns the maximum number of elements that can be stored in the array without forcing a reallocation.

The purpose of this method is to provide a means of fine tuning QVarLengthArray's memory usage. This method is rarely used. If you want to know how many items are in the array call size().

See also

reserve()

Returns a const STL-style iterator pointing to the first item in the array.

See also

begin(), constEnd()

Returns a const STL-style iterator pointing to the imaginary item after the last item in the array.

See also

constBegin(), end()

Removes all the elements from the array. Same as calling resize(0).

Returns a const STL-style iterator pointing to the first item in the array.

See also

begin(), constEnd()

Returns a const pointer to the data stored in the array. The pointer can be used to access the items in the array. The pointer remains valid as long as the array is not reallocated.

This method is mostly useful to pass an array to a function which accepts a raw C++ array.

See also

data(), operator[]()

Returns a const STL-style iterator pointing to the imaginary item after the last item in the array.

See also

constBegin(), end()

Returns true if the array contains an occurrence of value, otherwise returns false. This method requires the value type to have an implementation of operator==().

See also

indexOf(), lastIndexOf()

Equivalent to calling size().

See also

isEmpty(), resize()

Returns a const STL-style reverse iterator pointing to the first item in the variable length array, in reverse order.

See also

begin(), rbegin(), rend()

Returns a const STL-style reverse iterator pointing to one past the last item in the variable length array, in reverse order.

See also

end(), rend(), rbegin()

Returns a pointer to the data stored in the array. The pointer can be used to access and modify the items in the array.

The pointer remains valid as long as the array is not reallocated. This method is mostly useful to pass an array to a method which accepts a raw C++ array.

See also

constData(), operator[]()

This is an overloaded method.

Returns true if the array has size 0, otherwise returns false.

Equivalent to calling isEmpty().

Returns an STL-style iterator pointing to the imaginary item after the last item in the array.

See also

begin(), constEnd()

Returns an STL-style iterator pointing to the imaginary item after the last item in the array.

Removes all the items from begin up to (but not including) end. Returns an iterator to the same item that end referred to before the call.

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()).

See also

insert(), remove()

Returns a reference to the first item in the array. The array must not be empty. If the array can be empty, check isEmpty() before calling this method.

See also

last(), isEmpty()

Returns a reference to the first item in the array. The array must not be empty. If the array can be empty, check isEmpty() before calling this method.

Equivalent to calling first().

Equivalent to calling first().

Returns the index position of the first occurrence of value in the array, searching forward from index position from. Returns -1 if no item matched.

This method requires the type T to support operator==().

See also

lastIndexOf(), contains()

Inserts value in front of the item pointed to by the iterator before. Returns an iterator pointing at the inserted item.

Inserts count copies of value in front of the item pointed to by the iterator before. Returns an iterator pointing at the first of the inserted items.

Inserts value at index position index in the array. If index is 0 the value is prepended to the vector. If index is equal to size() the value is appended to the vector.

For large arrays, this operation can be slow (linear time), because it requires moving all the items at indexes i and above by one position further in memory. If you want a container class that provides a fast insert() method use QLinkedList instead.

See also

remove()

Inserts count copies of value at index position index in the array.

Returns true if the array has size 0, otherwise returns false.

See also

size(), resize()

Returns a reference to the last item in the array. The array must not be empty. If the array can be empty, check isEmpty() before calling this method.

See also

first(), isEmpty()

Returns a reference to the last item in the array. The array must not be empty. If the array can be empty, check isEmpty() before calling this method.

See also

first(), isEmpty()

Returns the index position of the last occurrence of the value in the array, searching backward from index position from. If from is -1 the search starts at the last item. Returns -1 if no item matched.

This method requires the type T to support operator==().

See also

indexOf(), contains()

Equivalent to calling size().

See also

isEmpty(), resize()

Appends value to the array and returns a reference to this vector.

See also

append(), operator>>()

Appends value to the array and returns a reference to this vector.

See also

append(), operator+=()

Assigns other to this array and returns a reference to this array.

Assigns the values of list to this array, and returns a reference to this array.

Returns a reference to the item at index position index. The given index must be a valid index position in the array.

See also

at(), data()

Equivalent to calling at[].

Equivalent to calling removeLast().

Inserts value at the beginning of the array. This is the same as vector.insert(0, value).

For large arrays, this operation can be slow (linear time), because it requires moving all the items in the array by one position further in memory. If you want a container class that provides a fast prepend() method use QList or QLinkedList instead.

See also

append(), insert()

Appends value to the array, extending the array if necessary.

Returns a STL-style reverse iterator pointing to the first item in the variable length array, in reverse order.

See also

begin(), crbegin(), rend()

Returns a STL-style reverse iterator pointing to the first item in the variable length array, in reverse order.

See also

begin(), crbegin(), rend()

Removes the element at index position index.

See also

insert(), replace()

Removes count elements from the middle of the array, starting at index position index.

See also

insert(), replace()

Decreases the size of the array by one. The allocated size is not changed.

See also

append()

Returns a STL-style reverse iterator pointing to one past the last item in the variable length array, in reverse order.

See also

end(), crend(), rbegin()

Returns a STL-style reverse iterator pointing to one past the last item in the variable length array, in reverse order.

See also

end(), crend(), rbegin()

Replaces the item at index position index with value. The index must be a valid position in the array.

See also

operator[](), remove()

Attempts to allocate memory for at least size elements. If you know in advance how large the array can get, you can call this method and if you call resize() often, you are likely to get better performance. If size is an underestimate, the worst that will happen is that the QVarLengthArray will be a bit slower.

The purpose of this method is to provide a means of fine tuning QVarLengthArray's memory usage. This method is rarely used. If you want to know how many items are in the array, call size().

See also

capacity()

Sets the size of the array to size. If size is greater than the current size, elements are added to the end. If size is less than the current size, elements are removed from the end.

If the type has a user defined constructor the new elements are default initialized. Otherwise the elements are uninitialized. Refer to default constructed elements for additional information.

See also

size()

Returns the number of elements in the array.

See also

isEmpty(), resize()

Releases any memory not required to store the items. If the container can fit its storage on the stack allocation, it will free the heap allocation and copy the elements back to the stack.

The purpose of this method is to provide a means of fine tuning QVarLengthArray's memory usage. This method is rarely used.

See also

reserve(), capacity(), resize()

Returns the value at index position index. If index is guaranteed to be within bounds use at() which is slightly faster. If index is out of bounds a value initialized object is returned. Refer to default constructed elements for additional information.

See also

at(), operator[]()

Returns the value at index position index. If the index is out of bounds the defaultValue is returned.

Returns true if the two arrays, specified by left and right, are not equal.

Two arrays are considered equal if they contain the same values in the same order. This method requires the value type to have an implementation of operator==().

See also

operator==()

Returns true if the two arrays, specified by left and right, are equal.

Two arrays are considered equal if they contain the same values in the same order. This method requires the value type to have an implementation of operator==().

See also

operator!=()