Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
981cb8c1
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,发现更多精彩内容 >>
提交
981cb8c1
编写于
10月 06, 2020
作者:
A
AnthonyMikh
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Eliminate bounds checking in slice::Windows
上级
5849a7ec
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
17 addition
and
15 deletion
+17
-15
library/core/src/slice/iter.rs
library/core/src/slice/iter.rs
+15
-14
library/core/src/slice/mod.rs
library/core/src/slice/mod.rs
+2
-1
未找到文件。
library/core/src/slice/iter.rs
浏览文件 @
981cb8c1
...
...
@@ -10,6 +10,7 @@
use
crate
::
iter
::{
FusedIterator
,
TrustedLen
,
TrustedRandomAccess
};
use
crate
::
marker
::{
PhantomData
,
Send
,
Sized
,
Sync
};
use
crate
::
mem
;
use
crate
::
num
::
NonZeroUsize
;
use
crate
::
ptr
::
NonNull
;
use
super
::{
from_raw_parts
,
from_raw_parts_mut
};
...
...
@@ -1187,12 +1188,12 @@ fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
#[stable(feature
=
"rust1"
,
since
=
"1.0.0"
)]
pub
struct
Windows
<
'a
,
T
:
'a
>
{
v
:
&
'a
[
T
],
size
:
u
size
,
size
:
NonZeroU
size
,
}
impl
<
'a
,
T
:
'a
>
Windows
<
'a
,
T
>
{
#[inline]
pub
(
super
)
fn
new
(
slice
:
&
'a
[
T
],
size
:
u
size
)
->
Self
{
pub
(
super
)
fn
new
(
slice
:
&
'a
[
T
],
size
:
NonZeroU
size
)
->
Self
{
Self
{
v
:
slice
,
size
}
}
}
...
...
@@ -1211,10 +1212,10 @@ impl<'a, T> Iterator for Windows<'a, T> {
#[inline]
fn
next
(
&
mut
self
)
->
Option
<&
'a
[
T
]
>
{
if
self
.size
>
self
.v
.len
()
{
if
self
.size
.get
()
>
self
.v
.len
()
{
None
}
else
{
let
ret
=
Some
(
&
self
.v
[
..
self
.size
]);
let
ret
=
Some
(
&
self
.v
[
..
self
.size
.get
()
]);
self
.v
=
&
self
.v
[
1
..
];
ret
}
...
...
@@ -1222,10 +1223,10 @@ fn next(&mut self) -> Option<&'a [T]> {
#[inline]
fn
size_hint
(
&
self
)
->
(
usize
,
Option
<
usize
>
)
{
if
self
.size
>
self
.v
.len
()
{
if
self
.size
.get
()
>
self
.v
.len
()
{
(
0
,
Some
(
0
))
}
else
{
let
size
=
self
.v
.len
()
-
self
.size
+
1
;
let
size
=
self
.v
.len
()
-
self
.size
.get
()
+
1
;
(
size
,
Some
(
size
))
}
}
...
...
@@ -1237,7 +1238,7 @@ fn count(self) -> usize {
#[inline]
fn
nth
(
&
mut
self
,
n
:
usize
)
->
Option
<
Self
::
Item
>
{
let
(
end
,
overflow
)
=
self
.size
.overflowing_add
(
n
);
let
(
end
,
overflow
)
=
self
.size
.
get
()
.
overflowing_add
(
n
);
if
end
>
self
.v
.len
()
||
overflow
{
self
.v
=
&
[];
None
...
...
@@ -1250,10 +1251,10 @@ fn nth(&mut self, n: usize) -> Option<Self::Item> {
#[inline]
fn
last
(
self
)
->
Option
<
Self
::
Item
>
{
if
self
.size
>
self
.v
.len
()
{
if
self
.size
.get
()
>
self
.v
.len
()
{
None
}
else
{
let
start
=
self
.v
.len
()
-
self
.size
;
let
start
=
self
.v
.len
()
-
self
.size
.get
()
;
Some
(
&
self
.v
[
start
..
])
}
}
...
...
@@ -1264,7 +1265,7 @@ unsafe fn __iterator_get_unchecked(&mut self, idx: usize) -> Self::Item {
// which means that `i` cannot overflow an `isize`, and the
// slice created by `from_raw_parts` is a subslice of `self.v`
// thus is guaranteed to be valid for the lifetime `'a` of `self.v`.
unsafe
{
from_raw_parts
(
self
.v
.as_ptr
()
.add
(
idx
),
self
.size
)
}
unsafe
{
from_raw_parts
(
self
.v
.as_ptr
()
.add
(
idx
),
self
.size
.get
()
)
}
}
}
...
...
@@ -1272,10 +1273,10 @@ unsafe fn __iterator_get_unchecked(&mut self, idx: usize) -> Self::Item {
impl
<
'a
,
T
>
DoubleEndedIterator
for
Windows
<
'a
,
T
>
{
#[inline]
fn
next_back
(
&
mut
self
)
->
Option
<&
'a
[
T
]
>
{
if
self
.size
>
self
.v
.len
()
{
if
self
.size
.get
()
>
self
.v
.len
()
{
None
}
else
{
let
ret
=
Some
(
&
self
.v
[
self
.v
.len
()
-
self
.size
..
]);
let
ret
=
Some
(
&
self
.v
[
self
.v
.len
()
-
self
.size
.
get
()
.
.
]);
self
.v
=
&
self
.v
[
..
self
.v
.len
()
-
1
];
ret
}
...
...
@@ -1284,11 +1285,11 @@ fn next_back(&mut self) -> Option<&'a [T]> {
#[inline]
fn
nth_back
(
&
mut
self
,
n
:
usize
)
->
Option
<
Self
::
Item
>
{
let
(
end
,
overflow
)
=
self
.v
.len
()
.overflowing_sub
(
n
);
if
end
<
self
.size
||
overflow
{
if
end
<
self
.size
.get
()
||
overflow
{
self
.v
=
&
[];
None
}
else
{
let
ret
=
&
self
.v
[
end
-
self
.size
..
end
];
let
ret
=
&
self
.v
[
end
-
self
.size
.
get
()
.
.
end
];
self
.v
=
&
self
.v
[
..
end
-
1
];
Some
(
ret
)
}
...
...
library/core/src/slice/mod.rs
浏览文件 @
981cb8c1
...
...
@@ -11,6 +11,7 @@
use
crate
::
cmp
::
Ordering
::{
self
,
Equal
,
Greater
,
Less
};
use
crate
::
marker
::
Copy
;
use
crate
::
mem
;
use
crate
::
num
::
NonZeroUsize
;
use
crate
::
ops
::{
FnMut
,
Range
,
RangeBounds
};
use
crate
::
option
::
Option
;
use
crate
::
option
::
Option
::{
None
,
Some
};
...
...
@@ -751,7 +752,7 @@ pub fn iter_mut(&mut self) -> IterMut<'_, T> {
#[stable(feature
=
"rust1"
,
since
=
"1.0.0"
)]
#[inline]
pub
fn
windows
(
&
self
,
size
:
usize
)
->
Windows
<
'_
,
T
>
{
assert_ne!
(
size
,
0
);
let
size
=
NonZeroUsize
::
new
(
size
)
.expect
(
"size is zero"
);
Windows
::
new
(
self
,
size
)
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录