From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from majordomo@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id NAA22102; Tue, 13 Aug 2002 13:03:57 +0200 (MET DST) X-Authentication-Warning: pauillac.inria.fr: majordomo set sender to owner-caml-list@pauillac.inria.fr using -f Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id NAA22095 for ; Tue, 13 Aug 2002 13:03:55 +0200 (MET DST) Received: from shiva.jussieu.fr (shiva.jussieu.fr [134.157.0.129]) by concorde.inria.fr (8.11.1/8.11.1) with ESMTP id g7DB3tL12609 for ; Tue, 13 Aug 2002 13:03:55 +0200 (MET DST) Received: from ibm3.cicrp.jussieu.fr (ibm3.cicrp.jussieu.fr [134.157.15.3]) by shiva.jussieu.fr (8.12.5/jtpda-5.4) with ESMTP id g7DB3sjR084199 ; Tue, 13 Aug 2002 13:03:54 +0200 (CEST) Received: from ibm1.cicrp.jussieu.fr (ibm1.cicrp.jussieu.fr [134.157.15.1]) by ibm3.cicrp.jussieu.fr (8.8.8/jtpda/mob-V8) with ESMTP id NAA26980 ; Tue, 13 Aug 2002 13:02:05 +0200 Received: from localhost (fernande@localhost) by ibm1.cicrp.jussieu.fr (8.8.8/jtpda/mob-v8) with SMTP id NAA30350 ; Tue, 13 Aug 2002 13:00:52 +0200 Date: Tue, 13 Aug 2002 13:00:51 +0200 (DST) From: Diego Olivier Fernandez Pons To: Oleg cc: caml-list@inria.fr Subject: Re: [Caml-list] Doubly-linked list In-Reply-To: <200208130759.DAA26086@dewberry.cc.columbia.edu> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=iso-8859-1 Content-Transfer-Encoding: QUOTED-PRINTABLE X-Antivirus: scanned by sophie at shiva.jussieu.fr Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk Oleg a =E9crit : > P.S. BTW, one could have identical interfaces for a) resizable arrays, b)= =20 > doubly-linked lists and c) deques, the only difference being the efficien= cy=20 > of various operations. It could be convenient for a programmer, because f= inal=20 > data representation can be chosen after the program has been profiled and= =20 > without changing much code. Has anyone tackled this problem? I will be soon releasing a data structure library (september) which includes a port of EDiSon (GHC/hslibs/data/Edison in the GHC CVS), all data structures that were in Okasaki's purely functional data structures book and some more (weight balanced trees, cartesian trees, priority search queues, ...) It uses an uniform data representation for the programmer to chose after the program has been profiled and without changing much code. Diego Olivier ------------------- 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