Re:Itsy Bitsy Data Structures – Simplified examples of many ...
by ksk on Friday August 26, 2016 @07:09PM
(#12369952)
>He's just saying that the hash table is pretty useless if two random keys could access the same memory.
That is already mentioned in the document itself. Also mentioned is that a proper implementation would have to deal with collisions.
As to it being useless.. the value of content is in its explanation of simple concepts, not in some imagined production-quality requirement that people want to assume it must have.
Re:Itsy Bitsy Data Structures – Simplified examples of many ...
by coldtea on Friday August 26, 2016 @08:03PM
(#12370157)
>As to it being useless.. the value of content is in its explanation of simple concepts, not in some imagined production-quality requirement that people want to assume it must have.
The value of an explanation of simple concepts is in their simple AND adequate explanation.
You can cut the implementation details, but can't cut essential properties to simplify, because then you're not explaining the original concept at all.
He's just saying that the hash table is pretty useless if two random keys could access the same memory.