epoc32/include/stdapis/stlportv5/stl/_hashtable.c
author William Roberts <williamr@symbian.org>
Wed, 31 Mar 2010 12:27:01 +0100
branchSymbian2
changeset 3 e1b950c65cb4
parent 2 epoc32/include/stdapis/stlport/stl/_hashtable.c@2fe1408b6811
child 4 837f303aceeb
permissions -rw-r--r--
Attempt to represent the S^2->S^3 header reorganisation as a series of "hg rename" operations
williamr@2
     1
/*
williamr@2
     2
 *
williamr@2
     3
 *
williamr@2
     4
 * Copyright (c) 1994
williamr@2
     5
 * Hewlett-Packard Company
williamr@2
     6
 *
williamr@2
     7
 * Copyright (c) 1996,1997
williamr@2
     8
 * Silicon Graphics Computer Systems, Inc.
williamr@2
     9
 *
williamr@2
    10
 * Copyright (c) 1997
williamr@2
    11
 * Moscow Center for SPARC Technology
williamr@2
    12
 *
williamr@2
    13
 * Copyright (c) 1999 
williamr@2
    14
 * Boris Fomitchev
williamr@2
    15
 *
williamr@2
    16
 * This material is provided "as is", with absolutely no warranty expressed
williamr@2
    17
 * or implied. Any use is at your own risk.
williamr@2
    18
 *
williamr@2
    19
 * Permission to use or copy this software for any purpose is hereby granted 
williamr@2
    20
 * without fee, provided the above notices are retained on all copies.
williamr@2
    21
 * Permission to modify the code and to distribute modified code is granted,
williamr@2
    22
 * provided the above notices are retained, and a notice that the code was
williamr@2
    23
 * modified is included with the above copyright notice.
williamr@2
    24
 *
williamr@2
    25
 */
williamr@2
    26
#ifndef _STLP_HASHTABLE_C
williamr@2
    27
#define _STLP_HASHTABLE_C
williamr@2
    28
williamr@2
    29
#ifndef _STLP_INTERNAL_HASHTABLE_H
williamr@2
    30
# include <stl/_hashtable.h>
williamr@2
    31
#endif
williamr@2
    32
williamr@2
    33
#ifdef _STLP_DEBUG
williamr@2
    34
#  define hashtable __WORKAROUND_DBG_RENAME(hashtable)
williamr@2
    35
#endif
williamr@2
    36
williamr@2
    37
_STLP_BEGIN_NAMESPACE
williamr@2
    38
williamr@2
    39
# define __PRIME_LIST_BODY { \
williamr@2
    40
  53ul,         97ul,         193ul,       389ul,       769ul,      \
williamr@2
    41
  1543ul,       3079ul,       6151ul,      12289ul,     24593ul,    \
williamr@2
    42
  49157ul,      98317ul,      196613ul,    393241ul,    786433ul,   \
williamr@2
    43
  1572869ul,    3145739ul,    6291469ul,   12582917ul,  25165843ul, \
williamr@2
    44
  50331653ul,   100663319ul,  201326611ul, 402653189ul, 805306457ul,\
williamr@2
    45
  1610612741ul, 3221225473ul, 4294967291ul  \
williamr@2
    46
}
williamr@2
    47
williamr@2
    48
#if ( _STLP_STATIC_TEMPLATE_DATA > 0 )
williamr@2
    49
template <class _Tp>
williamr@2
    50
const size_t _Stl_prime<_Tp>::_M_list[__stl_num_primes] = __PRIME_LIST_BODY;
williamr@2
    51
#else
williamr@2
    52
__DECLARE_INSTANCE(const size_t, 
williamr@2
    53
		   _Stl_prime_type::_M_list[], =__PRIME_LIST_BODY);
williamr@2
    54
#endif /* _STLP_STATIC_TEMPLATE_DATA */
williamr@2
    55
williamr@2
    56
# undef __PRIME_LIST_BODY
williamr@2
    57
williamr@2
    58
// fbp: these defines are for outline methods definitions.
williamr@2
    59
// needed to definitions to be portable. Should not be used in method bodies.
williamr@2
    60
williamr@2
    61
# if defined ( _STLP_NESTED_TYPE_PARAM_BUG )
williamr@2
    62
#  define __size_type__       size_t
williamr@2
    63
#  define size_type           size_t
williamr@2
    64
#  define value_type      _Val
williamr@2
    65
#  define key_type        _Key
williamr@2
    66
#  define _Node           _Hashtable_node<_Val>
williamr@2
    67
#  define __reference__       _Val&
williamr@2
    68
williamr@2
    69
#  define __iterator__        _Ht_iterator<_Val, _Nonconst_traits<_Val>, _Key, _HF, _ExK, _EqK, _All>
williamr@2
    70
#  define __const_iterator__  _Ht_iterator<_Val, _Const_traits<_Val>, _Key, _HF, _ExK, _EqK, _All>
williamr@2
    71
# else
williamr@2
    72
#  define __size_type__        _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _ExK, _EqK, _All>::size_type
williamr@2
    73
#  define __reference__        _STLP_TYPENAME_ON_RETURN_TYPE  hashtable<_Val, _Key, _HF, _ExK, _EqK, _All>::reference
williamr@2
    74
#  define __iterator__         _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _ExK, _EqK, _All>::iterator
williamr@2
    75
# endif
williamr@2
    76
williamr@2
    77
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, 
williamr@2
    78
          class _All>
williamr@2
    79
_Hashtable_node<_Val>*
williamr@2
    80
_Hashtable_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>::_M_skip_to_next() {
williamr@2
    81
  size_t __bucket = _M_ht->_M_bkt_num(_M_cur->_M_val);
williamr@2
    82
  size_t __h_sz;
williamr@2
    83
  __h_sz = this->_M_ht->bucket_count();
williamr@2
    84
williamr@2
    85
  _Node* __i=0;
williamr@2
    86
  while (__i==0 && ++__bucket < __h_sz)
williamr@2
    87
    __i = (_Node*)_M_ht->_M_buckets[__bucket];
williamr@2
    88
  return __i;
williamr@2
    89
}
williamr@2
    90
williamr@2
    91
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, 
williamr@2
    92
          class _All>
williamr@2
    93
__size_type__
williamr@2
    94
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::_M_next_size(size_type __n) const    { 
williamr@2
    95
  const size_type* __first = (const size_type*)_Stl_prime_type::_M_list;
williamr@2
    96
  const size_type* __last =  (const size_type*)_Stl_prime_type::_M_list + (int)__stl_num_primes;
williamr@2
    97
  const size_type* pos = __lower_bound(__first, __last, __n, __less((size_type*)0), (ptrdiff_t*)0);
williamr@2
    98
  return (pos == __last ? *(__last - 1) : *pos);
williamr@2
    99
}
williamr@2
   100
williamr@2
   101
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   102
bool 
williamr@2
   103
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::_M_equal(
williamr@2
   104
						  const hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>& __ht1,
williamr@2
   105
						  const hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>& __ht2)
williamr@2
   106
{
williamr@2
   107
  //  typedef _Hashtable_node<_Val> _Node;
williamr@2
   108
  if (__ht1.bucket_count() != __ht2.bucket_count())
williamr@2
   109
    return false;
williamr@2
   110
  for (size_t __n = 0; __n < __ht1.bucket_count(); ++__n) {
williamr@2
   111
    const _Node* __cur1 = __ht1._M_get_bucket(__n);
williamr@2
   112
    const _Node* __cur2 = __ht2._M_get_bucket(__n);
williamr@2
   113
    for ( ; __cur1 && __cur2 && __cur1->_M_val == __cur2->_M_val;
williamr@2
   114
          __cur1 = __cur1->_M_next, __cur2 = __cur2->_M_next)
williamr@2
   115
      {}
williamr@2
   116
    if (__cur1 || __cur2)
williamr@2
   117
      return false;
williamr@2
   118
  }
williamr@2
   119
  return true;
williamr@2
   120
}  
williamr@2
   121
williamr@2
   122
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   123
pair< _Ht_iterator<_Val, _Nonconst_traits<_Val>, _Key, _HF, _ExK, _EqK, _All> , bool> 
williamr@2
   124
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
williamr@2
   125
  ::insert_unique_noresize(const value_type& __obj)
williamr@2
   126
{
williamr@2
   127
  const size_type __n = _M_bkt_num(__obj);
williamr@2
   128
  _Node* __first = (_Node*)_M_buckets[__n];
williamr@2
   129
williamr@2
   130
  for (_Node* __cur = __first; __cur; __cur = __cur->_M_next) 
williamr@2
   131
    if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj)))
williamr@2
   132
      return pair<iterator, bool>(iterator(__cur, this), false);
williamr@2
   133
williamr@2
   134
  _Node* __tmp = _M_new_node(__obj);
williamr@2
   135
  __tmp->_M_next = __first;
williamr@2
   136
  _M_buckets[__n] = __tmp;
williamr@2
   137
  ++_M_num_elements._M_data;
williamr@2
   138
  return pair<iterator, bool>(iterator(__tmp, this), true);
williamr@2
   139
}
williamr@2
   140
williamr@2
   141
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   142
__iterator__ 
williamr@2
   143
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
williamr@2
   144
  ::insert_equal_noresize(const value_type& __obj)
williamr@2
   145
{
williamr@2
   146
  const size_type __n = _M_bkt_num(__obj);
williamr@2
   147
  _Node* __first = (_Node*)_M_buckets[__n];
williamr@2
   148
williamr@2
   149
  for (_Node* __cur = __first; __cur; __cur = __cur->_M_next) 
williamr@2
   150
    if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))) {
williamr@2
   151
      _Node* __tmp = _M_new_node(__obj);
williamr@2
   152
      __tmp->_M_next = __cur->_M_next;
williamr@2
   153
      __cur->_M_next = __tmp;
williamr@2
   154
      ++_M_num_elements._M_data;
williamr@2
   155
      return iterator(__tmp, this);
williamr@2
   156
    }
williamr@2
   157
williamr@2
   158
  _Node* __tmp = _M_new_node(__obj);
williamr@2
   159
  __tmp->_M_next = __first;
williamr@2
   160
  _M_buckets[__n] = __tmp;
williamr@2
   161
  ++_M_num_elements._M_data;
williamr@2
   162
  return iterator(__tmp, this);
williamr@2
   163
}
williamr@2
   164
williamr@2
   165
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   166
__reference__ 
williamr@2
   167
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::_M_insert(const value_type& __obj)
williamr@2
   168
{
williamr@2
   169
  resize(_M_num_elements._M_data + 1);
williamr@2
   170
williamr@2
   171
  size_type __n = _M_bkt_num(__obj);
williamr@2
   172
  _Node* __first = (_Node*)_M_buckets[__n];
williamr@2
   173
williamr@2
   174
  _Node* __tmp = _M_new_node(__obj);
williamr@2
   175
  __tmp->_M_next = __first;
williamr@2
   176
  _M_buckets[__n] = __tmp;
williamr@2
   177
  ++_M_num_elements._M_data;
williamr@2
   178
  return __tmp->_M_val;
williamr@2
   179
}
williamr@2
   180
williamr@2
   181
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   182
__reference__ 
williamr@2
   183
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::find_or_insert(const value_type& __obj)
williamr@2
   184
{
williamr@2
   185
williamr@2
   186
  _Node* __first = _M_find(_M_get_key(__obj));
williamr@2
   187
  if (__first)
williamr@2
   188
    return __first->_M_val;
williamr@2
   189
  else
williamr@2
   190
    return _M_insert(__obj);
williamr@2
   191
}
williamr@2
   192
williamr@2
   193
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   194
pair< _Ht_iterator<_Val, _Nonconst_traits<_Val>, _Key, _HF, _ExK, _EqK, _All>,
williamr@2
   195
      _Ht_iterator<_Val, _Nonconst_traits<_Val>, _Key, _HF, _ExK, _EqK, _All> > 
williamr@2
   196
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::equal_range(const key_type& __key)
williamr@2
   197
{
williamr@2
   198
  typedef pair<iterator, iterator> _Pii;
williamr@2
   199
  const size_type __n = _M_bkt_num_key(__key);
williamr@2
   200
williamr@2
   201
  for (_Node* __first = (_Node*)_M_buckets[__n]; __first; __first = __first->_M_next)
williamr@2
   202
    if (_M_equals(_M_get_key(__first->_M_val), __key)) {
williamr@2
   203
      for (_Node* __cur = __first->_M_next; __cur; __cur = __cur->_M_next)
williamr@2
   204
        if (!_M_equals(_M_get_key(__cur->_M_val), __key))
williamr@2
   205
          return _Pii(iterator(__first, this), iterator(__cur, this));
williamr@2
   206
      for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
williamr@2
   207
        if (_M_buckets[__m])
williamr@2
   208
          return _Pii(iterator(__first, this),
williamr@2
   209
                     iterator((_Node*)_M_buckets[__m], this));
williamr@2
   210
      return _Pii(iterator(__first, this), end());
williamr@2
   211
    }
williamr@2
   212
  return _Pii(end(), end());
williamr@2
   213
}
williamr@2
   214
williamr@2
   215
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   216
pair< _Ht_iterator<_Val, _Const_traits<_Val>, _Key, _HF, _ExK, _EqK, _All>, 
williamr@2
   217
     _Ht_iterator<_Val, _Const_traits<_Val>, _Key, _HF, _ExK, _EqK, _All> > 
williamr@2
   218
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
williamr@2
   219
  ::equal_range(const key_type& __key) const
williamr@2
   220
{
williamr@2
   221
  typedef pair<const_iterator, const_iterator> _Pii;
williamr@2
   222
  const size_type __n = _M_bkt_num_key(__key);
williamr@2
   223
williamr@2
   224
  for (const _Node* __first = (_Node*)_M_buckets[__n] ;
williamr@2
   225
       __first; 
williamr@2
   226
       __first = __first->_M_next) {
williamr@2
   227
    if (_M_equals(_M_get_key(__first->_M_val), __key)) {
williamr@2
   228
      for (const _Node* __cur = __first->_M_next;
williamr@2
   229
           __cur;
williamr@2
   230
           __cur = __cur->_M_next)
williamr@2
   231
        if (!_M_equals(_M_get_key(__cur->_M_val), __key))
williamr@2
   232
          return _Pii(const_iterator(__first, this),
williamr@2
   233
                      const_iterator(__cur, this));
williamr@2
   234
      for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
williamr@2
   235
        if (_M_buckets[__m])
williamr@2
   236
          return _Pii(const_iterator(__first, this),
williamr@2
   237
                      const_iterator((_Node*)_M_buckets[__m], this));
williamr@2
   238
      return _Pii(const_iterator(__first, this), end());
williamr@2
   239
    }
williamr@2
   240
  }
williamr@2
   241
  return _Pii(end(), end());
williamr@2
   242
}
williamr@2
   243
williamr@2
   244
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   245
__size_type__ 
williamr@2
   246
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::erase(const key_type& __key)
williamr@2
   247
{
williamr@2
   248
  const size_type __n = _M_bkt_num_key(__key);
williamr@2
   249
  _Node* __first = (_Node*)_M_buckets[__n];
williamr@2
   250
  size_type __erased = 0;
williamr@2
   251
williamr@2
   252
  if (__first) {
williamr@2
   253
    _Node* __cur = __first;
williamr@2
   254
    _Node* __next = __cur->_M_next;
williamr@2
   255
    while (__next) {
williamr@2
   256
      if (_M_equals(_M_get_key(__next->_M_val), __key)) {
williamr@2
   257
        __cur->_M_next = __next->_M_next;
williamr@2
   258
        _M_delete_node(__next);
williamr@2
   259
        __next = __cur->_M_next;
williamr@2
   260
        ++__erased;
williamr@2
   261
        --_M_num_elements._M_data;
williamr@2
   262
      }
williamr@2
   263
      else {
williamr@2
   264
        __cur = __next;
williamr@2
   265
        __next = __cur->_M_next;
williamr@2
   266
      }
williamr@2
   267
    }
williamr@2
   268
    if (_M_equals(_M_get_key(__first->_M_val), __key)) {
williamr@2
   269
      _M_buckets[__n] = __first->_M_next;
williamr@2
   270
      _M_delete_node(__first);
williamr@2
   271
      ++__erased;
williamr@2
   272
      --_M_num_elements._M_data;
williamr@2
   273
    }
williamr@2
   274
  }
williamr@2
   275
  return __erased;
williamr@2
   276
}
williamr@2
   277
williamr@2
   278
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   279
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::erase(const const_iterator& __it)
williamr@2
   280
{
williamr@2
   281
  // const iterator& __it = __REINTERPRET_CAST(const iterator&,_c_it);
williamr@2
   282
  const _Node* __p = __it._M_cur;
williamr@2
   283
  if (__p) {
williamr@2
   284
    const size_type __n = _M_bkt_num(__p->_M_val);
williamr@2
   285
    _Node* __cur = (_Node*)_M_buckets[__n];
williamr@2
   286
williamr@2
   287
    if (__cur == __p) {
williamr@2
   288
      _M_buckets[__n] = __cur->_M_next;
williamr@2
   289
      _M_delete_node(__cur);
williamr@2
   290
      --_M_num_elements._M_data;
williamr@2
   291
    }
williamr@2
   292
    else {
williamr@2
   293
      _Node* __next = __cur->_M_next;
williamr@2
   294
      while (__next) {
williamr@2
   295
        if (__next == __p) {
williamr@2
   296
          __cur->_M_next = __next->_M_next;
williamr@2
   297
          _M_delete_node(__next);
williamr@2
   298
          --_M_num_elements._M_data;
williamr@2
   299
          break;
williamr@2
   300
        }
williamr@2
   301
        else {
williamr@2
   302
          __cur = __next;
williamr@2
   303
          __next = __cur->_M_next;
williamr@2
   304
        }
williamr@2
   305
      }
williamr@2
   306
    }
williamr@2
   307
  }
williamr@2
   308
}
williamr@2
   309
williamr@2
   310
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   311
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
williamr@2
   312
  ::erase(const_iterator _c_first, const_iterator _c_last)
williamr@2
   313
{
williamr@2
   314
  iterator& __first = (iterator&)_c_first;
williamr@2
   315
  iterator& __last = (iterator&)_c_last;
williamr@2
   316
  size_type __f_bucket = __first._M_cur ? 
williamr@2
   317
    _M_bkt_num(__first._M_cur->_M_val) : _M_buckets.size();
williamr@2
   318
  size_type __l_bucket = __last._M_cur ? 
williamr@2
   319
    _M_bkt_num(__last._M_cur->_M_val) : _M_buckets.size();
williamr@2
   320
  if (__first._M_cur == __last._M_cur)
williamr@2
   321
    return;
williamr@2
   322
  else if (__f_bucket == __l_bucket)
williamr@2
   323
    _M_erase_bucket(__f_bucket, __first._M_cur, __last._M_cur);
williamr@2
   324
  else {
williamr@2
   325
    _M_erase_bucket(__f_bucket, __first._M_cur, 0);
williamr@2
   326
    for (size_type __n = __f_bucket + 1; __n < __l_bucket; ++__n)
williamr@2
   327
      _M_erase_bucket(__n, 0);
williamr@2
   328
    if (__l_bucket != _M_buckets.size())
williamr@2
   329
      _M_erase_bucket(__l_bucket, __last._M_cur);
williamr@2
   330
  }
williamr@2
   331
}
williamr@2
   332
williamr@2
   333
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   334
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
williamr@2
   335
  ::resize(size_type __num_elements_hint)
williamr@2
   336
{
williamr@2
   337
  const size_type __old_n = _M_buckets.size();
williamr@2
   338
  if (__num_elements_hint > __old_n) {
williamr@2
   339
    const size_type __n = _M_next_size(__num_elements_hint);
williamr@2
   340
    if (__n > __old_n) {
williamr@2
   341
      _BucketVector __tmp(__n, (void*)(0),
williamr@2
   342
			  _M_buckets.get_allocator());
williamr@2
   343
      _STLP_PUSH_CLEANUP_ITEM(_BucketVector, &__tmp);
williamr@2
   344
      _STLP_TRY {
williamr@2
   345
        for (size_type __bucket = 0; __bucket < __old_n; ++__bucket) {
williamr@2
   346
          _Node* __first = (_Node*)_M_buckets[__bucket];
williamr@2
   347
          while (__first) {
williamr@2
   348
            size_type __new_bucket = _M_bkt_num(__first->_M_val, __n);
williamr@2
   349
            _M_buckets[__bucket] = __first->_M_next;
williamr@2
   350
            __first->_M_next = (_Node*)__tmp[__new_bucket];
williamr@2
   351
            __tmp[__new_bucket] = __first;
williamr@2
   352
            __first = (_Node*)_M_buckets[__bucket];          
williamr@2
   353
          }
williamr@2
   354
        }
williamr@2
   355
        _M_buckets.swap(__tmp);
williamr@2
   356
      }
williamr@2
   357
      _STLP_CATCH_ALL {
williamr@2
   358
        for (size_type __bucket = 0; __bucket < __tmp.size(); ++__bucket) {
williamr@2
   359
          while (__tmp[__bucket]) {
williamr@2
   360
            _Node* __next = ((_Node*)__tmp[__bucket])->_M_next;
williamr@2
   361
            _M_delete_node((_Node*)__tmp[__bucket]);
williamr@2
   362
            __tmp[__bucket] = __next;
williamr@2
   363
          }
williamr@2
   364
        }
williamr@2
   365
        _STLP_RETHROW;
williamr@2
   366
    }
williamr@2
   367
#ifdef _STLP_USE_TRAP_LEAVE
williamr@2
   368
      CleanupStack::Pop();
williamr@2
   369
#endif
williamr@2
   370
williamr@2
   371
    }
williamr@2
   372
  }
williamr@2
   373
}
williamr@2
   374
williamr@2
   375
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   376
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
williamr@2
   377
  ::_M_erase_bucket(const size_type __n, _Node* __first, _Node* __last)
williamr@2
   378
{
williamr@2
   379
  _Node* __cur = (_Node*)_M_buckets[__n];
williamr@2
   380
  if (__cur == __first)
williamr@2
   381
    _M_erase_bucket(__n, __last);
williamr@2
   382
  else {
williamr@2
   383
    _Node* __next;
williamr@2
   384
    for (__next = __cur->_M_next; 
williamr@2
   385
         __next != __first; 
williamr@2
   386
         __cur = __next, __next = __cur->_M_next)
williamr@2
   387
      ;
williamr@2
   388
    while (__next != __last) {
williamr@2
   389
      __cur->_M_next = __next->_M_next;
williamr@2
   390
      _M_delete_node(__next);
williamr@2
   391
      __next = __cur->_M_next;
williamr@2
   392
      --_M_num_elements._M_data;
williamr@2
   393
    }
williamr@2
   394
  }
williamr@2
   395
}
williamr@2
   396
williamr@2
   397
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   398
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
williamr@2
   399
  ::_M_erase_bucket(const size_type __n, _Node* __last)
williamr@2
   400
{
williamr@2
   401
  _Node* __cur = (_Node*)_M_buckets[__n];
williamr@2
   402
  while (__cur && __cur != __last) {
williamr@2
   403
    _Node* __next = __cur->_M_next;
williamr@2
   404
    _M_delete_node(__cur);
williamr@2
   405
    __cur = __next;
williamr@2
   406
    _M_buckets[__n] = __cur;
williamr@2
   407
    --_M_num_elements._M_data;
williamr@2
   408
  }
williamr@2
   409
}
williamr@2
   410
williamr@2
   411
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   412
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::clear()
williamr@2
   413
{
williamr@2
   414
  for (size_type __i = 0; __i < _M_buckets.size(); ++__i) {
williamr@2
   415
    _Node* __cur = (_Node*)_M_buckets[__i];
williamr@2
   416
    while (__cur != 0) {
williamr@2
   417
      _Node* __next = __cur->_M_next;
williamr@2
   418
      _M_delete_node(__cur);
williamr@2
   419
      __cur = __next;
williamr@2
   420
    }
williamr@2
   421
    _M_buckets[__i] = 0;
williamr@2
   422
  }
williamr@2
   423
  _M_num_elements._M_data = 0;
williamr@2
   424
}
williamr@2
   425
williamr@2
   426
    
williamr@2
   427
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
williamr@2
   428
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
williamr@2
   429
  ::_M_copy_from(const hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>& __ht)
williamr@2
   430
{
williamr@2
   431
  _M_buckets.clear();
williamr@2
   432
  _M_buckets.reserve(__ht._M_buckets.size());
williamr@2
   433
  _M_buckets.insert(_M_buckets.end(), __ht._M_buckets.size(), (void*) 0);
williamr@2
   434
  _STLP_TRY {
williamr@2
   435
    for (size_type __i = 0; __i < __ht._M_buckets.size(); ++__i) {
williamr@2
   436
      const _Node* __cur = (_Node*)__ht._M_buckets[__i];
williamr@2
   437
      if (__cur) {
williamr@2
   438
        _Node* __xcopy = _M_new_node(__cur->_M_val);
williamr@2
   439
        _M_buckets[__i] = __xcopy;
williamr@2
   440
williamr@2
   441
        for (_Node* __next = __cur->_M_next; 
williamr@2
   442
             __next; 
williamr@2
   443
             __cur = __next, __next = __cur->_M_next) {
williamr@2
   444
          __xcopy->_M_next = _M_new_node(__next->_M_val);
williamr@2
   445
          __xcopy = __xcopy->_M_next;
williamr@2
   446
        }
williamr@2
   447
      }
williamr@2
   448
    }
williamr@2
   449
    _M_num_elements._M_data = __ht._M_num_elements._M_data;
williamr@2
   450
  }
williamr@2
   451
  _STLP_UNWIND(clear());
williamr@2
   452
}
williamr@2
   453
williamr@2
   454
# undef __iterator__ 
williamr@2
   455
# undef const_iterator
williamr@2
   456
# undef __size_type__
williamr@2
   457
# undef __reference__
williamr@2
   458
# undef size_type       
williamr@2
   459
# undef value_type      
williamr@2
   460
# undef key_type        
williamr@2
   461
# undef _Node            
williamr@2
   462
# undef __stl_num_primes
williamr@2
   463
# undef hashtable
williamr@2
   464
williamr@2
   465
_STLP_END_NAMESPACE
williamr@2
   466
williamr@2
   467
#endif /*  _STLP_HASHTABLE_C */
williamr@2
   468
williamr@2
   469
// Local Variables:
williamr@2
   470
// mode:C++
williamr@2
   471
// End: