Lines Matching defs:__first
224 const unsigned long* __first = __stl_prime_list;
226 const unsigned long* pos = std::lower_bound(__first, __last, __n);
507 _Node* __first;
508 for (__first = _M_buckets[__n];
509 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
510 __first = __first->_M_next)
512 return iterator(__first, this);
519 const _Node* __first;
520 for (__first = _M_buckets[__n];
521 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
522 __first = __first->_M_next)
524 return const_iterator(__first, this);
553 erase(iterator __first, iterator __last);
559 erase(const_iterator __first, const_iterator __last);
622 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
747 _Node* __first = _M_buckets[__n];
749 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
754 __tmp->_M_next = __first;
766 _Node* __first = _M_buckets[__n];
768 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
779 __tmp->_M_next = __first;
793 _Node* __first = _M_buckets[__n];
795 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
800 __tmp->_M_next = __first;
815 for (_Node* __first = _M_buckets[__n]; __first;
816 __first = __first->_M_next)
817 if (_M_equals(_M_get_key(__first->_M_val), __key))
819 for (_Node* __cur = __first->_M_next; __cur;
822 return _Pii(iterator(__first, this), iterator(__cur, this));
825 return _Pii(iterator(__first, this),
827 return _Pii(iterator(__first, this), end());
841 for (const _Node* __first = _M_buckets[__n]; __first;
842 __first = __first->_M_next)
844 if (_M_equals(_M_get_key(__first->_M_val), __key))
846 for (const _Node* __cur = __first->_M_next; __cur;
849 return _Pii(const_iterator(__first, this),
853 return _Pii(const_iterator(__first, this),
855 return _Pii(const_iterator(__first, this), end());
867 _Node* __first = _M_buckets[__n];
871 if (__first)
873 _Node* __cur = __first;
900 if (_M_equals(_M_get_key(__first->_M_val), __key))
902 _M_buckets[__n] = __first->_M_next;
903 _M_delete_node(__first);
960 erase(iterator __first, iterator __last)
962 size_type __f_bucket = __first._M_cur ? _M_bkt_num(__first._M_cur->_M_val)
968 if (__first._M_cur == __last._M_cur)
971 _M_erase_bucket(__f_bucket, __first._M_cur, __last._M_cur);
974 _M_erase_bucket(__f_bucket, __first._M_cur, 0);
985 erase(const_iterator __first, const_iterator __last)
987 erase(iterator(const_cast<_Node*>(__first._M_cur),
988 const_cast<hashtable*>(__first._M_ht)),
1016 _Node* __first = _M_buckets[__bucket];
1017 while (__first)
1019 size_type __new_bucket = _M_bkt_num(__first->_M_val,
1021 _M_buckets[__bucket] = __first->_M_next;
1022 __first->_M_next = __tmp[__new_bucket];
1023 __tmp[__new_bucket] = __first;
1024 __first = _M_buckets[__bucket];
1050 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last)
1053 if (__cur == __first)
1059 __next != __first;
