Please carefully read the latter half of my response to BrowserUK's example to see its correspondence to ST.
You mean the bit that doesn't use +* and claim it is an ST. THERE IS NO POINT!
My example was never a challenge to what P6 sort was capable of, I've written my own key-caching front end to the Crt qsort on more than one occasion. It's not hard.
It was a challenge to your patently absurd claim. And the damage such claims can have.
In reply to Re^8: sort +*, @array
by BrowserUk
in thread sort +*, @array
by raiph
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |