6

Fucking hashtables...I forgot that removals can screw with the probing sequence, causing later lookups to "randomly" fail after hundreds of operations and elements.

Spent 4 hours staring at 3 while loops and data sets of hundreds of key value pairs trying to figure out why one giant data set worked fine but the other failed on some lookups.

Comments
  • 0
    Randomly fail? I’d consider that a broken implementation.

    A good hash table should not fail lookups.

    They might get less efficient if you modify them a lot or need to rebuild the hash table to avoid to sparse buckets but not fail to find.
  • 1
    Yes i was implementing it, very much broken. The behavior appeared random which is why I put it in quotes
Add Comment