diff options
| author | kennytm <kennytm@gmail.com> | 2018-01-07 02:36:05 +0800 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2018-01-07 02:36:05 +0800 |
| commit | e7192c1a4b884ddeb54c32678da1687558d51e1f (patch) | |
| tree | 7fcd51dbf59636e31f972514f89aa369aca62361 /src/liballoc | |
| parent | c6bf11cf2b68d104ec33f1bca033ce1e06be1fd1 (diff) | |
| parent | 7948f458ab28dc3476e764850a15f62f594609b1 (diff) | |
| download | rust-e7192c1a4b884ddeb54c32678da1687558d51e1f.tar.gz rust-e7192c1a4b884ddeb54c32678da1687558d51e1f.zip | |
Rollup merge of #47217 - stjepang:set-examples, r=frewsxcv
Write examples for {BTree,Hash}Set::{get,replace,take}
Diffstat (limited to 'src/liballoc')
| -rw-r--r-- | src/liballoc/btree/set.rs | 33 |
1 files changed, 33 insertions, 0 deletions
diff --git a/src/liballoc/btree/set.rs b/src/liballoc/btree/set.rs index 2807bbaca0c..e094070fc3d 100644 --- a/src/liballoc/btree/set.rs +++ b/src/liballoc/btree/set.rs @@ -415,6 +415,16 @@ impl<T: Ord> BTreeSet<T> { /// The value may be any borrowed form of the set's value type, /// but the ordering on the borrowed form *must* match the /// ordering on the value type. + /// + /// # Examples + /// + /// ``` + /// use std::collections::BTreeSet; + /// + /// let set: BTreeSet<_> = [1, 2, 3].iter().cloned().collect(); + /// assert_eq!(set.get(&2), Some(&2)); + /// assert_eq!(set.get(&4), None); + /// ``` #[stable(feature = "set_recovery", since = "1.9.0")] pub fn get<Q: ?Sized>(&self, value: &Q) -> Option<&T> where T: Borrow<Q>, @@ -540,6 +550,19 @@ impl<T: Ord> BTreeSet<T> { /// Adds a value to the set, replacing the existing value, if any, that is equal to the given /// one. Returns the replaced value. + /// + /// # Examples + /// + /// ``` + /// use std::collections::BTreeSet; + /// + /// let mut set = BTreeSet::new(); + /// set.insert(Vec::<i32>::new()); + /// + /// assert_eq!(set.get(&[][..]).unwrap().capacity(), 0); + /// set.replace(Vec::with_capacity(10)); + /// assert_eq!(set.get(&[][..]).unwrap().capacity(), 10); + /// ``` #[stable(feature = "set_recovery", since = "1.9.0")] pub fn replace(&mut self, value: T) -> Option<T> { Recover::replace(&mut self.map, value) @@ -576,6 +599,16 @@ impl<T: Ord> BTreeSet<T> { /// The value may be any borrowed form of the set's value type, /// but the ordering on the borrowed form *must* match the /// ordering on the value type. + /// + /// # Examples + /// + /// ``` + /// use std::collections::BTreeSet; + /// + /// let mut set: BTreeSet<_> = [1, 2, 3].iter().cloned().collect(); + /// assert_eq!(set.take(&2), Some(2)); + /// assert_eq!(set.take(&2), None); + /// ``` #[stable(feature = "set_recovery", since = "1.9.0")] pub fn take<Q: ?Sized>(&mut self, value: &Q) -> Option<T> where T: Borrow<Q>, |
