Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
13d07ad0
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,发现更多精彩内容 >>
提交
13d07ad0
编写于
1月 20, 2013
作者:
D
Daniel Micay
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
add a Set trait and implement it for TreeSet
上级
5d07a70f
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
41 addition
and
13 deletion
+41
-13
src/libcore/container.rs
src/libcore/container.rs
+24
-0
src/libcore/core.rc
src/libcore/core.rc
+1
-0
src/libstd/treemap.rs
src/libstd/treemap.rs
+16
-13
未找到文件。
src/libcore/container.rs
0 → 100644
浏览文件 @
13d07ad0
// Copyright 2013 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
//! Container traits
pub
trait
Set
<
T
>
{
/// Return true if the set contains a value
pure
fn
contains
(
&
self
,
value
:
&
T
)
->
bool
;
/// Add a value to the set. Return true if the value was not already
/// present in the set.
fn
insert
(
&
mut
self
,
value
:
T
)
->
bool
;
/// Remove a value from the set. Return true if the value was
/// present in the set.
fn
remove
(
&
mut
self
,
value
:
&
T
)
->
bool
;
}
src/libcore/core.rc
浏览文件 @
13d07ad0
...
...
@@ -122,6 +122,7 @@ pub mod to_bytes;
pub mod clone;
pub mod io;
pub mod hash;
pub mod container;
/* Common data structures */
...
...
src/libstd/treemap.rs
浏览文件 @
13d07ad0
...
...
@@ -14,6 +14,7 @@
#[forbid(deprecated_mode)]
;
use
core
::
container
::
Set
;
use
core
::
cmp
::{
Eq
,
Ord
};
use
core
::
option
::{
Option
,
Some
,
None
};
use
core
::
prelude
::
*
;
...
...
@@ -197,6 +198,21 @@ impl <T: Eq Ord> TreeSet<T>: Eq {
pure
fn
ne
(
&
self
,
other
:
&
TreeSet
<
T
>
)
->
bool
{
self
.map
!=
other
.map
}
}
impl
<
T
:
Ord
>
TreeSet
<
T
>
:
Set
<
T
>
{
/// Return true if the set contains a value
pure
fn
contains
(
&
self
,
value
:
&
T
)
->
bool
{
self
.map
.contains_key
(
value
)
}
/// Add a value to the set. Return true if the value was not already
/// present in the set.
fn
insert
(
&
mut
self
,
value
:
T
)
->
bool
{
self
.map
.insert
(
value
,
())
}
/// Remove a value from the set. Return true if the value was
/// present in the set.
fn
remove
(
&
mut
self
,
value
:
&
T
)
->
bool
{
self
.map
.remove
(
value
)
}
}
impl
<
T
:
Ord
>
TreeSet
<
T
>
{
/// Create an empty TreeSet
static
pure
fn
new
()
->
TreeSet
<
T
>
{
TreeSet
{
map
:
TreeMap
::
new
()}
}
...
...
@@ -215,19 +231,6 @@ impl <T: Ord> TreeSet<T> {
self
.map
.each_key_reverse
(
f
)
}
/// Return true if the set contains a value
pure
fn
contains
(
&
self
,
value
:
&
T
)
->
bool
{
self
.map
.contains_key
(
value
)
}
/// Add a value to the set. Return true if the value was not
/// already present in the set.
fn
insert
(
&
mut
self
,
value
:
T
)
->
bool
{
self
.map
.insert
(
value
,
())
}
/// Remove a value from the set. Return true if the value was
/// present in the set.
fn
remove
(
&
mut
self
,
value
:
&
T
)
->
bool
{
self
.map
.remove
(
value
)
}
/// Get a lazy iterator over the values in the set.
/// Requires that it be frozen (immutable).
pure
fn
iter
(
&
self
)
->
TreeSetIterator
/&
self
<
T
>
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录