diff options
| author | bors <bors@rust-lang.org> | 2022-06-09 10:17:04 +0000 |
|---|---|---|
| committer | bors <bors@rust-lang.org> | 2022-06-09 10:17:04 +0000 |
| commit | be16c6166f08f9b26d854783bbd4ce8d006c8f6f (patch) | |
| tree | c63f2fba20a31ef9099a82321137d694fa870b84 /compiler/rustc_parse/src/parser/mod.rs | |
| parent | 6dc598a01b8f7619826b7152be5162e6d37a1754 (diff) | |
| parent | 49ccb7519f55bd117d2ab50b7a030637f380aec6 (diff) | |
| download | rust-be16c6166f08f9b26d854783bbd4ce8d006c8f6f.tar.gz rust-be16c6166f08f9b26d854783bbd4ce8d006c8f6f.zip | |
Auto merge of #97868 - ssomers:btree_from_sorted_iter, r=the8472
BTreeSet: avoid intermediate sorting when collecting sorted iterators As [pointed out by droundy](https://users.rust-lang.org/t/question-about-btreeset-implementation/76427), an obvious optimization is to skip the first step introduced by #88448 (creation of a vector and sorting) and it's easy to do so for btree's own iterators. Also, exploit `from` in the examples.
Diffstat (limited to 'compiler/rustc_parse/src/parser/mod.rs')
0 files changed, 0 insertions, 0 deletions