The "Schwartzian Transform" is far less important that it used to be due to recent sorting performance improvements.This sounds interesting. What improvements, and to what part of sorting?
Does that mean that splitting or concatenating in sort is optimized away after the first time? And is this specific to the sort function, or does it apply elsewhere (eg, a sorting fuction you pass to a GUI toolkit's list widget)?
In reply to Re^2: Custom sort with string of numbers
by Anonymous Monk
in thread Custom sort with string of numbers
by linuxfan
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |