[Haskell-cafe] Re: Records vs HList

David Menendez zednenem at psualum.com
Wed Nov 23 20:50:00 EST 2005

Keean Schupke writes:

> HList can do O(log n) by the way, if the labels have order, you can
> implement a binary search tree of labels (Of course all the accessor
> functions would need to be rewritten).

The idea of writing a type-level balanced binary search tree fills me
with an uncertain mixture of excitement and dread. Particularly if you
want to be able to compare records for equality.
David Menendez <zednenem at psualum.com> | "In this house, we obey the laws
<http://www.eyrie.org/~zednenem>      |        of thermodynamics!"

More information about the Haskell-Cafe mailing list