[Haskell] ANN: random-access-list-0.1
deduktionstheorem at web.de
Wed Jun 11 18:35:48 EDT 2008
I've implemented Chris Okasaki's random-access list which provides
typical list operations (cons, head, tail) in O(1) and yet offers
indexed random-access in O(log n). It's uploaded on hackage.
It's still an early version which I'll extend, but especially at this
eary stage I'd appreciate your feedback concerning what's still missing
/ to be fixed / to be improved.
 Chris Okasaki: "Purely Functional Data Structures"
Früher hieß es ja: Ich denke, also bin ich.
Heute weiß man: Es geht auch so.
- Dieter Nuhr
More information about the Haskell