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 : 216.73.216.44
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 /
ext /
pb_ds /
detail /
hash_fn /
Delete
Unzip
Name
Size
Permission
Date
Action
direct_mask_range_hashing_imp.hpp
2.05
KB
-rw-r--r--
2020-09-30 02:17
direct_mod_range_hashing_imp.hpp
2.04
KB
-rw-r--r--
2020-09-30 02:17
linear_probe_fn_imp.hpp
1.87
KB
-rw-r--r--
2020-09-30 02:17
mask_based_range_hashing.hpp
3.21
KB
-rw-r--r--
2020-09-30 02:17
mod_based_range_hashing.hpp
2.33
KB
-rw-r--r--
2020-09-30 02:17
probe_fn_base.hpp
1.96
KB
-rw-r--r--
2020-09-30 02:17
quadratic_probe_fn_imp.hpp
1.88
KB
-rw-r--r--
2020-09-30 02:17
ranged_hash_fn.hpp
10.37
KB
-rw-r--r--
2020-09-30 02:17
ranged_probe_fn.hpp
10.19
KB
-rw-r--r--
2020-09-30 02:17
sample_probe_fn.hpp
2.24
KB
-rw-r--r--
2020-09-30 02:17
sample_range_hashing.hpp
2.43
KB
-rw-r--r--
2020-09-30 02:17
sample_ranged_hash_fn.hpp
2.41
KB
-rw-r--r--
2020-09-30 02:17
sample_ranged_probe_fn.hpp
2.54
KB
-rw-r--r--
2020-09-30 02:17
Save
Rename
// -*- C++ -*- // Copyright (C) 2005-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/>. // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. // Permission to use, copy, modify, sell, and distribute this software // is hereby granted without fee, provided that the above copyright // notice appears in all copies, and that both that copyright notice // and this permission notice appear in supporting documentation. None // of the above authors, nor IBM Haifa Research Laboratories, make any // representation about the suitability of this software for any // purpose. It is provided "as is" without express or implied // warranty. /** * @file mask_based_range_hashing.hpp * Contains a range hashing policy base. */ #ifndef PB_DS_MASK_BASED_RANGE_HASHING_HPP #define PB_DS_MASK_BASED_RANGE_HASHING_HPP namespace __gnu_pbds { namespace detail { /// Range hashing policy. template<typename Size_Type> class mask_based_range_hashing { protected: typedef Size_Type size_type; void swap(mask_based_range_hashing& other) { std::swap(m_mask, other.m_mask); } void notify_resized(size_type size); inline size_type range_hash(size_type hash) const { return size_type(hash & m_mask); } private: size_type m_mask; const static size_type s_num_bits_in_size_type; const static size_type s_highest_bit_1; }; template<typename Size_Type> const typename mask_based_range_hashing<Size_Type>::size_type mask_based_range_hashing<Size_Type>::s_num_bits_in_size_type = sizeof(typename mask_based_range_hashing<Size_Type>::size_type) << 3; template<typename Size_Type> const typename mask_based_range_hashing<Size_Type>::size_type mask_based_range_hashing<Size_Type>::s_highest_bit_1 = static_cast<typename mask_based_range_hashing<Size_Type>::size_type>(1) << (s_num_bits_in_size_type - 1); template<typename Size_Type> void mask_based_range_hashing<Size_Type>:: notify_resized(size_type size) { size_type i = 0; while (size ^ s_highest_bit_1) { size <<= 1; ++i; } m_mask = 1; i += 2; while (i++ < s_num_bits_in_size_type) m_mask = (m_mask << 1) ^ 1; } } // namespace detail } // namespace __gnu_pbds #endif