Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Specialized dictionaries
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2001-11-05 (17:55)
From: Sven <luther@d...>
Subject: Re: [Caml-list] Specialized dictionaries
On Mon, Nov 05, 2001 at 06:36:54PM +0100, Florian Hars wrote:
> On Mon, Nov 05, 2001 at 11:32:51AM +0100, Jean-Christophe Filliatre wrote:
> > Marcin 'Qrczak' Kowalczyk writes:
> >  > I need dictionaries indexed by ints which must be very fast.
> > 
> > To be  even more efficient, I'm  afraid you have to  follow your idea,
> > that is to inline this hash function in your own copy of
> Wouldn't the Patricia Trees (from the 
> "the-name-of-the-author-currently-escapes-me"-department :-)) mentioned on 
> be useful in this case (unless 
> the problem needs the in-place update available with Hashtbl)? 
> The documentation claims that "The
>     performances are always better than the standard library's module
>     [Set], except for linear insertion (building a set by insertion of
>     consecutive integers)."

The standard library [Set] is a functional B tree, if i am not wrong, it is
quite fast, but depending on the apps, it will not be faster than the
hashtable, that's why we have the hashables.

Sven Luther
Bug reports:  FAQ:
To unsubscribe, mail  Archives: