1 Jun
2006
1 Jun
'06
11:57 p.m.
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 Roughly: "Reimplement AltBinaryRandomAccessList so that cons, head, and tail all run in O(1) amortized time, using the type data RList a = Nil | One a (RList (a,a)) | Two a a (RList (a,a)) | Three a a a (RList (a,a))" and the source for BinaryRandList at http://www.eecs.tufts.edu/~rdocki01/edison/_darcs/current/edison-core/src/Da... , I don't think the constant time bounds in the documentation are correct for this sequence type. Jim