Linux unitednationsplay.com 3.10.0-1160.45.1.el7.x86_64 #1 SMP Wed Oct 13 17:20:51 UTC 2021 x86_64
nginx/1.20.1
Server IP : 188.130.139.92 & Your IP : 3.140.254.100
Domains :
Cant Read [ /etc/named.conf ]
User : web
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
include /
c++ /
4.8.2 /
tr1 /
Delete
Unzip
Name
Size
Permission
Date
Action
array
6.8
KB
-rw-r--r--
2020-09-30 02:17
bessel_function.tcc
21.6
KB
-rw-r--r--
2020-09-30 02:17
beta_function.tcc
5.47
KB
-rw-r--r--
2020-09-30 02:17
ccomplex
1.23
KB
-rw-r--r--
2020-09-30 02:17
cctype
1.38
KB
-rw-r--r--
2020-09-30 02:17
cfenv
1.96
KB
-rw-r--r--
2020-09-30 02:17
cfloat
1.35
KB
-rw-r--r--
2020-09-30 02:17
cinttypes
2.2
KB
-rw-r--r--
2020-09-30 02:17
climits
1.42
KB
-rw-r--r--
2020-09-30 02:17
cmath
36.55
KB
-rw-r--r--
2020-09-30 02:17
complex
12.04
KB
-rw-r--r--
2020-09-30 02:17
complex.h
1.23
KB
-rw-r--r--
2020-09-30 02:17
cstdarg
1.22
KB
-rw-r--r--
2020-09-30 02:17
cstdbool
1.31
KB
-rw-r--r--
2020-09-30 02:17
cstdint
2.56
KB
-rw-r--r--
2020-09-30 02:17
cstdio
1.44
KB
-rw-r--r--
2020-09-30 02:17
cstdlib
1.74
KB
-rw-r--r--
2020-09-30 02:17
ctgmath
1.22
KB
-rw-r--r--
2020-09-30 02:17
ctime
1.21
KB
-rw-r--r--
2020-09-30 02:17
ctype.h
1.18
KB
-rw-r--r--
2020-09-30 02:17
cwchar
1.67
KB
-rw-r--r--
2020-09-30 02:17
cwctype
1.42
KB
-rw-r--r--
2020-09-30 02:17
ell_integral.tcc
26.85
KB
-rw-r--r--
2020-09-30 02:17
exp_integral.tcc
15.41
KB
-rw-r--r--
2020-09-30 02:17
fenv.h
1.18
KB
-rw-r--r--
2020-09-30 02:17
float.h
1.18
KB
-rw-r--r--
2020-09-30 02:17
functional
69.15
KB
-rw-r--r--
2020-09-30 02:17
functional_hash.h
5.7
KB
-rw-r--r--
2020-09-30 02:17
gamma.tcc
13.97
KB
-rw-r--r--
2020-09-30 02:17
hashtable.h
40.56
KB
-rw-r--r--
2020-09-30 02:17
hashtable_policy.h
24.64
KB
-rw-r--r--
2020-09-30 02:17
hypergeometric.tcc
27.07
KB
-rw-r--r--
2020-09-30 02:17
inttypes.h
1.24
KB
-rw-r--r--
2020-09-30 02:17
legendre_function.tcc
10.32
KB
-rw-r--r--
2020-09-30 02:17
limits.h
1.19
KB
-rw-r--r--
2020-09-30 02:17
math.h
4.45
KB
-rw-r--r--
2020-09-30 02:17
memory
1.75
KB
-rw-r--r--
2020-09-30 02:17
modified_bessel_func.tcc
15.35
KB
-rw-r--r--
2020-09-30 02:17
poly_hermite.tcc
3.61
KB
-rw-r--r--
2020-09-30 02:17
poly_laguerre.tcc
11.08
KB
-rw-r--r--
2020-09-30 02:17
random
1.55
KB
-rw-r--r--
2020-09-30 02:17
random.h
71.48
KB
-rw-r--r--
2020-09-30 02:17
random.tcc
52.73
KB
-rw-r--r--
2020-09-30 02:17
regex
90.77
KB
-rw-r--r--
2020-09-30 02:17
riemann_zeta.tcc
13.34
KB
-rw-r--r--
2020-09-30 02:17
shared_ptr.h
31.91
KB
-rw-r--r--
2020-09-30 02:17
special_function_util.h
4.71
KB
-rw-r--r--
2020-09-30 02:17
stdarg.h
1.19
KB
-rw-r--r--
2020-09-30 02:17
stdbool.h
1.19
KB
-rw-r--r--
2020-09-30 02:17
stdint.h
1.19
KB
-rw-r--r--
2020-09-30 02:17
stdio.h
1.18
KB
-rw-r--r--
2020-09-30 02:17
stdlib.h
1.45
KB
-rw-r--r--
2020-09-30 02:17
tgmath.h
1.23
KB
-rw-r--r--
2020-09-30 02:17
tuple
11.83
KB
-rw-r--r--
2020-09-30 02:17
type_traits
18.57
KB
-rw-r--r--
2020-09-30 02:17
unordered_map
1.54
KB
-rw-r--r--
2020-09-30 02:17
unordered_map.h
9.98
KB
-rw-r--r--
2020-09-30 02:17
unordered_set
1.54
KB
-rw-r--r--
2020-09-30 02:17
unordered_set.h
9.32
KB
-rw-r--r--
2020-09-30 02:17
utility
3.15
KB
-rw-r--r--
2020-09-30 02:17
wchar.h
1.22
KB
-rw-r--r--
2020-09-30 02:17
wctype.h
1.23
KB
-rw-r--r--
2020-09-30 02:17
Save
Rename
// TR1 unordered_map implementation -*- C++ -*- // Copyright (C) 2010-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 tr1/unordered_map.h * This is an internal header file, included by other library headers. * Do not attempt to use it directly. @headername{tr1/unordered_map} */ namespace std _GLIBCXX_VISIBILITY(default) { namespace tr1 { _GLIBCXX_BEGIN_NAMESPACE_VERSION // NB: When we get typedef templates these class definitions // will be unnecessary. template<class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >, bool __cache_hash_code = false> class __unordered_map : public _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc, std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, _Hash, __detail::_Mod_range_hashing, __detail::_Default_ranged_hash, __detail::_Prime_rehash_policy, __cache_hash_code, false, true> { typedef _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc, std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, _Hash, __detail::_Mod_range_hashing, __detail::_Default_ranged_hash, __detail::_Prime_rehash_policy, __cache_hash_code, false, true> _Base; public: typedef typename _Base::size_type size_type; typedef typename _Base::hasher hasher; typedef typename _Base::key_equal key_equal; typedef typename _Base::allocator_type allocator_type; explicit __unordered_map(size_type __n = 10, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) : _Base(__n, __hf, __detail::_Mod_range_hashing(), __detail::_Default_ranged_hash(), __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a) { } template<typename _InputIterator> __unordered_map(_InputIterator __f, _InputIterator __l, size_type __n = 10, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) : _Base(__f, __l, __n, __hf, __detail::_Mod_range_hashing(), __detail::_Default_ranged_hash(), __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a) { } }; template<class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >, bool __cache_hash_code = false> class __unordered_multimap : public _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc, std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, _Hash, __detail::_Mod_range_hashing, __detail::_Default_ranged_hash, __detail::_Prime_rehash_policy, __cache_hash_code, false, false> { typedef _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc, std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, _Hash, __detail::_Mod_range_hashing, __detail::_Default_ranged_hash, __detail::_Prime_rehash_policy, __cache_hash_code, false, false> _Base; public: typedef typename _Base::size_type size_type; typedef typename _Base::hasher hasher; typedef typename _Base::key_equal key_equal; typedef typename _Base::allocator_type allocator_type; explicit __unordered_multimap(size_type __n = 10, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) : _Base(__n, __hf, __detail::_Mod_range_hashing(), __detail::_Default_ranged_hash(), __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a) { } template<typename _InputIterator> __unordered_multimap(_InputIterator __f, _InputIterator __l, typename _Base::size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) : _Base(__f, __l, __n, __hf, __detail::_Mod_range_hashing(), __detail::_Default_ranged_hash(), __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a) { } }; template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc, bool __cache_hash_code> inline void swap(__unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc, __cache_hash_code>& __x, __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc, __cache_hash_code>& __y) { __x.swap(__y); } template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc, bool __cache_hash_code> inline void swap(__unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc, __cache_hash_code>& __x, __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc, __cache_hash_code>& __y) { __x.swap(__y); } /** * @brief A standard container composed of unique keys (containing * at most one of each key value) that associates values of another type * with the keys. * * @ingroup unordered_associative_containers * * Meets the requirements of a <a href="tables.html#65">container</a>, and * <a href="tables.html#xx">unordered associative container</a> * * @param Key Type of key objects. * @param Tp Type of mapped objects. * @param Hash Hashing function object type, defaults to hash<Value>. * @param Pred Predicate function object type, defaults to equal_to<Value>. * @param Alloc Allocator type, defaults to allocator<Key>. * * The resulting value type of the container is std::pair<const Key, Tp>. */ template<class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> > > class unordered_map : public __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc> { typedef __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc> _Base; public: typedef typename _Base::value_type value_type; typedef typename _Base::size_type size_type; typedef typename _Base::hasher hasher; typedef typename _Base::key_equal key_equal; typedef typename _Base::allocator_type allocator_type; explicit unordered_map(size_type __n = 10, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) : _Base(__n, __hf, __eql, __a) { } template<typename _InputIterator> unordered_map(_InputIterator __f, _InputIterator __l, size_type __n = 10, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) : _Base(__f, __l, __n, __hf, __eql, __a) { } }; /** * @brief A standard container composed of equivalent keys * (possibly containing multiple of each key value) that associates * values of another type with the keys. * * @ingroup unordered_associative_containers * * Meets the requirements of a <a href="tables.html#65">container</a>, and * <a href="tables.html#xx">unordered associative container</a> * * @param Key Type of key objects. * @param Tp Type of mapped objects. * @param Hash Hashing function object type, defaults to hash<Value>. * @param Pred Predicate function object type, defaults to equal_to<Value>. * @param Alloc Allocator type, defaults to allocator<Key>. * * The resulting value type of the container is std::pair<const Key, Tp>. */ template<class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> > > class unordered_multimap : public __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc> { typedef __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc> _Base; public: typedef typename _Base::value_type value_type; typedef typename _Base::size_type size_type; typedef typename _Base::hasher hasher; typedef typename _Base::key_equal key_equal; typedef typename _Base::allocator_type allocator_type; explicit unordered_multimap(size_type __n = 10, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) : _Base(__n, __hf, __eql, __a) { } template<typename _InputIterator> unordered_multimap(_InputIterator __f, _InputIterator __l, typename _Base::size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) : _Base(__f, __l, __n, __hf, __eql, __a) { } }; template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> inline void swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y) { __x.swap(__y); } template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> inline void swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y) { __x.swap(__y); } _GLIBCXX_END_NAMESPACE_VERSION } }