diff options
| author | Alex Crichton <alex@alexcrichton.com> | 2018-01-25 12:48:56 -0600 |
|---|---|---|
| committer | Alex Crichton <alex@alexcrichton.com> | 2018-01-25 13:49:48 -0800 |
| commit | 014931be8ef8cc6940e69dc3e9dc56febb6cd784 (patch) | |
| tree | 9eb8eb0a31c190164e4b8384b649cc5b76a6a6a3 /src/test/ui/thinlto | |
| parent | 8dd36af9cb183200cd96eb87885dfcfa132f4c51 (diff) | |
| parent | c6772b4dcb95137e88d5cd1814ce0051f74a3c29 (diff) | |
| download | rust-014931be8ef8cc6940e69dc3e9dc56febb6cd784.tar.gz rust-014931be8ef8cc6940e69dc3e9dc56febb6cd784.zip | |
Rollup merge of #47656 - ishitatsuyuki:patch-1, r=nikomatsakis
[perf] Use std based dedup in projection Unstable sort was added recently, and the code that is being modified is 3 years old. As quicksort doesn't allocate it will likely perform as well as, or better than linear search. I didn't benchmark. Have a perf run.
Diffstat (limited to 'src/test/ui/thinlto')
0 files changed, 0 insertions, 0 deletions