Hi,

I just found a nice way of writing lexicographic sort in O'Caml
using Luc Maranget's recent extension of pattern syntax, which
allows a single identifier to be bound in several alternatives.

For instance, here is code that sorts integer triples:

  let compare (major1, middle1, minor1) (major2, middle2, minor2) =
    match major1 - major2, middle1 - middle2, minor1 - minor2 with
    | 0, 0, d
    | 0, d, _
    | d, _, _ ->
	d

Quite beautiful. Perhaps this is obvious to many, but I thought
I'd post it.

-- 
François Pottier
Francois.Pottier@inria.fr
http://pauillac.inria.fr/~fpottier/
-------------------
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