| 59 | entries[bucket] = n; |
| 60 | } |
| 61 | void remove(unsigned int hash, Value value) |
| 62 | { |
| 63 | unsigned int bucket = hash & bucketMask; |
| 64 | Node *curr = entries[bucket], *prev = NULL; |
| 65 | while(curr) |
| 66 | { |
| 67 | if(curr->hash == hash && curr->value == value) |
| 68 | break; |
| 69 | prev = curr; |
| 70 | curr = curr->next; |
| 71 | } |
| 72 | assert(curr); |
| 73 | if(prev) |
| 74 | prev->next = curr->next; |
| 75 | else |
| 76 | entries[bucket] = curr->next; |
| 77 | } |
| 78 | |
| 79 | Value* find(unsigned int hash) |
| 80 | { |
no test coverage detected