Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
4920721f
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,发现更多精彩内容 >>
提交
4920721f
编写于
12月 27, 2016
作者:
D
djzin
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
update docs with new syntax
上级
60bab567
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
9 addition
and
9 deletion
+9
-9
src/libcollections/btree/map.rs
src/libcollections/btree/map.rs
+6
-6
src/libcollections/btree/set.rs
src/libcollections/btree/set.rs
+3
-3
未找到文件。
src/libcollections/btree/map.rs
浏览文件 @
4920721f
...
...
@@ -656,11 +656,11 @@ pub fn append(&mut self, other: &mut Self) {
}
/// Constructs a double-ended iterator over a sub-range of elements in the map.
/// The simplest way is to use the range synax `min..max`, thus `range(
..
)` will
/// yield
the whole collection
.
/// The simplest way is to use the range synax `min..max`, thus `range(
min..max
)` will
/// yield
elements from min (inclusive) to max (exclusive)
.
/// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
/// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
/// range.
/// range
from 4 to 10
.
///
/// # Examples
///
...
...
@@ -748,11 +748,11 @@ pub fn range<T: ?Sized, R>(&self, range: R) -> Range<K, V>
}
/// Constructs a mutable double-ended iterator over a sub-range of elements in the map.
/// The simplest way is to use the range synax `min..max`, thus `range(
..
)` will
/// yield
the whole collection
.
/// The simplest way is to use the range synax `min..max`, thus `range(
min..max
)` will
/// yield
elements from min (inclusive) to max (exclusive)
.
/// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
/// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
/// range.
/// range
from 4 to 10
.
///
/// # Examples
///
...
...
src/libcollections/btree/set.rs
浏览文件 @
4920721f
...
...
@@ -208,11 +208,11 @@ pub fn iter(&self) -> Iter<T> {
impl
<
T
:
Ord
>
BTreeSet
<
T
>
{
/// Constructs a double-ended iterator over a sub-range of elements in the set.
/// The simplest way is to use the range synax `min..max`, thus `range(
..
)` will
/// yield
the whole collection
.
/// The simplest way is to use the range synax `min..max`, thus `range(
min..max
)` will
/// yield
elements from min (inclusive) to max (exclusive)
.
/// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
/// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
/// range.
/// range
from 4 to 10
.
///
/// # Examples
///
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录