diff options
| author | David Tolnay <dtolnay@gmail.com> | 2019-05-18 20:25:15 -0700 |
|---|---|---|
| committer | David Tolnay <dtolnay@gmail.com> | 2019-05-18 20:25:24 -0700 |
| commit | ea7aa76911b6b896d503a812b26bfd6227fa90d9 (patch) | |
| tree | a2ab35803e173441ffdc60ea22b94dcdb513ddcf /src/test/ui/thinlto | |
| parent | 963184bbb670c1ffa97fc28a98cd5e8473118859 (diff) | |
| download | rust-ea7aa76911b6b896d503a812b26bfd6227fa90d9.tar.gz rust-ea7aa76911b6b896d503a812b26bfd6227fa90d9.zip | |
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.
Diffstat (limited to 'src/test/ui/thinlto')
0 files changed, 0 insertions, 0 deletions