[concurrency-interest] Persistent data structures

Florian Weimer fweimer at bfk.de
Tue Oct 4 04:46:17 EDT 2011

I'm not sure if this is the right place to ask, but anyway: I'm looking
for reasonably efficient implementations of persistent data structures,
mainly maps and list (with fast index-based access and addition at the
end).  Is there a canonical library I should choose?

Florian Weimer                <fweimer at bfk.de>
BFK edv-consulting GmbH       http://www.bfk.de/
Kriegsstraße 100              tel: +49-721-96201-1
D-76133 Karlsruhe             fax: +49-721-96201-99

More information about the Concurrency-interest mailing list