Linux yavrix.internet-webhosting.com 3.10.0-962.3.2.lve1.5.88.el7.x86_64 #1 SMP Fri Sep 26 14:06:42 UTC 2025 x86_64
LiteSpeed
Server IP : 103.8.25.136 & Your IP : 216.73.216.129
Domains :
Cant Read [ /etc/named.conf ]
User : celfico1
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
include /
c++ /
4.8.2 /
Delete
Unzip
Name
Size
Permission
Date
Action
backward
[ DIR ]
drwxr-xr-x
2026-05-06 18:20
bits
[ DIR ]
drwxr-xr-x
2026-05-06 18:20
debug
[ DIR ]
drwxr-xr-x
2026-05-06 18:20
decimal
[ DIR ]
drwxr-xr-x
2026-05-06 18:20
ext
[ DIR ]
drwxr-xr-x
2026-05-06 18:20
parallel
[ DIR ]
drwxr-xr-x
2026-05-06 18:20
profile
[ DIR ]
drwxr-xr-x
2026-05-06 18:20
tr1
[ DIR ]
drwxr-xr-x
2026-05-06 18:20
tr2
[ DIR ]
drwxr-xr-x
2026-05-06 18:20
x86_64-redhat-linux
[ DIR ]
drwxr-xr-x
2026-04-27 14:01
algorithm
2.46
KB
-rw-r--r--
2026-04-27 14:01
array
9.27
KB
-rw-r--r--
2026-04-27 14:01
atomic
33.3
KB
-rw-r--r--
2026-04-27 14:01
bitset
44.55
KB
-rw-r--r--
2026-04-27 14:01
cassert
1.58
KB
-rw-r--r--
2026-04-27 14:01
ccomplex
1.29
KB
-rw-r--r--
2026-04-27 14:01
cctype
2.35
KB
-rw-r--r--
2026-04-27 14:01
cerrno
1.7
KB
-rw-r--r--
2026-04-27 14:01
cfenv
2
KB
-rw-r--r--
2026-04-27 14:01
cfloat
1.82
KB
-rw-r--r--
2026-04-27 14:01
chrono
23.04
KB
-rw-r--r--
2026-04-27 14:01
cinttypes
2.11
KB
-rw-r--r--
2026-04-27 14:01
ciso646
1.46
KB
-rw-r--r--
2026-04-27 14:01
climits
1.84
KB
-rw-r--r--
2026-04-27 14:01
clocale
1.86
KB
-rw-r--r--
2026-04-27 14:01
cmath
41.45
KB
-rw-r--r--
2026-04-27 14:01
complex
51.29
KB
-rw-r--r--
2026-04-27 14:01
complex.h
1.43
KB
-rw-r--r--
2026-04-27 14:01
condition_variable
7.8
KB
-rw-r--r--
2026-04-27 14:01
csetjmp
1.9
KB
-rw-r--r--
2026-04-27 14:01
csignal
1.81
KB
-rw-r--r--
2026-04-27 14:01
cstdalign
1.37
KB
-rw-r--r--
2026-04-27 14:01
cstdarg
1.8
KB
-rw-r--r--
2026-04-27 14:01
cstdbool
1.37
KB
-rw-r--r--
2026-04-27 14:01
cstddef
1.57
KB
-rw-r--r--
2026-04-27 14:01
cstdint
2.12
KB
-rw-r--r--
2026-04-27 14:01
cstdio
4.18
KB
-rw-r--r--
2026-04-27 14:01
cstdlib
6.01
KB
-rw-r--r--
2026-04-27 14:01
cstring
3.05
KB
-rw-r--r--
2026-04-27 14:01
ctgmath
1.29
KB
-rw-r--r--
2026-04-27 14:01
ctime
2.08
KB
-rw-r--r--
2026-04-27 14:01
cwchar
6.34
KB
-rw-r--r--
2026-04-27 14:01
cwctype
2.73
KB
-rw-r--r--
2026-04-27 14:01
cxxabi.h
21.24
KB
-rw-r--r--
2026-04-27 14:01
deque
2.6
KB
-rw-r--r--
2026-04-27 14:01
exception
4.95
KB
-rw-r--r--
2026-04-27 14:01
fenv.h
1.97
KB
-rw-r--r--
2026-04-27 14:01
forward_list
1.54
KB
-rw-r--r--
2026-04-27 14:01
fstream
29.31
KB
-rw-r--r--
2026-04-27 14:01
functional
79.23
KB
-rw-r--r--
2026-04-27 14:01
future
41.7
KB
-rw-r--r--
2026-04-27 14:01
initializer_list
2.9
KB
-rw-r--r--
2026-04-27 14:01
iomanip
11.21
KB
-rw-r--r--
2026-04-27 14:01
ios
1.56
KB
-rw-r--r--
2026-04-27 14:01
iosfwd
6.69
KB
-rw-r--r--
2026-04-27 14:01
iostream
2.63
KB
-rw-r--r--
2026-04-27 14:01
istream
29.25
KB
-rw-r--r--
2026-04-27 14:01
iterator
2.58
KB
-rw-r--r--
2026-04-27 14:01
limits
65.68
KB
-rw-r--r--
2026-04-27 14:01
list
2.53
KB
-rw-r--r--
2026-04-27 14:01
locale
1.39
KB
-rw-r--r--
2026-04-27 14:01
map
2.5
KB
-rw-r--r--
2026-04-27 14:01
memory
2.81
KB
-rw-r--r--
2026-04-27 14:01
mutex
19.66
KB
-rw-r--r--
2026-04-27 14:01
new
4.09
KB
-rw-r--r--
2026-04-27 14:01
numeric
2.72
KB
-rw-r--r--
2026-04-27 14:01
ostream
19.19
KB
-rw-r--r--
2026-04-27 14:01
queue
2.41
KB
-rw-r--r--
2026-04-27 14:01
random
1.67
KB
-rw-r--r--
2026-04-27 14:01
ratio
18.69
KB
-rw-r--r--
2026-04-27 14:01
regex
1.82
KB
-rw-r--r--
2026-04-27 14:01
scoped_allocator
15.65
KB
-rw-r--r--
2026-04-27 14:01
set
2.5
KB
-rw-r--r--
2026-04-27 14:01
sstream
19.57
KB
-rw-r--r--
2026-04-27 14:01
stack
2.33
KB
-rw-r--r--
2026-04-27 14:01
stdexcept
4.61
KB
-rw-r--r--
2026-04-27 14:01
streambuf
28.71
KB
-rw-r--r--
2026-04-27 14:01
string
1.9
KB
-rw-r--r--
2026-04-27 14:01
system_error
10.11
KB
-rw-r--r--
2026-04-27 14:01
tgmath.h
1.33
KB
-rw-r--r--
2026-04-27 14:01
thread
7.08
KB
-rw-r--r--
2026-04-27 14:01
tuple
34.85
KB
-rw-r--r--
2026-04-27 14:01
type_traits
57.55
KB
-rw-r--r--
2026-04-27 14:01
typeindex
3.01
KB
-rw-r--r--
2026-04-27 14:01
typeinfo
7.5
KB
-rw-r--r--
2026-04-27 14:01
unordered_map
1.81
KB
-rw-r--r--
2026-04-27 14:01
unordered_set
1.81
KB
-rw-r--r--
2026-04-27 14:01
utility
5.22
KB
-rw-r--r--
2026-04-27 14:01
valarray
39.32
KB
-rw-r--r--
2026-04-27 14:01
vector
2.66
KB
-rw-r--r--
2026-04-27 14:01
Save
Rename
// <array> -*- C++ -*- // Copyright (C) 2007-2013 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 <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]); } }; 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); } }; /** * @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(noexcept(swap(std::declval<_Tp&>(), std::declval<_Tp&>()))) { 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) { 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(__N("array::at")); 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(__N("array::at")), _AT_Type::_S_ref(_M_elems, 0)); } reference front() { return *begin(); } constexpr const_reference front() const { return _AT_Type::_S_ref(_M_elems, 0); } reference back() { return _Nm ? *(end() - 1) : *end(); } constexpr const_reference back() const { return _Nm ? _AT_Type::_S_ref(_M_elems, _Nm - 1) : _AT_Type::_S_ref(_M_elems, 0); } pointer data() noexcept { return std::__addressof(_AT_Type::_S_ref(_M_elems, 0)); } const_pointer data() const noexcept { return std::__addressof(_AT_Type::_S_ref(_M_elems, 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. 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(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; 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; 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; }; _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