Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void remove(const key_type &key) {
- int index = bucketHash(key);
- for (int i = 0; i < sizes[index]; ++i){
- if (key == (*(buckets+index)+i)->val->first){
- if (i != 0){
- BucketNode *temp = (*(buckets+index)+i);
- BucketNode *prev = temp->prev;
- prev->next = temp->next;
- delete temp;
- }
- else {
- BucketNode *temp = (*(buckets+index)+i);
- (*(buckets+index)) = temp->next;
- (*(buckets+index))->prev = nullptr;
- delete temp;
- }
- --sizes[index];
- }
- }
- throw std::out_of_range("");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement