File Manager

X7ROOT File Manager

Current Path: /usr/include/c++/4.8.2/bits

📁 ..
📄 algorithmfwd.h(20.66 KB)
📄 alloc_traits.h(17.66 KB)
📄 allocator.h(6.1 KB)
📄 atomic_base.h(24.99 KB)
📄 atomic_lockfree_defines.h(2.2 KB)
📄 basic_ios.h(14.76 KB)
📄 basic_ios.tcc(5.89 KB)
📄 basic_string.h(109.49 KB)
📄 basic_string.tcc(38.43 KB)
📄 boost_concept_check.h(26.41 KB)
📄 c++0x_warning.h(1.47 KB)
📄 char_traits.h(16.95 KB)
📄 codecvt.h(16.23 KB)
📄 concept_check.h(3.26 KB)
📄 cpp_type_traits.h(9.56 KB)
📄 cxxabi_forced.h(1.77 KB)
📄 deque.tcc(31.91 KB)
📄 exception_defines.h(1.6 KB)
📄 exception_ptr.h(5.29 KB)
📄 forward_list.h(46.72 KB)
📄 forward_list.tcc(15.17 KB)
📄 fstream.tcc(28.3 KB)
📄 functexcept.h(3.04 KB)
📄 functional_hash.h(6.05 KB)
📄 gslice.h(5.39 KB)
📄 gslice_array.h(7.59 KB)
📄 hash_bytes.h(2.1 KB)
📄 hashtable.h(61.05 KB)
📄 hashtable_policy.h(52.72 KB)
📄 indirect_array.h(7.68 KB)
📄 ios_base.h(27.85 KB)
📄 istream.tcc(30.36 KB)
📄 list.tcc(12.2 KB)
📄 locale_classes.h(22.45 KB)
📄 locale_classes.tcc(8.18 KB)
📄 locale_facets.h(88.84 KB)
📄 locale_facets.tcc(38.02 KB)
📄 locale_facets_nonio.h(63.51 KB)
📄 locale_facets_nonio.tcc(40.85 KB)
📄 localefwd.h(5.1 KB)
📄 mask_array.h(7.41 KB)
📄 memoryfwd.h(2.36 KB)
📄 move.h(5.67 KB)
📄 nested_exception.h(4.58 KB)
📄 ostream.tcc(12.03 KB)
📄 ostream_insert.h(3.91 KB)
📄 postypes.h(8.02 KB)
📄 ptr_traits.h(5.17 KB)
📄 random.h(173.19 KB)
📄 random.tcc(106.59 KB)
📄 range_access.h(3.06 KB)
📄 regex.h(83.49 KB)
📄 regex_compiler.h(27.68 KB)
📄 regex_constants.h(10.81 KB)
📄 regex_cursor.h(2.7 KB)
📄 regex_error.h(4.5 KB)
📄 regex_grep_matcher.h(4.23 KB)
📄 regex_grep_matcher.tcc(5.41 KB)
📄 regex_nfa.h(10.65 KB)
📄 regex_nfa.tcc(4.85 KB)
📄 shared_ptr.h(18.97 KB)
📄 shared_ptr_base.h(40.65 KB)
📄 slice_array.h(9.12 KB)
📄 sstream.tcc(9.27 KB)
📄 stl_algo.h(212.55 KB)
📄 stl_algobase.h(41.41 KB)
📄 stl_bvector.h(28.98 KB)
📄 stl_construct.h(5.05 KB)
📄 stl_deque.h(66.41 KB)
📄 stl_function.h(22.06 KB)
📄 stl_heap.h(19.99 KB)
📄 stl_iterator.h(35.77 KB)
📄 stl_iterator_base_funcs.h(6.8 KB)
📄 stl_iterator_base_types.h(8.19 KB)
📄 stl_list.h(52.83 KB)
📄 stl_map.h(36.78 KB)
📄 stl_multimap.h(33.94 KB)
📄 stl_multiset.h(28.37 KB)
📄 stl_numeric.h(13.5 KB)
📄 stl_pair.h(9.63 KB)
📄 stl_queue.h(18.21 KB)
📄 stl_raw_storage_iter.h(3.37 KB)
📄 stl_relops.h(4.49 KB)
📄 stl_set.h(28.61 KB)
📄 stl_stack.h(9.65 KB)
📄 stl_tempbuf.h(8.15 KB)
📄 stl_tree.h(53.56 KB)
📄 stl_uninitialized.h(19.95 KB)
📄 stl_vector.h(48.64 KB)
📄 stream_iterator.h(6.44 KB)
📄 streambuf.tcc(4.81 KB)
📄 streambuf_iterator.h(12.33 KB)
📄 stringfwd.h(2.37 KB)
📄 unique_ptr.h(17.19 KB)
📄 unordered_map.h(47.76 KB)
📄 unordered_set.h(43.25 KB)
📄 uses_allocator.h(3.49 KB)
📄 valarray_after.h(22.12 KB)
📄 valarray_array.h(21.23 KB)
📄 valarray_array.tcc(7.08 KB)
📄 valarray_before.h(18.08 KB)
📄 vector.tcc(25.55 KB)

Editing: stl_pair.h

// Pair implementation -*- C++ -*-

// Copyright (C) 2001-2013 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
// <http://www.gnu.org/licenses/>.

/*
 *
 * 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 bits/stl_pair.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{utility}
 */

#ifndef _STL_PAIR_H
#define _STL_PAIR_H 1

#include <bits/move.h> // for std::move / std::forward, and std::swap

#if __cplusplus >= 201103L
#include <type_traits> // for std::__decay_and_strip too
#endif

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

/**
   *  @addtogroup utilities
   *  @{
   */

#if __cplusplus >= 201103L
  /// piecewise_construct_t
  struct piecewise_construct_t { };

/// piecewise_construct
  constexpr piecewise_construct_t piecewise_construct = piecewise_construct_t();

// Forward declarations.
  template<typename...>
    class tuple;

template<std::size_t...>
    struct _Index_tuple;
#endif

/**
   *  @brief Struct holding two objects of arbitrary type.
   *
   *  @tparam _T1  Type of first object.
   *  @tparam _T2  Type of second object.
   */
  template<class _T1, class _T2>
    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.  */
      _GLIBCXX_CONSTEXPR pair()
      : first(), second() { }

/** Two objects may be passed to a @c pair constructor to be copied.  */
      _GLIBCXX_CONSTEXPR pair(const _T1& __a, const _T2& __b)
      : first(__a), second(__b) { }

/** There is also a templated copy ctor for the @c pair class itself.  */
#if __cplusplus < 201103L
      template<class _U1, class _U2>
	pair(const pair<_U1, _U2>& __p)
	: first(__p.first), second(__p.second) { }
#else
      template<class _U1, class _U2, class = typename
	       enable_if<__and_<is_convertible<const _U1&, _T1>,
				is_convertible<const _U2&, _T2>>::value>::type>
	constexpr pair(const pair<_U1, _U2>& __p)
	: first(__p.first), second(__p.second) { }

constexpr pair(const pair&) = default;
      constexpr pair(pair&&) = default;

// DR 811.
      template<class _U1, class = typename
	       enable_if<is_convertible<_U1, _T1>::value>::type>
	constexpr pair(_U1&& __x, const _T2& __y)
	: first(std::forward<_U1>(__x)), second(__y) { }

template<class _U2, class = typename
	       enable_if<is_convertible<_U2, _T2>::value>::type>
	constexpr pair(const _T1& __x, _U2&& __y)
	: first(__x), second(std::forward<_U2>(__y)) { }

template<class _U1, class _U2, class = typename
	       enable_if<__and_<is_convertible<_U1, _T1>,
				is_convertible<_U2, _T2>>::value>::type>
	constexpr pair(_U1&& __x, _U2&& __y)
	: first(std::forward<_U1>(__x)), second(std::forward<_U2>(__y)) { }

template<class _U1, class _U2, class = typename
	       enable_if<__and_<is_convertible<_U1, _T1>,
				is_convertible<_U2, _T2>>::value>::type>
	constexpr pair(pair<_U1, _U2>&& __p)
	: first(std::forward<_U1>(__p.first)),
	  second(std::forward<_U2>(__p.second)) { }

template<typename... _Args1, typename... _Args2>
        pair(piecewise_construct_t, tuple<_Args1...>, tuple<_Args2...>);

pair&
      operator=(const pair& __p)
      {
	first = __p.first;
	second = __p.second;
	return *this;
      }

pair&
      operator=(pair&& __p)
      noexcept(__and_<is_nothrow_move_assignable<_T1>,
	              is_nothrow_move_assignable<_T2>>::value)
      {
	first = std::forward<first_type>(__p.first);
	second = std::forward<second_type>(__p.second);
	return *this;
      }

template<class _U1, class _U2>
	pair&
	operator=(const pair<_U1, _U2>& __p)
	{
	  first = __p.first;
	  second = __p.second;
	  return *this;
	}

template<class _U1, class _U2>
	pair&
	operator=(pair<_U1, _U2>&& __p)
	{
	  first = std::forward<_U1>(__p.first);
	  second = std::forward<_U2>(__p.second);
	  return *this;
	}

void
      swap(pair& __p)
      noexcept(noexcept(swap(first, __p.first))
	       && noexcept(swap(second, __p.second)))
      {
	using std::swap;
	swap(first, __p.first);
	swap(second, __p.second);
      }

private:
      template<typename... _Args1, std::size_t... _Indexes1,
               typename... _Args2, std::size_t... _Indexes2>
        pair(tuple<_Args1...>&, tuple<_Args2...>&,
             _Index_tuple<_Indexes1...>, _Index_tuple<_Indexes2...>);
#endif
    };

/// Two pairs of the same type are equal iff their members are equal.
  template<class _T1, class _T2>
    inline _GLIBCXX_CONSTEXPR bool
    operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
    { return __x.first == __y.first && __x.second == __y.second; }

/// <http://gcc.gnu.org/onlinedocs/libstdc++/manual/utilities.html>
  template<class _T1, class _T2>
    inline _GLIBCXX_CONSTEXPR 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<class _T1, class _T2>
    inline _GLIBCXX_CONSTEXPR bool
    operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
    { return !(__x == __y); }

/// Uses @c operator< to find the result.
  template<class _T1, class _T2>
    inline _GLIBCXX_CONSTEXPR bool
    operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
    { return __y < __x; }

/// Uses @c operator< to find the result.
  template<class _T1, class _T2>
    inline _GLIBCXX_CONSTEXPR bool
    operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
    { return !(__y < __x); }

/// Uses @c operator< to find the result.
  template<class _T1, class _T2>
    inline _GLIBCXX_CONSTEXPR bool
    operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
    { return !(__x < __y); }

#if __cplusplus >= 201103L
  /// See std::pair::swap().
  // Note:  no std::swap overloads in C++03 mode, this has performance
  //        implications, see, eg, libstdc++/38466.
  template<class _T1, class _T2>
    inline void
    swap(pair<_T1, _T2>& __x, pair<_T1, _T2>& __y)
    noexcept(noexcept(__x.swap(__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
#if __cplusplus >= 201103L
  // NB: DR 706.
  template<class _T1, class _T2>
    constexpr pair<typename __decay_and_strip<_T1>::__type,
                   typename __decay_and_strip<_T2>::__type>
    make_pair(_T1&& __x, _T2&& __y)
    {
      typedef typename __decay_and_strip<_T1>::__type __ds_type1;
      typedef typename __decay_and_strip<_T2>::__type __ds_type2;
      typedef pair<__ds_type1, __ds_type2> 	      __pair_type;
      return __pair_type(std::forward<_T1>(__x), std::forward<_T2>(__y));
    }
#else
  template<class _T1, class _T2>
    inline pair<_T1, _T2>
    make_pair(_T1 __x, _T2 __y)
    { return pair<_T1, _T2>(__x, __y); }
#endif

/// @}

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#endif /* _STL_PAIR_H */

X7ROOT File Manager

Editing: stl_pair.h

Upload File

Create Folder