headers/cpp/stl_hashtable.h

231   vector<_Node*,_Alloc> _M_buckets;
256       _M_buckets(__a),
270       _M_buckets(__a),
281       _M_buckets(__ht.get_allocator()),
312     _M_buckets.swap(__ht._M_buckets);
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);
341   size_type bucket_count() const { return _M_buckets.size(); }
349     for (_Node* __cur = _M_buckets[__bucket]; __cur; __cur = __cur->_M_next)
462     for ( __first = _M_buckets[__n];
473     for ( __first = _M_buckets[__n];
485     for (const _Node* __cur = _M_buckets[__n]; __cur; __cur = __cur->_M_next)
514     _M_buckets.reserve(__n_buckets);
515     _M_buckets.insert(_M_buckets.end(), __n_buckets, (_Node*) 0);
521     return _M_bkt_num_key(__key, _M_buckets.size());
572     while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
573       _M_cur = _M_ht->_M_buckets[__bucket];
597     while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
598       _M_cur = _M_ht->_M_buckets[__bucket];
671   if (__ht1._M_buckets.size() != __ht2._M_buckets.size())
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];
703   _Node* __first = _M_buckets[__n];
711   _M_buckets[__n] = __tmp;
722   _Node* __first = _M_buckets[__n];
735   _M_buckets[__n] = __tmp;
747   _Node* __first = _M_buckets[__n];
755   _M_buckets[__n] = __tmp;
768   for (_Node* __first = _M_buckets[__n]; __first; __first = __first->_M_next)
773       for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
774         if (_M_buckets[__m])
776                      iterator(_M_buckets[__m], this));
791   for (const _Node* __first = _M_buckets[__n] ;
801       for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
802         if (_M_buckets[__m])
804                       const_iterator(_M_buckets[__m], this));
816   _Node* __first = _M_buckets[__n];
836       _M_buckets[__n] = __first->_M_next;
850     _Node* __cur = _M_buckets[__n];
853       _M_buckets[__n] = __cur->_M_next;
880     _M_bkt_num(__first._M_cur->_M_val) : _M_buckets.size();
882     _M_bkt_num(__last._M_cur->_M_val) : _M_buckets.size();
892     if (__l_bucket != _M_buckets.size())
920   const size_type __old_n = _M_buckets.size();
925                                  _M_buckets.get_allocator());
928           _Node* __first = _M_buckets[__bucket];
931             _M_buckets[__bucket] = __first->_M_next;
934             __first = _M_buckets[__bucket];
937         _M_buckets.swap(__tmp);
959   _Node* __cur = _M_buckets[__n];
981   _Node* __cur = _M_buckets[__n];
986     _M_buckets[__n] = __cur;
994   for (size_type __i = 0; __i < _M_buckets.size(); ++__i) {
995     _Node* __cur = _M_buckets[__i];
1001     _M_buckets[__i] = 0;
1011   _M_buckets.clear();
1012   _M_buckets.reserve(__ht._M_buckets.size());
1013   _M_buckets.insert(_M_buckets.end(), __ht._M_buckets.size(), (_Node*) 0);
1015     for (size_type __i = 0; __i < __ht._M_buckets.size(); ++__i) {
1016       if (const _Node* __cur = __ht._M_buckets[__i]) {
1018         _M_buckets[__i] = ___copy;