On Monday 12 August 2002 05:51 am, Nicolas Cannasse wrote:
> > [1] One could of course copy elements to a list or an array, then sort
> > and iterate the latter, but I suppose it is inefficient, as hash table
>
> elements
>
> > are "almost sorted".
>
> In general, Hashtbl are not "almost sorted", as one cannot garantee that
> key(x) < key(y) => x < y.

I meant sorting by key (or iterating Hashtbl in the order of increasing 
_keys_).

> If you want such a behavior, you should use a Binary Search Tree instead.

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