mirror of
git://gcc.gnu.org/git/gcc.git
synced 2024-12-29 03:24:41 +08:00
bb84e66919
* Makefile.in (install): Some of HEADERS come from the stl dir now. * algorithm, deque, functional, iterator, list, map, memory, numeric, queue, set, stack, utility, vector: Now in stl dir. stl/: * algo.h, algobase.h, alloc.h, bvector.h, defalloc.h, deque.h, function.h, hash_map.h, hash_set.h, hashtable.h, heap.h, iterator.h, list.h, map.h, multimap.h, multiset.h, pair.h, pthread_alloc.h, rope.h, ropeimpl.h, set.h, slist.h, stack.h, stl_config.h, tempbuf.h, tree.h, type_traits.h, vector.h: Update to October 27 SGI snapshot. * algorithm, deque, functional, hash_map, hash_set, iterator, list, map, memory, numeric, pthread_alloc, queue, rope, set, slist, stack, stl_algo.h, stl_algobase.h, stl_alloc.h, stl_bvector.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, utility, vector: New files in October 27 SGI snapshot. From-SVN: r16277
74 lines
2.2 KiB
C++
74 lines
2.2 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:
|