Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
c3ac929b
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,发现更多精彩内容 >>
提交
c3ac929b
编写于
1月 19, 2015
作者:
A
Adolfo Ochagavía
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Add a Drain iterator to VecMap
上级
2366dee8
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
55 addition
and
6 deletion
+55
-6
src/libcollections/vec_map.rs
src/libcollections/vec_map.rs
+55
-6
未找到文件。
src/libcollections/vec_map.rs
浏览文件 @
c3ac929b
...
...
@@ -186,7 +186,7 @@ pub fn reserve_len_exact(&mut self, len: uint) {
}
}
/// Returns an iterator visiting all keys in ascending order
by
the keys.
/// Returns an iterator visiting all keys in ascending order
of
the keys.
/// The iterator's element type is `uint`.
#[stable]
pub
fn
keys
<
'r
>
(
&
'r
self
)
->
Keys
<
'r
,
V
>
{
...
...
@@ -196,7 +196,7 @@ fn first<A, B>((a, _): (A, B)) -> A { a }
Keys
{
iter
:
self
.iter
()
.map
(
first
)
}
}
/// Returns an iterator visiting all values in ascending order
by
the keys.
/// Returns an iterator visiting all values in ascending order
of
the keys.
/// The iterator's element type is `&'r V`.
#[stable]
pub
fn
values
<
'r
>
(
&
'r
self
)
->
Values
<
'r
,
V
>
{
...
...
@@ -206,7 +206,7 @@ fn second<A, B>((_, b): (A, B)) -> B { b }
Values
{
iter
:
self
.iter
()
.map
(
second
)
}
}
/// Returns an iterator visiting all key-value pairs in ascending order
by
the keys.
/// Returns an iterator visiting all key-value pairs in ascending order
of
the keys.
/// The iterator's element type is `(uint, &'r V)`.
///
/// # Examples
...
...
@@ -233,7 +233,7 @@ pub fn iter<'r>(&'r self) -> Iter<'r, V> {
}
}
/// Returns an iterator visiting all key-value pairs in ascending order
by
the keys,
/// Returns an iterator visiting all key-value pairs in ascending order
of
the keys,
/// with mutable references to the values.
/// The iterator's element type is `(uint, &'r mut V)`.
///
...
...
@@ -264,7 +264,7 @@ pub fn iter_mut<'r>(&'r mut self) -> IterMut<'r, V> {
}
}
/// Returns an iterator visiting all key-value pairs in ascending order
by
/// Returns an iterator visiting all key-value pairs in ascending order
of
/// the keys, consuming the original `VecMap`.
/// The iterator's element type is `(uint, &'r V)`.
///
...
...
@@ -278,7 +278,6 @@ pub fn iter_mut<'r>(&'r mut self) -> IterMut<'r, V> {
/// map.insert(3, "c");
/// map.insert(2, "b");
///
/// // Not possible with .iter()
/// let vec: Vec<(uint, &str)> = map.into_iter().collect();
///
/// assert_eq!(vec, vec![(1, "a"), (2, "b"), (3, "c")]);
...
...
@@ -293,6 +292,34 @@ fn filter<A>((i, v): (uint, Option<A>)) -> Option<(uint, A)> {
IntoIter
{
iter
:
self
.v
.into_iter
()
.enumerate
()
.filter_map
(
filter
)
}
}
/// Returns an iterator visiting all key-value pairs in ascending order of
/// the keys, emptying (but not consuming) the original `VecMap`.
/// The iterator's element type is `(uint, &'r V)`. Keeps the allocated memory for reuse.
///
/// # Examples
///
/// ```
/// use std::collections::VecMap;
///
/// let mut map = VecMap::new();
/// map.insert(1, "a");
/// map.insert(3, "c");
/// map.insert(2, "b");
///
/// let vec: Vec<(uint, &str)> = map.drain().collect();
///
/// assert_eq!(vec, vec![(1, "a"), (2, "b"), (3, "c")]);
/// ```
#[unstable
=
"matches collection reform specification, waiting for dust to settle"
]
pub
fn
drain
<
'a
>
(
&
'a
mut
self
)
->
Drain
<
'a
,
V
>
{
fn
filter
<
A
>
((
i
,
v
):
(
uint
,
Option
<
A
>
))
->
Option
<
(
uint
,
A
)
>
{
v
.map
(|
v
|
(
i
,
v
))
}
let
filter
:
fn
((
uint
,
Option
<
V
>
))
->
Option
<
(
uint
,
V
)
>
=
filter
;
// coerce to fn ptr
Drain
{
iter
:
self
.v
.drain
()
.enumerate
()
.filter_map
(
filter
)
}
}
/// Return the number of elements in the map.
///
/// # Examples
...
...
@@ -672,6 +699,28 @@ pub struct IntoIter<V> {
fn
((
uint
,
Option
<
V
>
))
->
Option
<
(
uint
,
V
)
>>
}
#[unstable]
pub
struct
Drain
<
'a
,
V
>
{
iter
:
FilterMap
<
(
uint
,
Option
<
V
>
),
(
uint
,
V
),
Enumerate
<
vec
::
Drain
<
'a
,
Option
<
V
>>>
,
fn
((
uint
,
Option
<
V
>
))
->
Option
<
(
uint
,
V
)
>>
}
#[unstable]
impl
<
'a
,
V
>
Iterator
for
Drain
<
'a
,
V
>
{
type
Item
=
(
uint
,
V
);
fn
next
(
&
mut
self
)
->
Option
<
(
uint
,
V
)
>
{
self
.iter
.next
()
}
fn
size_hint
(
&
self
)
->
(
uint
,
Option
<
uint
>
)
{
self
.iter
.size_hint
()
}
}
#[unstable]
impl
<
'a
,
V
>
DoubleEndedIterator
for
Drain
<
'a
,
V
>
{
fn
next_back
(
&
mut
self
)
->
Option
<
(
uint
,
V
)
>
{
self
.iter
.next_back
()
}
}
#[stable]
impl
<
'a
,
V
>
Iterator
for
Keys
<
'a
,
V
>
{
type
Item
=
uint
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录