i see that i was not clear what i meant with ordering, sorry for the confusion.
may be i should have referred to *comparable*: that’s how java abstracts the ordering of elements. (http://docs.oracle.com/javase/7/docs/api/java/lang/Comparable.html). the scala version of java’s comparable[t] is ordering[t]. that said, i think you’re reply is very valuable nonetheless. i especially like your reference to c++’s multiple inheritance mess, versus avail’s clean object model. so how would one compare (order) two tuples? only if we know how to compare every element pair wise. i.e. the result of sorting {<3,1,2>,<1,2>,<1,2,2>} would be {<1,2>,<1,2,2>,<3,1,2>} - and because we know how to order numbers, we thus know how to order tuples of numbers. cheers, - robbert
