Home | History | Annotate | Download | only in backward

Lines Matching refs:_M_buckets

302       _Vector_type          _M_buckets;
325 _M_get_key(__ext), _M_buckets(__a), _M_num_elements(0)
332 _M_get_key(_ExtractKey()), _M_buckets(__a), _M_num_elements(0)
338 _M_buckets(__ht.get_allocator()), _M_num_elements(0)
376 _M_buckets.swap(__ht._M_buckets);
383 for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
384 if (_M_buckets[__n])
385 return iterator(_M_buckets[__n], this);
396 for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
397 if (_M_buckets[__n])
398 return const_iterator(_M_buckets[__n], this);
415 { return _M_buckets.size(); }
425 for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next)
508 for (__first = _M_buckets[__n];
520 for (__first = _M_buckets[__n];
533 for (const _Node* __cur = _M_buckets[__n]; __cur;
576 _M_buckets.reserve(__n_buckets);
577 _M_buckets.insert(_M_buckets.end(), __n_buckets, (_Node*) 0);
583 { return _M_bkt_num_key(__key, _M_buckets.size()); }
642 while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
643 _M_cur = _M_ht->_M_buckets[__bucket];
670 while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
671 _M_cur = _M_ht->_M_buckets[__bucket];
694 if (__ht1._M_buckets.size() != __ht2._M_buckets.size())
697 for (size_t __n = 0; __n < __ht1._M_buckets.size(); ++__n)
699 _Node* __cur1 = __ht1._M_buckets[__n];
700 _Node* __cur2 = __ht2._M_buckets[__n];
708 for (__cur1 = __ht1._M_buckets[__n] ; __cur1;
712 for (__cur2 = __ht2._M_buckets[__n];
747 _Node* __first = _M_buckets[__n];
755 _M_buckets[__n] = __tmp;
766 _Node* __first = _M_buckets[__n];
780 _M_buckets[__n] = __tmp;
793 _Node* __first = _M_buckets[__n];
801 _M_buckets[__n] = __tmp;
815 for (_Node* __first = _M_buckets[__n]; __first;
823 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
824 if (_M_buckets[__m])
826 iterator(_M_buckets[__m], this));
841 for (const _Node* __first = _M_buckets[__n]; __first;
851 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
852 if (_M_buckets[__m])
854 const_iterator(_M_buckets[__m], this));
867 _Node* __first = _M_buckets[__n];
902 _M_buckets[__n] = __first->_M_next;
927 _Node* __cur = _M_buckets[__n];
931 _M_buckets[__n] = __cur->_M_next;
963 : _M_buckets.size();
966 : _M_buckets.size();
977 if (__l_bucket != _M_buckets.size())
1005 const size_type __old_n = _M_buckets.size();
1011 _Vector_type __tmp(__n, (_Node*)(0), _M_buckets.get_allocator());
1016 _Node* __first = _M_buckets[__bucket];
1021 _M_buckets[__bucket] = __first->_M_next;
1024 __first = _M_buckets[__bucket];
1027 _M_buckets.swap(__tmp);
1052 _Node* __cur = _M_buckets[__n];
1077 _Node* __cur = _M_buckets[__n];
1083 _M_buckets[__n] = __cur;
1096 for (size_type __i = 0; __i < _M_buckets.size(); ++__i)
1098 _Node* __cur = _M_buckets[__i];
1105 _M_buckets[__i] = 0;
1115 _M_buckets.clear();
1116 _M_buckets.reserve(__ht._M_buckets.size());
1117 _M_buckets.insert(_M_buckets.end(), __ht._M_buckets.size(), (_Node*) 0);
1120 for (size_type __i = 0; __i < __ht._M_buckets.size(); ++__i) {
1121 const _Node* __cur = __ht._M_buckets[__i];
1125 _M_buckets