> > > 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_).
> 

Hash table elements are _absolutely_ not sorted. It is the property of algorithm.

Sorry for poor english
-------------------
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