> > So far the best I've found is Data.Sequence.Seq, which in my tests > outperforms mutable vectors, but only for reads from the head or tail of the > sequence. Indexing into the middle of the sequence is relatively slow. >
Data.Sequence is implemented as a finger tree which is the culmination point of Ralf Hinzes talk on Number Systems and Data Structures [1]. Finger trees are versatile but also complicated. Maybe one of the simpler structures presented there (like random access lists) provides faster indexing. Sebastian [1]: http://www.cs.nott.ac.uk/~gmh/bctcs-slides/hinze.pdf
_______________________________________________ haskell-art mailing list [email protected] http://lists.lurk.org/mailman/listinfo/haskell-art
