include/tr1/hashtable_policy.h

41 namespace std
49     inline typename std::iterator_traits<_Iterator>::difference_type
51 		  std::input_iterator_tag)
55     inline typename std::iterator_traits<_Iterator>::difference_type
57 		  std::forward_iterator_tag)
58     { return std::distance(__first, __last); }
61     inline typename std::iterator_traits<_Iterator>::difference_type
64       typedef typename std::iterator_traits<_Iterator>::iterator_category _Tag;
184       std::size_t  _M_hash_code;
235       typedef std::ptrdiff_t                           difference_type;
236       typedef std::forward_iterator_tag                iterator_category;
276       typedef std::ptrdiff_t                           difference_type;
277       typedef std::forward_iterator_tag                iterator_category;
376       typedef std::ptrdiff_t                           difference_type;
377       typedef std::forward_iterator_tag                iterator_category;
421       typedef std::ptrdiff_t                           difference_type;
422       typedef std::forward_iterator_tag                iterator_category;
472     typedef std::size_t first_argument_type;
473     typedef std::size_t second_argument_type;
474     typedef std::size_t result_type;
498     std::size_t
499     _M_next_bkt(std::size_t __n) const;
502     std::size_t
503     _M_bkt_for_elements(std::size_t __n) const;
509     std::pair<bool, std::size_t>
510     _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
511 		   std::size_t __n_ins) const;
515     mutable std::size_t  _M_next_resize;
530   inline std::size_t
532   _M_next_bkt(std::size_t __n) const
536     const unsigned long* __p = std::lower_bound(_Primes<>::__primes, __last,
538     _M_next_resize = static_cast<std::size_t>(std::ceil(*__p
545   inline std::size_t
547   _M_bkt_for_elements(std::size_t __n) const
552     const unsigned long* __p = std::lower_bound(_Primes<>::__primes, __last,
554     _M_next_resize = static_cast<std::size_t>(std::ceil(*__p
568   inline std::pair<bool, std::size_t>
570   _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
571 		 std::size_t __n_ins) const
579 	    __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
582 	    const unsigned long* __p = std::lower_bound(_Primes<>::__primes,
586 	      static_cast<std::size_t>(std::ceil(*__p * _M_max_load_factor));
587 	    return std::make_pair(true, *__p);
592 	      static_cast<std::size_t>(std::ceil(__n_bkt
594 	    return std::make_pair(false, 0);
598       return std::make_pair(false, 0);
601   // Base classes for std::tr1::_Hashtable.  We define these base
620     struct _Map_base<_Key, _Pair, std::_Select1st<_Pair>, false, _Hashtable>
626   struct _Map_base<_Key, _Pair, std::_Select1st<_Pair>, true, _Hashtable>
635     typename _Map_base<_Key, _Pair, std::_Select1st<_Pair>,
637     _Map_base<_Key, _Pair, std::_Select1st<_Pair>, true, _Hashtable>::
642       std::size_t __n = __h->_M_bucket_index(__k, __code,
648 	return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
713       std::size_t
715 		      std::size_t __n) const
718       std::size_t
720 		      std::size_t __n) const
740 	std::swap(_M_extract, __x._M_extract);
741 	std::swap(_M_eq, __x._M_eq);
742 	std::swap(_M_ranged_hash, __x._M_ranged_hash);
786       typedef std::size_t _Hash_code_type;
792       std::size_t
794 		      std::size_t __n) const
797       std::size_t
799 		      std::size_t __n) const
819 	std::swap(_M_extract, __x._M_extract);
820 	std::swap(_M_eq, __x._M_eq);
821 	std::swap(_M_h1, __x._M_h1);
822 	std::swap(_M_h2, __x._M_h2);
853       typedef std::size_t _Hash_code_type;
859       std::size_t
861 		      std::size_t __n) const
864       std::size_t
866 		      std::size_t __n) const
886 	std::swap(_M_extract, __x._M_extract);
887 	std::swap(_M_eq, __x._M_eq);
888 	std::swap(_M_h1, __x._M_h1);
889 	std::swap(_M_h2, __x._M_h2);
900 } // namespace std::tr1