You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
52 lines
1.4 KiB
52 lines
1.4 KiB
8 years ago
|
/*
|
||
|
|
*
|
||
|
|
* Copyright (c) 1994
|
||
|
|
* Hewlett-Packard Company
|
||
|
|
*
|
||
|
|
* Permission to use, copy, modify, distribute and sell this software
|
||
|
|
* and its documentation for any purpose is hereby granted without fee,
|
||
|
|
* provided that the above copyright notice appear in all copies and
|
||
|
|
* that both that copyright notice and this permission notice appear
|
||
|
|
* in supporting documentation. Hewlett-Packard Company makes no
|
||
|
|
* representations about the suitability of this software for any
|
||
|
|
* purpose. It is provided "as is" without express or implied warranty.
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef PAIR_H
|
||
|
|
#define PAIR_H
|
||
|
|
|
||
|
|
#ifndef __GNUG__
|
||
|
|
#include <ministl/bool.h>
|
||
|
|
#endif
|
||
|
|
|
||
|
|
template <class T1, class T2>
|
||
|
|
struct pair {
|
||
|
|
T1 first;
|
||
|
|
T2 second;
|
||
|
|
#if defined(_AIX) && !defined(__GNUG__)
|
||
|
|
// if T? is const xlC goofes about first/second not beeing inited
|
||
|
|
pair() : first (T1()), second (T2()) {}
|
||
|
|
#else
|
||
|
|
pair() {}
|
||
|
|
#endif
|
||
|
|
pair(const T1& a, const T2& b) : first(a), second(b) {}
|
||
|
|
};
|
||
|
|
|
||
|
|
template <class T1, class T2>
|
||
|
|
inline bool operator==(const pair<T1, T2>& x, const pair<T1, T2>& y) {
|
||
|
|
return x.first == y.first && x.second == y.second;
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T1, class T2>
|
||
|
|
inline bool operator<(const pair<T1, T2>& x, const pair<T1, T2>& y) {
|
||
|
|
return x.first < y.first || (!(y.first < x.first) && x.second < y.second);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T1, class T2>
|
||
|
|
inline pair<T1, T2> make_pair(const T1& x, const T2& y) {
|
||
|
|
return pair<T1, T2>(x, y);
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif
|