squiid/rust
1
0
Fork 0
Code Issues Pull requests Projects Activity

Rollup merge of #87090 - ssomers:btree_comments, r=the8472

Browse source 
Make BTreeSet::split_off name elements like other set methods do

r? ````@Mark-Simulacrum````
This commit is contained in:
Yuki Okushi 2021-07-14 09:35:22 +09:00 committed by GitHub
commit b115527ce4
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -903,8 +903,8 @@ impl<T> BTreeSet<T> {
self.map.append(&mut other.map);
}
/// Splits the collection into two at the given key. Returns everything after the given key,
/// including the key.
/// Splits the collection into two at the given value. Returns everything after the given value,
/// including the value.
///
/// # Examples
///
@ -933,11 +933,11 @@ impl<T> BTreeSet<T> {
/// assert!(b.contains(&41));
/// ```
#[stable(feature = "btree_split_off", since = "1.11.0")]
pub fn split_off<Q: ?Sized + Ord>(&mut self, key: &Q) -> Self
pub fn split_off<Q: ?Sized + Ord>(&mut self, value: &Q) -> Self
where
T: Borrow<Q> + Ord,
{
BTreeSet { map: self.map.split_off(key) }
BTreeSet { map: self.map.split_off(value) }
}
/// Creates an iterator that visits all values in ascending order and uses a closure