> [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.
If you want such a behavior, you should use a Binary Search Tree instead.

Nicolas Cannasse

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