Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
aca4e6a8
R
Rust
项目概览
int
/
Rust
12 个月 前同步成功
通知
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,发现更多精彩内容 >>
提交
aca4e6a8
编写于
1月 17, 2016
作者:
K
Keith Yeung
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Add tests for collections to work with ZSTs
上级
bff52927
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
126 addition
and
0 deletion
+126
-0
src/test/run-pass/zero-sized-binary-heap-push.rs
src/test/run-pass/zero-sized-binary-heap-push.rs
+28
-0
src/test/run-pass/zero-sized-btreemap-insert.rs
src/test/run-pass/zero-sized-btreemap-insert.rs
+32
-0
src/test/run-pass/zero-sized-linkedlist-push.rs
src/test/run-pass/zero-sized-linkedlist-push.rs
+38
-0
src/test/run-pass/zero-sized-vec-push.rs
src/test/run-pass/zero-sized-vec-push.rs
+28
-0
未找到文件。
src/test/run-pass/zero-sized-binary-heap-push.rs
0 → 100644
浏览文件 @
aca4e6a8
// Copyright 2013 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
use
std
::
collections
::
BinaryHeap
;
use
std
::
iter
::
Iterator
;
fn
main
()
{
const
N
:
usize
=
8
;
for
len
in
0
..
N
{
let
mut
tester
=
BinaryHeap
::
with_capacity
(
len
);
assert_eq!
(
tester
.len
(),
0
);
assert
!
(
tester
.capacity
()
>=
len
);
for
bit
in
0
..
len
{
tester
.push
(());
}
assert_eq!
(
tester
.len
(),
len
);
assert_eq!
(
tester
.iter
()
.count
(),
len
);
tester
.clear
();
}
}
src/test/run-pass/zero-sized-btreemap-insert.rs
0 → 100644
浏览文件 @
aca4e6a8
// Copyright 2013 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
use
std
::
cmp
::{
Ord
,
Ordering
,
PartialOrd
};
use
std
::
collections
::
BTreeMap
;
use
std
::
iter
::
Iterator
;
#[derive(Eq,
Hash,
Debug,
Ord,
PartialEq,
PartialOrd)]
struct
Zst
;
fn
main
()
{
const
N
:
usize
=
8
;
for
len
in
0
..
N
{
let
mut
tester
=
BTreeMap
::
new
();
assert_eq!
(
tester
.len
(),
0
);
for
bit
in
0
..
len
{
tester
.insert
(
Zst
,
());
}
assert_eq!
(
tester
.len
(),
if
len
==
0
{
0
}
else
{
1
});
assert_eq!
(
tester
.iter
()
.count
(),
if
len
==
0
{
0
}
else
{
1
});
assert_eq!
(
tester
.get
(
&
Zst
)
.is_some
(),
len
>
0
);
tester
.clear
();
}
}
src/test/run-pass/zero-sized-linkedlist-push.rs
0 → 100644
浏览文件 @
aca4e6a8
// Copyright 2013 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
use
std
::
collections
::
LinkedList
;
use
std
::
iter
::
Iterator
;
fn
main
()
{
const
N
:
usize
=
8
;
// Test that for all possible sequences of push_front / push_back,
// we end up with a LinkedList of the correct size
for
len
in
0
..
N
{
let
mut
tester
=
LinkedList
::
new
();
assert_eq!
(
tester
.len
(),
0
);
assert_eq!
(
tester
.front
(),
None
);
for
case
in
0
..
(
1
<<
len
)
{
assert_eq!
(
tester
.len
(),
0
);
for
bit
in
0
..
len
{
if
case
&
(
1
<<
bit
)
!=
0
{
tester
.push_front
(());
}
else
{
tester
.push_back
(());
}
}
assert_eq!
(
tester
.len
(),
len
);
assert_eq!
(
tester
.iter
()
.count
(),
len
);
tester
.clear
();
}
}
}
src/test/run-pass/zero-sized-vec-push.rs
0 → 100644
浏览文件 @
aca4e6a8
// Copyright 2013 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
use
std
::
iter
::
Iterator
;
use
std
::
vec
::
Vec
;
fn
main
()
{
const
N
:
usize
=
8
;
for
len
in
0
..
N
{
let
mut
tester
=
Vec
::
with_capacity
(
len
);
assert_eq!
(
tester
.len
(),
0
);
assert
!
(
tester
.capacity
()
>=
len
);
for
bit
in
0
..
len
{
tester
.push
(());
}
assert_eq!
(
tester
.len
(),
len
);
assert_eq!
(
tester
.iter
()
.count
(),
len
);
tester
.clear
();
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录