Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
216bcfd6
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,发现更多精彩内容 >>
提交
216bcfd6
编写于
12月 03, 2014
作者:
J
Jorge Aparicio
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
libcore: use unboxed closures in the fields of `Unfold`
上级
a50c5872
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
18 addition
and
11 deletion
+18
-11
src/libcore/iter.rs
src/libcore/iter.rs
+18
-11
未找到文件。
src/libcore/iter.rs
浏览文件 @
216bcfd6
...
...
@@ -2108,19 +2108,18 @@ fn idx(&mut self, index: uint) -> Option<A> {
/// }
/// ```
#[experimental]
pub
struct
Unfold
<
'a
,
A
,
St
>
{
f
:
|
&
mut
St
|:
'a
->
Option
<
A
>
,
pub
struct
Unfold
<
A
,
St
,
F
>
where
F
:
FnMut
(
&
mut
St
)
->
Option
<
A
>
{
f
:
F
,
/// Internal state that will be passed to the closure on the next iteration
pub
state
:
St
,
}
#[experimental]
impl
<
'a
,
A
,
St
>
Unfold
<
'a
,
A
,
St
>
{
impl
<
A
,
St
,
F
>
Unfold
<
A
,
St
,
F
>
where
F
:
FnMut
(
&
mut
St
)
->
Option
<
A
>
{
/// Creates a new iterator with the specified closure as the "iterator
/// function" and an initial state to eventually pass to the closure
#[inline]
pub
fn
new
<
'a
>
(
initial_state
:
St
,
f
:
|
&
mut
St
|:
'a
->
Option
<
A
>
)
->
Unfold
<
'a
,
A
,
St
>
{
pub
fn
new
(
initial_state
:
St
,
f
:
F
)
->
Unfold
<
A
,
St
,
F
>
{
Unfold
{
f
:
f
,
state
:
initial_state
...
...
@@ -2129,7 +2128,7 @@ pub fn new<'a>(initial_state: St, f: |&mut St|: 'a -> Option<A>)
}
#[experimental]
impl
<
'a
,
A
,
St
>
Iterator
<
A
>
for
Unfold
<
'a
,
A
,
St
>
{
impl
<
A
,
St
,
F
>
Iterator
<
A
>
for
Unfold
<
A
,
St
,
F
>
where
F
:
FnMut
(
&
mut
St
)
->
Option
<
A
>
{
#[inline]
fn
next
(
&
mut
self
)
->
Option
<
A
>
{
(
self
.f
)(
&
mut
self
.state
)
...
...
@@ -2456,18 +2455,24 @@ fn indexable(&self) -> uint { uint::MAX }
fn
idx
(
&
mut
self
,
_
:
uint
)
->
Option
<
A
>
{
Some
(
self
.element
.clone
())
}
}
type
IterateState
<
'a
,
T
>
=
(|
T
|:
'a
->
T
,
Option
<
T
>
,
bool
);
type
IterateState
<
T
,
F
>
=
(
F
,
Option
<
T
>
,
bool
);
/// An iterator that repeatedly applies a given function, starting
/// from a given seed value.
#[experimental]
pub
type
Iterate
<
'a
,
T
>
=
Unfold
<
'a
,
T
,
IterateState
<
'a
,
T
>>
;
pub
type
Iterate
<
T
,
F
>
=
Unfold
<
T
,
IterateState
<
T
,
F
>
,
fn
(
&
mut
IterateState
<
T
,
F
>
)
->
Option
<
T
>>
;
/// Create a new iterator that produces an infinite sequence of
/// repeated applications of the given function `f`.
#[experimental]
pub
fn
iterate
<
'a
,
T
:
Clone
>
(
seed
:
T
,
f
:
|
T
|:
'a
->
T
)
->
Iterate
<
'a
,
T
>
{
Unfold
::
new
((
f
,
Some
(
seed
),
true
),
|
st
|
{
pub
fn
iterate
<
T
,
F
>
(
seed
:
T
,
f
:
F
)
->
Iterate
<
T
,
F
>
where
T
:
Clone
,
F
:
FnMut
(
T
)
->
T
,
{
fn
next
<
T
,
F
>
(
st
:
&
mut
IterateState
<
T
,
F
>
)
->
Option
<
T
>
where
T
:
Clone
,
F
:
FnMut
(
T
)
->
T
,
{
let
&
(
ref
mut
f
,
ref
mut
val
,
ref
mut
first
)
=
st
;
if
*
first
{
*
first
=
false
;
...
...
@@ -2480,7 +2485,9 @@ pub fn iterate<'a, T: Clone>(seed: T, f: |T|: 'a -> T) -> Iterate<'a, T> {
}
}
val
.clone
()
})
}
Unfold
::
new
((
f
,
Some
(
seed
),
true
),
next
)
}
/// Create a new iterator that endlessly repeats the element `elt`.
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录