Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] Weak Hash table
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Remi VANICAT <vanicat@l...>
Subject: [Caml-list] Weak Hash table
Hello,

I've just done a weak hash table that is a map (differently to the
weak hash table one can found in the ocaml cvs, which is a set). 

it can be found there :
http://aspellfr.free.fr/

There is some documentation and the semantic is as follow : find will
return you something for a key that has been previously add only if
both the key and the data are still alive. If either the key or the
data have been freed, then find won't find it.

The main problem is that multi add of binding from the same key will
hide the new binding or the old one, depending of garbage
collection...  

-- 
Rémi Vanicat
vanicat@labri.u-bordeaux.fr
http://dept-info.labri.u-bordeaux.fr/~vanicat
-------------------
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