|
|
<!DOCTYPE HTML>
|
|
|
<html lang="zh-CN" class="light sidebar-visible" dir="ltr">
|
|
|
<head>
|
|
|
<!-- Book generated using mdBook -->
|
|
|
<meta charset="UTF-8">
|
|
|
<title>测试游标 - Rust语言圣经(Rust Course)</title>
|
|
|
|
|
|
|
|
|
<!-- Custom HTML head -->
|
|
|
|
|
|
<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" id="highlight-css" href="../../highlight.css">
|
|
|
<link rel="stylesheet" id="tomorrow-night-css" href="../../tomorrow-night.css">
|
|
|
<link rel="stylesheet" id="ayu-highlight-css" href="../../ayu-highlight.css">
|
|
|
|
|
|
<!-- Custom theme stylesheets -->
|
|
|
<link rel="stylesheet" href="../../theme/style.css">
|
|
|
|
|
|
|
|
|
<!-- Provide site root and default themes to javascript -->
|
|
|
<script>
|
|
|
const path_to_root = "../../";
|
|
|
const default_light_theme = "light";
|
|
|
const default_dark_theme = "navy";
|
|
|
</script>
|
|
|
<!-- Start loading toc.js asap -->
|
|
|
<script src="../../toc.js"></script>
|
|
|
</head>
|
|
|
<body>
|
|
|
<div id="body-container">
|
|
|
<!-- Work around some values being stored in localStorage wrapped in quotes -->
|
|
|
<script>
|
|
|
try {
|
|
|
let theme = localStorage.getItem('mdbook-theme');
|
|
|
let 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>
|
|
|
const default_theme = window.matchMedia("(prefers-color-scheme: dark)").matches ? default_dark_theme : default_light_theme;
|
|
|
let theme;
|
|
|
try { theme = localStorage.getItem('mdbook-theme'); } catch(e) { }
|
|
|
if (theme === null || theme === undefined) { theme = default_theme; }
|
|
|
const html = document.documentElement;
|
|
|
html.classList.remove('light')
|
|
|
html.classList.add(theme);
|
|
|
html.classList.add("js");
|
|
|
</script>
|
|
|
|
|
|
<input type="checkbox" id="sidebar-toggle-anchor" class="hidden">
|
|
|
|
|
|
<!-- Hide / unhide sidebar before it is displayed -->
|
|
|
<script>
|
|
|
let sidebar = null;
|
|
|
const sidebar_toggle = document.getElementById("sidebar-toggle-anchor");
|
|
|
if (document.body.clientWidth >= 1080) {
|
|
|
try { sidebar = localStorage.getItem('mdbook-sidebar'); } catch(e) { }
|
|
|
sidebar = sidebar || 'visible';
|
|
|
} else {
|
|
|
sidebar = 'hidden';
|
|
|
}
|
|
|
sidebar_toggle.checked = sidebar === 'visible';
|
|
|
html.classList.remove('sidebar-visible');
|
|
|
html.classList.add("sidebar-" + sidebar);
|
|
|
</script>
|
|
|
|
|
|
<nav id="sidebar" class="sidebar" aria-label="Table of contents">
|
|
|
<!-- populated by js -->
|
|
|
<mdbook-sidebar-scrollbox class="sidebar-scrollbox"></mdbook-sidebar-scrollbox>
|
|
|
<noscript>
|
|
|
<iframe class="sidebar-iframe-outer" src="../../toc.html"></iframe>
|
|
|
</noscript>
|
|
|
<div id="sidebar-resize-handle" class="sidebar-resize-handle">
|
|
|
<div class="sidebar-resize-indicator"></div>
|
|
|
</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">
|
|
|
<div class="left-buttons">
|
|
|
<label id="sidebar-toggle" class="icon-button" for="sidebar-toggle-anchor" title="Toggle Table of Contents" aria-label="Toggle Table of Contents" aria-controls="sidebar">
|
|
|
<i class="fa fa-bars"></i>
|
|
|
</label>
|
|
|
<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="default_theme">Auto</button></li>
|
|
|
<li role="none"><button role="menuitem" class="theme" id="light">Light</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/production-unsafe-deque/testing-cursors.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>
|
|
|
document.getElementById('sidebar-toggle').setAttribute('aria-expanded', sidebar === 'visible');
|
|
|
document.getElementById('sidebar').setAttribute('aria-hidden', sidebar !== 'visible');
|
|
|
Array.from(document.querySelectorAll('#sidebar a')).forEach(function(link) {
|
|
|
link.setAttribute('tabIndex', sidebar === 'visible' ? 0 : -1);
|
|
|
});
|
|
|
</script>
|
|
|
|
|
|
<div id="content" class="content">
|
|
|
<main>
|
|
|
<h1 id="testing-cursors"><a class="header" href="#testing-cursors">Testing Cursors</a></h1>
|
|
|
<p>是时候找出我在上一节中犯了多少令人尴尬的错误了！</p>
|
|
|
<p>哦，天哪，我们的 API 既不像标准版，也不像旧版。好吧，那我打算从这两个地方拼凑一些东西吧。是的，让我们 "借用 " 标准版中的这些测试：</p>
|
|
|
<pre><pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span> #[test]
|
|
|
fn test_cursor_move_peek() {
|
|
|
let mut m: LinkedList<u32> = LinkedList::new();
|
|
|
m.extend([1, 2, 3, 4, 5, 6]);
|
|
|
let mut cursor = m.cursor_mut();
|
|
|
cursor.move_next();
|
|
|
assert_eq!(cursor.current(), Some(&mut 1));
|
|
|
assert_eq!(cursor.peek_next(), Some(&mut 2));
|
|
|
assert_eq!(cursor.peek_prev(), None);
|
|
|
assert_eq!(cursor.index(), Some(0));
|
|
|
cursor.move_prev();
|
|
|
assert_eq!(cursor.current(), None);
|
|
|
assert_eq!(cursor.peek_next(), Some(&mut 1));
|
|
|
assert_eq!(cursor.peek_prev(), Some(&mut 6));
|
|
|
assert_eq!(cursor.index(), None);
|
|
|
cursor.move_next();
|
|
|
cursor.move_next();
|
|
|
assert_eq!(cursor.current(), Some(&mut 2));
|
|
|
assert_eq!(cursor.peek_next(), Some(&mut 3));
|
|
|
assert_eq!(cursor.peek_prev(), Some(&mut 1));
|
|
|
assert_eq!(cursor.index(), Some(1));
|
|
|
|
|
|
let mut cursor = m.cursor_mut();
|
|
|
cursor.move_prev();
|
|
|
assert_eq!(cursor.current(), Some(&mut 6));
|
|
|
assert_eq!(cursor.peek_next(), None);
|
|
|
assert_eq!(cursor.peek_prev(), Some(&mut 5));
|
|
|
assert_eq!(cursor.index(), Some(5));
|
|
|
cursor.move_next();
|
|
|
assert_eq!(cursor.current(), None);
|
|
|
assert_eq!(cursor.peek_next(), Some(&mut 1));
|
|
|
assert_eq!(cursor.peek_prev(), Some(&mut 6));
|
|
|
assert_eq!(cursor.index(), None);
|
|
|
cursor.move_prev();
|
|
|
cursor.move_prev();
|
|
|
assert_eq!(cursor.current(), Some(&mut 5));
|
|
|
assert_eq!(cursor.peek_next(), Some(&mut 6));
|
|
|
assert_eq!(cursor.peek_prev(), Some(&mut 4));
|
|
|
assert_eq!(cursor.index(), Some(4));
|
|
|
}
|
|
|
|
|
|
#[test]
|
|
|
fn test_cursor_mut_insert() {
|
|
|
let mut m: LinkedList<u32> = LinkedList::new();
|
|
|
m.extend([1, 2, 3, 4, 5, 6]);
|
|
|
let mut cursor = m.cursor_mut();
|
|
|
cursor.move_next();
|
|
|
cursor.splice_before(Some(7).into_iter().collect());
|
|
|
cursor.splice_after(Some(8).into_iter().collect());
|
|
|
// check_links(&m);
|
|
|
assert_eq!(m.iter().cloned().collect::<Vec<_>>(), &[7, 1, 8, 2, 3, 4, 5, 6]);
|
|
|
let mut cursor = m.cursor_mut();
|
|
|
cursor.move_next();
|
|
|
cursor.move_prev();
|
|
|
cursor.splice_before(Some(9).into_iter().collect());
|
|
|
cursor.splice_after(Some(10).into_iter().collect());
|
|
|
check_links(&m);
|
|
|
assert_eq!(m.iter().cloned().collect::<Vec<_>>(), &[10, 7, 1, 8, 2, 3, 4, 5, 6, 9]);
|
|
|
|
|
|
/* remove_current not impl'd
|
|
|
let mut cursor = m.cursor_mut();
|
|
|
cursor.move_next();
|
|
|
cursor.move_prev();
|
|
|
assert_eq!(cursor.remove_current(), None);
|
|
|
cursor.move_next();
|
|
|
cursor.move_next();
|
|
|
assert_eq!(cursor.remove_current(), Some(7));
|
|
|
cursor.move_prev();
|
|
|
cursor.move_prev();
|
|
|
cursor.move_prev();
|
|
|
assert_eq!(cursor.remove_current(), Some(9));
|
|
|
cursor.move_next();
|
|
|
assert_eq!(cursor.remove_current(), Some(10));
|
|
|
check_links(&m);
|
|
|
assert_eq!(m.iter().cloned().collect::<Vec<_>>(), &[1, 8, 2, 3, 4, 5, 6]);
|
|
|
*/
|
|
|
|
|
|
let mut m: LinkedList<u32> = LinkedList::new();
|
|
|
m.extend([1, 8, 2, 3, 4, 5, 6]);
|
|
|
let mut cursor = m.cursor_mut();
|
|
|
cursor.move_next();
|
|
|
let mut p: LinkedList<u32> = LinkedList::new();
|
|
|
p.extend([100, 101, 102, 103]);
|
|
|
let mut q: LinkedList<u32> = LinkedList::new();
|
|
|
q.extend([200, 201, 202, 203]);
|
|
|
cursor.splice_after(p);
|
|
|
cursor.splice_before(q);
|
|
|
check_links(&m);
|
|
|
assert_eq!(
|
|
|
m.iter().cloned().collect::<Vec<_>>(),
|
|
|
&[200, 201, 202, 203, 1, 100, 101, 102, 103, 8, 2, 3, 4, 5, 6]
|
|
|
);
|
|
|
let mut cursor = m.cursor_mut();
|
|
|
cursor.move_next();
|
|
|
cursor.move_prev();
|
|
|
let tmp = cursor.split_before();
|
|
|
assert_eq!(m.into_iter().collect::<Vec<_>>(), &[]);
|
|
|
m = tmp;
|
|
|
let mut cursor = m.cursor_mut();
|
|
|
cursor.move_next();
|
|
|
cursor.move_next();
|
|
|
cursor.move_next();
|
|
|
cursor.move_next();
|
|
|
cursor.move_next();
|
|
|
cursor.move_next();
|
|
|
cursor.move_next();
|
|
|
let tmp = cursor.split_after();
|
|
|
assert_eq!(tmp.into_iter().collect::<Vec<_>>(), &[102, 103, 8, 2, 3, 4, 5, 6]);
|
|
|
check_links(&m);
|
|
|
assert_eq!(m.iter().cloned().collect::<Vec<_>>(), &[200, 201, 202, 203, 1, 100, 101]);
|
|
|
}
|
|
|
|
|
|
fn check_links<T>(_list: &LinkedList<T>) {
|
|
|
// would be good to do this!
|
|
|
}
|
|
|
<span class="boring">}</span></code></pre></pre>
|
|
|
<p>见证奇迹的时候！</p>
|
|
|
<pre><code class="language-text">cargo test
|
|
|
|
|
|
Compiling linked-list v0.0.3
|
|
|
Finished test [unoptimized + debuginfo] target(s) in 1.03s
|
|
|
Running unittests src\lib.rs
|
|
|
|
|
|
running 14 tests
|
|
|
test test::test_basic_front ... ok
|
|
|
test test::test_basic ... ok
|
|
|
test test::test_debug ... ok
|
|
|
test test::test_iterator_mut_double_end ... ok
|
|
|
test test::test_ord ... ok
|
|
|
test test::test_cursor_move_peek ... FAILED
|
|
|
test test::test_cursor_mut_insert ... FAILED
|
|
|
test test::test_iterator ... ok
|
|
|
test test::test_mut_iter ... ok
|
|
|
test test::test_eq ... ok
|
|
|
test test::test_rev_iter ... ok
|
|
|
test test::test_iterator_double_end ... ok
|
|
|
test test::test_hashmap ... ok
|
|
|
test test::test_ord_nan ... ok
|
|
|
|
|
|
failures:
|
|
|
|
|
|
---- test::test_cursor_move_peek stdout ----
|
|
|
thread 'test::test_cursor_move_peek' panicked at 'assertion failed: `(left == right)`
|
|
|
left: `None`,
|
|
|
right: `Some(1)`', src\lib.rs:1079:9
|
|
|
note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace
|
|
|
|
|
|
---- test::test_cursor_mut_insert stdout ----
|
|
|
thread 'test::test_cursor_mut_insert' panicked at 'assertion failed: `(left == right)`
|
|
|
left: `[200, 201, 202, 203, 10, 100, 101, 102, 103, 7, 1, 8, 2, 3, 4, 5, 6, 9]`,
|
|
|
right: `[200, 201, 202, 203, 1, 100, 101, 102, 103, 8, 2, 3, 4, 5, 6]`', src\lib.rs:1153:9
|
|
|
|
|
|
|
|
|
failures:
|
|
|
test::test_cursor_move_peek
|
|
|
test::test_cursor_mut_insert
|
|
|
|
|
|
test result: FAILED. 12 passed; 2 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
|
|
|
</code></pre>
|
|
|
<p>我得承认，我在这里有些自负，希望自己能成功。这就是我们写测试的原因（但也许我只是在移植测试时做得不好？）</p>
|
|
|
<p>第一次失败是什么？</p>
|
|
|
<pre><pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>let mut m: LinkedList<u32> = LinkedList::new();
|
|
|
m.extend([1, 2, 3, 4, 5, 6]);
|
|
|
let mut cursor = m.cursor_mut();
|
|
|
|
|
|
cursor.move_next();
|
|
|
assert_eq!(cursor.current(), Some(&mut 1));
|
|
|
assert_eq!(cursor.peek_next(), Some(&mut 2));
|
|
|
assert_eq!(cursor.peek_prev(), None);
|
|
|
assert_eq!(cursor.index(), Some(0));
|
|
|
|
|
|
cursor.move_prev();
|
|
|
assert_eq!(cursor.current(), None);
|
|
|
assert_eq!(cursor.peek_next(), Some(&mut 1)); // DIES HERE
|
|
|
<span class="boring">}</span></code></pre></pre>
|
|
|
<pre><pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>pub fn peek_next(&mut self) -> Option<&mut T> {
|
|
|
unsafe {
|
|
|
self.cur
|
|
|
.and_then(|node| (*node.as_ptr()).back)
|
|
|
.map(|node| &mut (*node.as_ptr()).elem)
|
|
|
}
|
|
|
}
|
|
|
<span class="boring">}</span></code></pre></pre>
|
|
|
<p>就是这错了。如果 <code>self.cur</code> 是 None, 我们不应该就这样放弃，我们还需要检查 self.list.front，因为我们在幽灵节点上！因此，我们只需在链中添加一个 or_else：</p>
|
|
|
<pre><pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>pub fn peek_next(&mut self) -> Option<&mut T> {
|
|
|
unsafe {
|
|
|
self.cur
|
|
|
.and_then(|node| (*node.as_ptr()).back)
|
|
|
.or_else(|| self.list.front)
|
|
|
.map(|node| &mut (*node.as_ptr()).elem)
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn peek_prev(&mut self) -> Option<&mut T> {
|
|
|
unsafe {
|
|
|
self.cur
|
|
|
.and_then(|node| (*node.as_ptr()).front)
|
|
|
.or_else(|| self.list.back)
|
|
|
.map(|node| &mut (*node.as_ptr()).elem)
|
|
|
}
|
|
|
}
|
|
|
<span class="boring">}</span></code></pre></pre>
|
|
|
<p>这样就修复好了吗？</p>
|
|
|
<pre><code class="language-text">---- test::test_cursor_move_peek stdout ----
|
|
|
thread 'test::test_cursor_move_peek' panicked at 'assertion failed: `(left == right)`
|
|
|
left: `Some(6)`,
|
|
|
right: `None`', src\lib.rs:1078:9
|
|
|
</code></pre>
|
|
|
<p>又错了。好吧，显然这比我想象的要难得多。盲目地把这些情况串联起来简直是一场灾难，让我们对幽灵节点与非幽灵节点的情况做不同的判断吧：</p>
|
|
|
<pre><pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>pub fn peek_next(&mut self) -> Option<&mut T> {
|
|
|
unsafe {
|
|
|
let next = if let Some(cur) = self.cur {
|
|
|
// Normal case, try to follow the cur node's back pointer
|
|
|
(*cur.as_ptr()).back
|
|
|
} else {
|
|
|
// Ghost case, try to use the list's front pointer
|
|
|
self.list.front
|
|
|
};
|
|
|
|
|
|
// Yield the element if the next node exists
|
|
|
next.map(|node| &mut (*node.as_ptr()).elem)
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn peek_prev(&mut self) -> Option<&mut T> {
|
|
|
unsafe {
|
|
|
let prev = if let Some(cur) = self.cur {
|
|
|
// Normal case, try to follow the cur node's front pointer
|
|
|
(*cur.as_ptr()).front
|
|
|
} else {
|
|
|
// Ghost case, try to use the list's back pointer
|
|
|
self.list.back
|
|
|
};
|
|
|
|
|
|
// Yield the element if the prev node exists
|
|
|
prev.map(|node| &mut (*node.as_ptr()).elem)
|
|
|
}
|
|
|
}
|
|
|
<span class="boring">}</span></code></pre></pre>
|
|
|
<p>我对这一次充满信心！</p>
|
|
|
<pre><pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span>
|
|
|
<span class="boring">fn main() {
|
|
|
</span> cargo test
|
|
|
Compiling linked-list v0.0.3
|
|
|
Finished test [unoptimized + debuginfo] target(s) in 0.70s
|
|
|
Running unittests src\lib.rs
|
|
|
|
|
|
running 14 tests
|
|
|
test test::test_basic_front ... ok
|
|
|
test test::test_basic ... ok
|
|
|
test test::test_cursor_move_peek ... ok
|
|
|
test test::test_eq ... ok
|
|
|
test test::test_cursor_mut_insert ... ok
|
|
|
test test::test_iterator ... ok
|
|
|
test test::test_iterator_double_end ... ok
|
|
|
test test::test_ord_nan ... ok
|
|
|
test test::test_mut_iter ... ok
|
|
|
test test::test_hashmap ... ok
|
|
|
test test::test_debug ... ok
|
|
|
test test::test_ord ... ok
|
|
|
test test::test_iterator_mut_double_end ... ok
|
|
|
test test::test_rev_iter ... ok
|
|
|
|
|
|
test result: ok. 14 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
|
|
|
|
|
|
Doc-tests linked-list
|
|
|
|
|
|
running 1 test
|
|
|
test src\lib.rs - assert_properties::iter_mut_invariant (line 803) - compile fail ... ok
|
|
|
|
|
|
test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.12s
|
|
|
<span class="boring">}</span></code></pre></pre>
|
|
|
<p>嘿嘿，看看这个......好吧，现在我开始疑神疑鬼了。让我们正确填写 check_links，并在 miri 下进行测试：</p>
|
|
|
<pre><pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>fn check_links<T: Eq + std::fmt::Debug>(list: &LinkedList<T>) {
|
|
|
let from_front: Vec<_> = list.iter().collect();
|
|
|
let from_back: Vec<_> = list.iter().rev().collect();
|
|
|
let re_reved: Vec<_> = from_back.into_iter().rev().collect();
|
|
|
|
|
|
assert_eq!(from_front, re_reved);
|
|
|
}
|
|
|
<span class="boring">}</span></code></pre></pre>
|
|
|
<pre><code class="language-text">$env:MIRIFLAGS="-Zmiri-tag-raw-pointers"
|
|
|
cargo miri test
|
|
|
Compiling linked-list v0.0.3
|
|
|
Finished test [unoptimized + debuginfo] target(s) in 0.25s
|
|
|
Running unittests src\lib.rs
|
|
|
|
|
|
running 14 tests
|
|
|
test test::test_basic ... ok
|
|
|
test test::test_basic_front ... ok
|
|
|
test test::test_cursor_move_peek ... ok
|
|
|
test test::test_cursor_mut_insert ... ok
|
|
|
test test::test_debug ... ok
|
|
|
test test::test_eq ... ok
|
|
|
test test::test_hashmap ... ok
|
|
|
test test::test_iterator ... ok
|
|
|
test test::test_iterator_double_end ... ok
|
|
|
test test::test_iterator_mut_double_end ... ok
|
|
|
test test::test_mut_iter ... ok
|
|
|
test test::test_ord ... ok
|
|
|
test test::test_ord_nan ... ok
|
|
|
test test::test_rev_iter ... ok
|
|
|
|
|
|
test result: ok. 14 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out
|
|
|
|
|
|
Doc-tests linked-list
|
|
|
|
|
|
running 1 test
|
|
|
test src\lib.rs - assert_properties::iter_mut_invariant (line 803) - compile fail ... ok
|
|
|
|
|
|
test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.10s
|
|
|
</code></pre>
|
|
|
<p>完成。</p>
|
|
|
<p>我们成功了 我们做出了一个具有生产质量的 LinkedList，其功能与 std 中的 LinkedList 基本相同。我们是否在这里或那里缺少了一些小的便利方法？当然有。我会把它们添加到最终发布的版本中吗？也许会！</p>
|
|
|
<p>但是，我已经非常累了。</p>
|
|
|
<p>所以。我们赢了</p>
|
|
|
<p>等等 我们正在生产质量。好吧，最后一个步骤： clippy。</p>
|
|
|
<pre><code class="language-text">cargo clippy
|
|
|
|
|
|
cargo clippy
|
|
|
Checking linked-list v0.0.3 (C:\Users\ninte\dev\contain\linked-list)
|
|
|
warning: redundant pattern matching, consider using `is_some()`
|
|
|
--> src\lib.rs:189:19
|
|
|
|
|
|
|
189 | while let Some(_) = self.pop_front() { }
|
|
|
| ----------^^^^^^^------------------- help: try this: `while self.pop_front().is_some()`
|
|
|
|
|
|
|
= note: `#[warn(clippy::redundant_pattern_matching)]` on by default
|
|
|
= note: this will change drop order of the result, as well as all temporaries
|
|
|
= note: add `#[allow(clippy::redundant_pattern_matching)]` if this is important
|
|
|
= help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#redundant_pattern_matching
|
|
|
|
|
|
warning: method `into_iter` can be confused for the standard trait method `std::iter::IntoIterator::into_iter`
|
|
|
--> src\lib.rs:210:5
|
|
|
|
|
|
|
210 | / pub fn into_iter(self) -> IntoIter<T> {
|
|
|
211 | | IntoIter {
|
|
|
212 | | list: self
|
|
|
213 | | }
|
|
|
214 | | }
|
|
|
| |_____^
|
|
|
|
|
|
|
= note: `#[warn(clippy::should_implement_trait)]` on by default
|
|
|
= help: consider implementing the trait `std::iter::IntoIterator` or choosing a less ambiguous method name
|
|
|
= help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#should_implement_trait
|
|
|
|
|
|
warning: redundant pattern matching, consider using `is_some()`
|
|
|
--> src\lib.rs:228:19
|
|
|
|
|
|
|
228 | while let Some(_) = self.pop_front() { }
|
|
|
| ----------^^^^^^^------------------- help: try this: `while self.pop_front().is_some()`
|
|
|
|
|
|
|
= note: this will change drop order of the result, as well as all temporaries
|
|
|
= note: add `#[allow(clippy::redundant_pattern_matching)]` if this is important
|
|
|
= help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#redundant_pattern_matching
|
|
|
|
|
|
warning: re-implementing `PartialEq::ne` is unnecessary
|
|
|
--> src\lib.rs:275:5
|
|
|
|
|
|
|
275 | / fn ne(&self, other: &Self) -> bool {
|
|
|
276 | | self.len() != other.len() || self.iter().ne(other)
|
|
|
277 | | }
|
|
|
| |_____^
|
|
|
|
|
|
|
= note: `#[warn(clippy::partialeq_ne_impl)]` on by default
|
|
|
= help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#partialeq_ne_impl
|
|
|
|
|
|
warning: `linked-list` (lib) generated 4 warnings
|
|
|
Finished dev [unoptimized + debuginfo] target(s) in 0.29s
|
|
|
</code></pre>
|
|
|
<p>好的 clippy, 按照你的要求修改。</p>
|
|
|
<p>再来一次：</p>
|
|
|
<pre><code class="language-text">cargo clippy
|
|
|
Finished dev [unoptimized + debuginfo] target(s) in 0.00s
|
|
|
</code></pre>
|
|
|
<p>太棒了，称为生产品质的最后一件事: fmt.</p>
|
|
|
<pre><code class="language-text">cargo fmt
|
|
|
</code></pre>
|
|
|
<p><strong>我们现在终于真正的完成啦!!!!!!!!!!!!!!!!!!!!!</strong></p>
|
|
|
|
|
|
</main>
|
|
|
|
|
|
<nav class="nav-wrapper" aria-label="Page navigation">
|
|
|
<!-- Mobile navigation buttons -->
|
|
|
<a rel="prev" href="../../too-many-lists/production-unsafe-deque/implementing-cursors.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 prefetch" href="../../too-many-lists/production-unsafe-deque/final-code.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/production-unsafe-deque/implementing-cursors.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 prefetch" href="../../too-many-lists/production-unsafe-deque/final-code.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>
|
|
|
window.playground_copyable = true;
|
|
|
</script>
|
|
|
|
|
|
<script src="../../ace.js"></script>
|
|
|
<script src="../../editor.js"></script>
|
|
|
<script src="../../mode-rust.js"></script>
|
|
|
<script src="../../theme-dawn.js"></script>
|
|
|
<script src="../../theme-tomorrow_night.js"></script>
|
|
|
|
|
|
<script src="../../elasticlunr.min.js"></script>
|
|
|
<script src="../../mark.min.js"></script>
|
|
|
<script src="../../searcher.js"></script>
|
|
|
|
|
|
<script src="../../clipboard.min.js"></script>
|
|
|
<script src="../../highlight.js"></script>
|
|
|
<script src="../../book.js"></script>
|
|
|
|
|
|
<!-- Custom JS scripts -->
|
|
|
<script src="../../assets/custom2.js"></script>
|
|
|
<script src="../../assets/bigPicture.js"></script>
|
|
|
|
|
|
|
|
|
</div>
|
|
|
</body>
|
|
|
</html>
|
