/usr/include/c++/4.4.4/bits
NameSizeModeActions
algorithmfwd.h207460644editdlrm
allocator.h51890644editdlrm
atomicfwd_c.h47490644editdlrm
atomicfwd_cxx.h29210644editdlrm
atomic_0.h139710644editdlrm
atomic_2.h127790644editdlrm
basic_ios.h149470644editdlrm
basic_ios.tcc60380644editdlrm
basic_string.h997180644editdlrm
basic_string.tcc393300644editdlrm
boost_concept_check.h270110644editdlrm
char_traits.h164100644editdlrm
cmath.tcc16530644editdlrm
codecvt.h165030644editdlrm
concept_check.h33220644editdlrm
cpp_type_traits.h96670644editdlrm
deque.tcc269200644editdlrm
forward_list.h447530644editdlrm
forward_list.tcc158060644editdlrm
fstream.tcc272430644editdlrm
functexcept.h27300644editdlrm
functional_hash.h20430644editdlrm
gslice.h54510644editdlrm
gslice_array.h77190644editdlrm
hashtable.h18770644editdlrm
indirect_array.h78180644editdlrm
ios_base.h281970644editdlrm
istream.tcc294560644editdlrm
list.tcc112740644editdlrm
localefwd.h50580644editdlrm
locale_classes.h235480644editdlrm
locale_classes.tcc72880644editdlrm
locale_facets.h905450644editdlrm
locale_facets.tcc387540644editdlrm
locale_facets_nonio.h654870644editdlrm
locale_facets_nonio.tcc411150644editdlrm
mask_array.h75440644editdlrm
move.h27040644editdlrm
ostream.tcc124460644editdlrm
ostream_insert.h39530644editdlrm
postypes.h82000644editdlrm
shared_ptr.h486550644editdlrm
slice_array.h92840644editdlrm
sstream.tcc90550644editdlrm
stl_algo.h2078770644editdlrm
stl_algobase.h399660644editdlrm
stl_bvector.h261920644editdlrm
stl_construct.h49570644editdlrm
stl_deque.h609240644editdlrm
stl_function.h222640644editdlrm
stl_heap.h200590644editdlrm
stl_iterator.h330140644editdlrm
stl_iterator_base_funcs.h68130644editdlrm
stl_iterator_base_types.h64810644editdlrm
stl_list.h491930644editdlrm
stl_map.h314590644editdlrm
stl_multimap.h294580644editdlrm
stl_multiset.h246940644editdlrm
stl_numeric.h132720644editdlrm
stl_pair.h84290644editdlrm
stl_queue.h187820644editdlrm
stl_raw_storage_iter.h33900644editdlrm
stl_relops.h44900644editdlrm
stl_set.h248820644editdlrm
stl_stack.h97370644editdlrm
stl_tempbuf.h64960644editdlrm
stl_tree.h436380644editdlrm
stl_uninitialized.h151100644editdlrm
stl_vector.h423260644editdlrm
streambuf.tcc49210644editdlrm
streambuf_iterator.h121710644editdlrm
stream_iterator.h64180644editdlrm
stringfwd.h22030644editdlrm
unique_ptr.h127110644editdlrm
valarray_after.h225490644editdlrm
valarray_array.h217420644editdlrm
valarray_array.tcc71890644editdlrm
valarray_before.h182070644editdlrm
vector.tcc211230644editdlrm
Edit: /usr/include/c++/4.4.4/bits/stl_pair.h (8429B)
// Pair implementation -*- C++ -*- // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 // Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the // terms of the GNU General Public License as published by the // Free Software Foundation; either version 3, or (at your option) // any later version. // This library is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // Under Section 7 of GPL version 3, you are granted additional // permissions described in the GCC Runtime Library Exception, version // 3.1, as published by the Free Software Foundation. // You should have received a copy of the GNU General Public License and // a copy of the GCC Runtime Library Exception along with this program; // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see // . /* * * 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. */ /** @file stl_pair.h * This is an internal header file, included by other library headers. * You should not attempt to use it directly. */ #ifndef _STL_PAIR_H #define _STL_PAIR_H 1 #include // for std::move / std::forward, std::decay, and // std::swap _GLIBCXX_BEGIN_NAMESPACE(std) /// pair holds two objects of arbitrary type. template struct pair { typedef _T1 first_type; ///< @c first_type is the first bound type typedef _T2 second_type; ///< @c second_type is the second bound type _T1 first; ///< @c first is a copy of the first object _T2 second; ///< @c second is a copy of the second object // _GLIBCXX_RESOLVE_LIB_DEFECTS // 265. std::pair::pair() effects overly restrictive /** The default constructor creates @c first and @c second using their * respective default constructors. */ pair() : first(), second() { } /** Two objects may be passed to a @c pair constructor to be copied. */ pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) { } #ifdef __GXX_EXPERIMENTAL_CXX0X__ template pair(_U1&& __x, _U2&& __y) : first(std::forward<_U1>(__x)), second(std::forward<_U2>(__y)) { } pair(pair&& __p) : first(std::move(__p.first)), second(std::move(__p.second)) { } #endif /** There is also a templated copy ctor for the @c pair class itself. */ template pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) { } #ifdef __GXX_EXPERIMENTAL_CXX0X__ template pair(pair<_U1, _U2>&& __p) : first(std::move(__p.first)), second(std::move(__p.second)) { } // http://gcc.gnu.org/ml/libstdc++/2007-08/msg00052.html template pair(_U1&& __x, _Arg0&& __arg0, _Args&&... __args) : first(std::forward<_U1>(__x)), second(std::forward<_Arg0>(__arg0), std::forward<_Args>(__args)...) { } pair& operator=(pair&& __p) { first = std::move(__p.first); second = std::move(__p.second); return *this; } template pair& operator=(pair<_U1, _U2>&& __p) { first = std::move(__p.first); second = std::move(__p.second); return *this; } void swap(pair&& __p) { using std::swap; swap(first, __p.first); swap(second, __p.second); } #endif }; /// Two pairs of the same type are equal iff their members are equal. template inline bool operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) { return __x.first == __y.first && __x.second == __y.second; } /// template 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); } /// Uses @c operator== to find the result. template inline bool operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) { return !(__x == __y); } /// Uses @c operator< to find the result. template inline bool operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) { return __y < __x; } /// Uses @c operator< to find the result. template inline bool operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) { return !(__y < __x); } /// Uses @c operator< to find the result. template inline bool operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) { return !(__x < __y); } #ifdef __GXX_EXPERIMENTAL_CXX0X__ /// See std::pair::swap(). // Note: no std::swap overloads in C++03 mode, this has performance // implications, see, eg, libstdc++/38466. template inline void swap(pair<_T1, _T2>& __x, pair<_T1, _T2>& __y) { __x.swap(__y); } template inline void swap(pair<_T1, _T2>&& __x, pair<_T1, _T2>& __y) { __x.swap(__y); } template inline void swap(pair<_T1, _T2>& __x, pair<_T1, _T2>&& __y) { __x.swap(__y); } #endif /** * @brief A convenience wrapper for creating a pair from two objects. * @param x The first object. * @param y The second object. * @return A newly-constructed pair<> object of the appropriate type. * * The standard requires that the objects be passed by reference-to-const, * but LWG issue #181 says they should be passed by const value. We follow * the LWG by default. */ // _GLIBCXX_RESOLVE_LIB_DEFECTS // 181. make_pair() unintended behavior #ifndef __GXX_EXPERIMENTAL_CXX0X__ template inline pair<_T1, _T2> make_pair(_T1 __x, _T2 __y) { return pair<_T1, _T2>(__x, __y); } #else template class reference_wrapper; // Helper which adds a reference to a type when given a reference_wrapper template struct __strip_reference_wrapper { typedef _Tp __type; }; template struct __strip_reference_wrapper > { typedef _Tp& __type; }; template struct __strip_reference_wrapper > { typedef _Tp& __type; }; template struct __decay_and_strip { typedef typename __strip_reference_wrapper< typename decay<_Tp>::type>::__type __type; }; // NB: DR 706. template inline pair::__type, typename __decay_and_strip<_T2>::__type> make_pair(_T1&& __x, _T2&& __y) { return pair::__type, typename __decay_and_strip<_T2>::__type> (std::forward<_T1>(__x), std::forward<_T2>(__y)); } #endif _GLIBCXX_END_NAMESPACE #endif /* _STL_PAIR_H */