diff options
| author | Matthias Krüger <476013+matthiaskrgr@users.noreply.github.com> | 2025-06-28 22:05:33 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2025-06-28 22:05:33 +0200 |
| commit | dc08a0add877af617a6abc00bfbabfdc378f601a (patch) | |
| tree | 8daf2fd2390cd4f0e20653805196a886d674432b | |
| parent | 7103bbb86a6233d53a777f2348a8dbbdea58bc58 (diff) | |
| parent | cd1713ebba83a87e80a7366fdfe6fc28cabe6053 (diff) | |
| download | rust-dc08a0add877af617a6abc00bfbabfdc378f601a.tar.gz rust-dc08a0add877af617a6abc00bfbabfdc378f601a.zip | |
Rollup merge of #143111 - xu-cheng:btreeset_from_iter, r=Mark-Simulacrum
BTreeSet: remove duplicated code by reusing `from_sorted_iter` The method `BTreeSet::from_sorted_iter` was introduced in 49ccb7519f55bd117d2ab50b7a030637f380aec6, but it was not consistently used throughout the codebase. As a result, some code redundantly reimplemented its logic. This commit fixes the problem.
| -rw-r--r-- | library/alloc/src/collections/btree/set.rs | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/library/alloc/src/collections/btree/set.rs b/library/alloc/src/collections/btree/set.rs index aa9e5fce1d4..d50ce02bda7 100644 --- a/library/alloc/src/collections/btree/set.rs +++ b/library/alloc/src/collections/btree/set.rs @@ -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) } } |