HashMap - nextEntry when removing an entry

[Helaas]

Hello,

I've so far only read the code, and never tried using it, so I'm just making an assumption.

I've noticed that in the remove function, the entry is set to *Null, but the the nextEntry of the previous element isn't updated with the nextEntry of the entry currently removed.

Doesn't this make all the entries after the entry currently deleted inaccessible? I would imagine this would lead to memory leaks because the dispose function loops until "entry@ = *null".

Regards

[lppedd]

@Helaas which data-structure are you referring to?

[Helaas]

if (entryPtr = bucket.entryPtr); bucket.entryPtr = *null; endif;

bucket.entryPtr is set to *NULL

But what happens to the other entries in that bucket?
I think these can't be accesed anymore because entries are always searched using entry.nextEntry.

Example
Bucket 1: E1 -> E2 -> E3 -> *Null
Lets remove E2

Bucket 1: E1 -> *Null
Now no entry has the pointer to E3.

Or am I looking at this the wrong way?

[lppedd]

@Helaas apparently you're right. I need to remember if the entryPtr = entry.nextEntryPtr; does it in some way. As of now I haven't access to an IBMi machine so I can't test it out.