Geforce File Manager

NAME	SIZE	ACTIONS
📁 backward		[ DEL ]
📁 bits		[ DEL ]
📁 debug		[ DEL ]
📁 decimal		[ DEL ]
📁 experimental		[ DEL ]
📁 ext		[ DEL ]
📁 parallel		[ DEL ]
📁 profile		[ DEL ]
📁 tr1		[ DEL ]
📁 tr2		[ DEL ]
📁 x86_64-redhat-linux		[ DEL ]
📄 algorithm	2,518 B	[ EDIT ] \| [ DEL ]
📄 any	18,604 B	[ EDIT ] \| [ DEL ]
📄 array	11,657 B	[ EDIT ] \| [ DEL ]
📄 atomic	41,057 B	[ EDIT ] \| [ DEL ]
📄 bitset	45,910 B	[ EDIT ] \| [ DEL ]
📄 cassert	1,648 B	[ EDIT ] \| [ DEL ]
📄 ccomplex	1,335 B	[ EDIT ] \| [ DEL ]
📄 cctype	2,409 B	[ EDIT ] \| [ DEL ]
📄 cerrno	1,770 B	[ EDIT ] \| [ DEL ]
📄 cfenv	2,051 B	[ EDIT ] \| [ DEL ]
📄 cfloat	1,889 B	[ EDIT ] \| [ DEL ]
📄 charconv	16,708 B	[ EDIT ] \| [ DEL ]
📄 chrono	29,874 B	[ EDIT ] \| [ DEL ]
📄 cinttypes	2,157 B	[ EDIT ] \| [ DEL ]
📄 ciso646	1,464 B	[ EDIT ] \| [ DEL ]
📄 climits	1,913 B	[ EDIT ] \| [ DEL ]
📄 clocale	1,905 B	[ EDIT ] \| [ DEL ]
📄 cmath	48,142 B	[ EDIT ] \| [ DEL ]
📄 codecvt	5,341 B	[ EDIT ] \| [ DEL ]
📄 complex	54,537 B	[ EDIT ] \| [ DEL ]
📄 complex.h	1,596 B	[ EDIT ] \| [ DEL ]
📄 condition_variable	8,954 B	[ EDIT ] \| [ DEL ]
📄 csetjmp	1,949 B	[ EDIT ] \| [ DEL ]
📄 csignal	1,855 B	[ EDIT ] \| [ DEL ]
📄 cstdalign	1,407 B	[ EDIT ] \| [ DEL ]
📄 cstdarg	1,868 B	[ EDIT ] \| [ DEL ]
📄 cstdbool	1,401 B	[ EDIT ] \| [ DEL ]
📄 cstddef	6,440 B	[ EDIT ] \| [ DEL ]
📄 cstdint	2,167 B	[ EDIT ] \| [ DEL ]
📄 cstdio	4,439 B	[ EDIT ] \| [ DEL ]
📄 cstdlib	6,325 B	[ EDIT ] \| [ DEL ]
📄 cstring	3,123 B	[ EDIT ] \| [ DEL ]
📄 ctgmath	1,360 B	[ EDIT ] \| [ DEL ]
📄 ctime	2,125 B	[ EDIT ] \| [ DEL ]
📄 cuchar	2,210 B	[ EDIT ] \| [ DEL ]
📄 cwchar	6,509 B	[ EDIT ] \| [ DEL ]
📄 cwctype	2,793 B	[ EDIT ] \| [ DEL ]
📄 cxxabi.h	21,977 B	[ EDIT ] \| [ DEL ]
📄 deque	2,665 B	[ EDIT ] \| [ DEL ]
📄 exception	4,803 B	[ EDIT ] \| [ DEL ]
📄 fenv.h	2,020 B	[ EDIT ] \| [ DEL ]
📄 filesystem	1,438 B	[ EDIT ] \| [ DEL ]
📄 forward_list	1,577 B	[ EDIT ] \| [ DEL ]
📄 fstream	36,787 B	[ EDIT ] \| [ DEL ]
📄 functional	37,750 B	[ EDIT ] \| [ DEL ]
📄 future	50,678 B	[ EDIT ] \| [ DEL ]
📄 initializer_list	2,974 B	[ EDIT ] \| [ DEL ]
📄 iomanip	16,547 B	[ EDIT ] \| [ DEL ]
📄 ios	1,601 B	[ EDIT ] \| [ DEL ]
📄 iosfwd	6,918 B	[ EDIT ] \| [ DEL ]
📄 iostream	2,695 B	[ EDIT ] \| [ DEL ]
📄 istream	32,843 B	[ EDIT ] \| [ DEL ]
📄 iterator	2,644 B	[ EDIT ] \| [ DEL ]
📄 limits	69,181 B	[ EDIT ] \| [ DEL ]
📄 list	2,594 B	[ EDIT ] \| [ DEL ]
📄 locale	1,488 B	[ EDIT ] \| [ DEL ]
📄 map	2,559 B	[ EDIT ] \| [ DEL ]
📄 math.h	4,367 B	[ EDIT ] \| [ DEL ]
📄 memory	4,711 B	[ EDIT ] \| [ DEL ]
📄 mutex	18,224 B	[ EDIT ] \| [ DEL ]
📄 new	7,521 B	[ EDIT ] \| [ DEL ]
📄 numeric	5,444 B	[ EDIT ] \| [ DEL ]
📄 optional	43,963 B	[ EDIT ] \| [ DEL ]
📄 ostream	22,091 B	[ EDIT ] \| [ DEL ]
📄 queue	2,467 B	[ EDIT ] \| [ DEL ]
📄 random	1,692 B	[ EDIT ] \| [ DEL ]
📄 ratio	19,886 B	[ EDIT ] \| [ DEL ]
📄 regex	1,894 B	[ EDIT ] \| [ DEL ]
📄 scoped_allocator	16,221 B	[ EDIT ] \| [ DEL ]
📄 set	2,559 B	[ EDIT ] \| [ DEL ]
📄 shared_mutex	19,409 B	[ EDIT ] \| [ DEL ]
📄 sstream	26,871 B	[ EDIT ] \| [ DEL ]
📄 stack	2,391 B	[ EDIT ] \| [ DEL ]
📄 stdexcept	7,975 B	[ EDIT ] \| [ DEL ]
📄 stdlib.h	2,248 B	[ EDIT ] \| [ DEL ]
📄 streambuf	30,017 B	[ EDIT ] \| [ DEL ]
📄 string	1,940 B	[ EDIT ] \| [ DEL ]
📄 string_view	20,791 B	[ EDIT ] \| [ DEL ]
📄 system_error	11,522 B	[ EDIT ] \| [ DEL ]
📄 tgmath.h	1,360 B	[ EDIT ] \| [ DEL ]
📄 thread	10,519 B	[ EDIT ] \| [ DEL ]
📄 tuple	60,350 B	[ EDIT ] \| [ DEL ]
📄 type_traits	85,871 B	[ EDIT ] \| [ DEL ]
📄 typeindex	3,093 B	[ EDIT ] \| [ DEL ]
📄 typeinfo	7,692 B	[ EDIT ] \| [ DEL ]
📄 unordered_map	1,848 B	[ EDIT ] \| [ DEL ]
📄 unordered_set	1,847 B	[ EDIT ] \| [ DEL ]
📄 utility	12,303 B	[ EDIT ] \| [ DEL ]
📄 valarray	40,274 B	[ EDIT ] \| [ DEL ]
📄 variant	48,242 B	[ EDIT ] \| [ DEL ]
📄 vector	2,747 B	[ EDIT ] \| [ DEL ]

[ CLOSE ]

EDIT: array

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

// Copyright (C) 2007-2018 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];
      typedef __is_swappable<_Tp> _Is_swappable;
      typedef __is_nothrow_swappable<_Tp> _Is_nothrow_swappable;

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 { };
     typedef true_type _Is_swappable;
     typedef true_type _Is_nothrow_swappable;

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(_AT_Type::_Is_nothrow_swappable::value)
      { std::swap_ranges(begin(), end(), __other.begin()); }

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

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

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

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

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

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

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

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

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

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

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

_GLIBCXX17_CONSTEXPR 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.
      _GLIBCXX17_CONSTEXPR 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); }

_GLIBCXX17_CONSTEXPR 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));
      }

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

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

_GLIBCXX17_CONSTEXPR 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);
      }

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

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

#if __cpp_deduction_guides >= 201606
  template<typename _Tp, typename... _Up>
    array(_Tp, _Up...)
      -> array<enable_if_t<(is_same_v<_Tp, _Up> && ...), _Tp>,
	       1 + sizeof...(_Up)>;
#endif

// 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
#if __cplusplus > 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11
    // Constrained free swap overload, see p0185r1
    typename enable_if<
      _GLIBCXX_STD_C::__array_traits<_Tp, _Nm>::_Is_swappable::value
    >::type
#else
    void
#endif
    swap(array<_Tp, _Nm>& __one, array<_Tp, _Nm>& __two)
    noexcept(noexcept(__one.swap(__two)))
    { __one.swap(__two); }

#if __cplusplus > 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11
  template<typename _Tp, std::size_t _Nm>
    typename enable_if<
      !_GLIBCXX_STD_C::__array_traits<_Tp, _Nm>::_Is_swappable::value>::type
    swap(array<_Tp, _Nm>&, array<_Tp, _Nm>&) = delete;
#endif

template<std::size_t _Int, typename _Tp, std::size_t _Nm>
    constexpr _Tp&
    get(array<_Tp, _Nm>& __arr) noexcept
    {
      static_assert(_Int < _Nm, "array index is within 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, "array index is within 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, "array index is within 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 const _Tp&&
    get(const array<_Tp, _Nm>&& __arr) noexcept
    {
      static_assert(_Int < _Nm, "array index is within bounds");
      return std::move(_GLIBCXX_STD_C::get<_Int>(__arr));
    }

_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>
    struct 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>
    struct 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