mirror of https://github.com/sunface/rust-course
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.
570 lines
69 KiB
570 lines
69 KiB
3 weeks ago
|
<!DOCTYPE HTML>
|
||
|
|
<html lang="zh-CN" class="light" 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" 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 class="sidebar-visible no-js">
|
||
|
|
<div id="body-container">
|
||
|
|
<!-- Provide site root to javascript -->
|
||
|
|
<script>
|
||
|
|
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>
|
||
|
|
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>
|
||
|
|
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('light')
|
||
|
|
html.classList.add(theme);
|
||
|
|
var body = document.querySelector('body');
|
||
|
|
body.classList.remove('no-js')
|
||
|
|
body.classList.add('js');
|
||
|
|
</script>
|
||
|
|
|
||
|
|
<input type="checkbox" id="sidebar-toggle-anchor" class="hidden">
|
||
|
|
|
||
|
|
<!-- Hide / unhide sidebar before it is displayed -->
|
||
|
|
<script>
|
||
|
|
var body = document.querySelector('body');
|
||
|
|
var sidebar = null;
|
||
|
|
var 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';
|
||
|
|
body.classList.remove('sidebar-visible');
|
||
|
|
body.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="spacer"></li><li class="chapter-item affix "><a href="../../some-thoughts.html">Xobserve: 一切皆可观测</a></li><li class="chapter-item affix "><a href="../../beat-ai.html">BeatAI: 工程师 AI 入门圣经</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></l
|
||
|
|
</div>
|
||
|
|
<div id="sidebar-resize-handle" class="sidebar-resize-handle">
|
||
|
|
<div class="sidebar-resize-indicator"></div>
|
||
|
|
</div>
|
||
|
|
</nav>
|
||
|
|
|
||
|
|
<!-- Track and set sidebar scroll position -->
|
||
|
|
<script>
|
||
|
|
var sidebarScrollbox = document.querySelector('#sidebar .sidebar-scrollbox');
|
||
|
|
sidebarScrollbox.addEventListener('click', function(e) {
|
||
|
|
if (e.target.tagName === 'A') {
|
||
|
|
sessionStorage.setItem('sidebar-scroll', sidebarScrollbox.scrollTop);
|
||
|
|
}
|
||
|
|
}, { passive: true });
|
||
|
|
var sidebarScrollTop = sessionStorage.getItem('sidebar-scroll');
|
||
|
|
sessionStorage.removeItem('sidebar-scroll');
|
||
|
|
if (sidebarScrollTop) {
|
||
|
|
// preserve sidebar scroll position when navigating via links within sidebar
|
||
|
|
sidebarScrollbox.scrollTop = sidebarScrollTop;
|
||
|
|
} else {
|
||
|
|
// scroll sidebar to current active section when navigating via "next/previous chapter" buttons
|
||
|
|
var activeSection = document.querySelector('#sidebar .active');
|
||
|
|
if (activeSection) {
|
||
|
|
activeSection.scrollIntoView({ block: 'center' });
|
||
|
|
}
|
||
|
|
}
|
||
|
|
</script>
|
||
|
|
|
||
|
|
<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="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.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">
|
||
|
|
<!-- Page table of contents -->
|
||
|
|
<div class="sidetoc"><nav class="pagetoc"></nav></div>
|
||
|
|
<main>
|
||
|
|
<h1 id="testing"><a class="header" href="#testing">Testing</a></h1>
|
||
|
|
<p>好吧，我推迟了一段时间测试，因为我们都知道，我们现在是 Rust 的主人，不会再犯错了！另外，这是对一个旧 crate 的重写，所以我已经有了所有的测试。你已经看过很多测试了。它们就在这里：</p>
|
||
|
|
<pre><pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
||
|
|
</span><span class="boring">fn main() {
|
||
|
|
</span>#[cfg(test)]
|
||
|
|
mod test {
|
||
|
|
use super::LinkedList;
|
||
|
|
|
||
|
|
fn generate_test() -> LinkedList<i32> {
|
||
|
|
list_from(&[0, 1, 2, 3, 4, 5, 6])
|
||
|
|
}
|
||
|
|
|
||
|
|
fn list_from<T: Clone>(v: &[T]) -> LinkedList<T> {
|
||
|
|
v.iter().map(|x| (*x).clone()).collect()
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn test_basic_front() {
|
||
|
|
let mut list = LinkedList::new();
|
||
|
|
|
||
|
|
// Try to break an empty list
|
||
|
|
assert_eq!(list.len(), 0);
|
||
|
|
assert_eq!(list.pop_front(), None);
|
||
|
|
assert_eq!(list.len(), 0);
|
||
|
|
|
||
|
|
// Try to break a one item list
|
||
|
|
list.push_front(10);
|
||
|
|
assert_eq!(list.len(), 1);
|
||
|
|
assert_eq!(list.pop_front(), Some(10));
|
||
|
|
assert_eq!(list.len(), 0);
|
||
|
|
assert_eq!(list.pop_front(), None);
|
||
|
|
assert_eq!(list.len(), 0);
|
||
|
|
|
||
|
|
// Mess around
|
||
|
|
list.push_front(10);
|
||
|
|
assert_eq!(list.len(), 1);
|
||
|
|
list.push_front(20);
|
||
|
|
assert_eq!(list.len(), 2);
|
||
|
|
list.push_front(30);
|
||
|
|
assert_eq!(list.len(), 3);
|
||
|
|
assert_eq!(list.pop_front(), Some(30));
|
||
|
|
assert_eq!(list.len(), 2);
|
||
|
|
list.push_front(40);
|
||
|
|
assert_eq!(list.len(), 3);
|
||
|
|
assert_eq!(list.pop_front(), Some(40));
|
||
|
|
assert_eq!(list.len(), 2);
|
||
|
|
assert_eq!(list.pop_front(), Some(20));
|
||
|
|
assert_eq!(list.len(), 1);
|
||
|
|
assert_eq!(list.pop_front(), Some(10));
|
||
|
|
assert_eq!(list.len(), 0);
|
||
|
|
assert_eq!(list.pop_front(), None);
|
||
|
|
assert_eq!(list.len(), 0);
|
||
|
|
assert_eq!(list.pop_front(), None);
|
||
|
|
assert_eq!(list.len(), 0);
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn test_basic() {
|
||
|
|
let mut m = LinkedList::new();
|
||
|
|
assert_eq!(m.pop_front(), None);
|
||
|
|
assert_eq!(m.pop_back(), None);
|
||
|
|
assert_eq!(m.pop_front(), None);
|
||
|
|
m.push_front(1);
|
||
|
|
assert_eq!(m.pop_front(), Some(1));
|
||
|
|
m.push_back(2);
|
||
|
|
m.push_back(3);
|
||
|
|
assert_eq!(m.len(), 2);
|
||
|
|
assert_eq!(m.pop_front(), Some(2));
|
||
|
|
assert_eq!(m.pop_front(), Some(3));
|
||
|
|
assert_eq!(m.len(), 0);
|
||
|
|
assert_eq!(m.pop_front(), None);
|
||
|
|
m.push_back(1);
|
||
|
|
m.push_back(3);
|
||
|
|
m.push_back(5);
|
||
|
|
m.push_back(7);
|
||
|
|
assert_eq!(m.pop_front(), Some(1));
|
||
|
|
|
||
|
|
let mut n = LinkedList::new();
|
||
|
|
n.push_front(2);
|
||
|
|
n.push_front(3);
|
||
|
|
{
|
||
|
|
assert_eq!(n.front().unwrap(), &3);
|
||
|
|
let x = n.front_mut().unwrap();
|
||
|
|
assert_eq!(*x, 3);
|
||
|
|
*x = 0;
|
||
|
|
}
|
||
|
|
{
|
||
|
|
assert_eq!(n.back().unwrap(), &2);
|
||
|
|
let y = n.back_mut().unwrap();
|
||
|
|
assert_eq!(*y, 2);
|
||
|
|
*y = 1;
|
||
|
|
}
|
||
|
|
assert_eq!(n.pop_front(), Some(0));
|
||
|
|
assert_eq!(n.pop_front(), Some(1));
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn test_iterator() {
|
||
|
|
let m = generate_test();
|
||
|
|
for (i, elt) in m.iter().enumerate() {
|
||
|
|
assert_eq!(i as i32, *elt);
|
||
|
|
}
|
||
|
|
let mut n = LinkedList::new();
|
||
|
|
assert_eq!(n.iter().next(), None);
|
||
|
|
n.push_front(4);
|
||
|
|
let mut it = n.iter();
|
||
|
|
assert_eq!(it.size_hint(), (1, Some(1)));
|
||
|
|
assert_eq!(it.next().unwrap(), &4);
|
||
|
|
assert_eq!(it.size_hint(), (0, Some(0)));
|
||
|
|
assert_eq!(it.next(), None);
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn test_iterator_double_end() {
|
||
|
|
let mut n = LinkedList::new();
|
||
|
|
assert_eq!(n.iter().next(), None);
|
||
|
|
n.push_front(4);
|
||
|
|
n.push_front(5);
|
||
|
|
n.push_front(6);
|
||
|
|
let mut it = n.iter();
|
||
|
|
assert_eq!(it.size_hint(), (3, Some(3)));
|
||
|
|
assert_eq!(it.next().unwrap(), &6);
|
||
|
|
assert_eq!(it.size_hint(), (2, Some(2)));
|
||
|
|
assert_eq!(it.next_back().unwrap(), &4);
|
||
|
|
assert_eq!(it.size_hint(), (1, Some(1)));
|
||
|
|
assert_eq!(it.next_back().unwrap(), &5);
|
||
|
|
assert_eq!(it.next_back(), None);
|
||
|
|
assert_eq!(it.next(), None);
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn test_rev_iter() {
|
||
|
|
let m = generate_test();
|
||
|
|
for (i, elt) in m.iter().rev().enumerate() {
|
||
|
|
assert_eq!(6 - i as i32, *elt);
|
||
|
|
}
|
||
|
|
let mut n = LinkedList::new();
|
||
|
|
assert_eq!(n.iter().rev().next(), None);
|
||
|
|
n.push_front(4);
|
||
|
|
let mut it = n.iter().rev();
|
||
|
|
assert_eq!(it.size_hint(), (1, Some(1)));
|
||
|
|
assert_eq!(it.next().unwrap(), &4);
|
||
|
|
assert_eq!(it.size_hint(), (0, Some(0)));
|
||
|
|
assert_eq!(it.next(), None);
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn test_mut_iter() {
|
||
|
|
let mut m = generate_test();
|
||
|
|
let mut len = m.len();
|
||
|
|
for (i, elt) in m.iter_mut().enumerate() {
|
||
|
|
assert_eq!(i as i32, *elt);
|
||
|
|
len -= 1;
|
||
|
|
}
|
||
|
|
assert_eq!(len, 0);
|
||
|
|
let mut n = LinkedList::new();
|
||
|
|
assert!(n.iter_mut().next().is_none());
|
||
|
|
n.push_front(4);
|
||
|
|
n.push_back(5);
|
||
|
|
let mut it = n.iter_mut();
|
||
|
|
assert_eq!(it.size_hint(), (2, Some(2)));
|
||
|
|
assert!(it.next().is_some());
|
||
|
|
assert!(it.next().is_some());
|
||
|
|
assert_eq!(it.size_hint(), (0, Some(0)));
|
||
|
|
assert!(it.next().is_none());
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn test_iterator_mut_double_end() {
|
||
|
|
let mut n = LinkedList::new();
|
||
|
|
assert!(n.iter_mut().next_back().is_none());
|
||
|
|
n.push_front(4);
|
||
|
|
n.push_front(5);
|
||
|
|
n.push_front(6);
|
||
|
|
let mut it = n.iter_mut();
|
||
|
|
assert_eq!(it.size_hint(), (3, Some(3)));
|
||
|
|
assert_eq!(*it.next().unwrap(), 6);
|
||
|
|
assert_eq!(it.size_hint(), (2, Some(2)));
|
||
|
|
assert_eq!(*it.next_back().unwrap(), 4);
|
||
|
|
assert_eq!(it.size_hint(), (1, Some(1)));
|
||
|
|
assert_eq!(*it.next_back().unwrap(), 5);
|
||
|
|
assert!(it.next_back().is_none());
|
||
|
|
assert!(it.next().is_none());
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn test_eq() {
|
||
|
|
let mut n: LinkedList<u8> = list_from(&[]);
|
||
|
|
let mut m = list_from(&[]);
|
||
|
|
assert!(n == m);
|
||
|
|
n.push_front(1);
|
||
|
|
assert!(n != m);
|
||
|
|
m.push_back(1);
|
||
|
|
assert!(n == m);
|
||
|
|
|
||
|
|
let n = list_from(&[2, 3, 4]);
|
||
|
|
let m = list_from(&[1, 2, 3]);
|
||
|
|
assert!(n != m);
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn test_ord() {
|
||
|
|
let n = list_from(&[]);
|
||
|
|
let m = list_from(&[1, 2, 3]);
|
||
|
|
assert!(n < m);
|
||
|
|
assert!(m > n);
|
||
|
|
assert!(n <= n);
|
||
|
|
assert!(n >= n);
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn test_ord_nan() {
|
||
|
|
let nan = 0.0f64 / 0.0;
|
||
|
|
let n = list_from(&[nan]);
|
||
|
|
let m = list_from(&[nan]);
|
||
|
|
assert!(!(n < m));
|
||
|
|
assert!(!(n > m));
|
||
|
|
assert!(!(n <= m));
|
||
|
|
assert!(!(n >= m));
|
||
|
|
|
||
|
|
let n = list_from(&[nan]);
|
||
|
|
let one = list_from(&[1.0f64]);
|
||
|
|
assert!(!(n < one));
|
||
|
|
assert!(!(n > one));
|
||
|
|
assert!(!(n <= one));
|
||
|
|
assert!(!(n >= one));
|
||
|
|
|
||
|
|
let u = list_from(&[1.0f64, 2.0, nan]);
|
||
|
|
let v = list_from(&[1.0f64, 2.0, 3.0]);
|
||
|
|
assert!(!(u < v));
|
||
|
|
assert!(!(u > v));
|
||
|
|
assert!(!(u <= v));
|
||
|
|
assert!(!(u >= v));
|
||
|
|
|
||
|
|
let s = list_from(&[1.0f64, 2.0, 4.0, 2.0]);
|
||
|
|
let t = list_from(&[1.0f64, 2.0, 3.0, 2.0]);
|
||
|
|
assert!(!(s < t));
|
||
|
|
assert!(s > one);
|
||
|
|
assert!(!(s <= one));
|
||
|
|
assert!(s >= one);
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn test_debug() {
|
||
|
|
let list: LinkedList<i32> = (0..10).collect();
|
||
|
|
assert_eq!(format!("{:?}", list), "[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]");
|
||
|
|
|
||
|
|
let list: LinkedList<&str> = vec!["just", "one", "test", "more"]
|
||
|
|
.iter().copied()
|
||
|
|
.collect();
|
||
|
|
assert_eq!(format!("{:?}", list), r#"["just", "one", "test", "more"]"#);
|
||
|
|
}
|
||
|
|
|
||
|
|
#[test]
|
||
|
|
fn test_hashmap() {
|
||
|
|
// Check that HashMap works with this as a key
|
||
|
|
|
||
|
|
let list1: LinkedList<i32> = (0..10).collect();
|
||
|
|
let list2: LinkedList<i32> = (1..11).collect();
|
||
|
|
let mut map = std::collections::HashMap::new();
|
||
|
|
|
||
|
|
assert_eq!(map.insert(list1.clone(), "list1"), None);
|
||
|
|
assert_eq!(map.insert(list2.clone(), "list2"), None);
|
||
|
|
|
||
|
|
assert_eq!(map.len(), 2);
|
||
|
|
|
||
|
|
assert_eq!(map.get(&list1), Some(&"list1"));
|
||
|
|
assert_eq!(map.get(&list2), Some(&"list2"));
|
||
|
|
|
||
|
|
assert_eq!(map.remove(&list1), Some("list1"));
|
||
|
|
assert_eq!(map.remove(&list2), Some("list2"));
|
||
|
|
|
||
|
|
assert!(map.is_empty());
|
||
|
|
}
|
||
|
|
}
|
||
|
|
<span class="boring">}</span></code></pre></pre>
|
||
|
|
<p>现在是关键时刻：</p>
|
||
|
|
<pre><code class="language-text">cargo test
|
||
|
|
Finished test [unoptimized + debuginfo] target(s) in 0.00s
|
||
|
|
Running unittests src\lib.rs
|
||
|
|
|
||
|
|
running 12 tests
|
||
|
|
test test::test_basic ... ok
|
||
|
|
test test::test_basic_front ... ok
|
||
|
|
test test::test_eq ... ok
|
||
|
|
test test::test_iterator ... ok
|
||
|
|
test test::test_iterator_mut_double_end ... ok
|
||
|
|
test test::test_ord_nan ... ok
|
||
|
|
test test::test_iterator_double_end ... ok
|
||
|
|
test test::test_mut_iter ... ok
|
||
|
|
test test::test_rev_iter ... ok
|
||
|
|
test test::test_hashmap ... ok
|
||
|
|
test test::test_ord ... ok
|
||
|
|
test test::test_debug ... ok
|
||
|
|
|
||
|
|
test result: ok. 12 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
|
||
|
|
$env:MIRIFLAGS="-Zmiri-tag-raw-pointers"
|
||
|
|
cargo miri test
|
||
|
|
Compiling linked-list v0.0.3
|
||
|
|
Finished test [unoptimized + debuginfo] target(s) in 0.35s
|
||
|
|
Running unittests src\lib.rs
|
||
|
|
|
||
|
|
running 12 tests
|
||
|
|
test test::test_basic ... ok
|
||
|
|
test test::test_basic_front ... 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. 12 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out
|
||
|
|
</code></pre>
|
||
|
|
<p>😭</p>
|
||
|
|
<p>我们做到了，我们真的没有搞砸。这不是小把戏！我们所有的练习和训练终于值得了！我们终于写出了好代码</p>
|
||
|
|
<p>现在，我们可以回到 "有趣的事情 "上来了！</p>
|
||
|
|
|
||
|
|
<div id="giscus-container"></div>
|
||
|
|
</main>
|
||
|
|
|
||
|
|
<nav class="nav-wrapper" aria-label="Page navigation">
|
||
|
|
<!-- Mobile navigation buttons -->
|
||
|
|
<a rel="prev" href="../../too-many-lists/production-unsafe-deque/filling-in-random-bits.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/send-sync-and-compile-tests.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/filling-in-random-bits.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/send-sync-and-compile-tests.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>
|
||
|
|
|
||
|
|
<script type="text/javascript" charset="utf-8">
|
||
|
|
var pagePath = "too-many-lists/production-unsafe-deque/testing.md"
|
||
|
|
</script>
|
||
|
|
|
||
|
|
|
||
|
|
<!-- Custom JS scripts -->
|
||
|
|
<script src="../../assets/custom.js"></script>
|
||
|
|
<script src="../../assets/bigPicture.js"></script>
|
||
|
|
|
||
|
|
|
||
|
|
</div>
|
||
|
|
</body>
|
||
|
|
</html>
|