[m-dev.] efficiency of mercury lists ?

[Michael Day]

> If you check out the rather excellent "Purely Functional Data
> Structures" by Chris Okasaki you'll find an implementation of
> binary random-access lists for which the cons, head, tail,
> lookup and update operations run in O(log n) worst case space.

Wow good tip, seems he's written a nice square matrix type too :)

Michael

--------------------------------------------------------------------------
mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au
--------------------------------------------------------------------------