ANN: Edison 1.2RC4

Jim Apple jbapple+haskell-lib at
Thu Jun 1 23:57:47 EDT 2006

> I am pleased to announce the 4th (and with any luck, final) release candidate
> for Edison 1.2.  Edison is a library of efficient data structures for
> Haskell.

Based on Exercise 10.2 of Okasaki's book

"Reimplement AltBinaryRandomAccessList so that cons, head, and tail
all run in O(1) amortized time, using the type

data RList a =
  | One a (RList (a,a))
  | Two a a (RList (a,a))
  | Three a a a (RList (a,a))"

and the source for BinaryRandList at
, I don't think the constant time bounds in the documentation are
correct for this sequence type.


More information about the Libraries mailing list