[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Brian Rogoff <bpr@b...> |
| Subject: | Re: [Caml-list] Weak hash table |
On Thu, 14 Mar 2002, Damien Doligez wrote: > >From: Remi VANICAT <vanicat@labri.u-bordeaux.fr> > > > >I've look at it, and it seem it's an implementation of a set, not of a > >map. > > It's a hashed set and not a hashed map, because a hashed set is what I > needed to implement hash-consing for my toy BDD package. Will we see your toy implementation in the OCaml distribution? I think such a thing, and/or a binding to one of the better C BDD libraries, would make a useful addition. -- Brian ------------------- 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