headers/cpp/stl_hashtable.h

91   _Hashtable_iterator(_Node* __n, _Hashtable* __tab)
92     : _M_cur(__n), _M_ht(__tab) {}
130   _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab)
131     : _M_cur(__n), _M_ht(__tab) {}
159 inline unsigned long __stl_next_prime(unsigned long __n)
163   const unsigned long* pos = lower_bound(__first, __last, __n);
247   hashtable(size_type __n,
259     _M_initialize_buckets(__n);
262   hashtable(size_type __n,
273     _M_initialize_buckets(__n);
318     for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
319       if (_M_buckets[__n])
320         return iterator(_M_buckets[__n], this);
328     for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
329       if (_M_buckets[__n])
330         return const_iterator(_M_buckets[__n], this);
402     size_type __n = 0;
403     distance(__f, __l, __n);
404     resize(_M_num_elements + __n);
405     for ( ; __n > 0; --__n, ++__f)
413     size_type __n = 0;
414     distance(__f, __l, __n);
415     resize(_M_num_elements + __n);
416     for ( ; __n > 0; --__n, ++__f)
423     size_type __n = __l - __f;
424     resize(_M_num_elements + __n);
425     for ( ; __n > 0; --__n, ++__f)
431     size_type __n = __l - __f;
432     resize(_M_num_elements + __n);
433     for ( ; __n > 0; --__n, ++__f)
439     size_type __n = 0;
440     distance(__f, __l, __n);
441     resize(_M_num_elements + __n);
442     for ( ; __n > 0; --__n, ++__f)
448     size_type __n = 0;
449     distance(__f, __l, __n);
450     resize(_M_num_elements + __n);
451     for ( ; __n > 0; --__n, ++__f)
460     size_type __n = _M_bkt_num_key(__key);
462     for ( __first = _M_buckets[__n];
471     size_type __n = _M_bkt_num_key(__key);
473     for ( __first = _M_buckets[__n];
482     const size_type __n = _M_bkt_num_key(__key);
485     for (const _Node* __cur = _M_buckets[__n]; __cur; __cur = __cur->_M_next)
508   size_type _M_next_size(size_type __n) const
509     { return __stl_next_prime(__n); }
511   void _M_initialize_buckets(size_type __n)
513     const size_type __n_buckets = _M_next_size(__n);
529   size_type _M_bkt_num_key(const key_type& __key, size_t __n) const
531     return _M_hash(__key) % __n;
534   size_type _M_bkt_num(const value_type& __obj, size_t __n) const
536     return _M_bkt_num_key(_M_get_key(__obj), __n);
541     _Node* __n = _M_get_node();
542     __n->_M_next = 0;
544       construct(&__n->_M_val, __obj);
545       return __n;
547     __STL_UNWIND(_M_put_node(__n));
550   void _M_delete_node(_Node* __n)
552     destroy(&__n->_M_val);
553     _M_put_node(__n);
556   void _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
557   void _M_erase_bucket(const size_type __n, _Node* __last);
673   for (int __n = 0; __n < __ht1._M_buckets.size(); ++__n) {
674     _Node* __cur1 = __ht1._M_buckets[__n];
675     _Node* __cur2 = __ht2._M_buckets[__n];
702   const size_type __n = _M_bkt_num(__obj);
703   _Node* __first = _M_buckets[__n];
711   _M_buckets[__n] = __tmp;
721   const size_type __n = _M_bkt_num(__obj);
722   _Node* __first = _M_buckets[__n];
735   _M_buckets[__n] = __tmp;
746   size_type __n = _M_bkt_num(__obj);
747   _Node* __first = _M_buckets[__n];
755   _M_buckets[__n] = __tmp;
766   const size_type __n = _M_bkt_num_key(__key);
768   for (_Node* __first = _M_buckets[__n]; __first; __first = __first->_M_next)
773       for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
789   const size_type __n = _M_bkt_num_key(__key);
791   for (const _Node* __first = _M_buckets[__n] ;
801       for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
815   const size_type __n = _M_bkt_num_key(__key);
816   _Node* __first = _M_buckets[__n];
836       _M_buckets[__n] = __first->_M_next;
849     const size_type __n = _M_bkt_num(__p->_M_val);
850     _Node* __cur = _M_buckets[__n];
853       _M_buckets[__n] = __cur->_M_next;
890     for (size_type __n = __f_bucket + 1; __n < __l_bucket; ++__n)
891       _M_erase_bucket(__n, 0);
922     const size_type __n = _M_next_size(__num_elements_hint);
923     if (__n > __old_n) {
924       vector<_Node*, _All> __tmp(__n, (_Node*)(0),
930             size_type __new_bucket = _M_bkt_num(__first->_M_val, __n);
957   ::_M_erase_bucket(const size_type __n, _Node* __first, _Node* __last)
959   _Node* __cur = _M_buckets[__n];
961     _M_erase_bucket(__n, __last);
979   ::_M_erase_bucket(const size_type __n, _Node* __last)
981   _Node* __cur = _M_buckets[__n];
986     _M_buckets[__n] = __cur;