News for hackers. Stuff that matters.
Re:Diving into the world of hash tables by freyr on Monday June 26, 2017 @12:49AM (#14634171)
They're not really the same thing then. In OJFord's implementation, there's a one-to-one correspondence between states: the element is a member of the set iff it exists as a key in the hash table.

In the true/false implementation, two distinct hash table states (false or key not set) map to one set state (not a member). The program must check whether the key is set, and then check its value.

There are no comments on this comment yet.