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
[oliver: Re: [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: 2004-04-24 (09:20)
From: oliver@f...
Subject: [oliver: Re: [oliver: Re: [Caml-list] Should be INSIDE STANDARD-LIB: Hashtbl.keys]]
----- Forwarded message from oliver -----

To: Martin Jambon <>
Subject: Re: [oliver: Re: [Caml-list] Should be INSIDE STANDARD-LIB: Hashtbl.keys]

On Sat, Apr 24, 2004 at 03:30:53PM +0800, Martin Jambon wrote:
> 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:

I have not read it until now.

But will have a look at it immediately.


----- End forwarded message -----

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: