1 // Pair implementation -*- C++ -*-
3 // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 // Free Software Foundation, Inc.
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the
8 // terms of the GNU General Public License as published by the
9 // Free Software Foundation; either version 3, or (at your option)
12 // This library is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // Under Section 7 of GPL version 3, you are granted additional
18 // permissions described in the GCC Runtime Library Exception, version
19 // 3.1, as published by the Free Software Foundation.
21 // You should have received a copy of the GNU General Public License and
22 // a copy of the GCC Runtime Library Exception along with this program;
23 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 // <http://www.gnu.org/licenses/>.
29 * Hewlett-Packard Company
31 * Permission to use, copy, modify, distribute and sell this software
32 * and its documentation for any purpose is hereby granted without fee,
33 * provided that the above copyright notice appear in all copies and
34 * that both that copyright notice and this permission notice appear
35 * in supporting documentation. Hewlett-Packard Company makes no
36 * representations about the suitability of this software for any
37 * purpose. It is provided "as is" without express or implied warranty.
40 * Copyright (c) 1996,1997
41 * Silicon Graphics Computer Systems, Inc.
43 * Permission to use, copy, modify, distribute and sell this software
44 * and its documentation for any purpose is hereby granted without fee,
45 * provided that the above copyright notice appear in all copies and
46 * that both that copyright notice and this permission notice appear
47 * in supporting documentation. Silicon Graphics makes no
48 * representations about the suitability of this software for any
49 * purpose. It is provided "as is" without express or implied warranty.
53 * This is an internal header file, included by other library headers.
54 * You should not attempt to use it directly.
60 #include <bits/move.h> // for std::move / std::forward, and std::swap
62 #ifdef __GXX_EXPERIMENTAL_CXX0X__
63 #include <type_traits> // for std::__decay_and_strip too
66 _GLIBCXX_BEGIN_NAMESPACE(std)
68 #ifdef __GXX_EXPERIMENTAL_CXX0X__
69 struct piecewise_construct_t { };
71 // forward declarations
79 /// pair holds two objects of arbitrary type.
80 template<class _T1, class _T2>
83 typedef _T1 first_type; ///< @c first_type is the first bound type
84 typedef _T2 second_type; ///< @c second_type is the second bound type
86 _T1 first; ///< @c first is a copy of the first object
87 _T2 second; ///< @c second is a copy of the second object
89 // _GLIBCXX_RESOLVE_LIB_DEFECTS
90 // 265. std::pair::pair() effects overly restrictive
91 /** The default constructor creates @c first and @c second using their
92 * respective default constructors. */
94 : first(), second() { }
96 /** Two objects may be passed to a @c pair constructor to be copied. */
97 pair(const _T1& __a, const _T2& __b)
98 : first(__a), second(__b) { }
100 #ifdef __GXX_EXPERIMENTAL_CXX0X__
101 pair(const pair&) = default;
104 template<class _U1, class = typename
105 std::enable_if<std::is_convertible<_U1, _T1>::value>::type>
106 pair(_U1&& __x, const _T2& __y)
107 : first(std::forward<_U1>(__x)),
110 template<class _U2, class = typename
111 std::enable_if<std::is_convertible<_U2, _T2>::value>::type>
112 pair(const _T1& __x, _U2&& __y)
114 second(std::forward<_U2>(__y)) { }
116 template<class _U1, class _U2, class = typename
117 std::enable_if<std::is_convertible<_U1, _T1>::value
118 && std::is_convertible<_U2, _T2>::value>::type>
119 pair(_U1&& __x, _U2&& __y)
120 : first(std::forward<_U1>(__x)),
121 second(std::forward<_U2>(__y)) { }
124 : first(std::move(__p.first)),
125 second(std::move(__p.second)) { }
127 template<class... _Args1, class... _Args2>
128 pair(piecewise_construct_t,
129 tuple<_Args1...> __first_args,
130 tuple<_Args2...> __second_args)
131 : first(__cons<first_type>(std::move(__first_args))),
132 second(__cons<second_type>(std::move(__second_args))) { }
135 /** There is also a templated copy ctor for the @c pair class itself. */
136 template<class _U1, class _U2>
137 pair(const pair<_U1, _U2>& __p)
139 second(__p.second) { }
141 #ifdef __GXX_EXPERIMENTAL_CXX0X__
142 template<class _U1, class _U2>
143 pair(pair<_U1, _U2>&& __p)
144 : first(std::move(__p.first)),
145 second(std::move(__p.second)) { }
148 operator=(pair&& __p)
150 first = std::move(__p.first);
151 second = std::move(__p.second);
155 template<class _U1, class _U2>
157 operator=(const pair<_U1, _U2>& __p)
164 template<class _U1, class _U2>
166 operator=(pair<_U1, _U2>&& __p)
168 first = std::move(__p.first);
169 second = std::move(__p.second);
177 swap(first, __p.first);
178 swap(second, __p.second);
182 template<typename _Tp, typename... _Args>
184 __cons(tuple<_Args...>&&);
186 template<typename _Tp, typename... _Args, int... _Indexes>
188 __do_cons(tuple<_Args...>&&, const _Index_tuple<_Indexes...>&);
192 /// Two pairs of the same type are equal iff their members are equal.
193 template<class _T1, class _T2>
195 operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
196 { return __x.first == __y.first && __x.second == __y.second; }
198 /// <http://gcc.gnu.org/onlinedocs/libstdc++/manual/utilities.html>
199 template<class _T1, class _T2>
201 operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
202 { return __x.first < __y.first
203 || (!(__y.first < __x.first) && __x.second < __y.second); }
205 /// Uses @c operator== to find the result.
206 template<class _T1, class _T2>
208 operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
209 { return !(__x == __y); }
211 /// Uses @c operator< to find the result.
212 template<class _T1, class _T2>
214 operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
215 { return __y < __x; }
217 /// Uses @c operator< to find the result.
218 template<class _T1, class _T2>
220 operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
221 { return !(__y < __x); }
223 /// Uses @c operator< to find the result.
224 template<class _T1, class _T2>
226 operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
227 { return !(__x < __y); }
229 #ifdef __GXX_EXPERIMENTAL_CXX0X__
230 /// See std::pair::swap().
231 // Note: no std::swap overloads in C++03 mode, this has performance
232 // implications, see, eg, libstdc++/38466.
233 template<class _T1, class _T2>
235 swap(pair<_T1, _T2>& __x, pair<_T1, _T2>& __y)
240 * @brief A convenience wrapper for creating a pair from two objects.
241 * @param x The first object.
242 * @param y The second object.
243 * @return A newly-constructed pair<> object of the appropriate type.
245 * The standard requires that the objects be passed by reference-to-const,
246 * but LWG issue #181 says they should be passed by const value. We follow
247 * the LWG by default.
249 // _GLIBCXX_RESOLVE_LIB_DEFECTS
250 // 181. make_pair() unintended behavior
251 #ifndef __GXX_EXPERIMENTAL_CXX0X__
252 template<class _T1, class _T2>
253 inline pair<_T1, _T2>
254 make_pair(_T1 __x, _T2 __y)
255 { return pair<_T1, _T2>(__x, __y); }
258 template<class _T1, class _T2>
259 inline pair<typename __decay_and_strip<_T1>::__type,
260 typename __decay_and_strip<_T2>::__type>
261 make_pair(_T1&& __x, _T2&& __y)
263 return pair<typename __decay_and_strip<_T1>::__type,
264 typename __decay_and_strip<_T2>::__type>
265 (std::forward<_T1>(__x), std::forward<_T2>(__y));
269 _GLIBCXX_END_NAMESPACE
271 #endif /* _STL_PAIR_H */