Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
da50db0c
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,发现更多精彩内容 >>
提交
da50db0c
编写于
12月 05, 2014
作者:
C
Chase Southwood
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Implement BitOps for TreeSet
上级
361baabb
变更
1
显示空白变更内容
内联
并排
Showing
1 changed file
with
125 addition
and
1 deletion
+125
-1
src/libcollections/tree/set.rs
src/libcollections/tree/set.rs
+125
-1
未找到文件。
src/libcollections/tree/set.rs
浏览文件 @
da50db0c
...
...
@@ -21,7 +21,6 @@
use
tree_map
::{
TreeMap
,
Entries
,
RevEntries
,
MoveEntries
};
// FIXME(conventions): implement bounded iterators
// FIXME(conventions): implement BitOr, BitAnd, BitXor, and Sub
// FIXME(conventions): replace rev_iter(_mut) by making iter(_mut) DoubleEnded
/// An implementation of the `Set` trait on top of the `TreeMap` container. The
...
...
@@ -666,6 +665,90 @@ fn next(&mut self) -> Option<&'a T> {
}
}
#[unstable
=
"matches collection reform specification, waiting for dust to settle"
]
impl
<
T
:
Ord
+
Clone
>
BitOr
<
TreeSet
<
T
>
,
TreeSet
<
T
>>
for
TreeSet
<
T
>
{
/// Returns the union of `self` and `rhs` as a new `TreeSet<T>`.
///
/// # Example
///
/// ```
/// use std::collections::TreeSet;
///
/// let a: TreeSet<int> = vec![1, 2, 3].into_iter().collect();
/// let b: TreeSet<int> = vec![3, 4, 5].into_iter().collect();
///
/// let set: TreeSet<int> = a | b;
/// let v: Vec<int> = set.into_iter().collect();
/// assert_eq!(v, vec![1, 2, 3, 4, 5]);
/// ```
fn
bitor
(
&
self
,
rhs
:
&
TreeSet
<
T
>
)
->
TreeSet
<
T
>
{
self
.union
(
rhs
)
.cloned
()
.collect
()
}
}
#[unstable
=
"matches collection reform specification, waiting for dust to settle"
]
impl
<
T
:
Ord
+
Clone
>
BitAnd
<
TreeSet
<
T
>
,
TreeSet
<
T
>>
for
TreeSet
<
T
>
{
/// Returns the intersection of `self` and `rhs` as a new `TreeSet<T>`.
///
/// # Example
///
/// ```
/// use std::collections::TreeSet;
///
/// let a: TreeSet<int> = vec![1, 2, 3].into_iter().collect();
/// let b: TreeSet<int> = vec![2, 3, 4].into_iter().collect();
///
/// let set: TreeSet<int> = a & b;
/// let v: Vec<int> = set.into_iter().collect();
/// assert_eq!(v, vec![2, 3]);
/// ```
fn
bitand
(
&
self
,
rhs
:
&
TreeSet
<
T
>
)
->
TreeSet
<
T
>
{
self
.intersection
(
rhs
)
.cloned
()
.collect
()
}
}
#[unstable
=
"matches collection reform specification, waiting for dust to settle"
]
impl
<
T
:
Ord
+
Clone
>
BitXor
<
TreeSet
<
T
>
,
TreeSet
<
T
>>
for
TreeSet
<
T
>
{
/// Returns the symmetric difference of `self` and `rhs` as a new `TreeSet<T>`.
///
/// # Example
///
/// ```
/// use std::collections::TreeSet;
///
/// let a: TreeSet<int> = vec![1, 2, 3].into_iter().collect();
/// let b: TreeSet<int> = vec![3, 4, 5].into_iter().collect();
///
/// let set: TreeSet<int> = a ^ b;
/// let v: Vec<int> = set.into_iter().collect();
/// assert_eq!(v, vec![1, 2, 4, 5]);
/// ```
fn
bitxor
(
&
self
,
rhs
:
&
TreeSet
<
T
>
)
->
TreeSet
<
T
>
{
self
.symmetric_difference
(
rhs
)
.cloned
()
.collect
()
}
}
#[unstable
=
"matches collection reform specification, waiting for dust to settle"
]
impl
<
T
:
Ord
+
Clone
>
Sub
<
TreeSet
<
T
>
,
TreeSet
<
T
>>
for
TreeSet
<
T
>
{
/// Returns the difference of `self` and `rhs` as a new `TreeSet<T>`.
///
/// # Example
///
/// ```
/// use std::collections::TreeSet;
///
/// let a: TreeSet<int> = vec![1, 2, 3].into_iter().collect();
/// let b: TreeSet<int> = vec![3, 4, 5].into_iter().collect();
///
/// let set: TreeSet<int> = a - b;
/// let v: Vec<int> = set.into_iter().collect();
/// assert_eq!(v, vec![1, 2]);
/// ```
fn
sub
(
&
self
,
rhs
:
&
TreeSet
<
T
>
)
->
TreeSet
<
T
>
{
self
.difference
(
rhs
)
.cloned
()
.collect
()
}
}
impl
<
T
:
Ord
>
FromIterator
<
T
>
for
TreeSet
<
T
>
{
fn
from_iter
<
Iter
:
Iterator
<
T
>>
(
iter
:
Iter
)
->
TreeSet
<
T
>
{
let
mut
set
=
TreeSet
::
new
();
...
...
@@ -695,6 +778,7 @@ fn hash(&self, state: &mut S) {
mod
test
{
use
std
::
prelude
::
*
;
use
std
::
hash
;
use
vec
::
Vec
;
use
super
::
TreeSet
;
...
...
@@ -932,6 +1016,46 @@ fn check_union(a: &[int], b: &[int],
&
[
-
2
,
1
,
3
,
5
,
9
,
11
,
13
,
16
,
19
,
24
]);
}
#[test]
fn
test_bit_or
()
{
let
a
:
TreeSet
<
int
>
=
vec!
[
1
,
3
,
5
,
9
,
11
,
16
,
19
,
24
]
.into_iter
()
.collect
();
let
b
:
TreeSet
<
int
>
=
vec!
[
-
2
,
1
,
5
,
9
,
13
,
19
]
.into_iter
()
.collect
();
let
set
:
TreeSet
<
int
>
=
a
|
b
;
let
v
:
Vec
<
int
>
=
set
.into_iter
()
.collect
();
assert_eq!
(
v
,
vec!
[
-
2
,
1
,
3
,
5
,
9
,
11
,
13
,
16
,
19
,
24
]);
}
#[test]
fn
test_bit_and
()
{
let
a
:
TreeSet
<
int
>
=
vec!
[
11
,
1
,
3
,
77
,
103
,
5
,
-
5
]
.into_iter
()
.collect
();
let
b
:
TreeSet
<
int
>
=
vec!
[
2
,
11
,
77
,
-
9
,
-
42
,
5
,
3
]
.into_iter
()
.collect
();
let
set
:
TreeSet
<
int
>
=
a
&
b
;
let
v
:
Vec
<
int
>
=
set
.into_iter
()
.collect
();
assert_eq!
(
v
,
vec!
[
3
,
5
,
11
,
77
]);
}
#[test]
fn
test_bit_xor
()
{
let
a
:
TreeSet
<
int
>
=
vec!
[
1
,
3
,
5
,
9
,
11
]
.into_iter
()
.collect
();
let
b
:
TreeSet
<
int
>
=
vec!
[
-
2
,
3
,
9
,
14
,
22
]
.into_iter
()
.collect
();
let
set
:
TreeSet
<
int
>
=
a
^
b
;
let
v
:
Vec
<
int
>
=
set
.into_iter
()
.collect
();
assert_eq!
(
v
,
vec!
[
-
2
,
1
,
5
,
11
,
14
,
22
]);
}
#[test]
fn
test_sub
()
{
let
a
:
TreeSet
<
int
>
=
vec!
[
-
5
,
11
,
22
,
33
,
40
,
42
]
.into_iter
()
.collect
();
let
b
:
TreeSet
<
int
>
=
vec!
[
-
12
,
-
5
,
14
,
23
,
34
,
38
,
39
,
50
]
.into_iter
()
.collect
();
let
set
:
TreeSet
<
int
>
=
a
-
b
;
let
v
:
Vec
<
int
>
=
set
.into_iter
()
.collect
();
assert_eq!
(
v
,
vec!
[
11
,
22
,
33
,
40
,
42
]);
}
#[test]
fn
test_zip
()
{
let
mut
x
=
TreeSet
::
new
();
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录