REDROOM

Navigation

Breadcrumbs

/ / usr / include / c++ / 8 / tr1

Create

Create File | Create Folder | Upload Files | Run Command

Preview: unordered_set.h Size: 9.32 KB

/usr/include/c++/8/tr1/unordered_set.h

// TR1 unordered_set implementation -*- C++ -*-

// Copyright (C) 2010-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/unordered_set.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{tr1/unordered_set}
 */

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

namespace tr1
{
  // NB: When we get typedef templates these class definitions
  // will be unnecessary.
  template<class _Value,
	   class _Hash = hash<_Value>,
	   class _Pred = std::equal_to<_Value>,
	   class _Alloc = std::allocator<_Value>,
	   bool __cache_hash_code = false>
    class __unordered_set
    : public _Hashtable<_Value, _Value, _Alloc,
			std::_Identity<_Value>, _Pred,
			_Hash, __detail::_Mod_range_hashing,
			__detail::_Default_ranged_hash,
			__detail::_Prime_rehash_policy,
			__cache_hash_code, true, true>
    {
      typedef _Hashtable<_Value, _Value, _Alloc,
			 std::_Identity<_Value>, _Pred,
			 _Hash, __detail::_Mod_range_hashing,
			 __detail::_Default_ranged_hash,
			 __detail::_Prime_rehash_policy,
			 __cache_hash_code, true, 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_set(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::_Identity<_Value>(), __a)
      { }

      template<typename _InputIterator>
	__unordered_set(_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::_Identity<_Value>(), __a)
	{ }
    };

  template<class _Value,
	   class _Hash = hash<_Value>,
	   class _Pred = std::equal_to<_Value>,
	   class _Alloc = std::allocator<_Value>,
	   bool __cache_hash_code = false>
    class __unordered_multiset
    : public _Hashtable<_Value, _Value, _Alloc,
			std::_Identity<_Value>, _Pred,
			_Hash, __detail::_Mod_range_hashing,
			__detail::_Default_ranged_hash,
			__detail::_Prime_rehash_policy,
			__cache_hash_code, true, false>
    {
      typedef _Hashtable<_Value, _Value, _Alloc,
			 std::_Identity<_Value>, _Pred,
			 _Hash, __detail::_Mod_range_hashing,
			 __detail::_Default_ranged_hash,
			 __detail::_Prime_rehash_policy,
			 __cache_hash_code, true, 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_multiset(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::_Identity<_Value>(), __a)
      { }


      template<typename _InputIterator>
	__unordered_multiset(_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::_Identity<_Value>(), __a)
	{ }
    };

  template<class _Value, class _Hash, class _Pred, class _Alloc,
	   bool __cache_hash_code>
    inline void
    swap(__unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __x,
	 __unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __y)
    { __x.swap(__y); }

  template<class _Value, class _Hash, class _Pred, class _Alloc,
	   bool __cache_hash_code>
    inline void
    swap(__unordered_multiset<_Value, _Hash, _Pred,
	 _Alloc, __cache_hash_code>& __x,
	 __unordered_multiset<_Value, _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) in which the elements' keys are
   *  the elements themselves.
   *
   *  @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  Value  Type of key 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>.
   */
  template<class _Value,
	   class _Hash = hash<_Value>,
	   class _Pred = std::equal_to<_Value>,
	   class _Alloc = std::allocator<_Value> >
    class unordered_set
    : public __unordered_set<_Value, _Hash, _Pred, _Alloc>
    {
      typedef __unordered_set<_Value, _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_set(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_set(_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) in which the
   *  elements' keys are the elements themselves.
   *
   *  @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  Value  Type of key 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>.
   */
  template<class _Value,
	   class _Hash = hash<_Value>,
	   class _Pred = std::equal_to<_Value>,
	   class _Alloc = std::allocator<_Value> >
    class unordered_multiset
    : public __unordered_multiset<_Value, _Hash, _Pred, _Alloc>
    {
      typedef __unordered_multiset<_Value, _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_multiset(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_multiset(_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 _Value, class _Hash, class _Pred, class _Alloc>
    inline void
    swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
	 unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
    { __x.swap(__y); }

  template<class _Value, class _Hash, class _Pred, class _Alloc>
    inline void
    swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
	 unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
    { __x.swap(__y); }
}

_GLIBCXX_END_NAMESPACE_VERSION
}

Directory Contents

Dirs: 0 × Files: 62

Sort:

Enable drag-to-move

Name	Size	Perms	Modified	Actions
array	6.80 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
bessel_function.tcc	21.95 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
beta_function.tcc	5.85 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
ccomplex	1.23 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
cctype	1.38 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
cfenv	1.96 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
cfloat	1.35 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
cinttypes	2.20 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
climits	1.42 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
cmath	42.78 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
complex	12.09 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
complex.h	1.23 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
cstdarg	1.22 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
cstdbool	1.31 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
cstdint	2.56 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
cstdio	1.45 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
cstdlib	1.75 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
ctgmath	1.22 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
ctime	1.21 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
ctype.h	1.18 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
cwchar	1.68 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
cwctype	1.42 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
ell_integral.tcc	27.07 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
exp_integral.tcc	15.63 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
fenv.h	1.18 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
float.h	1.18 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
functional	68.89 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
functional_hash.h	5.90 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
gamma.tcc	14.34 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
hashtable.h	40.56 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
hashtable_policy.h	24.50 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
hypergeometric.tcc	27.41 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
inttypes.h	1.24 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
legendre_function.tcc	10.65 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
limits.h	1.19 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
math.h	4.45 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
memory	1.75 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
modified_bessel_func.tcc	15.94 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
poly_hermite.tcc	3.83 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
poly_laguerre.tcc	11.40 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
random	1.55 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
random.h	71.41 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
random.tcc	52.66 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
regex	90.70 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
riemann_zeta.tcc	13.73 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
shared_ptr.h	31.84 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
special_function_util.h	4.94 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
stdarg.h	1.19 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
stdbool.h	1.19 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
stdint.h	1.19 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
stdio.h	1.18 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
stdlib.h	1.45 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
tgmath.h	1.23 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
tuple	11.83 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
type_traits	18.57 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
unordered_map	1.54 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
unordered_map.h	9.98 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
unordered_set	1.54 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
unordered_set.h	9.32 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
utility	3.15 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
wchar.h	1.22 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive
wctype.h	1.23 KB	lrw-r--r--	2025-08-26 09:45:04	Edit Download recursive recursive