News for hackers. Stuff that matters.
Re:Treaps: A Simple Balanced Binary Tree by Peaker on Sunday September 11, 2011 @05:21PM (#2984882)
I think that Haskell's standard library implementation of a binary search tree (Data.Map) had long had a balancing bug...

It probably doesn't anymore, but I guess it probably makes it a practical win to get type-level guarantees.

Also, guarantees about correctness are easier to get from tools like QuickCheck. Balance errors will be harder to spot.

There are no comments on this comment yet.