You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
458 lines
61 KiB
458 lines
61 KiB
2 years ago
|
<!DOCTYPE HTML>
|
||
|
|
<html lang="zh-CN" class="sidebar-visible no-js light">
|
||
|
|
<head>
|
||
|
|
<!-- Book generated using mdBook -->
|
||
|
|
<meta charset="UTF-8">
|
||
|
|
<title>最终代码 - Rust语言圣经(Rust Course)</title>
|
||
|
|
<!-- Custom HTML head -->
|
||
|
|
<meta content="text/html; charset=utf-8" http-equiv="Content-Type">
|
||
|
|
<meta name="description" content="">
|
||
|
|
<meta name="viewport" content="width=device-width, initial-scale=1">
|
||
|
|
<meta name="theme-color" content="#ffffff" />
|
||
|
|
|
||
|
|
<link rel="icon" href="../../favicon.svg">
|
||
|
|
<link rel="shortcut icon" href="../../favicon.png">
|
||
|
|
<link rel="stylesheet" href="../../css/variables.css">
|
||
|
|
<link rel="stylesheet" href="../../css/general.css">
|
||
|
|
<link rel="stylesheet" href="../../css/chrome.css">
|
||
|
|
<link rel="stylesheet" href="../../css/print.css" media="print">
|
||
|
|
<!-- Fonts -->
|
||
|
|
<link rel="stylesheet" href="../../FontAwesome/css/font-awesome.css">
|
||
|
|
<link rel="stylesheet" href="../../fonts/fonts.css">
|
||
|
|
<!-- Highlight.js Stylesheets -->
|
||
|
|
<link rel="stylesheet" href="../../highlight.css">
|
||
|
|
<link rel="stylesheet" href="../../tomorrow-night.css">
|
||
|
|
<link rel="stylesheet" href="../../ayu-highlight.css">
|
||
|
|
|
||
|
|
<!-- Custom theme stylesheets -->
|
||
|
|
<link rel="stylesheet" href="../../theme/style.css">
|
||
|
|
</head>
|
||
|
|
<body>
|
||
|
|
<!-- Provide site root to javascript -->
|
||
|
|
<script type="text/javascript">
|
||
|
|
var path_to_root = "../../";
|
||
|
|
var default_theme = window.matchMedia("(prefers-color-scheme: dark)").matches ? "navy" : "light";
|
||
|
|
</script>
|
||
|
|
|
||
|
|
<!-- Work around some values being stored in localStorage wrapped in quotes -->
|
||
|
|
<script type="text/javascript">
|
||
|
|
try {
|
||
|
|
var theme = localStorage.getItem('mdbook-theme');
|
||
|
|
var sidebar = localStorage.getItem('mdbook-sidebar');
|
||
|
|
if (theme.startsWith('"') && theme.endsWith('"')) {
|
||
|
|
localStorage.setItem('mdbook-theme', theme.slice(1, theme.length - 1));
|
||
|
|
}
|
||
|
|
if (sidebar.startsWith('"') && sidebar.endsWith('"')) {
|
||
|
|
localStorage.setItem('mdbook-sidebar', sidebar.slice(1, sidebar.length - 1));
|
||
|
|
}
|
||
|
|
} catch (e) { }
|
||
|
|
</script>
|
||
|
|
|
||
|
|
<!-- Set the theme before any content is loaded, prevents flash -->
|
||
|
|
<script type="text/javascript">
|
||
|
|
var theme;
|
||
|
|
try { theme = localStorage.getItem('mdbook-theme'); } catch(e) { }
|
||
|
|
if (theme === null || theme === undefined) { theme = default_theme; }
|
||
|
|
var html = document.querySelector('html');
|
||
|
|
html.classList.remove('no-js')
|
||
|
|
html.classList.remove('light')
|
||
|
|
html.classList.add(theme);
|
||
|
|
html.classList.add('js');
|
||
|
|
</script>
|
||
|
|
|
||
|
|
<!-- Hide / unhide sidebar before it is displayed -->
|
||
|
|
<script type="text/javascript">
|
||
|
|
var html = document.querySelector('html');
|
||
|
|
var sidebar = 'hidden';
|
||
|
|
if (document.body.clientWidth >= 1080) {
|
||
|
|
try { sidebar = localStorage.getItem('mdbook-sidebar'); } catch(e) { }
|
||
|
|
sidebar = sidebar || 'visible';
|
||
|
|
}
|
||
|
|
html.classList.remove('sidebar-visible');
|
||
|
|
html.classList.add("sidebar-" + sidebar);
|
||
|
|
</script>
|
||
|
|
|
||
|
|
<nav id="sidebar" class="sidebar" aria-label="Table of contents">
|
||
|
|
<div class="sidebar-scrollbox">
|
||
|
|
<ol class="chapter"><li class="chapter-item affix "><a href="../../about-book.html">关于本书</a></li><li class="chapter-item affix "><a href="../../into-rust.html">进入 Rust 编程世界</a></li><li class="chapter-item affix "><a href="../../first-try/sth-you-should-not-do.html">避免从入门到放弃</a></li><li class="chapter-item affix "><a href="../../community.html">社区和锈书</a></li><li class="chapter-item affix "><li class="part-title">Rust 语言基础学习</li><li class="spacer"></li><li class="chapter-item "><a href="../../first-try/intro.html"><strong aria-hidden="true">1.</strong> 寻找牛刀，以便小试</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="../../first-try/installation.html"><strong aria-hidden="true">1.1.</strong> 安装 Rust 环境</a></li><li class="chapter-item "><a href="../../first-try/editor.html"><strong aria-hidden="true">1.2.</strong> 墙推 VSCode!</a></li><li class="chapter-item "><a href="../../first-try/cargo.html"><strong aria-hidden="true">1.3.</strong> 认识 Cargo</a></li><li class="chapter-item "><a href="../../first-try/hello-world.html"><strong aria-hidden="true">1.4.</strong> 不仅仅是 Hello world</a></li><li class="chapter-item "><a href="../../first-try/slowly-downloading.html"><strong aria-hidden="true">1.5.</strong> 下载依赖太慢了？</a></li></ol></li><li class="chapter-item "><a href="../../basic/intro.html"><strong aria-hidden="true">2.</strong> Rust 基础入门</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="../../basic/variable.html"><strong aria-hidden="true">2.1.</strong> 变量绑定与解构</a></li><li class="chapter-item "><a href="../../basic/base-type/index.html"><strong aria-hidden="true">2.2.</strong> 基本类型</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="../../basic/base-type/numbers.html"><strong aria-hidden="true">2.2.1.</strong> 数值类型</a></li><li class="chapter-item "><a href="../../basic/base-type/char-bool.html"><strong aria-hidden="true">2.2.2.</strong> 字符、布尔、单元类型</a></li><li class="chapter-item "><a href="../../basic/base-type/statement-expression.html"><strong aria-hidden="true">2.2.3.</strong> 语句与表达式</a></li><li class="chapter-item "><a href="../../basic/base-type/function.html"><strong aria-hidden="true">2.2.4.</strong> 函数</a></li></ol></li><li class="chapter-item "><a href="../../basic/ownership/index.html"><strong aria-hidden="true">2.3.</strong> 所有权和借用</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="../../basic/ownership/ownership.html"><strong aria-hidden="true">2.3.1.</strong> 所有权</a></li><li class="chapter-item "><a href="../../basic/ownership/borrowing.html"><strong aria-hidden="true">2.3.2.</strong> 引用与借用</a></li></ol></li><li class="chapter-item "><a href="../../basic/compound-type/intro.html"><strong aria-hidden="true">2.4.</strong> 复合类型</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="../../basic/compound-type/string-slice.html"><strong aria-hidden="true">2.4.1.</strong> 字符串与切片</a></li><li class="chapter-item "><a href="../../basic/compound-type/tuple.html"><strong aria-hidden="true">2.4.2.</strong> 元组</a></li><li class="chapter-item "><a href="../../basic/compound-type/struct.html"><strong aria-hidden="true">2.4.3.</strong> 结构体</a></li><li class="chapter-item "><a href="../../basic/compound-type/enum.html"><strong aria-hidden="true">2.4.4.</strong> 枚举</a></li><li class="chapter-item "><a href="../../basic/compound-type/array.html"><strong aria-hidden="true">2.4.5.</strong> 数组</a></li></ol></li><li class="chapter-item "><a href="../../basic/flow-control.html"><strong aria-hidden="true">2.5.</strong> 流程控制</a></li><li class="chapter-item "><a href="../../basic/match-pattern/intro.html"><strong aria-hidde
|
||
|
|
</div>
|
||
|
|
<div id="sidebar-resize-handle" class="sidebar-resize-handle"></div>
|
||
|
|
</nav>
|
||
|
|
|
||
|
|
<div id="page-wrapper" class="page-wrapper">
|
||
|
|
|
||
|
|
<div class="page">
|
||
|
|
<div id="menu-bar-hover-placeholder"></div>
|
||
|
|
<div id="menu-bar" class="menu-bar sticky bordered">
|
||
|
|
<div class="left-buttons">
|
||
|
|
<button id="sidebar-toggle" class="icon-button" type="button" title="Toggle Table of Contents" aria-label="Toggle Table of Contents" aria-controls="sidebar">
|
||
|
|
<i class="fa fa-bars"></i>
|
||
|
|
</button>
|
||
|
|
<button id="theme-toggle" class="icon-button" type="button" title="Change theme" aria-label="Change theme" aria-haspopup="true" aria-expanded="false" aria-controls="theme-list">
|
||
|
|
<i class="fa fa-paint-brush"></i>
|
||
|
|
</button>
|
||
|
|
<ul id="theme-list" class="theme-popup" aria-label="Themes" role="menu">
|
||
|
|
<li role="none"><button role="menuitem" class="theme" id="light">Light (default)</button></li>
|
||
|
|
<li role="none"><button role="menuitem" class="theme" id="rust">Rust</button></li>
|
||
|
|
<li role="none"><button role="menuitem" class="theme" id="coal">Coal</button></li>
|
||
|
|
<li role="none"><button role="menuitem" class="theme" id="navy">Navy</button></li>
|
||
|
|
<li role="none"><button role="menuitem" class="theme" id="ayu">Ayu</button></li>
|
||
|
|
</ul>
|
||
|
|
<button id="search-toggle" class="icon-button" type="button" title="Search. (Shortkey: s)" aria-label="Toggle Searchbar" aria-expanded="false" aria-keyshortcuts="S" aria-controls="searchbar">
|
||
|
|
<i class="fa fa-search"></i>
|
||
|
|
</button>
|
||
|
|
</div>
|
||
|
|
|
||
|
|
<h1 class="menu-title">Rust语言圣经(Rust Course)</h1>
|
||
|
|
|
||
|
|
<div class="right-buttons">
|
||
|
|
<a href="../../print.html" title="Print this book" aria-label="Print this book">
|
||
|
|
<i id="print-button" class="fa fa-print"></i>
|
||
|
|
</a>
|
||
|
|
<a href="https://github.com/sunface/rust-course" title="Git repository" aria-label="Git repository">
|
||
|
|
<i id="git-repository-button" class="fa fa-github"></i>
|
||
|
|
</a>
|
||
|
|
<a href="https://github.com/sunface/rust-course/edit/main/src/too-many-lists/deque/final-code.md" title="Suggest an edit" aria-label="Suggest an edit">
|
||
|
|
<i id="git-edit-button" class="fa fa-edit"></i>
|
||
|
|
</a>
|
||
|
|
</div>
|
||
|
|
</div>
|
||
|
|
|
||
|
|
<div id="search-wrapper" class="hidden">
|
||
|
|
<form id="searchbar-outer" class="searchbar-outer">
|
||
|
|
<input type="search" id="searchbar" name="searchbar" placeholder="Search this book ..." aria-controls="searchresults-outer" aria-describedby="searchresults-header">
|
||
|
|
</form>
|
||
|
|
<div id="searchresults-outer" class="searchresults-outer hidden">
|
||
|
|
<div id="searchresults-header" class="searchresults-header"></div>
|
||
|
|
<ul id="searchresults">
|
||
|
|
</ul>
|
||
|
|
</div>
|
||
|
|
</div>
|
||
|
|
<!-- Apply ARIA attributes after the sidebar and the sidebar toggle button are added to the DOM -->
|
||
|
|
<script type="text/javascript">
|
||
|
|
document.getElementById('sidebar-toggle').setAttribute('aria-expanded', sidebar === 'visible');
|
||
|
|
document.getElementById('sidebar').setAttribute('aria-hidden', sidebar !== 'visible');
|
||
|
|
|
||
|
|
// Get viewed page store
|
||
|
|
var viewed_key = 'mdbook-viewed';
|
||
|
|
var viewed_map = {};
|
||
|
|
try {
|
||
|
|
var viewed_storage = localStorage.getItem(viewed_key);
|
||
|
|
if (viewed_storage) {
|
||
|
|
viewed_map = JSON.parse(viewed_storage)
|
||
|
|
}
|
||
|
|
} catch (e) { }
|
||
|
|
|
||
|
|
Array.from(document.querySelectorAll('#sidebar a')).forEach(function(link) {
|
||
|
|
link.setAttribute('tabIndex', sidebar === 'visible' ? 0 : -1);
|
||
|
|
|
||
|
|
// Apply viewed style
|
||
|
|
if (viewed_map[link.pathname]) {
|
||
|
|
link.classList.add('md-viewed')
|
||
|
|
}
|
||
|
|
});
|
||
|
|
|
||
|
|
// Mark viewed after 30s
|
||
|
|
setTimeout(function() {
|
||
|
|
viewed_map[location.pathname] = 1;
|
||
|
|
localStorage.setItem(viewed_key, JSON.stringify(viewed_map));
|
||
|
|
}, 30000)
|
||
|
|
</script>
|
||
|
|
|
||
|
|
<div id="content" class="content">
|
||
|
|
<!-- Page table of contents -->
|
||
|
|
<div class="sidetoc"><nav class="pagetoc"></nav></div>
|
||
|
|
<main>
|
||
|
|
<h1 id="最终代码"><a class="header" href="#最终代码">最终代码</a></h1>
|
||
|
|
<p>这一章真不好写( 也很难翻译... )，最终我们实现了一个 100% 安全但是功能残缺的双向链表。</p>
|
||
|
|
<p>同时在实现中，还有大量 <code>Rc</code> 和 <code>RefCell</code> 引起的运行时检查，最终会影响链表的性能。整个双向链表实现史就是一部别名和所有权的奋斗史。</p>
|
||
|
|
<p>总之，不管爱与不爱，它就这样了，特别是如果我们不在意内部的细节暴露给外面用户时。</p>
|
||
|
|
<p>而从下一章开始，我们将实现一个真正能够全盘掌控的链表，当然...通过 unsafe 代码实现！</p>
|
||
|
|
<pre><pre class="playground"><code class="language-rust edition2021">
|
||
|
|
#![allow(unused)]
|
||
|
|
fn main() {
|
||
|
|
use std::rc::Rc;
|
||
|
|
use std::cell::{Ref, RefMut, RefCell};
|
||
|
|
|
||
|
|
pub struct List<T> {
|
||
|
|
head: Link<T>,
|
||
|
|
tail: Link<T>,
|
||
|
|
}
|
||
|
|
|
||
|
|
type Link<T> = Option<Rc<RefCell<Node<T>>>>;
|
||
|
|
|
||
|
|
struct Node<T> {
|
||
|
|
elem: T,
|
||
|
|
next: Link<T>,
|
||
|
|
prev: Link<T>,
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
impl<T> Node<T> {
|
||
|
|
fn new(elem: T) -> Rc<RefCell<Self>> {
|
||
|
|
Rc::new(RefCell::new(Node {
|
||
|
|
elem: elem,
|
||
|
|
prev: None,
|
||
|
|
next: None,
|
||
|
|
}))
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
impl<T> List<T> {
|
||
|
|
pub fn new() -> Self {
|
||
|
|
List { head: None, tail: None }
|
||
|
|
}
|
||
|
|
|
||
|
|
pub fn push_front(&mut self, elem: T) {
|
||
|
|
let new_head = Node::new(elem);
|
||
|
|
match self.head.take() {
|
||
|
|
Some(old_head) => {
|
||
|
|
old_head.borrow_mut().prev = Some(new_head.clone());
|
||
|
|
new_head.borrow_mut().next = Some(old_head);
|
||
|
|
self.head = Some(new_head);
|
||
|
|
}
|
||
|
|
None => {
|
||
|
|
self.tail = Some(new_head.clone());
|
||
|
|
self.head = Some(new_head);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
pub fn push_back(&mut self, elem: T) {
|
||
|
|
let new_tail = Node::new(elem);
|
||
|
|
match self.tail.take() {
|
||
|
|
Some(old_tail) => {
|
||
|
|
old_tail.borrow_mut().next = Some(new_tail.clone());
|
||
|
|
new_tail.borrow_mut().prev = Some(old_tail);
|
||
|
|
self.tail = Some(new_tail);
|
||
|
|
}
|
||
|
|
None => {
|
||
|
|
self.head = Some(new_tail.clone());
|
||
|
|
self.tail = Some(new_tail);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
pub fn pop_back(&mut self) -> Option<T> {
|
||
|
|
self.tail.take().map(|old_tail| {
|
||
|
|
match old_tail.borrow_mut().prev.take() {
|
||
|
|
Some(new_tail) => {
|
||
|
|
new_tail.borrow_mut().next.take();
|
||
|
|
self.tail = Some(new_tail);
|
||
|
|
}
|
||
|
|
None => {
|
||
|
|
self.head.take();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
Rc::try_unwrap(old_tail).ok().unwrap().into_inner().elem
|
||
|
|
})
|
||
|
|
}
|
||
|
|
|
||
|
|
pub fn pop_front(&mut self) -> Option<T> {
|
||
|
|
self.head.take().map(|old_head| {
|
||
|
|
match old_head.borrow_mut().next.take() {
|
||
|
|
Some(new_head) => {
|
||
|
|
new_head.borrow_mut().prev.take();
|
||
|
|
self.head = Some(new_head);
|
||
|
|
}
|
||
|
|
None => {
|
||
|
|
self.tail.take();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
Rc::try_unwrap(old_head).ok().unwrap().into_inner().elem
|
||
|
|
})
|
||
|
|
}
|
||
|
|
|
||
|
|
pub fn peek_front(&self) -> Option<Ref<T>> {
|
||
|
|
self.head.as_ref().map(|node| {
|
||
|
|
Ref::map(node.borrow(), |node| &node.elem)
|
||
|
|
})
|
||
|
|
}
|
||
|
|
|
||
|
|
pub fn peek_back(&self) -> Option<Ref<T>> {
|
||
|
|
self.tail.as_ref().map(|node| {
|
||
|
|
Ref::map(node.borrow(), |node| &node.elem)
|
||
|
|
})
|
||
|
|
}
|
||
|
|
|
||
|
|
pub fn peek_back_mut(&mut self) -> Option<RefMut<T>> {
|
||
|
|
self.tail.as_ref().map(|node| {
|
||
|
|
RefMut::map(node.borrow_mut(), |node| &mut node.elem)
|
||
|
|
})
|
||
|
|
}
|
||
|
|
|
||
|
|
pub fn peek_front_mut(&mut self) -> Option<RefMut<T>> {
|
||
|
|
self.head.as_ref().map(|node| {
|
||
|
|
RefMut::map(node.borrow_mut(), |node| &mut node.elem)
|
||
|
|
})
|
||
|
|
}
|
||
|
|
|
||
|
|
pub fn into_iter(self) -> IntoIter<T> {
|
||
|
|
IntoIter(self)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
impl<T> Drop for List<T> {
|
||
|
|
fn drop(&mut self) {
|
||
|
|
while self.pop_front().is_some() {}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
pub struct IntoIter<T>(List<T>);
|
||
|
|
|
||
|
|
impl<T> Iterator for IntoIter<T> {
|
||
|
|
type Item = T;
|
||
|
|
|
||
|
|
fn next(&mut self) -> Option<T> {
|
||
|
|
self.0.pop_front()
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
impl<T> DoubleEndedIterator for IntoIter<T> {
|
||
|
|
fn next_back(&mut self) -> Option<T> {
|
||
|
|
self.0.pop_back()
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
#[cfg(test)]
|
||
|
|
mod test {
|
||
|
|
use super::List;
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn basics() {
|
||
|
|
let mut list = List::new();
|
||
|
|
|
||
|
|
// Check empty list behaves right
|
||
|
|
assert_eq!(list.pop_front(), None);
|
||
|
|
|
||
|
|
// Populate list
|
||
|
|
list.push_front(1);
|
||
|
|
list.push_front(2);
|
||
|
|
list.push_front(3);
|
||
|
|
|
||
|
|
// Check normal removal
|
||
|
|
assert_eq!(list.pop_front(), Some(3));
|
||
|
|
assert_eq!(list.pop_front(), Some(2));
|
||
|
|
|
||
|
|
// Push some more just to make sure nothing's corrupted
|
||
|
|
list.push_front(4);
|
||
|
|
list.push_front(5);
|
||
|
|
|
||
|
|
// Check normal removal
|
||
|
|
assert_eq!(list.pop_front(), Some(5));
|
||
|
|
assert_eq!(list.pop_front(), Some(4));
|
||
|
|
|
||
|
|
// Check exhaustion
|
||
|
|
assert_eq!(list.pop_front(), Some(1));
|
||
|
|
assert_eq!(list.pop_front(), None);
|
||
|
|
|
||
|
|
// ---- back -----
|
||
|
|
|
||
|
|
// Check empty list behaves right
|
||
|
|
assert_eq!(list.pop_back(), None);
|
||
|
|
|
||
|
|
// Populate list
|
||
|
|
list.push_back(1);
|
||
|
|
list.push_back(2);
|
||
|
|
list.push_back(3);
|
||
|
|
|
||
|
|
// Check normal removal
|
||
|
|
assert_eq!(list.pop_back(), Some(3));
|
||
|
|
assert_eq!(list.pop_back(), Some(2));
|
||
|
|
|
||
|
|
// Push some more just to make sure nothing's corrupted
|
||
|
|
list.push_back(4);
|
||
|
|
list.push_back(5);
|
||
|
|
|
||
|
|
// Check normal removal
|
||
|
|
assert_eq!(list.pop_back(), Some(5));
|
||
|
|
assert_eq!(list.pop_back(), Some(4));
|
||
|
|
|
||
|
|
// Check exhaustion
|
||
|
|
assert_eq!(list.pop_back(), Some(1));
|
||
|
|
assert_eq!(list.pop_back(), None);
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn peek() {
|
||
|
|
let mut list = List::new();
|
||
|
|
assert!(list.peek_front().is_none());
|
||
|
|
assert!(list.peek_back().is_none());
|
||
|
|
assert!(list.peek_front_mut().is_none());
|
||
|
|
assert!(list.peek_back_mut().is_none());
|
||
|
|
|
||
|
|
list.push_front(1); list.push_front(2); list.push_front(3);
|
||
|
|
|
||
|
|
assert_eq!(&*list.peek_front().unwrap(), &3);
|
||
|
|
assert_eq!(&mut *list.peek_front_mut().unwrap(), &mut 3);
|
||
|
|
assert_eq!(&*list.peek_back().unwrap(), &1);
|
||
|
|
assert_eq!(&mut *list.peek_back_mut().unwrap(), &mut 1);
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn into_iter() {
|
||
|
|
let mut list = List::new();
|
||
|
|
list.push_front(1); list.push_front(2); list.push_front(3);
|
||
|
|
|
||
|
|
let mut iter = list.into_iter();
|
||
|
|
assert_eq!(iter.next(), Some(3));
|
||
|
|
assert_eq!(iter.next_back(), Some(1));
|
||
|
|
assert_eq!(iter.next(), Some(2));
|
||
|
|
assert_eq!(iter.next_back(), None);
|
||
|
|
assert_eq!(iter.next(), None);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
</code></pre></pre>
|
||
|
|
|
||
|
|
<div id="giscus-container"></div>
|
||
|
|
</main>
|
||
|
|
|
||
|
|
<nav class="nav-wrapper" aria-label="Page navigation">
|
||
|
|
<!-- Mobile navigation buttons -->
|
||
|
|
<a rel="prev" href="../../too-many-lists/deque/iterator.html" class="mobile-nav-chapters previous" title="Previous chapter" aria-label="Previous chapter" aria-keyshortcuts="Left">
|
||
|
|
<i class="fa fa-angle-left"></i>
|
||
|
|
</a>
|
||
|
|
<a rel="next" href="../../too-many-lists/unsafe-queue/intro.html" class="mobile-nav-chapters next" title="Next chapter" aria-label="Next chapter" aria-keyshortcuts="Right">
|
||
|
|
<i class="fa fa-angle-right"></i>
|
||
|
|
</a>
|
||
|
|
<div style="clear: both"></div>
|
||
|
|
</nav>
|
||
|
|
</div>
|
||
|
|
</div>
|
||
|
|
|
||
|
|
<nav class="nav-wide-wrapper" aria-label="Page navigation">
|
||
|
|
<a rel="prev" href="../../too-many-lists/deque/iterator.html" class="nav-chapters previous" title="Previous chapter" aria-label="Previous chapter" aria-keyshortcuts="Left">
|
||
|
|
<i class="fa fa-angle-left"></i>
|
||
|
|
</a>
|
||
|
|
<a rel="next" href="../../too-many-lists/unsafe-queue/intro.html" class="nav-chapters next" title="Next chapter" aria-label="Next chapter" aria-keyshortcuts="Right">
|
||
|
|
<i class="fa fa-angle-right"></i>
|
||
|
|
</a>
|
||
|
|
</nav>
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
<script type="text/javascript">
|
||
|
|
window.playground_copyable = true;
|
||
|
|
</script>
|
||
|
|
<script src="../../ace.js" type="text/javascript" charset="utf-8"></script>
|
||
|
|
<script src="../../editor.js" type="text/javascript" charset="utf-8"></script>
|
||
|
|
<script src="../../mode-rust.js" type="text/javascript" charset="utf-8"></script>
|
||
|
|
<script src="../../theme-dawn.js" type="text/javascript" charset="utf-8"></script>
|
||
|
|
<script src="../../theme-tomorrow_night.js" type="text/javascript" charset="utf-8"></script>
|
||
|
|
<script src="../../elasticlunr.min.js" type="text/javascript" charset="utf-8"></script>
|
||
|
|
<script src="../../mark.min.js" type="text/javascript" charset="utf-8"></script>
|
||
|
|
<script src="../../searcher.js" type="text/javascript" charset="utf-8"></script>
|
||
|
|
<script src="../../clipboard.min.js" type="text/javascript" charset="utf-8"></script>
|
||
|
|
<script src="../../highlight.js" type="text/javascript" charset="utf-8"></script>
|
||
|
|
<script src="../../book.js" type="text/javascript" charset="utf-8"></script>
|
||
|
|
<script type="text/javascript" charset="utf-8">
|
||
|
|
var pagePath = "too-many-lists/deque/final-code.md"
|
||
|
|
</script>
|
||
|
|
|
||
|
|
|
||
|
|
<!-- Custom JS scripts -->
|
||
|
|
<script type="text/javascript" src="../../assets/custom.js"></script>
|
||
|
|
<script type="text/javascript" src="../../assets/bigPicture.js"></script>
|
||
|
|
</body>
|
||
|
|
</html>
|