Lines Matching refs:__first
240 const unsigned long* __first = _Hashtable_prime_list<unsigned long>::_S_get_prime_list();
241 const unsigned long* __last = __first + (int)_S_num_primes;
242 const unsigned long* pos = std::lower_bound(__first, __last, __n);
525 _Node* __first;
526 for (__first = _M_buckets[__n];
527 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
528 __first = __first->_M_next)
530 return iterator(__first, this);
537 const _Node* __first;
538 for (__first = _M_buckets[__n];
539 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
540 __first = __first->_M_next)
542 return const_iterator(__first, this);
571 erase(iterator __first, iterator __last);
577 erase(const_iterator __first, const_iterator __last);
640 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
765 _Node* __first = _M_buckets[__n];
767 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
772 __tmp->_M_next = __first;
784 _Node* __first = _M_buckets[__n];
786 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
797 __tmp->_M_next = __first;
811 _Node* __first = _M_buckets[__n];
813 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
818 __tmp->_M_next = __first;
833 for (_Node* __first = _M_buckets[__n]; __first;
834 __first = __first->_M_next)
835 if (_M_equals(_M_get_key(__first->_M_val), __key))
837 for (_Node* __cur = __first->_M_next; __cur;
840 return _Pii(iterator(__first, this), iterator(__cur, this));
843 return _Pii(iterator(__first, this),
845 return _Pii(iterator(__first, this), end());
859 for (const _Node* __first = _M_buckets[__n]; __first;
860 __first = __first->_M_next)
862 if (_M_equals(_M_get_key(__first->_M_val), __key))
864 for (const _Node* __cur = __first->_M_next; __cur;
867 return _Pii(const_iterator(__first, this),
871 return _Pii(const_iterator(__first, this),
873 return _Pii(const_iterator(__first, this), end());
885 _Node* __first = _M_buckets[__n];
889 if (__first)
891 _Node* __cur = __first;
918 bool __delete_first = _M_equals(_M_get_key(__first->_M_val), __key);
929 _M_buckets[__n] = __first->_M_next;
930 _M_delete_node(__first);
979 erase(iterator __first, iterator __last)
981 size_type __f_bucket = __first._M_cur ? _M_bkt_num(__first._M_cur->_M_val)
987 if (__first._M_cur == __last._M_cur)
990 _M_erase_bucket(__f_bucket, __first._M_cur, __last._M_cur);
993 _M_erase_bucket(__f_bucket, __first._M_cur, 0);
1004 erase(const_iterator __first, const_iterator __last)
1006 erase(iterator(const_cast<_Node*>(__first._M_cur),
1007 const_cast<hashtable*>(__first._M_ht)),
1035 _Node* __first = _M_buckets[__bucket];
1036 while (__first)
1038 size_type __new_bucket = _M_bkt_num(__first->_M_val,
1040 _M_buckets[__bucket] = __first->_M_next;
1041 __first->_M_next = __tmp[__new_bucket];
1042 __tmp[__new_bucket] = __first;
1043 __first = _M_buckets[__bucket];
1069 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last)
1072 if (__cur == __first)
1078 __next != __first;