#acupoftea - mail.ontime-ae.com

System	:	Linux server1.ontime-gulf.com 4.18.0-553.5.1.el8_10.x86_64 #1 SMP Wed Jun 5 09:12:13 EDT 2024 x86_64
Software	:	Apache
Server	:	162.0.230.206
Domains	:	40 Domain
Permission	:	[ drwxr-xr-x ]
	:	/ usr / include / c++ / 8 / tr1 /

216.73.216.38

Home

File array

// 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

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

~ ACUPOFTEA - mail.ontime-ae.com