Gecko [ www.foryou-vip.com ]

Name	Size	Permission	Date
backward	[ DIR ]	drwxrwxrwx	2020-08-24 23:49
bits	[ DIR ]	drwxrwxrwx	2020-08-24 23:49
debug	[ DIR ]	drwxrwxrwx	2020-08-24 23:49
decimal	[ DIR ]	drwxrwxrwx	2020-08-24 23:49
experimental	[ DIR ]	drwxrwxrwx	2020-08-24 23:49
ext	[ DIR ]	drwxrwxrwx	2020-08-24 23:49
parallel	[ DIR ]	drwxrwxrwx	2020-08-24 23:49
profile	[ DIR ]	drwxrwxrwx	2020-08-24 23:49
sun	[ DIR ]	drwxrwxrwx	2020-08-24 23:49
tr1	[ DIR ]	drwxrwxrwx	2020-08-24 23:49
tr2	[ DIR ]	drwxrwxrwx	2020-08-24 23:49
algorithm	2.46 KB	-rwxrwxrwx	2018-02-14 17:53
array	9.84 KB	-rwxrwxrwx	2018-02-14 17:53
atomic	37 KB	-rwxrwxrwx	2018-02-14 17:53
bitset	44.87 KB	-rwxrwxrwx	2018-02-14 17:53
cassert	1.61 KB	-rwxrwxrwx	2018-02-14 17:53
ccomplex	1.3 KB	-rwxrwxrwx	2018-02-14 17:53
cctype	2.35 KB	-rwxrwxrwx	2018-02-14 17:53
cerrno	1.73 KB	-rwxrwxrwx	2018-02-14 17:53
cfenv	2 KB	-rwxrwxrwx	2018-02-14 17:53
cfloat	1.84 KB	-rwxrwxrwx	2018-02-14 17:53
chrono	26.13 KB	-rwxrwxrwx	2018-02-14 17:53
cinttypes	2.11 KB	-rwxrwxrwx	2018-02-14 17:53
ciso646	1.43 KB	-rwxrwxrwx	2018-02-14 17:53
climits	1.87 KB	-rwxrwxrwx	2018-02-14 17:53
clocale	1.86 KB	-rwxrwxrwx	2018-02-14 17:53
cmath	46.56 KB	-rwxrwxrwx	2018-02-14 17:53
codecvt	5.22 KB	-rwxrwxrwx	2018-02-14 17:53
complex	52.72 KB	-rwxrwxrwx	2018-02-14 17:53
complex.h	1.43 KB	-rwxrwxrwx	2018-02-14 17:53
condition_variable	8.45 KB	-rwxrwxrwx	2018-02-14 17:53
csetjmp	1.9 KB	-rwxrwxrwx	2018-02-14 17:53
csignal	1.81 KB	-rwxrwxrwx	2018-02-14 17:53
cstdalign	1.37 KB	-rwxrwxrwx	2018-02-14 17:53
cstdarg	1.82 KB	-rwxrwxrwx	2018-02-14 17:53
cstdbool	1.37 KB	-rwxrwxrwx	2018-02-14 17:53
cstddef	1.89 KB	-rwxrwxrwx	2018-02-14 17:53
cstdint	2.12 KB	-rwxrwxrwx	2018-02-14 17:53
cstdio	4.33 KB	-rwxrwxrwx	2018-02-14 17:53
cstdlib	6.72 KB	-rwxrwxrwx	2018-02-14 17:53
cstring	3.05 KB	-rwxrwxrwx	2018-02-14 17:53
ctgmath	1.33 KB	-rwxrwxrwx	2018-02-14 17:53
ctime	2.08 KB	-rwxrwxrwx	2018-02-14 17:53
cuchar	2.16 KB	-rwxrwxrwx	2018-02-14 17:53
cwchar	6.36 KB	-rwxrwxrwx	2018-02-14 17:53
cwctype	2.73 KB	-rwxrwxrwx	2018-02-14 17:53
cxxabi.h	21.56 KB	-rwxrwxrwx	2018-02-14 17:53
deque	2.6 KB	-rwxrwxrwx	2018-02-14 17:53
exception	5.65 KB	-rwxrwxrwx	2018-02-14 17:53
fenv.h	1.97 KB	-rwxrwxrwx	2018-02-14 17:53
forward_list	1.54 KB	-rwxrwxrwx	2018-02-14 17:53
fstream	33.06 KB	-rwxrwxrwx	2018-02-14 17:53
functional	68.77 KB	-rwxrwxrwx	2018-02-14 17:53
future	49.58 KB	-rwxrwxrwx	2018-02-14 17:53
initializer_list	2.9 KB	-rwxrwxrwx	2018-02-14 17:53
iomanip	15.82 KB	-rwxrwxrwx	2018-02-14 17:53
ios	1.56 KB	-rwxrwxrwx	2018-02-14 17:53
iosfwd	6.76 KB	-rwxrwxrwx	2018-02-14 17:53
iostream	2.63 KB	-rwxrwxrwx	2018-02-14 17:53
istream	30.22 KB	-rwxrwxrwx	2018-02-14 17:53
iterator	2.58 KB	-rwxrwxrwx	2018-02-14 17:53
limits	67.75 KB	-rwxrwxrwx	2018-02-14 17:53
list	2.53 KB	-rwxrwxrwx	2018-02-14 17:53
locale	1.45 KB	-rwxrwxrwx	2018-02-14 17:53
map	2.5 KB	-rwxrwxrwx	2018-02-14 17:53
math.h	4.28 KB	-rwxrwxrwx	2018-02-14 17:53
memory	4.62 KB	-rwxrwxrwx	2018-02-14 17:53
mutex	15.97 KB	-rwxrwxrwx	2018-02-14 17:53
new	5.17 KB	-rwxrwxrwx	2018-02-14 17:53
numeric	2.72 KB	-rwxrwxrwx	2018-02-14 17:53
ostream	19.79 KB	-rwxrwxrwx	2018-02-14 17:53
queue	2.41 KB	-rwxrwxrwx	2018-02-14 17:53
random	1.65 KB	-rwxrwxrwx	2018-02-14 17:53
ratio	18.69 KB	-rwxrwxrwx	2018-02-14 17:53
regex	1.84 KB	-rwxrwxrwx	2018-02-14 17:53
scoped_allocator	15.76 KB	-rwxrwxrwx	2018-02-14 17:53
set	2.5 KB	-rwxrwxrwx	2018-02-14 17:53
shared_mutex	18.88 KB	-rwxrwxrwx	2018-02-14 17:53
sstream	25.75 KB	-rwxrwxrwx	2018-02-14 17:53
stack	2.33 KB	-rwxrwxrwx	2018-02-14 17:53
stdexcept	7.8 KB	-rwxrwxrwx	2018-02-14 17:53
stdlib.h	2.2 KB	-rwxrwxrwx	2018-02-14 17:53
streambuf	28.87 KB	-rwxrwxrwx	2018-02-14 17:53
string	1.9 KB	-rwxrwxrwx	2018-02-14 17:53
system_error	10.6 KB	-rwxrwxrwx	2018-02-14 17:53
tgmath.h	1.33 KB	-rwxrwxrwx	2018-02-14 17:53
thread	8.59 KB	-rwxrwxrwx	2018-02-14 17:53
tuple	54.9 KB	-rwxrwxrwx	2018-02-14 17:53
type_traits	74.32 KB	-rwxrwxrwx	2018-02-14 17:53
typeindex	3.02 KB	-rwxrwxrwx	2018-02-14 17:53
typeinfo	7.5 KB	-rwxrwxrwx	2018-02-14 17:53
unordered_map	1.81 KB	-rwxrwxrwx	2018-02-14 17:53
unordered_set	1.81 KB	-rwxrwxrwx	2018-02-14 17:53
utility	10.34 KB	-rwxrwxrwx	2018-02-14 17:53
valarray	39.26 KB	-rwxrwxrwx	2018-02-14 17:53
vector	2.68 KB	-rwxrwxrwx	2018-02-14 17:53

Rename

// <array> -*- C++ -*-

// Copyright (C) 2007-2016 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/>.

/** @file include/array
 *  This is a Standard C++ Library header.
 */

#ifndef _GLIBCXX_ARRAY
#define _GLIBCXX_ARRAY 1

#pragma GCC system_header

#if __cplusplus < 201103L
# include <bits/c++0x_warning.h>
#else

#include <utility>
#include <stdexcept>
#include <bits/stl_algobase.h>
#include <bits/range_access.h>

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_CONTAINER

template<typename _Tp, std::size_t _Nm>
    struct __array_traits
    {
      typedef _Tp _Type[_Nm];

static constexpr _Tp&
      _S_ref(const _Type& __t, std::size_t __n) noexcept
      { return const_cast<_Tp&>(__t[__n]); }

static constexpr _Tp*
      _S_ptr(const _Type& __t) noexcept
      { return const_cast<_Tp*>(__t); }
    };

template<typename _Tp>
   struct __array_traits<_Tp, 0>
   {
     struct _Type { };

static constexpr _Tp&
     _S_ref(const _Type&, std::size_t) noexcept
     { return *static_cast<_Tp*>(nullptr); }

static constexpr _Tp*
     _S_ptr(const _Type&) noexcept
     { return nullptr; }
   };

/**
   *  @brief A standard container for storing a fixed size sequence of elements.
   *
   *  @ingroup sequences
   *
   *  Meets the requirements of a <a href="tables.html#65">container</a>, a
   *  <a href="tables.html#66">reversible container</a>, and a
   *  <a href="tables.html#67">sequence</a>.
   *
   *  Sets support random access iterators.
   *
   *  @tparam  Tp  Type of element. Required to be a complete type.
   *  @tparam  N  Number of elements.
  */
  template<typename _Tp, std::size_t _Nm>
    struct array
    {
      typedef _Tp 	    			      value_type;
      typedef value_type*			      pointer;
      typedef const value_type*                       const_pointer;
      typedef value_type&                   	      reference;
      typedef const value_type&             	      const_reference;
      typedef value_type*          		      iterator;
      typedef const value_type*			      const_iterator;
      typedef std::size_t                    	      size_type;
      typedef std::ptrdiff_t                   	      difference_type;
      typedef std::reverse_iterator<iterator>	      reverse_iterator;
      typedef std::reverse_iterator<const_iterator>   const_reverse_iterator;

// Support for zero-sized arrays mandatory.
      typedef _GLIBCXX_STD_C::__array_traits<_Tp, _Nm> _AT_Type;
      typename _AT_Type::_Type                         _M_elems;

// No explicit construct/copy/destroy for aggregate type.

// DR 776.
      void
      fill(const value_type& __u)
      { std::fill_n(begin(), size(), __u); }

void
      swap(array& __other)
      noexcept(__is_nothrow_swappable<_Tp>::value)
      { std::swap_ranges(begin(), end(), __other.begin()); }

// Iterators.
      iterator
      begin() noexcept
      { return iterator(data()); }

const_iterator
      begin() const noexcept
      { return const_iterator(data()); }

iterator
      end() noexcept
      { return iterator(data() + _Nm); }

const_iterator
      end() const noexcept
      { return const_iterator(data() + _Nm); }

reverse_iterator 
      rbegin() noexcept
      { return reverse_iterator(end()); }

const_reverse_iterator 
      rbegin() const noexcept
      { return const_reverse_iterator(end()); }

reverse_iterator 
      rend() noexcept
      { return reverse_iterator(begin()); }

const_reverse_iterator 
      rend() const noexcept
      { return const_reverse_iterator(begin()); }

const_iterator
      cbegin() const noexcept
      { return const_iterator(data()); }

const_iterator
      cend() const noexcept
      { return const_iterator(data() + _Nm); }

const_reverse_iterator 
      crbegin() const noexcept
      { return const_reverse_iterator(end()); }

const_reverse_iterator 
      crend() const noexcept
      { return const_reverse_iterator(begin()); }

// Capacity.
      constexpr size_type 
      size() const noexcept { return _Nm; }

constexpr size_type 
      max_size() const noexcept { return _Nm; }

constexpr bool 
      empty() const noexcept { return size() == 0; }

// Element access.
      reference
      operator[](size_type __n) noexcept
      { return _AT_Type::_S_ref(_M_elems, __n); }

constexpr const_reference
      operator[](size_type __n) const noexcept
      { return _AT_Type::_S_ref(_M_elems, __n); }

reference
      at(size_type __n)
      {
	if (__n >= _Nm)
	  std::__throw_out_of_range_fmt(__N("array::at: __n (which is %zu) "
					    ">= _Nm (which is %zu)"),
					__n, _Nm);
	return _AT_Type::_S_ref(_M_elems, __n);
      }

constexpr const_reference
      at(size_type __n) const
      {
	// Result of conditional expression must be an lvalue so use
	// boolean ? lvalue : (throw-expr, lvalue)
	return __n < _Nm ? _AT_Type::_S_ref(_M_elems, __n)
	  : (std::__throw_out_of_range_fmt(__N("array::at: __n (which is %zu) "
					       ">= _Nm (which is %zu)"),
					   __n, _Nm),
	     _AT_Type::_S_ref(_M_elems, 0));
      }

reference 
      front() noexcept
      { return *begin(); }

constexpr const_reference 
      front() const noexcept
      { return _AT_Type::_S_ref(_M_elems, 0); }

reference 
      back() noexcept
      { return _Nm ? *(end() - 1) : *end(); }

constexpr const_reference 
      back() const noexcept
      { 
	return _Nm ? _AT_Type::_S_ref(_M_elems, _Nm - 1) 
 	           : _AT_Type::_S_ref(_M_elems, 0);
      }

pointer
      data() noexcept
      { return _AT_Type::_S_ptr(_M_elems); }

const_pointer
      data() const noexcept
      { return _AT_Type::_S_ptr(_M_elems); }
    };

// Array comparisons.
  template<typename _Tp, std::size_t _Nm>
    inline bool 
    operator==(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
    { return std::equal(__one.begin(), __one.end(), __two.begin()); }

template<typename _Tp, std::size_t _Nm>
    inline bool
    operator!=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
    { return !(__one == __two); }

template<typename _Tp, std::size_t _Nm>
    inline bool
    operator<(const array<_Tp, _Nm>& __a, const array<_Tp, _Nm>& __b)
    { 
      return std::lexicographical_compare(__a.begin(), __a.end(),
					  __b.begin(), __b.end()); 
    }

template<typename _Tp, std::size_t _Nm>
    inline bool
    operator>(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
    { return __two < __one; }

template<typename _Tp, std::size_t _Nm>
    inline bool
    operator<=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
    { return !(__one > __two); }

template<typename _Tp, std::size_t _Nm>
    inline bool
    operator>=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
    { return !(__one < __two); }

// Specialized algorithms.
  template<typename _Tp, std::size_t _Nm>
    inline void
    swap(array<_Tp, _Nm>& __one, array<_Tp, _Nm>& __two)
    noexcept(noexcept(__one.swap(__two)))
    { __one.swap(__two); }

template<std::size_t _Int, typename _Tp, std::size_t _Nm>
    constexpr _Tp&
    get(array<_Tp, _Nm>& __arr) noexcept
    {
      static_assert(_Int < _Nm, "index is out of bounds");
      return _GLIBCXX_STD_C::__array_traits<_Tp, _Nm>::
	_S_ref(__arr._M_elems, _Int);
    }

template<std::size_t _Int, typename _Tp, std::size_t _Nm>
    constexpr _Tp&&
    get(array<_Tp, _Nm>&& __arr) noexcept
    {
      static_assert(_Int < _Nm, "index is out of bounds");
      return std::move(_GLIBCXX_STD_C::get<_Int>(__arr));
    }

template<std::size_t _Int, typename _Tp, std::size_t _Nm>
    constexpr const _Tp&
    get(const array<_Tp, _Nm>& __arr) noexcept
    {
      static_assert(_Int < _Nm, "index is out of bounds");
      return _GLIBCXX_STD_C::__array_traits<_Tp, _Nm>::
	_S_ref(__arr._M_elems, _Int);
    }

_GLIBCXX_END_NAMESPACE_CONTAINER
} // namespace std

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

// Tuple interface to class template array.

/// tuple_size
  template<typename _Tp> 
    class tuple_size;

/// Partial specialization for std::array
  template<typename _Tp, std::size_t _Nm>
    struct tuple_size<_GLIBCXX_STD_C::array<_Tp, _Nm>>
    : public integral_constant<std::size_t, _Nm> { };

/// tuple_element
  template<std::size_t _Int, typename _Tp>
    class tuple_element;

/// Partial specialization for std::array
  template<std::size_t _Int, typename _Tp, std::size_t _Nm>
    struct tuple_element<_Int, _GLIBCXX_STD_C::array<_Tp, _Nm>>
    {
      static_assert(_Int < _Nm, "index is out of bounds");
      typedef _Tp type;
    };

template<typename _Tp, std::size_t _Nm>
    struct __is_tuple_like_impl<_GLIBCXX_STD_C::array<_Tp, _Nm>> : true_type
    { };

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#ifdef _GLIBCXX_DEBUG
# include <debug/array>
#endif

#ifdef _GLIBCXX_PROFILE
# include <profile/array>
#endif

#endif // C++11

#endif // _GLIBCXX_ARRAY