Gecko [ paroquia-rio-de-mouro.pt ]

Name	Size	Permission	Date
algorithmfwd.h	21.14 KB	-rw-r--r--	2019-10-04 20:36
alloc_traits.h	20.05 KB	-rw-r--r--	2019-10-04 20:36
allocated_ptr.h	3.38 KB	-rw-r--r--	2019-10-04 20:36
allocator.h	6.32 KB	-rw-r--r--	2019-10-04 20:36
atomic_base.h	23.41 KB	-rw-r--r--	2019-10-04 20:36
atomic_futex.h	9.35 KB	-rw-r--r--	2019-10-04 20:36
atomic_lockfree_defines.h	2.2 KB	-rw-r--r--	2019-10-04 20:36
basic_ios.h	15.7 KB	-rw-r--r--	2019-10-04 20:36
basic_ios.tcc	5.89 KB	-rw-r--r--	2019-10-04 20:36
basic_string.h	198.81 KB	-rw-r--r--	2019-10-04 20:36
basic_string.tcc	50.73 KB	-rw-r--r--	2019-10-04 20:36
boost_concept_check.h	26.41 KB	-rw-r--r--	2019-10-04 20:36
c++0x_warning.h	1.44 KB	-rw-r--r--	2019-10-04 20:36
c++14_warning.h	1.48 KB	-rw-r--r--	2019-10-04 20:36
char_traits.h	17.56 KB	-rw-r--r--	2019-10-04 20:36
codecvt.h	20.8 KB	-rw-r--r--	2019-10-04 20:36
concept_check.h	3.26 KB	-rw-r--r--	2019-10-04 20:36
cpp_type_traits.h	10.04 KB	-rw-r--r--	2019-10-04 20:36
cxxabi_forced.h	1.77 KB	-rw-r--r--	2019-10-04 20:36
deque.tcc	32.89 KB	-rw-r--r--	2019-10-04 20:36
enable_special_members.h	10.87 KB	-rw-r--r--	2019-10-04 20:36
exception_defines.h	1.61 KB	-rw-r--r--	2019-10-04 20:36
exception_ptr.h	5.5 KB	-rw-r--r--	2019-10-04 20:36
forward_list.h	47.01 KB	-rw-r--r--	2019-10-04 20:36
forward_list.tcc	15.17 KB	-rw-r--r--	2019-10-04 20:36
fstream.tcc	32.1 KB	-rw-r--r--	2019-10-04 20:36
functexcept.h	3.18 KB	-rw-r--r--	2019-10-04 20:36
functional_hash.h	6.05 KB	-rw-r--r--	2019-10-04 20:36
gslice.h	5.39 KB	-rw-r--r--	2019-10-04 20:36
gslice_array.h	7.59 KB	-rw-r--r--	2019-10-04 20:36
hash_bytes.h	2.1 KB	-rw-r--r--	2019-10-04 20:36
hashtable.h	67.95 KB	-rw-r--r--	2019-10-04 20:36
hashtable_policy.h	62.61 KB	-rw-r--r--	2019-10-04 20:36
indirect_array.h	7.68 KB	-rw-r--r--	2019-10-04 20:36
ios_base.h	30.21 KB	-rw-r--r--	2019-10-04 20:36
istream.tcc	30.21 KB	-rw-r--r--	2019-10-04 20:36
list.tcc	13.5 KB	-rw-r--r--	2019-10-04 20:36
locale_classes.h	24.14 KB	-rw-r--r--	2019-10-04 20:36
locale_classes.tcc	8.18 KB	-rw-r--r--	2019-10-04 20:36
locale_conv.h	15.64 KB	-rw-r--r--	2019-10-04 20:36
locale_facets.h	89.93 KB	-rw-r--r--	2019-10-04 20:36
locale_facets.tcc	38.63 KB	-rw-r--r--	2019-10-04 20:36
locale_facets_nonio.h	67.33 KB	-rw-r--r--	2019-10-04 20:36
locale_facets_nonio.tcc	44.04 KB	-rw-r--r--	2019-10-04 20:36
localefwd.h	5.51 KB	-rw-r--r--	2019-10-04 20:36
mask_array.h	7.41 KB	-rw-r--r--	2019-10-04 20:36
memoryfwd.h	2.36 KB	-rw-r--r--	2019-10-04 20:36
move.h	5.93 KB	-rw-r--r--	2019-10-04 20:36
nested_exception.h	4.5 KB	-rw-r--r--	2019-10-04 20:36
ostream.tcc	12.03 KB	-rw-r--r--	2019-10-04 20:36
ostream_insert.h	3.91 KB	-rw-r--r--	2019-10-04 20:36
parse_numbers.h	7.58 KB	-rw-r--r--	2019-10-04 20:36
postypes.h	8.02 KB	-rw-r--r--	2019-10-04 20:36
predefined_ops.h	7.75 KB	-rw-r--r--	2019-10-04 20:36
ptr_traits.h	5.02 KB	-rw-r--r--	2019-10-04 20:36
quoted_string.h	4.47 KB	-rw-r--r--	2019-10-04 20:36
random.h	169.22 KB	-rw-r--r--	2019-10-04 20:36
random.tcc	102.74 KB	-rw-r--r--	2019-10-04 20:36
range_access.h	7.11 KB	-rw-r--r--	2019-10-04 20:36
regex.h	94.4 KB	-rw-r--r--	2019-10-04 20:36
regex.tcc	16.72 KB	-rw-r--r--	2019-10-04 20:36
regex_automaton.h	8.52 KB	-rw-r--r--	2019-10-04 20:36
regex_automaton.tcc	7.71 KB	-rw-r--r--	2019-10-04 20:36
regex_compiler.h	14.35 KB	-rw-r--r--	2019-10-04 20:36
regex_compiler.tcc	17.4 KB	-rw-r--r--	2019-10-04 20:36
regex_constants.h	13.57 KB	-rw-r--r--	2019-10-04 20:36
regex_error.h	4.48 KB	-rw-r--r--	2019-10-04 20:36
regex_executor.h	6.62 KB	-rw-r--r--	2019-10-04 20:36
regex_executor.tcc	13.99 KB	-rw-r--r--	2019-10-04 20:36
regex_scanner.h	6.88 KB	-rw-r--r--	2019-10-04 20:36
regex_scanner.tcc	13.8 KB	-rw-r--r--	2019-10-04 20:36
shared_ptr.h	19.8 KB	-rw-r--r--	2019-10-04 20:36
shared_ptr_atomic.h	9.54 KB	-rw-r--r--	2019-10-04 20:36
shared_ptr_base.h	44.48 KB	-rw-r--r--	2019-10-04 20:36
slice_array.h	9.12 KB	-rw-r--r--	2019-10-04 20:36
sstream.tcc	9.27 KB	-rw-r--r--	2019-10-04 20:36
stl_algo.h	198.04 KB	-rw-r--r--	2019-10-04 20:36
stl_algobase.h	49.72 KB	-rw-r--r--	2019-10-04 20:36
stl_bvector.h	32.76 KB	-rw-r--r--	2019-10-04 20:36
stl_construct.h	5.05 KB	-rw-r--r--	2019-10-04 20:36
stl_deque.h	75.97 KB	-rw-r--r--	2019-10-04 20:36
stl_function.h	32.55 KB	-rw-r--r--	2019-10-04 20:36
stl_heap.h	18.19 KB	-rw-r--r--	2019-10-04 20:36
stl_iterator.h	36.98 KB	-rw-r--r--	2019-10-04 20:36
stl_iterator_base_funcs.h	6.8 KB	-rw-r--r--	2019-10-04 20:36
stl_iterator_base_types.h	8.42 KB	-rw-r--r--	2019-10-04 20:36
stl_list.h	60.65 KB	-rw-r--r--	2019-10-04 20:36
stl_map.h	39.54 KB	-rw-r--r--	2019-10-04 20:36
stl_multimap.h	36.77 KB	-rw-r--r--	2019-10-04 20:36
stl_multiset.h	30.93 KB	-rw-r--r--	2019-10-04 20:36
stl_numeric.h	13.5 KB	-rw-r--r--	2019-10-04 20:36
stl_pair.h	9.63 KB	-rw-r--r--	2019-10-04 20:36
stl_queue.h	18.28 KB	-rw-r--r--	2019-10-04 20:36
stl_raw_storage_iter.h	3.37 KB	-rw-r--r--	2019-10-04 20:36
stl_relops.h	4.49 KB	-rw-r--r--	2019-10-04 20:36
stl_set.h	31.18 KB	-rw-r--r--	2019-10-04 20:36
stl_stack.h	9.71 KB	-rw-r--r--	2019-10-04 20:36
stl_tempbuf.h	8.15 KB	-rw-r--r--	2019-10-04 20:36
stl_tree.h	67.54 KB	-rw-r--r--	2019-10-04 20:36
stl_uninitialized.h	21.37 KB	-rw-r--r--	2019-10-04 20:36
stl_vector.h	52.41 KB	-rw-r--r--	2019-10-04 20:36
stream_iterator.h	6.44 KB	-rw-r--r--	2019-10-04 20:36
streambuf.tcc	4.81 KB	-rw-r--r--	2019-10-04 20:36
streambuf_iterator.h	12.33 KB	-rw-r--r--	2019-10-04 20:36
stringfwd.h	2.55 KB	-rw-r--r--	2019-10-04 20:36
uniform_int_dist.h	9.72 KB	-rw-r--r--	2019-10-04 20:36
unique_ptr.h	23.29 KB	-rw-r--r--	2019-10-04 20:36
unordered_map.h	52.15 KB	-rw-r--r--	2019-10-04 20:36
unordered_set.h	47.51 KB	-rw-r--r--	2019-10-04 20:36
uses_allocator.h	3.19 KB	-rw-r--r--	2019-10-04 20:36
valarray_after.h	22.12 KB	-rw-r--r--	2019-10-04 20:36
valarray_array.h	21.23 KB	-rw-r--r--	2019-10-04 20:36
valarray_array.tcc	7.08 KB	-rw-r--r--	2019-10-04 20:36
valarray_before.h	18.08 KB	-rw-r--r--	2019-10-04 20:36
vector.tcc	26.42 KB	-rw-r--r--	2019-10-04 20:36

Rename

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

// Copyright (C) 2001-2015 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 */