bors be16c6166f 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.

2022-06-09 10:17:04 +00:00

..

benches

Avoid use of rand::thread_rng in stdlib benchmarks

2022-05-02 00:08:21 -07:00

src

BTreeSet: avoid intermediate sorting when collecting sorted iterators

2022-06-08 12:42:31 +02:00

tests

Stabilize const_intrinsic_copy

2022-06-08 20:17:28 +09:00

Cargo.toml

Switch all libraries to the 2021 edition

2021-12-23 19:03:47 +08:00