Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
5cab04ea
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,发现更多精彩内容 >>
提交
5cab04ea
编写于
12月 08, 2020
作者:
M
Mara Bos
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Remove deprecated linked_list_extras methods.
上级
5e6e1e33
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
0 addition
and
62 deletion
+0
-62
library/alloc/src/collections/linked_list.rs
library/alloc/src/collections/linked_list.rs
+0
-62
未找到文件。
library/alloc/src/collections/linked_list.rs
浏览文件 @
5cab04ea
...
...
@@ -1099,68 +1099,6 @@ impl<T> ExactSizeIterator for IterMut<'_, T> {}
#[stable(feature
=
"fused"
,
since
=
"1.26.0"
)]
impl
<
T
>
FusedIterator
for
IterMut
<
'_
,
T
>
{}
impl
<
T
>
IterMut
<
'_
,
T
>
{
/// Inserts the given element just after the element most recently returned by `.next()`.
/// The inserted element does not appear in the iteration.
///
/// This method will be removed soon.
#[inline]
#[unstable(
feature
=
"linked_list_extras"
,
reason
=
"this is probably better handled by a cursor type -- we'll see"
,
issue
=
"27794"
)]
#[rustc_deprecated(
reason
=
"Deprecated in favor of CursorMut methods. This method will be removed soon."
,
since
=
"1.47.0"
)]
pub
fn
insert_next
(
&
mut
self
,
element
:
T
)
{
match
self
.head
{
// `push_back` is okay with aliasing `element` references
None
=>
self
.list
.push_back
(
element
),
Some
(
head
)
=>
unsafe
{
let
prev
=
match
head
.as_ref
()
.prev
{
// `push_front` is okay with aliasing nodes
None
=>
return
self
.list
.push_front
(
element
),
Some
(
prev
)
=>
prev
,
};
let
node
=
Some
(
Box
::
leak
(
box
Node
{
next
:
Some
(
head
),
prev
:
Some
(
prev
),
element
})
.into
(),
);
// Not creating references to entire nodes to not invalidate the
// reference to `element` we handed to the user.
(
*
prev
.as_ptr
())
.next
=
node
;
(
*
head
.as_ptr
())
.prev
=
node
;
self
.list.len
+=
1
;
},
}
}
/// Provides a reference to the next element, without changing the iterator.
///
/// This method will be removed soon.
#[inline]
#[unstable(
feature
=
"linked_list_extras"
,
reason
=
"this is probably better handled by a cursor type -- we'll see"
,
issue
=
"27794"
)]
#[rustc_deprecated(
reason
=
"Deprecated in favor of CursorMut methods. This method will be removed soon."
,
since
=
"1.47.0"
)]
pub
fn
peek_next
(
&
mut
self
)
->
Option
<&
mut
T
>
{
if
self
.len
==
0
{
None
}
else
{
unsafe
{
self
.head
.as_mut
()
.map
(|
node
|
&
mut
node
.as_mut
()
.element
)
}
}
}
}
/// A cursor over a `LinkedList`.
///
/// A `Cursor` is like an iterator, except that it can freely seek back-and-forth.
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录