That's what the Schwartzian Transform, GRT, or Orcish Maneuvre save you from; they only compute each key once.
George_Sherston's original solution also avoided recomputing keys unnecessarily, by storing them in ->{Sort} beforehand.
--
Mike
In reply to Re: Re: Complex Sort - using varying numbers of parameters
by RMGir
in thread Complex Sort - using varying numbers of parameters
by George_Sherston
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |