treeowl
commented
8 years ago - The hedge algorithms turn out to be slower in most benchmarks than the far simpler divide-and-conquer algorithms. Bleloch et al recently proved divide-and-conquer asymptotically optimal. Use divide-and-conquer instead, and optimize with pointer equality tests (where applicable) and size tests (for differences).
- Some functions were much lazier than they had any business being, suspending trivial work instead of doing it. Strictify.
- Add total functions for obtaining min and max.