Lines Matching refs:_M_buckets
320 _Vector_type _M_buckets;
343 _M_get_key(__ext), _M_buckets(__a), _M_num_elements(0)
350 _M_get_key(_ExtractKey()), _M_buckets(__a), _M_num_elements(0)
356 _M_buckets(__ht.get_allocator()), _M_num_elements(0)
394 _M_buckets.swap(__ht._M_buckets);
401 for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
402 if (_M_buckets[__n])
403 return iterator(_M_buckets[__n], this);
414 for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
415 if (_M_buckets[__n])
416 return const_iterator(_M_buckets[__n], this);
433 { return _M_buckets.size(); }
445 for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next)
528 for (__first = _M_buckets[__n];
540 for (__first = _M_buckets[__n];
553 for (const _Node* __cur = _M_buckets[__n]; __cur;
596 _M_buckets.reserve(__n_buckets);
597 _M_buckets.insert(_M_buckets.end(), __n_buckets, (_Node*) 0);
603 { return _M_bkt_num_key(__key, _M_buckets.size()); }
662 while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
663 _M_cur = _M_ht->_M_buckets[__bucket];
690 while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
691 _M_cur = _M_ht->_M_buckets[__bucket];
714 if (__ht1._M_buckets.size() != __ht2._M_buckets.size())
717 for (size_t __n = 0; __n < __ht1._M_buckets.size(); ++__n)
719 _Node* __cur1 = __ht1._M_buckets[__n];
720 _Node* __cur2 = __ht2._M_buckets[__n];
728 for (__cur1 = __ht1._M_buckets[__n] ; __cur1;
732 for (__cur2 = __ht2._M_buckets[__n];
767 _Node* __first = _M_buckets[__n];
775 _M_buckets[__n] = __tmp;
786 _Node* __first = _M_buckets[__n];
800 _M_buckets[__n] = __tmp;
813 _Node* __first = _M_buckets[__n];
821 _M_buckets[__n] = __tmp;
835 for (_Node* __first = _M_buckets[__n]; __first;
843 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
844 if (_M_buckets[__m])
846 iterator(_M_buckets[__m], this));
861 for (const _Node* __first = _M_buckets[__n]; __first;
871 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
872 if (_M_buckets[__m])
874 const_iterator(_M_buckets[__m], this));
887 _Node* __first = _M_buckets[__n];
922 _M_buckets[__n] = __first->_M_next;
947 _Node* __cur = _M_buckets[__n];
951 _M_buckets[__n] = __cur->_M_next;
983 : _M_buckets.size();
986 : _M_buckets.size();
997 if (__l_bucket != _M_buckets.size())
1025 const size_type __old_n = _M_buckets.size();
1031 _Vector_type __tmp(__n, (_Node*)(0), _M_buckets.get_allocator());
1036 _Node* __first = _M_buckets[__bucket];
1041 _M_buckets[__bucket] = __first->_M_next;
1044 __first = _M_buckets[__bucket];
1047 _M_buckets.swap(__tmp);
1072 _Node* __cur = _M_buckets[__n];
1097 _Node* __cur = _M_buckets[__n];
1103 _M_buckets[__n] = __cur;
1116 for (size_type __i = 0; __i < _M_buckets.size(); ++__i)
1118 _Node* __cur = _M_buckets[__i];
1125 _M_buckets[__i] = 0;
1135 _M_buckets.clear();
1136 _M_buckets.reserve(__ht._M_buckets.size());
1137 _M_buckets.insert(_M_buckets.end(), __ht._M_buckets.size(), (_Node*) 0);
1140 for (size_type __i = 0; __i < __ht._M_buckets.size(); ++__i) {
1141 const _Node* __cur = __ht._M_buckets[__i];
1145 _M_buckets[__i] = __local_copy;
