Geforce File Manager

NAME	SIZE	ACTIONS
📄 array	6,964 B	[ EDIT ] \| [ DEL ]
📄 bessel_function.tcc	22,473 B	[ EDIT ] \| [ DEL ]
📄 beta_function.tcc	5,995 B	[ EDIT ] \| [ DEL ]
📄 ccomplex	1,255 B	[ EDIT ] \| [ DEL ]
📄 cctype	1,412 B	[ EDIT ] \| [ DEL ]
📄 cfenv	2,004 B	[ EDIT ] \| [ DEL ]
📄 cfloat	1,380 B	[ EDIT ] \| [ DEL ]
📄 cinttypes	2,256 B	[ EDIT ] \| [ DEL ]
📄 climits	1,454 B	[ EDIT ] \| [ DEL ]
📄 cmath	43,806 B	[ EDIT ] \| [ DEL ]
📄 complex	12,384 B	[ EDIT ] \| [ DEL ]
📄 complex.h	1,261 B	[ EDIT ] \| [ DEL ]
📄 cstdarg	1,246 B	[ EDIT ] \| [ DEL ]
📄 cstdbool	1,344 B	[ EDIT ] \| [ DEL ]
📄 cstdint	2,623 B	[ EDIT ] \| [ DEL ]
📄 cstdio	1,482 B	[ EDIT ] \| [ DEL ]
📄 cstdlib	1,796 B	[ EDIT ] \| [ DEL ]
📄 ctgmath	1,248 B	[ EDIT ] \| [ DEL ]
📄 ctime	1,234 B	[ EDIT ] \| [ DEL ]
📄 ctype.h	1,209 B	[ EDIT ] \| [ DEL ]
📄 cwchar	1,718 B	[ EDIT ] \| [ DEL ]
📄 cwctype	1,459 B	[ EDIT ] \| [ DEL ]
📄 ell_integral.tcc	27,724 B	[ EDIT ] \| [ DEL ]
📄 exp_integral.tcc	16,009 B	[ EDIT ] \| [ DEL ]
📄 fenv.h	1,204 B	[ EDIT ] \| [ DEL ]
📄 float.h	1,209 B	[ EDIT ] \| [ DEL ]
📄 functional	70,545 B	[ EDIT ] \| [ DEL ]
📄 functional_hash.h	6,043 B	[ EDIT ] \| [ DEL ]
📄 gamma.tcc	14,682 B	[ EDIT ] \| [ DEL ]
📄 hashtable.h	41,537 B	[ EDIT ] \| [ DEL ]
📄 hashtable_policy.h	25,086 B	[ EDIT ] \| [ DEL ]
📄 hypergeometric.tcc	28,066 B	[ EDIT ] \| [ DEL ]
📄 inttypes.h	1,267 B	[ EDIT ] \| [ DEL ]
📄 legendre_function.tcc	10,909 B	[ EDIT ] \| [ DEL ]
📄 limits.h	1,214 B	[ EDIT ] \| [ DEL ]
📄 math.h	4,553 B	[ EDIT ] \| [ DEL ]
📄 memory	1,791 B	[ EDIT ] \| [ DEL ]
📄 modified_bessel_func.tcc	16,320 B	[ EDIT ] \| [ DEL ]
📄 poly_hermite.tcc	3,925 B	[ EDIT ] \| [ DEL ]
📄 poly_laguerre.tcc	11,676 B	[ EDIT ] \| [ DEL ]
📄 random	1,589 B	[ EDIT ] \| [ DEL ]
📄 random.h	73,123 B	[ EDIT ] \| [ DEL ]
📄 random.tcc	53,927 B	[ EDIT ] \| [ DEL ]
📄 regex	92,880 B	[ EDIT ] \| [ DEL ]
📄 riemann_zeta.tcc	14,063 B	[ EDIT ] \| [ DEL ]
📄 shared_ptr.h	32,608 B	[ EDIT ] \| [ DEL ]
📄 special_function_util.h	5,055 B	[ EDIT ] \| [ DEL ]
📄 stdarg.h	1,214 B	[ EDIT ] \| [ DEL ]
📄 stdbool.h	1,219 B	[ EDIT ] \| [ DEL ]
📄 stdint.h	1,214 B	[ EDIT ] \| [ DEL ]
📄 stdio.h	1,209 B	[ EDIT ] \| [ DEL ]
📄 stdlib.h	1,487 B	[ EDIT ] \| [ DEL ]
📄 tgmath.h	1,255 B	[ EDIT ] \| [ DEL ]
📄 tuple	12,119 B	[ EDIT ] \| [ DEL ]
📄 type_traits	19,019 B	[ EDIT ] \| [ DEL ]
📄 unordered_map	1,574 B	[ EDIT ] \| [ DEL ]
📄 unordered_map.h	10,216 B	[ EDIT ] \| [ DEL ]
📄 unordered_set	1,574 B	[ EDIT ] \| [ DEL ]
📄 unordered_set.h	9,540 B	[ EDIT ] \| [ DEL ]
📄 utility	3,225 B	[ EDIT ] \| [ DEL ]
📄 wchar.h	1,249 B	[ EDIT ] \| [ DEL ]
📄 wctype.h	1,255 B	[ EDIT ] \| [ DEL ]

[ CLOSE ]

EDIT: 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;

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;

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
}