include/ext/hashtable.h

229     const unsigned long* __first = __stl_prime_list;
231     const unsigned long* pos = std::lower_bound(__first, __last, __n);
512 	_Node* __first;
513 	for (__first = _M_buckets[__n];
514 	     __first && !_M_equals(_M_get_key(__first->_M_val), __key);
515 	     __first = __first->_M_next)
517 	return iterator(__first, this);
524 	const _Node* __first;
525 	for (__first = _M_buckets[__n];
526 	     __first && !_M_equals(_M_get_key(__first->_M_val), __key);
527 	     __first = __first->_M_next)
529 	return const_iterator(__first, this);
558       erase(iterator __first, iterator __last);
564       erase(const_iterator __first, const_iterator __last);
627       _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
752       _Node* __first = _M_buckets[__n];
754       for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
759       __tmp->_M_next = __first;
771       _Node* __first = _M_buckets[__n];
773       for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
784       __tmp->_M_next = __first;
798       _Node* __first = _M_buckets[__n];
800       for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
805       __tmp->_M_next = __first;
820       for (_Node* __first = _M_buckets[__n]; __first;
821 	   __first = __first->_M_next)
822 	if (_M_equals(_M_get_key(__first->_M_val), __key))
824 	    for (_Node* __cur = __first->_M_next; __cur;
827 		return _Pii(iterator(__first, this), iterator(__cur, this));
830 		return _Pii(iterator(__first, this),
832 	    return _Pii(iterator(__first, this), end());
846       for (const _Node* __first = _M_buckets[__n]; __first;
847 	   __first = __first->_M_next)
849 	  if (_M_equals(_M_get_key(__first->_M_val), __key))
851 	      for (const _Node* __cur = __first->_M_next; __cur;
854 		  return _Pii(const_iterator(__first, this),
858 		  return _Pii(const_iterator(__first, this),
860 	      return _Pii(const_iterator(__first, this), end());
872       _Node* __first = _M_buckets[__n];
875       if (__first)
877 	  _Node* __cur = __first;
895 	  if (_M_equals(_M_get_key(__first->_M_val), __key))
897 	      _M_buckets[__n] = __first->_M_next;
898 	      _M_delete_node(__first);
947     erase(iterator __first, iterator __last)
949       size_type __f_bucket = __first._M_cur ? _M_bkt_num(__first._M_cur->_M_val)
955       if (__first._M_cur == __last._M_cur)
958 	_M_erase_bucket(__f_bucket, __first._M_cur, __last._M_cur);
961 	  _M_erase_bucket(__f_bucket, __first._M_cur, 0);
972     erase(const_iterator __first, const_iterator __last)
974       erase(iterator(const_cast<_Node*>(__first._M_cur),
975 		     const_cast<hashtable*>(__first._M_ht)),
1003 		      _Node* __first = _M_buckets[__bucket];
1004 		      while (__first)
1006 			  size_type __new_bucket = _M_bkt_num(__first->_M_val,
1008 			  _M_buckets[__bucket] = __first->_M_next;
1009 			  __first->_M_next = __tmp[__new_bucket];
1010 			  __tmp[__new_bucket] = __first;
1011 			  __first = _M_buckets[__bucket];
1037     _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last)
1040       if (__cur == __first)
1046 	       __next != __first;