Gecko [ www.corporacionhdm.com.pe ]

Name	Size	Permission	Date
array	6.8 KB	-rw-r--r--	2025-03-31 10:36
bessel_function.tcc	21.95 KB	-rw-r--r--	2025-03-31 10:36
beta_function.tcc	5.85 KB	-rw-r--r--	2025-03-31 10:36
ccomplex	1.23 KB	-rw-r--r--	2025-03-31 10:36
cctype	1.38 KB	-rw-r--r--	2025-03-31 10:36
cfenv	1.96 KB	-rw-r--r--	2025-03-31 10:36
cfloat	1.35 KB	-rw-r--r--	2025-03-31 10:36
cinttypes	2.2 KB	-rw-r--r--	2025-03-31 10:36
climits	1.42 KB	-rw-r--r--	2025-03-31 10:36
cmath	42.78 KB	-rw-r--r--	2025-03-31 10:36
complex	12.09 KB	-rw-r--r--	2025-03-31 10:36
complex.h	1.23 KB	-rw-r--r--	2025-03-31 10:36
cstdarg	1.22 KB	-rw-r--r--	2025-03-31 10:36
cstdbool	1.31 KB	-rw-r--r--	2025-03-31 10:36
cstdint	2.56 KB	-rw-r--r--	2025-03-31 10:36
cstdio	1.45 KB	-rw-r--r--	2025-03-31 10:36
cstdlib	1.75 KB	-rw-r--r--	2025-03-31 10:36
ctgmath	1.22 KB	-rw-r--r--	2025-03-31 10:36
ctime	1.21 KB	-rw-r--r--	2025-03-31 10:36
ctype.h	1.18 KB	-rw-r--r--	2025-03-31 10:36
cwchar	1.68 KB	-rw-r--r--	2025-03-31 10:36
cwctype	1.42 KB	-rw-r--r--	2025-03-31 10:36
ell_integral.tcc	27.07 KB	-rw-r--r--	2025-03-31 10:36
exp_integral.tcc	15.63 KB	-rw-r--r--	2025-03-31 10:36
fenv.h	1.18 KB	-rw-r--r--	2025-03-31 10:36
float.h	1.18 KB	-rw-r--r--	2025-03-31 10:36
functional	68.89 KB	-rw-r--r--	2025-03-31 10:36
functional_hash.h	5.9 KB	-rw-r--r--	2025-03-31 10:36
gamma.tcc	14.34 KB	-rw-r--r--	2025-03-31 10:36
hashtable.h	40.56 KB	-rw-r--r--	2025-03-31 10:36
hashtable_policy.h	24.5 KB	-rw-r--r--	2025-03-31 10:36
hypergeometric.tcc	27.41 KB	-rw-r--r--	2025-03-31 10:36
inttypes.h	1.24 KB	-rw-r--r--	2025-03-31 10:36
legendre_function.tcc	10.65 KB	-rw-r--r--	2025-03-31 10:36
limits.h	1.19 KB	-rw-r--r--	2025-03-31 10:36
math.h	4.45 KB	-rw-r--r--	2025-03-31 10:36
memory	1.75 KB	-rw-r--r--	2025-03-31 10:36
modified_bessel_func.tcc	15.94 KB	-rw-r--r--	2025-03-31 10:36
poly_hermite.tcc	3.83 KB	-rw-r--r--	2025-03-31 10:36
poly_laguerre.tcc	11.4 KB	-rw-r--r--	2025-03-31 10:36
random	1.55 KB	-rw-r--r--	2025-03-31 10:36
random.h	71.41 KB	-rw-r--r--	2025-03-31 10:36
random.tcc	52.66 KB	-rw-r--r--	2025-03-31 10:36
regex	90.7 KB	-rw-r--r--	2025-03-31 10:36
riemann_zeta.tcc	13.73 KB	-rw-r--r--	2025-03-31 10:36
shared_ptr.h	31.84 KB	-rw-r--r--	2025-03-31 10:36
special_function_util.h	4.94 KB	-rw-r--r--	2025-03-31 10:36
stdarg.h	1.19 KB	-rw-r--r--	2025-03-31 10:36
stdbool.h	1.19 KB	-rw-r--r--	2025-03-31 10:36
stdint.h	1.19 KB	-rw-r--r--	2025-03-31 10:36
stdio.h	1.18 KB	-rw-r--r--	2025-03-31 10:36
stdlib.h	1.45 KB	-rw-r--r--	2025-03-31 10:36
tgmath.h	1.23 KB	-rw-r--r--	2025-03-31 10:36
tuple	11.83 KB	-rw-r--r--	2025-03-31 10:36
type_traits	18.57 KB	-rw-r--r--	2025-03-31 10:36
unordered_map	1.54 KB	-rw-r--r--	2025-03-31 10:36
unordered_map.h	9.98 KB	-rw-r--r--	2025-03-31 10:36
unordered_set	1.54 KB	-rw-r--r--	2025-03-31 10:36
unordered_set.h	9.32 KB	-rw-r--r--	2025-03-31 10:36
utility	3.15 KB	-rw-r--r--	2025-03-31 10:36
wchar.h	1.22 KB	-rw-r--r--	2025-03-31 10:36
wctype.h	1.23 KB	-rw-r--r--	2025-03-31 10:36

Rename

// class template array -*- C++ -*-

// Copyright (C) 2004-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 tr1/array
 *  This is a TR1 C++ Library header. 
 */

#ifndef _GLIBCXX_TR1_ARRAY
#define _GLIBCXX_TR1_ARRAY 1

#pragma GCC system_header

#include <bits/stl_algobase.h>

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

namespace tr1
{
  /**
   *  @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.
   *
   *  @param  Tp  Type of element. Required to be a complete type.
   *  @param  N  Number of elements.
  */
  template<typename _Tp, std::size_t _Nm>
    struct array
    {
      typedef _Tp 	    			      value_type;
      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.
      value_type _M_instance[_Nm ? _Nm : 1];

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

void
      assign(const value_type& __u)
      { std::fill_n(begin(), size(), __u); }

void
      swap(array& __other)
      { std::swap_ranges(begin(), end(), __other.begin()); }

// Iterators.
      iterator
      begin()
      { return iterator(std::__addressof(_M_instance[0])); }

const_iterator
      begin() const 
      { return const_iterator(std::__addressof(_M_instance[0])); }

iterator
      end()
      { return iterator(std::__addressof(_M_instance[_Nm])); }

const_iterator
      end() const
      { return const_iterator(std::__addressof(_M_instance[_Nm])); }

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

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

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

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

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

size_type 
      max_size() const { return _Nm; }

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

// Element access.
      reference
      operator[](size_type __n)
      { return _M_instance[__n]; }

const_reference
      operator[](size_type __n) const
      { return _M_instance[__n]; }

reference
      at(size_type __n)
      {
	if (__n >= _Nm)
	  std::__throw_out_of_range(__N("array::at"));
	return _M_instance[__n];
      }

const_reference
      at(size_type __n) const
      {
	if (__n >= _Nm)
	  std::__throw_out_of_range(__N("array::at"));
	return _M_instance[__n];
      }

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

const_reference 
      front() const
      { return *begin(); }

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

const_reference 
      back() const
      { return _Nm ? *(end() - 1) : *end(); }

_Tp*
      data()
      { return std::__addressof(_M_instance[0]); }

const _Tp*
      data() const
      { return std::__addressof(_M_instance[0]); }
    };

// 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 [6.2.2.2].
  template<typename _Tp, std::size_t _Nm>
    inline void
    swap(array<_Tp, _Nm>& __one, array<_Tp, _Nm>& __two)
    { __one.swap(__two); }

// Tuple interface to class template array [6.2.2.5].

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

/// tuple_element
  template<int _Int, typename _Tp>
    class tuple_element;

template<typename _Tp, std::size_t _Nm>
    struct tuple_size<array<_Tp, _Nm> >
    { static const int value = _Nm; };

template<typename _Tp, std::size_t _Nm>
    const int
    tuple_size<array<_Tp, _Nm> >::value;

template<int _Int, typename _Tp, std::size_t _Nm>
    struct tuple_element<_Int, array<_Tp, _Nm> >
    { typedef _Tp type; };

template<int _Int, typename _Tp, std::size_t _Nm>
    inline _Tp&
    get(array<_Tp, _Nm>& __arr)
    { return __arr[_Int]; }

template<int _Int, typename _Tp, std::size_t _Nm>
    inline const _Tp&
    get(const array<_Tp, _Nm>& __arr)
    { return __arr[_Int]; }
}

_GLIBCXX_END_NAMESPACE_VERSION
}

#endif // _GLIBCXX_TR1_ARRAY