Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
7948f458
R
Rust
项目概览
int
/
Rust
大约 1 年 前同步成功
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
Rust
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
7948f458
编写于
1月 05, 2018
作者:
S
Stjepan Glavina
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Write examples for {BTree,Hash}Set::{get,replace,take}
上级
dd582ac3
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
66 addition
and
0 deletion
+66
-0
src/liballoc/btree/set.rs
src/liballoc/btree/set.rs
+33
-0
src/libstd/collections/hash/set.rs
src/libstd/collections/hash/set.rs
+33
-0
未找到文件。
src/liballoc/btree/set.rs
浏览文件 @
7948f458
...
...
@@ -415,6 +415,16 @@ pub fn contains<Q: ?Sized>(&self, value: &Q) -> bool
/// 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 @@ pub fn insert(&mut self, value: T) -> bool {
/// 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 @@ pub fn remove<Q: ?Sized>(&mut self, value: &Q) -> bool
/// 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
>
,
...
...
src/libstd/collections/hash/set.rs
浏览文件 @
7948f458
...
...
@@ -527,6 +527,16 @@ pub fn contains<Q: ?Sized>(&self, value: &Q) -> bool
/// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
/// the value type.
///
/// # Examples
///
/// ```
/// use std::collections::HashSet;
///
/// let set: HashSet<_> = [1, 2, 3].iter().cloned().collect();
/// assert_eq!(set.get(&2), Some(&2));
/// assert_eq!(set.get(&4), None);
/// ```
///
/// [`Eq`]: ../../std/cmp/trait.Eq.html
/// [`Hash`]: ../../std/hash/trait.Hash.html
#[stable(feature
=
"set_recovery"
,
since
=
"1.9.0"
)]
...
...
@@ -631,6 +641,19 @@ pub fn insert(&mut self, value: T) -> bool {
/// 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::HashSet;
///
/// let mut set = HashSet::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
)
...
...
@@ -671,6 +694,16 @@ pub fn remove<Q: ?Sized>(&mut self, value: &Q) -> bool
/// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
/// the value type.
///
/// # Examples
///
/// ```
/// use std::collections::HashSet;
///
/// let mut set: HashSet<_> = [1, 2, 3].iter().cloned().collect();
/// assert_eq!(set.take(&2), Some(2));
/// assert_eq!(set.take(&2), None);
/// ```
///
/// [`Eq`]: ../../std/cmp/trait.Eq.html
/// [`Hash`]: ../../std/hash/trait.Hash.html
#[stable(feature
=
"set_recovery"
,
since
=
"1.9.0"
)]
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录