/**************************************************************************** ** ** Copyright (C) 1992-2007 Trolltech ASA. All rights reserved. ** ** This file is part of the QtCore module of the Qt Toolkit. ** ** This file may be used under the terms of the GNU General Public ** License version 2.0 as published by the Free Software Foundation ** and appearing in the file LICENSE.GPL included in the packaging of ** this file. Please review the following information to ensure GNU ** General Public Licensing requirements will be met: ** http://trolltech.com/products/qt/licenses/licensing/opensource/ ** ** If you are unsure which license is appropriate for your use, please ** review the following information: ** http://trolltech.com/products/qt/licenses/licensing/licensingoverview ** or contact the sales department at sales@trolltech.com. ** ** In addition, as a special exception, Trolltech gives you certain ** additional rights. These rights are described in the Trolltech GPL ** Exception version 1.0, which can be found at ** http://www.trolltech.com/products/qt/gplexception/ and in the file ** GPL_EXCEPTION.txt in this package. ** ** In addition, as a special exception, Trolltech, as the sole copyright ** holder for Qt Designer, grants users of the Qt/Eclipse Integration ** plug-in the right for the Qt/Eclipse Integration to link to ** functionality provided by Qt Designer and its related libraries. ** ** Trolltech reserves all rights not expressly granted herein. ** ** Trolltech ASA (c) 2007 ** ** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE ** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ** ****************************************************************************/ #ifndef QPAIR_H #define QPAIR_H #include QT_BEGIN_HEADER QT_MODULE(Core) template struct QPair { typedef T1 first_type; typedef T2 second_type; QPair() : first(T1()), second(T2()) {} QPair(const T1 &t1, const T2 &t2) : first(t1), second(t2) {} QPair &operator=(const QPair &other) { first = other.first; second = other.second; return *this; } T1 first; T2 second; }; template Q_INLINE_TEMPLATE bool operator==(const QPair &p1, const QPair &p2) { return p1.first == p2.first && p1.second == p2.second; } template Q_INLINE_TEMPLATE bool operator!=(const QPair &p1, const QPair &p2) { return !(p1 == p2); } template Q_INLINE_TEMPLATE bool operator<(const QPair &p1, const QPair &p2) { return p1.first < p2.first || (!(p2.first < p1.first) && p1.second < p2.second); } template Q_INLINE_TEMPLATE bool operator>(const QPair &p1, const QPair &p2) { return p2 < p1; } template Q_INLINE_TEMPLATE bool operator<=(const QPair &p1, const QPair &p2) { return !(p2 < p1); } template Q_INLINE_TEMPLATE bool operator>=(const QPair &p1, const QPair &p2) { return !(p1 < p2); } template Q_OUTOFLINE_TEMPLATE QPair qMakePair(const T1 &x, const T2 &y) { return QPair(x, y); } #ifndef QT_NO_DATASTREAM template inline QDataStream& operator>>(QDataStream& s, QPair& p) { s >> p.first >> p.second; return s; } template inline QDataStream& operator<<(QDataStream& s, const QPair& p) { s << p.first << p.second; return s; } #endif QT_END_HEADER #endif // QPAIR_H