Version française
Home     About     Download     Resources     Contact us    
Browse thread
implementation of set (standard library)
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Alexey Nogin <nogin@c...>
Subject: Re: implementation of set (standard library)
Hi,

Markus Mottl wrote:

> I have taken a look at the implementation of sets in the standard library
> and thought that the "add" function could be implemented differently
> (possibly faster).

Our group wrote several implementation of sets - based on splay trees,
red-black trees, etc. Implementation based on the splay trees turned out to
be much faster than the OCAML Set module when the "mem" operation is more
frequent than add/union/remove/inter/diff operations. But on our usage
pattern it turned out that red-black trees are much faster than both Set and
SplaySet. If somebody is interested, I can put the code on ftp.

Alexey
--------------------------------------------------------------
Home Page: http://www.cs.cornell.edu/nogin/
E-Mail: nogin@cs.cornell.edu (office), ayn2@cornell.edu (home)
Office: Upson 4139, tel: 1-607-255-4934
ICQ #: 24708107 (office), 24678341 (home)