123 lines
4.1 KiB
C
123 lines
4.1 KiB
C
|
/*
|
||
|
|
* Copyright (C) 2008 The Android Open Source Project
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions
|
||
|
|
* are met:
|
||
|
|
* * Redistributions of source code must retain the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer.
|
||
|
|
* * Redistributions in binary form must reproduce the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer in
|
||
|
|
* the documentation and/or other materials provided with the
|
||
|
|
* distribution.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
||
|
|
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
||
|
|
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
||
|
|
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
|
||
|
|
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
|
||
|
|
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
||
|
|
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||
|
|
* SUCH DAMAGE.
|
||
|
|
*/
|
||
|
|
/*
|
||
|
|
*
|
||
|
|
* 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(), second() {}
|
||
|
|
pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
|
||
|
|
|
||
|
|
template <class _U1, class _U2>
|
||
|
|
pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
|
||
|
|
};
|
||
|
|
|
||
|
|
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 bool operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
|
||
|
|
return !(__x == __y);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class _T1, class _T2>
|
||
|
|
inline bool operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
|
||
|
|
return __y < __x;
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class _T1, class _T2>
|
||
|
|
inline bool operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
|
||
|
|
return !(__y < __x);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class _T1, class _T2>
|
||
|
|
inline bool operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
|
||
|
|
return !(__x < __y);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class _T1, class _T2>
|
||
|
|
inline pair<_T1, _T2> make_pair(_T1 __x, _T2 __y)
|
||
|
|
{
|
||
|
|
return pair<_T1, _T2>(__x, __y);
|
||
|
|
}
|
||
|
|
|
||
|
|
__STL_END_NAMESPACE
|
||
|
|
|
||
|
|
#endif /* __SGI_STL_INTERNAL_PAIR_H */
|
||
|
|
|
||
|
|
// Local Variables:
|
||
|
|
// mode:C++
|
||
|
|
// End:
|