Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
fdeda33a
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,发现更多精彩内容 >>
提交
fdeda33a
编写于
6月 17, 2016
作者:
O
Oliver Middleton
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Add short summaries to btree modules
Also improve hash_map and hash_set module short summaries.
上级
bb4a79b0
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
6 addition
and
2 deletion
+6
-2
src/libcollections/lib.rs
src/libcollections/lib.rs
+2
-0
src/libstd/collections/mod.rs
src/libstd/collections/mod.rs
+4
-2
未找到文件。
src/libcollections/lib.rs
浏览文件 @
fdeda33a
...
...
@@ -105,12 +105,14 @@
#[stable(feature
=
"rust1"
,
since
=
"1.0.0"
)]
pub
mod
btree_map
{
//! A map based on a B-Tree.
#[stable(feature
=
"rust1"
,
since
=
"1.0.0"
)]
pub
use
btree
::
map
::
*
;
}
#[stable(feature
=
"rust1"
,
since
=
"1.0.0"
)]
pub
mod
btree_set
{
//! A set based on a B-Tree.
#[stable(feature
=
"rust1"
,
since
=
"1.0.0"
)]
pub
use
btree
::
set
::
*
;
}
...
...
src/libstd/collections/mod.rs
浏览文件 @
fdeda33a
...
...
@@ -429,14 +429,16 @@
#[stable(feature
=
"rust1"
,
since
=
"1.0.0"
)]
pub
mod
hash_map
{
//! A hashmap
//! A hash map implementation which uses linear probing with Robin
//! Hood bucket stealing.
#[stable(feature
=
"rust1"
,
since
=
"1.0.0"
)]
pub
use
super
::
hash
::
map
::
*
;
}
#[stable(feature
=
"rust1"
,
since
=
"1.0.0"
)]
pub
mod
hash_set
{
//! A hashset
//! An implementation of a hash set using the underlying representation of a
//! HashMap where the value is ().
#[stable(feature
=
"rust1"
,
since
=
"1.0.0"
)]
pub
use
super
::
hash
::
set
::
*
;
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录