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 PAA07547; Tue, 6 May 2003 15:29:50 +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 PAA07843 for ; Tue, 6 May 2003 15:29:49 +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 h46DTmH07708 for ; Tue, 6 May 2003 15:29:48 +0200 (MET DST) Received: from ibm3.cicrp.jussieu.fr (ibm3.cicrp.jussieu.fr [134.157.15.3]) by shiva.jussieu.fr (8.12.9/jtpda-5.4) with ESMTP id h46DTdru037522 ; Tue, 6 May 2003 15:29:40 +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 PAA14234 ; Tue, 6 May 2003 15:28:47 +0200 Received: from localhost (fernande@localhost) by ibm1.cicrp.jussieu.fr (8.8.8/jtpda/mob-v8) with ESMTP id PAA3629226 ; Tue, 6 May 2003 15:28:47 +0200 Date: Tue, 6 May 2003 15:28:46 +0200 (DST) From: Diego Olivier Fernandez Pons To: erayo@cs.bilkent.edu.tr cc: Caml List Subject: Re: [Caml-list] Two types of efficiency (Was Efficiency of 'a list) In-Reply-To: <200305052105.43350.exa@kablonet.com.tr> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Antivirus: scanned by sophie at shiva.jussieu.fr X-Spam: no; 0.00; pons:01 cicrp:01 caml-list:01 eray:01 ozkural:01 ahem:01 okasaki:01 leda:01 unreleased:01 hash:01 'standard:01 chris:01 fernandez:01 caml:01 writting:01 Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk Bonjour, On Mon, 5 May 2003, Eray Ozkural wrote: > But it's almost certain that I will not write any functional > structure library, ahem :P That's more like optimizing for an > ensemble of data structures instead of 1 and I think it requires an > expertise of its own. Moreover, I don't want to be labeled "failed" > :) I did not meant to be rude and Chris Okasaki has made a very good job promoting purely functional data structures and some important theoretical work too. In 1997 Roberto Tamassia and Luca Vismara wrote an article comparing the design of GeomLib (the geometric package of JDSL) with the STL, LEDA and CGAL, considering the following points : - ease of use - efficiency - flexibility - reliability - extensibility - reusability - modularity - functionality - correctness checking The only problem is that 6 years after that seminal paper, Geomlib is still unreleased. Okasaki made the same kind of mistake, writting the paper before the library was ended ('Edison is still mostly a framework. That is, I provide signatures, but not yet very many implementations. I indend to populate this framework over the time, adding a new module every few weeks'). > What I have in mind is tight imperative code like: > AVL Trees > B+ Trees > Disjoint Sets > Some dynamic hash code > PQ: Binary Heaps, etc. (I already did binary heap) > k-d trees (I'm not sure if I wanna go into comp. geometry though ;) ) Structure monster should notice that : (a) there are already many data structures (purely functional or imperative) available in Caml. Structure monster should check the Caml Hump (data structures section) or some pages I wrote on the subject (http://www.edite-de-paris.com.fr/~fernandz/Caml/index_en.html). (b) there are already several projects of 'standard libraries', including the official standard library for Caml. Structure monster should not begin one more of this projects but join (or use the same interface, design, naming conventions, ...) one of these. 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