Home | History | Annotate | Download | only in backward

Lines Matching refs:_M_buckets

318       _Vector_type          _M_buckets;
341 _M_get_key(__ext), _M_buckets(__a), _M_num_elements(0)
348 _M_get_key(_ExtractKey()), _M_buckets(__a), _M_num_elements(0)
354 _M_buckets(__ht.get_allocator()), _M_num_elements(0)
392 _M_buckets.swap(__ht._M_buckets);
399 for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
400 if (_M_buckets[__n])
401 return iterator(_M_buckets[__n], this);
412 for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
413 if (_M_buckets[__n])
414 return const_iterator(_M_buckets[__n], this);
431 { return _M_buckets.size(); }
443 for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next)
526 for (__first = _M_buckets[__n];
538 for (__first = _M_buckets[__n];
551 for (const _Node* __cur = _M_buckets[__n]; __cur;
594 _M_buckets.reserve(__n_buckets);
595 _M_buckets.insert(_M_buckets.end(), __n_buckets, (_Node*) 0);
601 { return _M_bkt_num_key(__key, _M_buckets.size()); }
660 while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
661 _M_cur = _M_ht->_M_buckets[__bucket];
688 while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
689 _M_cur = _M_ht->_M_buckets[__bucket];
712 if (__ht1._M_buckets.size() != __ht2._M_buckets.size())
715 for (size_t __n = 0; __n < __ht1._M_buckets.size(); ++__n)
717 _Node* __cur1 = __ht1._M_buckets[__n];
718 _Node* __cur2 = __ht2._M_buckets[__n];
726 for (__cur1 = __ht1._M_buckets[__n] ; __cur1;
730 for (__cur2 = __ht2._M_buckets[__n];
765 _Node* __first = _M_buckets[__n];
773 _M_buckets[__n] = __tmp;
784 _Node* __first = _M_buckets[__n];
798 _M_buckets[__n] = __tmp;
811 _Node* __first = _M_buckets[__n];
819 _M_buckets[__n] = __tmp;
833 for (_Node* __first = _M_buckets[__n]; __first;
841 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
842 if (_M_buckets[__m])
844 iterator(_M_buckets[__m], this));
859 for (const _Node* __first = _M_buckets[__n]; __first;
869 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
870 if (_M_buckets[__m])
872 const_iterator(_M_buckets[__m], this));
885 _Node* __first = _M_buckets[__n];
929 _M_buckets[__n] = __first->_M_next;
946 _Node* __cur = _M_buckets[__n];
950 _M_buckets[__n] = __cur->_M_next;
982 : _M_buckets.size();
985 : _M_buckets.size();
996 if (__l_bucket != _M_buckets.size())
1024 const size_type __old_n = _M_buckets.size();
1030 _Vector_type __tmp(__n, (_Node*)(0), _M_buckets.get_allocator());
1035 _Node* __first = _M_buckets[__bucket];
1040 _M_buckets[__bucket] = __first->_M_next;
1043 __first = _M_buckets[__bucket];
1046 _M_buckets.swap(__tmp);
1071 _Node* __cur = _M_buckets[__n];
1096 _Node* __cur = _M_buckets[__n];
1102 _M_buckets[__n] = __cur;
1115 for (size_type __i = 0; __i < _M_buckets.size(); ++__i)
1117 _Node* __cur = _M_buckets[__i];
1124 _M_buckets[__i] = 0;
1134 _M_buckets.clear();
1135 _M_buckets.reserve(__ht._M_buckets.size());
1136 _M_buckets.insert(_M_buckets.end(), __ht._M_buckets.size(), (_Node*) 0);
1139 for (size_type __i = 0; __i < __ht._M_buckets.size(); ++__i) {
1140 const _Node* __cur = __ht._M_buckets[__i];
1144 _M_buckets[__i] = __local_copy;