Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
2e1911b4
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,发现更多精彩内容 >>
提交
2e1911b4
编写于
12月 03, 2014
作者:
A
Austin Bonander
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
core::iter::Unfold: reword docs and add example
Remove note about core
上级
daa07458
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
34 addition
and
3 deletion
+34
-3
src/libcore/iter.rs
src/libcore/iter.rs
+34
-3
未找到文件。
src/libcore/iter.rs
浏览文件 @
2e1911b4
...
...
@@ -2036,18 +2036,49 @@ fn idx(&mut self, index: uint) -> Option<A> {
}
}
/// An iterator which just modifies the contained state throughout iteration.
/// An iterator which passes mutable state to a closure and yields the result.
///
/// # Example: The Fibonacci Sequence
///
/// An iterator that yields sequential Fibonacci numbers, and stops on overflow.
///
/// ```rust
/// use std::iter::Unfold;
/// use std::num::Int; // For `.checked_add()`
///
/// // This iterator will yield up to the last Fibonacci number before the max value of `u32`.
/// // You can simply change `u32` to `u64` in this line if you want higher values than that.
/// let mut fibonacci = Unfold::new((Some(0u32), Some(1u32)), |&(ref mut x2, ref mut x1)| {
/// // Attempt to get the next Fibonacci number
/// // `x1` will be `None` if previously overflowed.
/// let next = match (*x2, *x1) {
/// (Some(x2), Some(x1)) => x2.checked_add(x1),
/// _ => None,
/// };
///
/// // Shift left: ret <- x2 <- x1 <- next
/// let ret = *x2;
/// *x2 = *x1;
/// *x1 = next;
///
/// ret
/// });
///
/// for i in fibonacci {
/// println!("{}", i);
/// }
/// ```
#[experimental]
pub
struct
Unfold
<
'a
,
A
,
St
>
{
f
:
|
&
mut
St
|:
'a
->
Option
<
A
>
,
/// Internal state that will be
yielded
on the next iteration
/// 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
>
{
/// Creates a new iterator with the specified closure as the "iterator
/// function" and an initial state to eventually pass to 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
>
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录