Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
2eea642c
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,发现更多精彩内容 >>
提交
2eea642c
编写于
6月 29, 2013
作者:
H
Huon Wilson
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Convert vec::dedup to a method.
上级
faa8f8ff
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
36 addition
and
41 deletion
+36
-41
src/librustc/middle/check_match.rs
src/librustc/middle/check_match.rs
+1
-1
src/libstd/prelude.rs
src/libstd/prelude.rs
+1
-1
src/libstd/vec.rs
src/libstd/vec.rs
+34
-39
未找到文件。
src/librustc/middle/check_match.rs
浏览文件 @
2eea642c
...
...
@@ -417,7 +417,7 @@ pub fn missing_ctor(cx: &MatchCheckCtxt,
}
}
);
vec
::
dedup
(
&
mut
sorted_vec_lens
);
sorted_vec_lens
.dedup
(
);
let
mut
found_slice
=
false
;
let
mut
next
=
0
;
...
...
src/libstd/prelude.rs
浏览文件 @
2eea642c
...
...
@@ -74,7 +74,7 @@
pub
use
tuple
::{
ImmutableTuple10
,
ImmutableTuple11
,
ImmutableTuple12
};
pub
use
vec
::{
VectorVector
,
CopyableVector
,
ImmutableVector
};
pub
use
vec
::{
ImmutableEqVector
,
ImmutableTotalOrdVector
,
ImmutableCopyableVector
};
pub
use
vec
::{
OwnedVector
,
OwnedCopyableVector
,
MutableVector
};
pub
use
vec
::{
OwnedVector
,
OwnedCopyableVector
,
OwnedEqVector
,
MutableVector
};
pub
use
io
::{
Reader
,
ReaderUtil
,
Writer
,
WriterUtil
};
// Reexported runtime types
...
...
src/libstd/vec.rs
浏览文件 @
2eea642c
...
...
@@ -343,41 +343,6 @@ pub fn consume_reverse<T>(mut v: ~[T], f: &fn(uint, v: T)) {
}
}
/**
* Remove consecutive repeated elements from a vector; if the vector is
* sorted, this removes all duplicates.
*/
pub
fn
dedup
<
T
:
Eq
>
(
v
:
&
mut
~
[
T
])
{
unsafe
{
if
v
.len
()
<
1
{
return
;
}
let
mut
last_written
=
0
;
let
mut
next_to_read
=
1
;
do
as_mut_buf
(
*
v
)
|
p
,
ln
|
{
// last_written < next_to_read <= ln
while
next_to_read
<
ln
{
// last_written < next_to_read < ln
if
*
ptr
::
mut_offset
(
p
,
next_to_read
)
==
*
ptr
::
mut_offset
(
p
,
last_written
)
{
ptr
::
replace_ptr
(
ptr
::
mut_offset
(
p
,
next_to_read
),
intrinsics
::
uninit
());
}
else
{
last_written
+=
1
;
// last_written <= next_to_read < ln
if
next_to_read
!=
last_written
{
ptr
::
swap_ptr
(
ptr
::
mut_offset
(
p
,
last_written
),
ptr
::
mut_offset
(
p
,
next_to_read
));
}
}
// last_written <= next_to_read < ln
next_to_read
+=
1
;
// last_written < next_to_read <= ln
}
}
// last_written < next_to_read == ln
raw
::
set_len
(
v
,
last_written
+
1
);
}
}
// Appending
/// Iterates over the `rhs` vector, copying each element and appending it to the
...
...
@@ -1734,14 +1699,44 @@ fn grow_set(&mut self, index: uint, initval: &T, val: T) {
}
#[allow(missing_doc)]
trait
OwnedEqVector
<
T
:
Eq
>
{
pub
trait
OwnedEqVector
<
T
:
Eq
>
{
fn
dedup
(
&
mut
self
);
}
impl
<
T
:
Eq
>
OwnedEqVector
<
T
>
for
~
[
T
]
{
#[inline]
fn
dedup
(
&
mut
self
)
{
dedup
(
self
)
/**
* Remove consecutive repeated elements from a vector; if the vector is
* sorted, this removes all duplicates.
*/
pub
fn
dedup
(
&
mut
self
)
{
unsafe
{
if
self
.len
()
==
0
{
return
;
}
let
mut
last_written
=
0
;
let
mut
next_to_read
=
1
;
do
as_mut_buf
(
*
self
)
|
p
,
ln
|
{
// last_written < next_to_read <= ln
while
next_to_read
<
ln
{
// last_written < next_to_read < ln
if
*
ptr
::
mut_offset
(
p
,
next_to_read
)
==
*
ptr
::
mut_offset
(
p
,
last_written
)
{
ptr
::
replace_ptr
(
ptr
::
mut_offset
(
p
,
next_to_read
),
intrinsics
::
uninit
());
}
else
{
last_written
+=
1
;
// last_written <= next_to_read < ln
if
next_to_read
!=
last_written
{
ptr
::
swap_ptr
(
ptr
::
mut_offset
(
p
,
last_written
),
ptr
::
mut_offset
(
p
,
next_to_read
));
}
}
// last_written <= next_to_read < ln
next_to_read
+=
1
;
// last_written < next_to_read <= ln
}
}
// last_written < next_to_read == ln
raw
::
set_len
(
self
,
last_written
+
1
);
}
}
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录