splay trees 0.4 released

From: Jean-Francois Monin (JeanFrancois.Monin@cnet.francetelecom.fr)
Date: Tue Apr 06 1999 - 10:13:32 MET DST

Date: Tue, 6 Apr 1999 10:13:32 +0200
Message-Id: <199904060813.KAA14075@lsun565.lannion.cnet.fr>
From: Jean-Francois Monin <JeanFrancois.Monin@cnet.francetelecom.fr>
To: caml-list@inria.fr
Subject: splay trees 0.4 released

It is may pleasure to announce a new release (0.4) of splay trees in

You can you use it as a mutable association table like hashtbl with a
richer interface, related to the order of keys (especially sub, filter,
map, from, floor, ceil, prev, next). The price to pay is less good
performances than hashtbl (1.5 to 1.9 times slower on my bench marks).

BTW the use of splay trees in otags is now simpler and Otags has been
updated (release 0.8).


The interface of splay now follows the same conventions (order of
arguments) as for other mutable data structures like arrays and hash

Introduction of splaytbl with the same functional behavior as hashtbl
several items can be associated to a single key); splayInterv.ml no
longer useful

fold replaced by fold_right
elements replaced by to_list
Added fold_left, to_stream, filter, map, copy,
      sub, from, floor, ceil, prev, next.


Jean-Francois Monin, CNET DTL/MSV,          Tel +33 2 96 05 26 79
2 av. Pierre Marzin, 22307 Lannion, France  Fax +33 2 96 05 39 45
SANS TRAIT D'UNION :     JeanFrancois.Monin@cnet.francetelecom.fr

This archive was generated by hypermail 2b29 : Sun Jan 02 2000 - 11:58:21 MET