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
Labelling trees
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2007-06-08 (09:52)
From: Till Varoquaux <till.varoquaux@g...>
Subject: Re: [Caml-list] Labelling trees
On 6/8/07, skaller <> wrote:
> On Thu, 2007-06-07 at 16:26 +0200, Till Varoquaux wrote:

> True, but the hash required would be unstable.
> Hashing or comparing using the value of a term as a key
> is no good. It's too slow.

Hashing doesn't read the whole structure, it can be parametrized to
read less data. Do you really see a performance boost using addresses