Hi

Has anyone implemented a doubly-linked list with O(1) push_back, push_front, 
back, front, length operations?

Thanks
Oleg

P.S. BTW, one could have identical interfaces for a) resizable arrays, b) 
doubly-linked lists and c) deques, the only difference being the efficiency 
of various operations. It could be convenient for a programmer, because final 
data representation can be chosen after the program has been profiled and 
without changing much code. Has anyone tackled this problem?
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners