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
Re: [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: Re: [Caml-list] Weak hash table
Damien Doligez <> writes:

> >From: Christophe Raffalli <>
> >did anyone implemented weak hash table using weak pointers in OCaml ?
> My implementation is in the stdlib Weak of the CVS version of OCaml.
> It will be part of the next release, so I'm interested in bug reports
> and feature requests.

I've look at it, and it seem it's an implementation of a set, not of a
map. So if one want a map, he have to use a weak hashtable of
couple. But if he want the couple to be alive when ever say its first
element is alive, one have to make the couple accessible from the
first element. So to say the least, it's difficult to use it like

By the way, I'm not sure to think of a good solution for this.

Rémi Vanicat
To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: