661 |
int count = capacity; |
int count = capacity; |
662 |
while(count > 0) |
while(count > 0) |
663 |
{ |
{ |
664 |
if(table[hash].key == null || table[hash].key == removed) |
if( table[hash].key == null ) break; // reached end of table |
665 |
|
if(table[hash].key != removed) |
666 |
{ |
{ |
667 |
break; |
if(KeyEquals(table[hash].key, key)) |
668 |
} |
{ |
669 |
else if(KeyEquals(table[hash].key, key)) |
table[hash].key = removed; |
670 |
{ |
table[hash].value = null; |
671 |
table[hash].key = removed; |
--num; |
672 |
table[hash].value = null; |
++generation; |
673 |
--num; |
break; |
674 |
++generation; |
} |
|
break; |
|
675 |
} |
} |
676 |
hash = (hash + 1) % capacity; |
hash = (hash + 1) % capacity; |
677 |
--count; |
--count; |