Version française
Home     About     Download     Resources     Contact us    
Browse thread
[oliver: Re: [Caml-list] Should be INSIDE STANDARD-LIB: Hashtbl.keys]
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Martin Jambon <martin_jambon@e...>
Subject: Re: [oliver: Re: [Caml-list] Should be INSIDE STANDARD-LIB: Hashtbl.keys]
On Fri, 23 Apr 2004, Oliver Bandel wrote:

> When you want to report each key only once, you need a temporarily
> hash to sort out multiple stuff. This, because the fold-function
> reports EACH binding (and it good that it does it), and therefore
> multiple bindings to a key will occur more than once.
> The function has to sort them out.
>
> I'm shure it's more efficient to implement that inside the
> hashtbl-module. (I've not looked into the sources, but suppose
> that it will be more performant, when a Hashtbl.keys will
> be implemented inside the Hashtbl-module.)

Please, tell me why you don't like my solution:
  http://caml.inria.fr/archives/200404/msg00527.html

Best regards,

Martin

-------------------
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