|Home | All Classes | Main Classes | Annotated | Grouped Classes | Functions|
The QPair class is a value-based template class that provides a pair of elements. More...
List of all member functions.
QPair is a Qt implementation of an STL-like pair. It can be used in your application if the standard pair<> is not available on your target platforms.
QPair<T1, T2> defines a template instance to create a pair of values that contains two values of type T1 and T2. Please note that QPair does not store pointers to the two elements; it holds a copy of every member. This is why these kinds of classes are called value based. If you're interested in pointer based classes see, for example, QPtrList and QDict.
QPair holds one copy of type T1 and one copy of type T2, but does not provide iterators to access these elements. Instead, the two elements (first and second) are public member variables of the pair. QPair owns the contained elements. For more relaxed ownership semantics, see QPtrCollection and friends which are pointer-based containers.
Some classes cannot be used within a QPair: for example, all classes derived from QObject and thus all classes that implement widgets. Only "values" can be used in a QPair. To qualify as a value the class must provide:
Note that C++ defaults to field-by-field assignment operators and copy constructors if no explicit version is supplied. In many cases this is sufficient.
QPair uses an STL-like syntax to manipulate and address the objects it contains. See the QTL documentation for more information.
Functions that need to return two values can use a QPair.
See also Qt Template Library Classes, Implicitly and Explicitly Shared Classes, and Non-GUI Classes.
Constructs an empty pair. The first and second elements are default constructed.
Constructs a pair and initializes the first element with t1 and the second element with t2.
This is a template convenience function. It is used to create a QPair<> object that contains t1 and t2.
This file is part of the Qt toolkit. Copyright © 1995-2005 Trolltech. All Rights Reserved.