![]() |
| ||
Classes - Annotated - Tree - Functions - Home - Structure |
The QPtrVector class is a template collection class that provides a vector (array). More...
#include <qptrvector.h>
Inherits QPtrCollection.
The QPtrVector class is a template collection class that provides a vector (array).
QPtrVector is implemented as a template class. Defines a template instance QPtrVector<X> to create a vector that contains pointers to X or X*.
A vector is the same as an array. The main difference between QPtrVector and QMemArray is that QPtrVector stores pointers to the elements, whereas QMemArray stores the elements themselves (i.e., QMemArray is value-based).
Unless otherwise stated, all functions that remove items from the vector will also delete the element pointed to if auto-deletion is enabled - see setAutoDelete(). By default, auto-deletion is disabled - see setAutoDelete(). By default auto-deletion is disabled. This behaviour can be changed in a subclass by reimplementing the virtual method deleteItem().
Functions that compare items (find() and sort(),for example) will do so using the virtual function compareItems(). The default implementation of this function will compare only the absolute pointer values. Reimplement compareItems() in a subclass to get searching and sorting based on the item contents.
See also Collection Classes and QMemArray.
Constructs a null vector.
See also isNull().
Constructs an vector with room for size items. Makes a null vector if size == 0.
All size positions in the vector are initialized to 0.
See also size(), resize() and isNull().
Constructs a copy of v. Only the pointers are copied (i.e., shallow copy).
Removes all items from the vector, and destroys the vector itself.
See also clear().
Returns the item at position i, or 0 if there is no item at that position. i must be less than size().
Returns the setting of the auto-delete option. The default is FALSE.
See also setAutoDelete().
In a sorted array, finds the first occurrence of d using binary search. For a sorted array, this is generally much faster than find(), which does a linear search.
Returns the position of d, or -1 if d could not be found. d may not be 0.
Compares items using the virtual function compareItems().
Removes all items from the vector, and destroys the vector itself.
The vector becomes a null vector.
See also isNull().
Reimplemented from QPtrCollection.
This virtual function compares two list items.
Returns:
This function returns int rather than bool so that reimplementations can return one of three values and use it to sort by:
The sort() and bsearch() functions require that compareItems() is implemented as described here.
This function should not modify the vector because some const functions call compareItems().
Returns the number of occurrences of item d in the vector.
Compares items using the virtual function compareItems().
See also containsRef().
Returns the number of occurrences of the item pointer d in the vector.
This function does not use compareItems() to compare items.
See also findRef().
Returns the number of items in the vector. The vector is empty if count() == 0.
See also isEmpty() and size().
Reimplemented from QPtrCollection.
The vector is a null vector if data() == 0 (null pointer).
See also isNull().
Inserts item d in all positions in the vector. Any existing items are removed. If d is 0, the vector becomes empty.
If size >= 0, the vector is first resized to size. By default, size is -1.
Returns TRUE if successful, or FALSE if the memory cannot be allocated (only if a resize has been requested).
See also resize(), insert() and isEmpty().
Finds the first occurrence of item d in the vector using linear search. The search starts at position i, which must be less than size(). i is by default 0; i.e., the search starts at the start of the vector.
Returns the position of v, or -1 if v could not be found.
Compares items using the virtual function compareItems().
See also findRef() and bsearch().
Finds the first occurrence of the item pointer d in the vector using linear search. The search starts at position i, which must be less than size(). i is by default 0; i.e., the search starts at the start of the vector.
Returns the position of d, or -1 if d could not be found.
This function does not use compareItems() to compare items.
See also find() and bsearch().
Sets position i in the vector to contain the item d. i must be less than size(). Any previous element in position i is removed.
See also at().
Returns TRUE if the vector is empty, i.e., count() == 0, otherwise FALSE.
See also count().
Returns TRUE if the vector is null, otherwise FALSE.
A null vector has size() == 0 and data() == 0.
See also size().
Assigns v to this vector and returns a reference to this vector.
This vector is first cleared and then all the items from v are copied into the vector. Only the pointers are copied (i.e., shallow copy).
See also clear().
Returns the item at position i, or 0 if there is no item at that position. i must be less than size().
Equivalent to at( i ).
See also at().
Reads a vector item from the stream s and returns a reference to the stream.
The default implementation sets item to 0.
See also write().
Removes the item at position i in the vector, if there is one. i must be less than size().
Returns TRUE unless i is out of range.
Any items in position size or beyond in the vector are removed. New positions are initialized 0.
Returns TRUE if successful, or FALSE if the memory cannot be allocated.
Sets the collection to auto-delete its contents if enable is TRUE and to never delete them if enable is FALSE.
If auto-deleting is turned on, all the items in a collection are deleted when the collection itself is deleted. This can be quite convenient if the collection has the only pointer to the items.
The default setting is FALSE, for safety. If you turn it on, be careful about copying the collection - you might find yourself with two collections deleting the same items.
See also autoDelete().
Examples: grapher/grapher.cpp, scribble/scribble.cpp and table/bigtable/main.cpp.
Returns the size of the vector, i.e., the number of vector positions. This is also the maximum number of items the vector can hold.
The vector is a null vector if size() == 0.
See also isNull(), resize() and count().
Sorts the items in ascending order. Any empty positions will be put last.
Compares items using the virtual function compareItems().
See also bsearch().
Returns the item at position i in the vector, and removes that item from the vector. i must be less than size(). If there is no item at position i, 0 is returned.
In contrast to remove(), this function does not call deleteItem() for the removed item.
Copies all items in this vector to the list list. list is first cleared and then all items are appended to list.
See also QPtrList, QPtrStack and QPtrQueue.
The default implementation does nothing.
See also read().
Search the documentation, FAQ, qt-interest archive and more (uses
www.trolltech.com):
This file is part of the Qt toolkit, copyright © 1995-2001 Trolltech, all rights reserved.
Copyright © 2001 Trolltech | Trademarks | Qt version 3.0.0-beta2
|