Version française
Home     About     Download     Resources     Contact us    
Browse thread
Re: [Caml-list] Data structure library
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Diego Olivier Fernandez Pons <Diego-Olivier.FERNANDEZ-PONS@c...>
Subject: Re: [Caml-list] Data structure library
    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