>>>>> "AC" == Aaron Crane <[EMAIL PROTECTED]> writes:
AC> One option might be an 'rsort' function, but I think that's AC> somewhat lacking in the taste department. AC> Another might be as simple as AC> @unsorted ==> sort ==> reverse ==> @sorted; again, reverse order needs to be on a per key basis. the problem we are wrangling is how to support multiple keys in a clean syntactical way. AC> @unsorted ==> sort &rinfix:cmp ==> @sorted; AC> That is, rinfix: (or some other name) is like infix:, but gives you a AC> function that reverses its arguments before actually running the operator. AC> Perhaps it could even be implemented as a macro. again, confusing. why should the order of a binary operator mean so much? the order of a sort key is either ascending or descending. that is what coders want to specify. translating that to the correct operator (cmp or <=>) and the correct binary order is not the same as specifying the key sort order and key type (int, string, float). uri -- Uri Guttman ------ [EMAIL PROTECTED] -------- http://www.stemsystems.com --Perl Consulting, Stem Development, Systems Architecture, Design and Coding- Search or Offer Perl Jobs ---------------------------- http://jobs.perl.org
