about summary refs log tree commit diff
path: root/src/test/run-pass/thinlto
diff options
context:
space:
mode:
authorStjepan Glavina <stjepang@gmail.com>2016-12-06 12:05:16 +0100
committerStjepan Glavina <stjepang@gmail.com>2016-12-07 21:35:07 +0100
commitc8d73ea68a9fbd127d7b78b4c167f0b80523ab7b (patch)
tree15bb048476a909f016cf39ed24da9385628f1e8d /src/test/run-pass/thinlto
parentff261d3a6b5964e1e3744d055238de624afc5d76 (diff)
downloadrust-c8d73ea68a9fbd127d7b78b4c167f0b80523ab7b.tar.gz
rust-c8d73ea68a9fbd127d7b78b4c167f0b80523ab7b.zip
Implement a faster sort algorithm
This is a complete rewrite of the standard sort algorithm. The new algorithm
is a simplified variant of TimSort. In summary, the changes are:

* Improved performance, especially on partially sorted inputs.
* Performs less comparisons on both random and partially sorted inputs.
* Decreased the size of temporary memory: the new sort allocates 4x less.
Diffstat (limited to 'src/test/run-pass/thinlto')
0 files changed, 0 insertions, 0 deletions