Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
309ab34b
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,发现更多精彩内容 >>
提交
309ab34b
编写于
12月 04, 2014
作者:
C
Chase Southwood
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Implement BitOps for TrieSet
上级
207a5084
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
125 addition
and
1 deletion
+125
-1
src/libcollections/trie/set.rs
src/libcollections/trie/set.rs
+125
-1
未找到文件。
src/libcollections/trie/set.rs
浏览文件 @
309ab34b
...
...
@@ -9,7 +9,6 @@
// except according to those terms.
// FIXME(conventions): implement bounded iterators
// FIXME(conventions): implement BitOr, BitAnd, BitXor, and Sub
// FIXME(conventions): replace each_reverse by making iter DoubleEnded
// FIXME(conventions): implement iter_mut and into_iter
...
...
@@ -463,6 +462,90 @@ fn extend<Iter: Iterator<uint>>(&mut self, mut iter: Iter) {
}
}
#[unstable
=
"matches collection reform specification, waiting for dust to settle"
]
impl
BitOr
<
TrieSet
,
TrieSet
>
for
TrieSet
{
/// Returns the union of `self` and `rhs` as a new `TrieSet`.
///
/// # Example
///
/// ```
/// use std::collections::TrieSet;
///
/// let a: TrieSet = vec![1, 2, 3].into_iter().collect();
/// let b: TrieSet = vec![3, 4, 5].into_iter().collect();
///
/// let set: TrieSet = a | b;
/// let v: Vec<uint> = set.iter().collect();
/// assert_eq!(v, vec![1u, 2, 3, 4, 5]);
/// ```
fn
bitor
(
&
self
,
rhs
:
&
TrieSet
)
->
TrieSet
{
self
.union
(
rhs
)
.collect
()
}
}
#[unstable
=
"matches collection reform specification, waiting for dust to settle"
]
impl
BitAnd
<
TrieSet
,
TrieSet
>
for
TrieSet
{
/// Returns the intersection of `self` and `rhs` as a new `TrieSet`.
///
/// # Example
///
/// ```
/// use std::collections::TrieSet;
///
/// let a: TrieSet = vec![1, 2, 3].into_iter().collect();
/// let b: TrieSet = vec![2, 3, 4].into_iter().collect();
///
/// let set: TrieSet = a & b;
/// let v: Vec<uint> = set.iter().collect();
/// assert_eq!(v, vec![2u, 3]);
/// ```
fn
bitand
(
&
self
,
rhs
:
&
TrieSet
)
->
TrieSet
{
self
.intersection
(
rhs
)
.collect
()
}
}
#[unstable
=
"matches collection reform specification, waiting for dust to settle"
]
impl
BitXor
<
TrieSet
,
TrieSet
>
for
TrieSet
{
/// Returns the symmetric difference of `self` and `rhs` as a new `TrieSet`.
///
/// # Example
///
/// ```
/// use std::collections::TrieSet;
///
/// let a: TrieSet = vec![1, 2, 3].into_iter().collect();
/// let b: TrieSet = vec![3, 4, 5].into_iter().collect();
///
/// let set: TrieSet = a ^ b;
/// let v: Vec<uint> = set.iter().collect();
/// assert_eq!(v, vec![1u, 2, 4, 5]);
/// ```
fn
bitxor
(
&
self
,
rhs
:
&
TrieSet
)
->
TrieSet
{
self
.symmetric_difference
(
rhs
)
.collect
()
}
}
#[unstable
=
"matches collection reform specification, waiting for dust to settle"
]
impl
Sub
<
TrieSet
,
TrieSet
>
for
TrieSet
{
/// Returns the difference of `self` and `rhs` as a new `TrieSet`.
///
/// # Example
///
/// ```
/// use std::collections::TrieSet;
///
/// let a: TrieSet = vec![1, 2, 3].into_iter().collect();
/// let b: TrieSet = vec![3, 4, 5].into_iter().collect();
///
/// let set: TrieSet = a - b;
/// let v: Vec<uint> = set.iter().collect();
/// assert_eq!(v, vec![1u, 2]);
/// ```
fn
sub
(
&
self
,
rhs
:
&
TrieSet
)
->
TrieSet
{
self
.difference
(
rhs
)
.collect
()
}
}
/// A forward iterator over a set.
pub
struct
SetItems
<
'a
>
{
iter
:
Entries
<
'a
,
()
>
...
...
@@ -569,6 +652,7 @@ fn next(&mut self) -> Option<uint> {
mod
test
{
use
std
::
prelude
::
*
;
use
std
::
uint
;
use
vec
::
Vec
;
use
super
::
TrieSet
;
...
...
@@ -738,4 +822,44 @@ fn check_union(a: &[uint], b: &[uint], expected: &[uint]) {
&
[
1
,
5
,
9
,
13
,
19
],
&
[
1
,
3
,
5
,
9
,
11
,
13
,
16
,
19
,
24
]);
}
#[test]
fn
test_bit_or
()
{
let
a
:
TrieSet
=
vec!
[
1
,
2
,
3
]
.into_iter
()
.collect
();
let
b
:
TrieSet
=
vec!
[
3
,
4
,
5
]
.into_iter
()
.collect
();
let
set
:
TrieSet
=
a
|
b
;
let
v
:
Vec
<
uint
>
=
set
.iter
()
.collect
();
assert_eq!
(
v
,
vec!
[
1u
,
2
,
3
,
4
,
5
]);
}
#[test]
fn
test_bit_and
()
{
let
a
:
TrieSet
=
vec!
[
1
,
2
,
3
]
.into_iter
()
.collect
();
let
b
:
TrieSet
=
vec!
[
2
,
3
,
4
]
.into_iter
()
.collect
();
let
set
:
TrieSet
=
a
&
b
;
let
v
:
Vec
<
uint
>
=
set
.iter
()
.collect
();
assert_eq!
(
v
,
vec!
[
2u
,
3
]);
}
#[test]
fn
test_bit_xor
()
{
let
a
:
TrieSet
=
vec!
[
1
,
2
,
3
]
.into_iter
()
.collect
();
let
b
:
TrieSet
=
vec!
[
3
,
4
,
5
]
.into_iter
()
.collect
();
let
set
:
TrieSet
=
a
^
b
;
let
v
:
Vec
<
uint
>
=
set
.iter
()
.collect
();
assert_eq!
(
v
,
vec!
[
1u
,
2
,
4
,
5
]);
}
#[test]
fn
test_sub
()
{
let
a
:
TrieSet
=
vec!
[
1
,
2
,
3
]
.into_iter
()
.collect
();
let
b
:
TrieSet
=
vec!
[
3
,
4
,
5
]
.into_iter
()
.collect
();
let
set
:
TrieSet
=
a
-
b
;
let
v
:
Vec
<
uint
>
=
set
.iter
()
.collect
();
assert_eq!
(
v
,
vec!
[
1u
,
2
]);
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录