diff options
| author | Mazdak Farrokhzad <twingoow@gmail.com> | 2019-05-20 23:03:06 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2019-05-20 23:03:06 +0200 |
| commit | 864e7a9251057ba31e4f316d459ad6a1dc48baab (patch) | |
| tree | 7cf78c3370f78e5c8d4ecc7f8256d8ee02b7e4c6 /src/test/ui/thinlto | |
| parent | 65cec43ce10ce0ca33fcd34014bdb0812ddea02f (diff) | |
| parent | ea7aa76911b6b896d503a812b26bfd6227fa90d9 (diff) | |
| download | rust-864e7a9251057ba31e4f316d459ad6a1dc48baab.tar.gz rust-864e7a9251057ba31e4f316d459ad6a1dc48baab.zip | |
Rollup merge of #60952 - dtolnay:heap, r=Amanieu
Document BinaryHeap time complexity I went into some detail on the time complexity of `push` because it is relevant for using BinaryHeap efficiently -- specifically that you should avoid pushing many elements in ascending order when possible. r? @Amanieu Closes #47976. Closes #59698.
Diffstat (limited to 'src/test/ui/thinlto')
0 files changed, 0 insertions, 0 deletions