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 VAA01964; Sat, 31 Aug 2002 21:51:59 +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 VAA02260 for ; Sat, 31 Aug 2002 21:51:58 +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 g7VJpuD07626 for ; Sat, 31 Aug 2002 21:51:57 +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 g7VJpujR053726 ; Sat, 31 Aug 2002 21:51:56 +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 VAA20536 ; Sat, 31 Aug 2002 21:50:17 +0200 Received: from localhost (fernande@localhost) by ibm1.cicrp.jussieu.fr (8.8.8/jtpda/mob-v8) with SMTP id VAA58528 ; Sat, 31 Aug 2002 21:50:16 +0200 Date: Sat, 31 Aug 2002 21:50:16 +0200 (DST) From: Diego Olivier Fernandez Pons To: Markus Mottl cc: caml-list@inria.fr Subject: Re: [Caml-list] Data structure library In-Reply-To: <20020831171405.GA11903@fichte.ai.univie.ac.at> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Antivirus: scanned by sophie at shiva.jussieu.fr Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk Markus > Due to the new release of OCaml-3.06 lazy values are treated differently > now. Fortunately, this only requires small changes, namely: > > Furthermore, in file "braunSeq" there is a warning about a non-exhaustive > pattern-matching: The only purpose of this release is to give some useful data structures to those who are participating in the ICFP 2002 programming contest : I just tared a copy of the working files. In fact, there are some source files that are not even in the Makefile There will be a better release soon For those who wonder what I thought could be useful : - heaps are very often used in graph algorithms (convex envelop) - priority search trees can be used for Disjkstra's shortest path algorith (see the paper from Ralf Hinze) 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