df9262681b
* algorithm alloc.h defalloc.h hash_map.h hash_set.h iterator memory pthread_alloc pthread_alloc.h rope ropeimpl.h stl_algo.h stl_algobase.h stl_alloc.h stl_bvector.h stl_config.h stl_construct.h stl_deque.h stl_function.h stl_hash_fun.h stl_hash_map.h stl_hash_set.h stl_hashtable.h stl_heap.h stl_iterator.h stl_list.h stl_map.h stl_multimap.h stl_multiset.h stl_numeric.h stl_pair.h stl_queue.h stl_raw_storage_iter.h stl_relops.h stl_rope.h stl_set.h stl_slist.h stl_stack.h stl_tempbuf.h stl_tree.h stl_uninitialized.h stl_vector.h tempbuf.h type_traits.h: Update to SGI STL 3.11. From-SVN: r22190
78 lines
2.3 KiB
C++
78 lines
2.3 KiB
C++
/*
|
|
*
|
|
* 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.
|
|
*
|
|
*
|
|
* Copyright (c) 1996,1997
|
|
* Silicon Graphics Computer Systems, Inc.
|
|
*
|
|
* 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. Silicon Graphics makes no
|
|
* representations about the suitability of this software for any
|
|
* purpose. It is provided "as is" without express or implied warranty.
|
|
*/
|
|
|
|
/* NOTE: This is an internal header file, included by other STL headers.
|
|
* You should not attempt to use it directly.
|
|
*/
|
|
|
|
#ifndef __SGI_STL_INTERNAL_PAIR_H
|
|
#define __SGI_STL_INTERNAL_PAIR_H
|
|
|
|
__STL_BEGIN_NAMESPACE
|
|
|
|
template <class _T1, class _T2>
|
|
struct pair {
|
|
typedef _T1 first_type;
|
|
typedef _T2 second_type;
|
|
|
|
_T1 first;
|
|
_T2 second;
|
|
pair() : first(_T1()), second(_T2()) {}
|
|
pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
|
|
|
|
#ifdef __STL_MEMBER_TEMPLATES
|
|
template <class _U1, class _U2>
|
|
pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
|
|
#endif
|
|
};
|
|
|
|
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);
|
|
}
|
|
|
|
__STL_END_NAMESPACE
|
|
|
|
#endif /* __SGI_STL_INTERNAL_PAIR_H */
|
|
|
|
// Local Variables:
|
|
// mode:C++
|
|
// End:
|