user0/rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

BTreeSet: remove duplicated code by reusing from_sorted_iter

Browse source 
The method `BTreeSet::from_sorted_iter` was introduced in 49ccb7519f,
but it was not consistently used throughout the codebase. As a result, some code redundantly reimplemented its logic.
This commit fixes the problem.
This commit is contained in:
Cheng Xu 2025-06-27 11:01:59 -07:00
parent 13c46fd0b0
commit cd1713ebba
No known key found for this signature in database
GPG key ID: 8794B5D7A3C67F70
1 changed files with 1 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

4
library/alloc/src/collections/btree/set.rs
View file

@ -1517,9 +1517,7 @@ impl<T: Ord, const N: usize> From<[T; N]> for BTreeSet<T> {
// use stable sort to preserve the insertion order.
arr.sort();
let iter = IntoIterator::into_iter(arr).map(|k| (k, SetValZST::default()));
let map = BTreeMap::bulk_build_from_sorted_iter(iter, Global);
BTreeSet { map }
BTreeSet::from_sorted_iter(IntoIterator::into_iter(arr), Global)
}
}