> The reason open addressing is considered open is that it frees us from the hash table. The table entries themselves are not stored directly in the bins anymore, as with a closed addressing hash table, but rather in a separate entries array, ordered by insertion.

> Open addressing uses the bins array to map keys to their index in the entries array.

Am I wrong or is this generally not true? Open addressing is about storing the entries directly in the bins [1].

The new implementation is still open addressing, sure, but the bins contain an index to a separate entries array, presumably to keep the size of the bins array compact.

[1] https://en.wikipedia.org/wiki/Hash_table#Open_addressing