|
|
<!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-de23e50b.svg">
|
|
|
<link rel="shortcut icon" href="../../favicon-8114d1fc.png">
|
|
|
<link rel="stylesheet" href="../../css/variables-8adf115d.css">
|
|
|
<link rel="stylesheet" href="../../css/general-2459343d.css">
|
|
|
<link rel="stylesheet" href="../../css/chrome-ae938929.css">
|
|
|
<link rel="stylesheet" href="../../css/print-9e4910d8.css" media="print">
|
|
|
|
|
|
<!-- Fonts -->
|
|
|
<link rel="stylesheet" href="../../fonts/fonts-9644e21d.css">
|
|
|
|
|
|
<!-- Highlight.js Stylesheets -->
|
|
|
<link rel="stylesheet" id="mdbook-highlight-css" href="../../highlight-493f70e1.css">
|
|
|
<link rel="stylesheet" id="mdbook-tomorrow-night-css" href="../../tomorrow-night-4c0ae647.css">
|
|
|
<link rel="stylesheet" id="mdbook-ayu-highlight-css" href="../../ayu-highlight-3fdfc3ac.css">
|
|
|
|
|
|
<!-- Custom theme stylesheets -->
|
|
|
<link rel="stylesheet" href="../../theme/style-234bffbf.css">
|
|
|
|
|
|
|
|
|
<!-- Provide site root and default themes to javascript -->
|
|
|
<script>
|
|
|
const path_to_root = "../../";
|
|
|
const default_light_theme = "light";
|
|
|
const default_dark_theme = "navy";
|
|
|
window.path_to_searchindex_js = "../../searchindex-4a1a74fa.js";
|
|
|
</script>
|
|
|
<!-- Start loading toc.js asap -->
|
|
|
<script src="../../toc-42887675.js"></script>
|
|
|
</head>
|
|
|
<body>
|
|
|
<div id="mdbook-help-container">
|
|
|
<div id="mdbook-help-popup">
|
|
|
<h2 class="mdbook-help-title">Keyboard shortcuts</h2>
|
|
|
<div>
|
|
|
<p>Press <kbd>←</kbd> or <kbd>→</kbd> to navigate between chapters</p>
|
|
|
<p>Press <kbd>S</kbd> or <kbd>/</kbd> to search in the book</p>
|
|
|
<p>Press <kbd>?</kbd> to show this help</p>
|
|
|
<p>Press <kbd>Esc</kbd> to hide this help</p>
|
|
|
</div>
|
|
|
</div>
|
|
|
</div>
|
|
|
<div id="mdbook-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="mdbook-sidebar-toggle-anchor" class="hidden">
|
|
|
|
|
|
<!-- Hide / unhide sidebar before it is displayed -->
|
|
|
<script>
|
|
|
let sidebar = null;
|
|
|
const sidebar_toggle = document.getElementById("mdbook-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 = false;
|
|
|
}
|
|
|
if (sidebar === 'visible') {
|
|
|
sidebar_toggle.checked = true;
|
|
|
} else {
|
|
|
html.classList.remove('sidebar-visible');
|
|
|
}
|
|
|
</script>
|
|
|
|
|
|
<nav id="mdbook-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="mdbook-sidebar-resize-handle" class="sidebar-resize-handle">
|
|
|
<div class="sidebar-resize-indicator"></div>
|
|
|
</div>
|
|
|
</nav>
|
|
|
|
|
|
<div id="mdbook-page-wrapper" class="page-wrapper">
|
|
|
|
|
|
<div class="page">
|
|
|
<div id="mdbook-menu-bar-hover-placeholder"></div>
|
|
|
<div id="mdbook-menu-bar" class="menu-bar sticky">
|
|
|
<div class="left-buttons">
|
|
|
<label id="mdbook-sidebar-toggle" class="icon-button" for="mdbook-sidebar-toggle-anchor" title="Toggle Table of Contents" aria-label="Toggle Table of Contents" aria-controls="mdbook-sidebar">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M0 96C0 78.3 14.3 64 32 64H416c17.7 0 32 14.3 32 32s-14.3 32-32 32H32C14.3 128 0 113.7 0 96zM0 256c0-17.7 14.3-32 32-32H416c17.7 0 32 14.3 32 32s-14.3 32-32 32H32c-17.7 0-32-14.3-32-32zM448 416c0 17.7-14.3 32-32 32H32c-17.7 0-32-14.3-32-32s14.3-32 32-32H416c17.7 0 32 14.3 32 32z"/></svg></span>
|
|
|
</label>
|
|
|
<button id="mdbook-theme-toggle" class="icon-button" type="button" title="Change theme" aria-label="Change theme" aria-haspopup="true" aria-expanded="false" aria-controls="mdbook-theme-list">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 576 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M371.3 367.1c27.3-3.9 51.9-19.4 67.2-42.9L600.2 74.1c12.6-19.5 9.4-45.3-7.6-61.2S549.7-4.4 531.1 9.6L294.4 187.2c-24 18-38.2 46.1-38.4 76.1L371.3 367.1zm-19.6 25.4l-116-104.4C175.9 290.3 128 339.6 128 400c0 3.9 .2 7.8 .6 11.6c1.8 17.5-10.2 36.4-27.8 36.4H96c-17.7 0-32 14.3-32 32s14.3 32 32 32H240c61.9 0 112-50.1 112-112c0-2.5-.1-5-.2-7.5z"/></svg></span>
|
|
|
</button>
|
|
|
<ul id="mdbook-theme-list" class="theme-popup" aria-label="Themes" role="menu">
|
|
|
<li role="none"><button role="menuitem" class="theme" id="mdbook-theme-default_theme">Auto</button></li>
|
|
|
<li role="none"><button role="menuitem" class="theme" id="mdbook-theme-light">Light</button></li>
|
|
|
<li role="none"><button role="menuitem" class="theme" id="mdbook-theme-rust">Rust</button></li>
|
|
|
<li role="none"><button role="menuitem" class="theme" id="mdbook-theme-coal">Coal</button></li>
|
|
|
<li role="none"><button role="menuitem" class="theme" id="mdbook-theme-navy">Navy</button></li>
|
|
|
<li role="none"><button role="menuitem" class="theme" id="mdbook-theme-ayu">Ayu</button></li>
|
|
|
</ul>
|
|
|
<button id="mdbook-search-toggle" class="icon-button" type="button" title="Search (`/`)" aria-label="Toggle Searchbar" aria-expanded="false" aria-keyshortcuts="/ s" aria-controls="mdbook-searchbar">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M416 208c0 45.9-14.9 88.3-40 122.7L502.6 457.4c12.5 12.5 12.5 32.8 0 45.3s-32.8 12.5-45.3 0L330.7 376c-34.4 25.2-76.8 40-122.7 40C93.1 416 0 322.9 0 208S93.1 0 208 0S416 93.1 416 208zM208 352c79.5 0 144-64.5 144-144s-64.5-144-144-144S64 128.5 64 208s64.5 144 144 144z"/></svg></span>
|
|
|
</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">
|
|
|
<span class=fa-svg id="print-button"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M128 0C92.7 0 64 28.7 64 64v96h64V64H354.7L384 93.3V160h64V93.3c0-17-6.7-33.3-18.7-45.3L400 18.7C388 6.7 371.7 0 354.7 0H128zM384 352v32 64H128V384 368 352H384zm64 32h32c17.7 0 32-14.3 32-32V256c0-35.3-28.7-64-64-64H64c-35.3 0-64 28.7-64 64v96c0 17.7 14.3 32 32 32H64v64c0 35.3 28.7 64 64 64H384c35.3 0 64-28.7 64-64V384zm-16-88c-13.3 0-24-10.7-24-24s10.7-24 24-24s24 10.7 24 24s-10.7 24-24 24z"/></svg></span>
|
|
|
</a>
|
|
|
<a href="https://github.com/sunface/rust-course" title="Git repository" aria-label="Git repository">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 496 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3.3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5.3-6.2 2.3zm44.2-1.7c-2.9.7-4.9 2.6-4.6 4.9.3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3.7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3.3 2.9 2.3 3.9 1.6 1 3.6.7 4.3-.7.7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3.7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3.7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z"/></svg></span>
|
|
|
</a>
|
|
|
<a href="https://github.com/sunface/rust-course/edit/main/src/too-many-lists/production-unsafe-deque/final-code.md" title="Suggest an edit" aria-label="Suggest an edit" rel="edit">
|
|
|
<span class=fa-svg id="git-edit-button"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M421.7 220.3l-11.3 11.3-22.6 22.6-205 205c-6.6 6.6-14.8 11.5-23.8 14.1L30.8 511c-8.4 2.5-17.5 .2-23.7-6.1S-1.5 489.7 1 481.2L38.7 353.1c2.6-9 7.5-17.2 14.1-23.8l205-205 22.6-22.6 11.3-11.3 33.9 33.9 62.1 62.1 33.9 33.9zM96 353.9l-9.3 9.3c-.9 .9-1.6 2.1-2 3.4l-25.3 86 86-25.3c1.3-.4 2.5-1.1 3.4-2l9.3-9.3H112c-8.8 0-16-7.2-16-16V353.9zM453.3 19.3l39.4 39.4c25 25 25 65.5 0 90.5l-14.5 14.5-22.6 22.6-11.3 11.3-33.9-33.9-62.1-62.1L314.3 67.7l11.3-11.3 22.6-22.6 14.5-14.5c25-25 65.5-25 90.5 0z"/></svg></span>
|
|
|
</a>
|
|
|
|
|
|
</div>
|
|
|
</div>
|
|
|
|
|
|
<div id="mdbook-search-wrapper" class="hidden">
|
|
|
<form id="mdbook-searchbar-outer" class="searchbar-outer">
|
|
|
<div class="search-wrapper">
|
|
|
<input type="search" id="mdbook-searchbar" name="searchbar" placeholder="Search this book ..." aria-controls="mdbook-searchresults-outer" aria-describedby="searchresults-header">
|
|
|
<div class="spinner-wrapper">
|
|
|
<span class=fa-svg id="fa-spin"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M304 48c0-26.5-21.5-48-48-48s-48 21.5-48 48s21.5 48 48 48s48-21.5 48-48zm0 416c0-26.5-21.5-48-48-48s-48 21.5-48 48s21.5 48 48 48s48-21.5 48-48zM48 304c26.5 0 48-21.5 48-48s-21.5-48-48-48s-48 21.5-48 48s21.5 48 48 48zm464-48c0-26.5-21.5-48-48-48s-48 21.5-48 48s21.5 48 48 48s48-21.5 48-48zM142.9 437c18.7-18.7 18.7-49.1 0-67.9s-49.1-18.7-67.9 0s-18.7 49.1 0 67.9s49.1 18.7 67.9 0zm0-294.2c18.7-18.7 18.7-49.1 0-67.9S93.7 56.2 75 75s-18.7 49.1 0 67.9s49.1 18.7 67.9 0zM369.1 437c18.7 18.7 49.1 18.7 67.9 0s18.7-49.1 0-67.9s-49.1-18.7-67.9 0s-18.7 49.1 0 67.9z"/></svg></span>
|
|
|
</div>
|
|
|
</div>
|
|
|
</form>
|
|
|
<div id="mdbook-searchresults-outer" class="searchresults-outer hidden">
|
|
|
<div id="mdbook-searchresults-header" class="searchresults-header"></div>
|
|
|
<ul id="mdbook-searchresults">
|
|
|
</ul>
|
|
|
</div>
|
|
|
</div>
|
|
|
|
|
|
<!-- Apply ARIA attributes after the sidebar and the sidebar toggle button are added to the DOM -->
|
|
|
<script>
|
|
|
document.getElementById('mdbook-sidebar-toggle').setAttribute('aria-expanded', sidebar === 'visible');
|
|
|
document.getElementById('mdbook-sidebar').setAttribute('aria-hidden', sidebar !== 'visible');
|
|
|
Array.from(document.querySelectorAll('#mdbook-sidebar a')).forEach(function(link) {
|
|
|
link.setAttribute('tabIndex', sidebar === 'visible' ? 0 : -1);
|
|
|
});
|
|
|
</script>
|
|
|
|
|
|
<div id="mdbook-content" class="content">
|
|
|
<main>
|
|
|
<h1 id="final-code"><a class="header" href="#final-code">Final Code</a></h1>
|
|
|
<p>我真不敢相信，我居然让你坐在那里，听我从头开始重新实现 std::collections::LinkedList，一路上我犯了很多繁琐的小错误。</p>
|
|
|
<p>我做到了，书写完了，我终于可以休息了。</p>
|
|
|
<p>好了，下面是我们完整重写的 1200 行代码的全部内容。这应该与 <a href="https://github.com/contain-rs/linked-list/commit/5b69cc29454595172a5167a09277660342b78092">this commit</a> 的文本相同。</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>use std::cmp::Ordering;
|
|
|
use std::fmt::{self, Debug};
|
|
|
use std::hash::{Hash, Hasher};
|
|
|
use std::iter::FromIterator;
|
|
|
use std::marker::PhantomData;
|
|
|
use std::ptr::NonNull;
|
|
|
|
|
|
pub struct LinkedList<T> {
|
|
|
front: Link<T>,
|
|
|
back: Link<T>,
|
|
|
len: usize,
|
|
|
_boo: PhantomData<T>,
|
|
|
}
|
|
|
|
|
|
type Link<T> = Option<NonNull<Node<T>>>;
|
|
|
|
|
|
struct Node<T> {
|
|
|
front: Link<T>,
|
|
|
back: Link<T>,
|
|
|
elem: T,
|
|
|
}
|
|
|
|
|
|
pub struct Iter<'a, T> {
|
|
|
front: Link<T>,
|
|
|
back: Link<T>,
|
|
|
len: usize,
|
|
|
_boo: PhantomData<&'a T>,
|
|
|
}
|
|
|
|
|
|
pub struct IterMut<'a, T> {
|
|
|
front: Link<T>,
|
|
|
back: Link<T>,
|
|
|
len: usize,
|
|
|
_boo: PhantomData<&'a mut T>,
|
|
|
}
|
|
|
|
|
|
pub struct IntoIter<T> {
|
|
|
list: LinkedList<T>,
|
|
|
}
|
|
|
|
|
|
pub struct CursorMut<'a, T> {
|
|
|
list: &'a mut LinkedList<T>,
|
|
|
cur: Link<T>,
|
|
|
index: Option<usize>,
|
|
|
}
|
|
|
|
|
|
impl<T> LinkedList<T> {
|
|
|
pub fn new() -> Self {
|
|
|
Self {
|
|
|
front: None,
|
|
|
back: None,
|
|
|
len: 0,
|
|
|
_boo: PhantomData,
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn push_front(&mut self, elem: T) {
|
|
|
// SAFETY: it's a linked-list, what do you want?
|
|
|
unsafe {
|
|
|
let new = NonNull::new_unchecked(Box::into_raw(Box::new(Node {
|
|
|
front: None,
|
|
|
back: None,
|
|
|
elem,
|
|
|
})));
|
|
|
if let Some(old) = self.front {
|
|
|
// Put the new front before the old one
|
|
|
(*old.as_ptr()).front = Some(new);
|
|
|
(*new.as_ptr()).back = Some(old);
|
|
|
} else {
|
|
|
// If there's no front, then we're the empty list and need
|
|
|
// to set the back too.
|
|
|
self.back = Some(new);
|
|
|
}
|
|
|
// These things always happen!
|
|
|
self.front = Some(new);
|
|
|
self.len += 1;
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn push_back(&mut self, elem: T) {
|
|
|
// SAFETY: it's a linked-list, what do you want?
|
|
|
unsafe {
|
|
|
let new = NonNull::new_unchecked(Box::into_raw(Box::new(Node {
|
|
|
back: None,
|
|
|
front: None,
|
|
|
elem,
|
|
|
})));
|
|
|
if let Some(old) = self.back {
|
|
|
// Put the new back before the old one
|
|
|
(*old.as_ptr()).back = Some(new);
|
|
|
(*new.as_ptr()).front = Some(old);
|
|
|
} else {
|
|
|
// If there's no back, then we're the empty list and need
|
|
|
// to set the front too.
|
|
|
self.front = Some(new);
|
|
|
}
|
|
|
// These things always happen!
|
|
|
self.back = Some(new);
|
|
|
self.len += 1;
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn pop_front(&mut self) -> Option<T> {
|
|
|
unsafe {
|
|
|
// Only have to do stuff if there is a front node to pop.
|
|
|
self.front.map(|node| {
|
|
|
// Bring the Box back to life so we can move out its value and
|
|
|
// Drop it (Box continues to magically understand this for us).
|
|
|
let boxed_node = Box::from_raw(node.as_ptr());
|
|
|
let result = boxed_node.elem;
|
|
|
|
|
|
// Make the next node into the new front.
|
|
|
self.front = boxed_node.back;
|
|
|
if let Some(new) = self.front {
|
|
|
// Cleanup its reference to the removed node
|
|
|
(*new.as_ptr()).front = None;
|
|
|
} else {
|
|
|
// If the front is now null, then this list is now empty!
|
|
|
self.back = None;
|
|
|
}
|
|
|
|
|
|
self.len -= 1;
|
|
|
result
|
|
|
// Box gets implicitly freed here, knows there is no T.
|
|
|
})
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn pop_back(&mut self) -> Option<T> {
|
|
|
unsafe {
|
|
|
// Only have to do stuff if there is a back node to pop.
|
|
|
self.back.map(|node| {
|
|
|
// Bring the Box front to life so we can move out its value and
|
|
|
// Drop it (Box continues to magically understand this for us).
|
|
|
let boxed_node = Box::from_raw(node.as_ptr());
|
|
|
let result = boxed_node.elem;
|
|
|
|
|
|
// Make the next node into the new back.
|
|
|
self.back = boxed_node.front;
|
|
|
if let Some(new) = self.back {
|
|
|
// Cleanup its reference to the removed node
|
|
|
(*new.as_ptr()).back = None;
|
|
|
} else {
|
|
|
// If the back is now null, then this list is now empty!
|
|
|
self.front = None;
|
|
|
}
|
|
|
|
|
|
self.len -= 1;
|
|
|
result
|
|
|
// Box gets implicitly freed here, knows there is no T.
|
|
|
})
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn front(&self) -> Option<&T> {
|
|
|
unsafe { self.front.map(|node| &(*node.as_ptr()).elem) }
|
|
|
}
|
|
|
|
|
|
pub fn front_mut(&mut self) -> Option<&mut T> {
|
|
|
unsafe { self.front.map(|node| &mut (*node.as_ptr()).elem) }
|
|
|
}
|
|
|
|
|
|
pub fn back(&self) -> Option<&T> {
|
|
|
unsafe { self.back.map(|node| &(*node.as_ptr()).elem) }
|
|
|
}
|
|
|
|
|
|
pub fn back_mut(&mut self) -> Option<&mut T> {
|
|
|
unsafe { self.back.map(|node| &mut (*node.as_ptr()).elem) }
|
|
|
}
|
|
|
|
|
|
pub fn len(&self) -> usize {
|
|
|
self.len
|
|
|
}
|
|
|
|
|
|
pub fn is_empty(&self) -> bool {
|
|
|
self.len == 0
|
|
|
}
|
|
|
|
|
|
pub fn clear(&mut self) {
|
|
|
// Oh look it's drop again
|
|
|
while self.pop_front().is_some() {}
|
|
|
}
|
|
|
|
|
|
pub fn iter(&self) -> Iter<T> {
|
|
|
Iter {
|
|
|
front: self.front,
|
|
|
back: self.back,
|
|
|
len: self.len,
|
|
|
_boo: PhantomData,
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn iter_mut(&mut self) -> IterMut<T> {
|
|
|
IterMut {
|
|
|
front: self.front,
|
|
|
back: self.back,
|
|
|
len: self.len,
|
|
|
_boo: PhantomData,
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn cursor_mut(&mut self) -> CursorMut<T> {
|
|
|
CursorMut {
|
|
|
list: self,
|
|
|
cur: None,
|
|
|
index: None,
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T> Drop for LinkedList<T> {
|
|
|
fn drop(&mut self) {
|
|
|
// Pop until we have to stop
|
|
|
while self.pop_front().is_some() {}
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T> Default for LinkedList<T> {
|
|
|
fn default() -> Self {
|
|
|
Self::new()
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T: Clone> Clone for LinkedList<T> {
|
|
|
fn clone(&self) -> Self {
|
|
|
let mut new_list = Self::new();
|
|
|
for item in self {
|
|
|
new_list.push_back(item.clone());
|
|
|
}
|
|
|
new_list
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T> Extend<T> for LinkedList<T> {
|
|
|
fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) {
|
|
|
for item in iter {
|
|
|
self.push_back(item);
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T> FromIterator<T> for LinkedList<T> {
|
|
|
fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self {
|
|
|
let mut list = Self::new();
|
|
|
list.extend(iter);
|
|
|
list
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T: Debug> Debug for LinkedList<T> {
|
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
|
|
f.debug_list().entries(self).finish()
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T: PartialEq> PartialEq for LinkedList<T> {
|
|
|
fn eq(&self, other: &Self) -> bool {
|
|
|
self.len() == other.len() && self.iter().eq(other)
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T: Eq> Eq for LinkedList<T> {}
|
|
|
|
|
|
impl<T: PartialOrd> PartialOrd for LinkedList<T> {
|
|
|
fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
|
|
|
self.iter().partial_cmp(other)
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T: Ord> Ord for LinkedList<T> {
|
|
|
fn cmp(&self, other: &Self) -> Ordering {
|
|
|
self.iter().cmp(other)
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T: Hash> Hash for LinkedList<T> {
|
|
|
fn hash<H: Hasher>(&self, state: &mut H) {
|
|
|
self.len().hash(state);
|
|
|
for item in self {
|
|
|
item.hash(state);
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<'a, T> IntoIterator for &'a LinkedList<T> {
|
|
|
type IntoIter = Iter<'a, T>;
|
|
|
type Item = &'a T;
|
|
|
|
|
|
fn into_iter(self) -> Self::IntoIter {
|
|
|
self.iter()
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<'a, T> Iterator for Iter<'a, T> {
|
|
|
type Item = &'a T;
|
|
|
|
|
|
fn next(&mut self) -> Option<Self::Item> {
|
|
|
// While self.front == self.back is a tempting condition to check here,
|
|
|
// it won't do the right for yielding the last element! That sort of
|
|
|
// thing only works for arrays because of "one-past-the-end" pointers.
|
|
|
if self.len > 0 {
|
|
|
// We could unwrap front, but this is safer and easier
|
|
|
self.front.map(|node| unsafe {
|
|
|
self.len -= 1;
|
|
|
self.front = (*node.as_ptr()).back;
|
|
|
&(*node.as_ptr()).elem
|
|
|
})
|
|
|
} else {
|
|
|
None
|
|
|
}
|
|
|
}
|
|
|
|
|
|
fn size_hint(&self) -> (usize, Option<usize>) {
|
|
|
(self.len, Some(self.len))
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<'a, T> DoubleEndedIterator for Iter<'a, T> {
|
|
|
fn next_back(&mut self) -> Option<Self::Item> {
|
|
|
if self.len > 0 {
|
|
|
self.back.map(|node| unsafe {
|
|
|
self.len -= 1;
|
|
|
self.back = (*node.as_ptr()).front;
|
|
|
&(*node.as_ptr()).elem
|
|
|
})
|
|
|
} else {
|
|
|
None
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<'a, T> ExactSizeIterator for Iter<'a, T> {
|
|
|
fn len(&self) -> usize {
|
|
|
self.len
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<'a, T> IntoIterator for &'a mut LinkedList<T> {
|
|
|
type IntoIter = IterMut<'a, T>;
|
|
|
type Item = &'a mut T;
|
|
|
|
|
|
fn into_iter(self) -> Self::IntoIter {
|
|
|
self.iter_mut()
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<'a, T> Iterator for IterMut<'a, T> {
|
|
|
type Item = &'a mut T;
|
|
|
|
|
|
fn next(&mut self) -> Option<Self::Item> {
|
|
|
// While self.front == self.back is a tempting condition to check here,
|
|
|
// it won't do the right for yielding the last element! That sort of
|
|
|
// thing only works for arrays because of "one-past-the-end" pointers.
|
|
|
if self.len > 0 {
|
|
|
// We could unwrap front, but this is safer and easier
|
|
|
self.front.map(|node| unsafe {
|
|
|
self.len -= 1;
|
|
|
self.front = (*node.as_ptr()).back;
|
|
|
&mut (*node.as_ptr()).elem
|
|
|
})
|
|
|
} else {
|
|
|
None
|
|
|
}
|
|
|
}
|
|
|
|
|
|
fn size_hint(&self) -> (usize, Option<usize>) {
|
|
|
(self.len, Some(self.len))
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<'a, T> DoubleEndedIterator for IterMut<'a, T> {
|
|
|
fn next_back(&mut self) -> Option<Self::Item> {
|
|
|
if self.len > 0 {
|
|
|
self.back.map(|node| unsafe {
|
|
|
self.len -= 1;
|
|
|
self.back = (*node.as_ptr()).front;
|
|
|
&mut (*node.as_ptr()).elem
|
|
|
})
|
|
|
} else {
|
|
|
None
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<'a, T> ExactSizeIterator for IterMut<'a, T> {
|
|
|
fn len(&self) -> usize {
|
|
|
self.len
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T> IntoIterator for LinkedList<T> {
|
|
|
type IntoIter = IntoIter<T>;
|
|
|
type Item = T;
|
|
|
|
|
|
fn into_iter(self) -> Self::IntoIter {
|
|
|
IntoIter { list: self }
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T> Iterator for IntoIter<T> {
|
|
|
type Item = T;
|
|
|
|
|
|
fn next(&mut self) -> Option<Self::Item> {
|
|
|
self.list.pop_front()
|
|
|
}
|
|
|
|
|
|
fn size_hint(&self) -> (usize, Option<usize>) {
|
|
|
(self.list.len, Some(self.list.len))
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T> DoubleEndedIterator for IntoIter<T> {
|
|
|
fn next_back(&mut self) -> Option<Self::Item> {
|
|
|
self.list.pop_back()
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T> ExactSizeIterator for IntoIter<T> {
|
|
|
fn len(&self) -> usize {
|
|
|
self.list.len
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<'a, T> CursorMut<'a, T> {
|
|
|
pub fn index(&self) -> Option<usize> {
|
|
|
self.index
|
|
|
}
|
|
|
|
|
|
pub fn move_next(&mut self) {
|
|
|
if let Some(cur) = self.cur {
|
|
|
unsafe {
|
|
|
// We're on a real element, go to its next (back)
|
|
|
self.cur = (*cur.as_ptr()).back;
|
|
|
if self.cur.is_some() {
|
|
|
*self.index.as_mut().unwrap() += 1;
|
|
|
} else {
|
|
|
// We just walked to the ghost, no more index
|
|
|
self.index = None;
|
|
|
}
|
|
|
}
|
|
|
} else if !self.list.is_empty() {
|
|
|
// We're at the ghost, and there is a real front, so move to it!
|
|
|
self.cur = self.list.front;
|
|
|
self.index = Some(0)
|
|
|
} else {
|
|
|
// We're at the ghost, but that's the only element... do nothing.
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn move_prev(&mut self) {
|
|
|
if let Some(cur) = self.cur {
|
|
|
unsafe {
|
|
|
// We're on a real element, go to its previous (front)
|
|
|
self.cur = (*cur.as_ptr()).front;
|
|
|
if self.cur.is_some() {
|
|
|
*self.index.as_mut().unwrap() -= 1;
|
|
|
} else {
|
|
|
// We just walked to the ghost, no more index
|
|
|
self.index = None;
|
|
|
}
|
|
|
}
|
|
|
} else if !self.list.is_empty() {
|
|
|
// We're at the ghost, and there is a real back, so move to it!
|
|
|
self.cur = self.list.back;
|
|
|
self.index = Some(self.list.len - 1)
|
|
|
} else {
|
|
|
// We're at the ghost, but that's the only element... do nothing.
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn current(&mut self) -> Option<&mut T> {
|
|
|
unsafe { self.cur.map(|node| &mut (*node.as_ptr()).elem) }
|
|
|
}
|
|
|
|
|
|
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)
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn split_before(&mut self) -> LinkedList<T> {
|
|
|
// We have this:
|
|
|
//
|
|
|
// list.front -> A <-> B <-> C <-> D <- list.back
|
|
|
// ^
|
|
|
// cur
|
|
|
//
|
|
|
//
|
|
|
// And we want to produce this:
|
|
|
//
|
|
|
// list.front -> C <-> D <- list.back
|
|
|
// ^
|
|
|
// cur
|
|
|
//
|
|
|
//
|
|
|
// return.front -> A <-> B <- return.back
|
|
|
//
|
|
|
if let Some(cur) = self.cur {
|
|
|
// We are pointing at a real element, so the list is non-empty.
|
|
|
unsafe {
|
|
|
// Current state
|
|
|
let old_len = self.list.len;
|
|
|
let old_idx = self.index.unwrap();
|
|
|
let prev = (*cur.as_ptr()).front;
|
|
|
|
|
|
// What self will become
|
|
|
let new_len = old_len - old_idx;
|
|
|
let new_front = self.cur;
|
|
|
let new_back = self.list.back;
|
|
|
let new_idx = Some(0);
|
|
|
|
|
|
// What the output will become
|
|
|
let output_len = old_len - new_len;
|
|
|
let output_front = self.list.front;
|
|
|
let output_back = prev;
|
|
|
|
|
|
// Break the links between cur and prev
|
|
|
if let Some(prev) = prev {
|
|
|
(*cur.as_ptr()).front = None;
|
|
|
(*prev.as_ptr()).back = None;
|
|
|
}
|
|
|
|
|
|
// Produce the result:
|
|
|
self.list.len = new_len;
|
|
|
self.list.front = new_front;
|
|
|
self.list.back = new_back;
|
|
|
self.index = new_idx;
|
|
|
|
|
|
LinkedList {
|
|
|
front: output_front,
|
|
|
back: output_back,
|
|
|
len: output_len,
|
|
|
_boo: PhantomData,
|
|
|
}
|
|
|
}
|
|
|
} else {
|
|
|
// We're at the ghost, just replace our list with an empty one.
|
|
|
// No other state needs to be changed.
|
|
|
std::mem::replace(self.list, LinkedList::new())
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn split_after(&mut self) -> LinkedList<T> {
|
|
|
// We have this:
|
|
|
//
|
|
|
// list.front -> A <-> B <-> C <-> D <- list.back
|
|
|
// ^
|
|
|
// cur
|
|
|
//
|
|
|
//
|
|
|
// And we want to produce this:
|
|
|
//
|
|
|
// list.front -> A <-> B <- list.back
|
|
|
// ^
|
|
|
// cur
|
|
|
//
|
|
|
//
|
|
|
// return.front -> C <-> D <- return.back
|
|
|
//
|
|
|
if let Some(cur) = self.cur {
|
|
|
// We are pointing at a real element, so the list is non-empty.
|
|
|
unsafe {
|
|
|
// Current state
|
|
|
let old_len = self.list.len;
|
|
|
let old_idx = self.index.unwrap();
|
|
|
let next = (*cur.as_ptr()).back;
|
|
|
|
|
|
// What self will become
|
|
|
let new_len = old_idx + 1;
|
|
|
let new_back = self.cur;
|
|
|
let new_front = self.list.front;
|
|
|
let new_idx = Some(old_idx);
|
|
|
|
|
|
// What the output will become
|
|
|
let output_len = old_len - new_len;
|
|
|
let output_front = next;
|
|
|
let output_back = self.list.back;
|
|
|
|
|
|
// Break the links between cur and next
|
|
|
if let Some(next) = next {
|
|
|
(*cur.as_ptr()).back = None;
|
|
|
(*next.as_ptr()).front = None;
|
|
|
}
|
|
|
|
|
|
// Produce the result:
|
|
|
self.list.len = new_len;
|
|
|
self.list.front = new_front;
|
|
|
self.list.back = new_back;
|
|
|
self.index = new_idx;
|
|
|
|
|
|
LinkedList {
|
|
|
front: output_front,
|
|
|
back: output_back,
|
|
|
len: output_len,
|
|
|
_boo: PhantomData,
|
|
|
}
|
|
|
}
|
|
|
} else {
|
|
|
// We're at the ghost, just replace our list with an empty one.
|
|
|
// No other state needs to be changed.
|
|
|
std::mem::replace(self.list, LinkedList::new())
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn splice_before(&mut self, mut input: LinkedList<T>) {
|
|
|
// We have this:
|
|
|
//
|
|
|
// input.front -> 1 <-> 2 <- input.back
|
|
|
//
|
|
|
// list.front -> A <-> B <-> C <- list.back
|
|
|
// ^
|
|
|
// cur
|
|
|
//
|
|
|
//
|
|
|
// Becoming this:
|
|
|
//
|
|
|
// list.front -> A <-> 1 <-> 2 <-> B <-> C <- list.back
|
|
|
// ^
|
|
|
// cur
|
|
|
//
|
|
|
unsafe {
|
|
|
// We can either `take` the input's pointers or `mem::forget`
|
|
|
// it. Using `take` is more responsible in case we ever do custom
|
|
|
// allocators or something that also needs to be cleaned up!
|
|
|
if input.is_empty() {
|
|
|
// Input is empty, do nothing.
|
|
|
} else if let Some(cur) = self.cur {
|
|
|
// Both lists are non-empty
|
|
|
let in_front = input.front.take().unwrap();
|
|
|
let in_back = input.back.take().unwrap();
|
|
|
|
|
|
if let Some(prev) = (*cur.as_ptr()).front {
|
|
|
// General Case, no boundaries, just internal fixups
|
|
|
(*prev.as_ptr()).back = Some(in_front);
|
|
|
(*in_front.as_ptr()).front = Some(prev);
|
|
|
(*cur.as_ptr()).front = Some(in_back);
|
|
|
(*in_back.as_ptr()).back = Some(cur);
|
|
|
} else {
|
|
|
// No prev, we're appending to the front
|
|
|
(*cur.as_ptr()).front = Some(in_back);
|
|
|
(*in_back.as_ptr()).back = Some(cur);
|
|
|
self.list.front = Some(in_front);
|
|
|
}
|
|
|
// Index moves forward by input length
|
|
|
*self.index.as_mut().unwrap() += input.len;
|
|
|
} else if let Some(back) = self.list.back {
|
|
|
// We're on the ghost but non-empty, append to the back
|
|
|
let in_front = input.front.take().unwrap();
|
|
|
let in_back = input.back.take().unwrap();
|
|
|
|
|
|
(*back.as_ptr()).back = Some(in_front);
|
|
|
(*in_front.as_ptr()).front = Some(back);
|
|
|
self.list.back = Some(in_back);
|
|
|
} else {
|
|
|
// We're empty, become the input, remain on the ghost
|
|
|
std::mem::swap(self.list, &mut input);
|
|
|
}
|
|
|
|
|
|
self.list.len += input.len;
|
|
|
// Not necessary but Polite To Do
|
|
|
input.len = 0;
|
|
|
|
|
|
// Input dropped here
|
|
|
}
|
|
|
}
|
|
|
|
|
|
pub fn splice_after(&mut self, mut input: LinkedList<T>) {
|
|
|
// We have this:
|
|
|
//
|
|
|
// input.front -> 1 <-> 2 <- input.back
|
|
|
//
|
|
|
// list.front -> A <-> B <-> C <- list.back
|
|
|
// ^
|
|
|
// cur
|
|
|
//
|
|
|
//
|
|
|
// Becoming this:
|
|
|
//
|
|
|
// list.front -> A <-> B <-> 1 <-> 2 <-> C <- list.back
|
|
|
// ^
|
|
|
// cur
|
|
|
//
|
|
|
unsafe {
|
|
|
// We can either `take` the input's pointers or `mem::forget`
|
|
|
// it. Using `take` is more responsible in case we ever do custom
|
|
|
// allocators or something that also needs to be cleaned up!
|
|
|
if input.is_empty() {
|
|
|
// Input is empty, do nothing.
|
|
|
} else if let Some(cur) = self.cur {
|
|
|
// Both lists are non-empty
|
|
|
let in_front = input.front.take().unwrap();
|
|
|
let in_back = input.back.take().unwrap();
|
|
|
|
|
|
if let Some(next) = (*cur.as_ptr()).back {
|
|
|
// General Case, no boundaries, just internal fixups
|
|
|
(*next.as_ptr()).front = Some(in_back);
|
|
|
(*in_back.as_ptr()).back = Some(next);
|
|
|
(*cur.as_ptr()).back = Some(in_front);
|
|
|
(*in_front.as_ptr()).front = Some(cur);
|
|
|
} else {
|
|
|
// No next, we're appending to the back
|
|
|
(*cur.as_ptr()).back = Some(in_front);
|
|
|
(*in_front.as_ptr()).front = Some(cur);
|
|
|
self.list.back = Some(in_back);
|
|
|
}
|
|
|
// Index doesn't change
|
|
|
} else if let Some(front) = self.list.front {
|
|
|
// We're on the ghost but non-empty, append to the front
|
|
|
let in_front = input.front.take().unwrap();
|
|
|
let in_back = input.back.take().unwrap();
|
|
|
|
|
|
(*front.as_ptr()).front = Some(in_back);
|
|
|
(*in_back.as_ptr()).back = Some(front);
|
|
|
self.list.front = Some(in_front);
|
|
|
} else {
|
|
|
// We're empty, become the input, remain on the ghost
|
|
|
std::mem::swap(self.list, &mut input);
|
|
|
}
|
|
|
|
|
|
self.list.len += input.len;
|
|
|
// Not necessary but Polite To Do
|
|
|
input.len = 0;
|
|
|
|
|
|
// Input dropped here
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
|
|
|
unsafe impl<T: Send> Send for LinkedList<T> {}
|
|
|
unsafe impl<T: Sync> Sync for LinkedList<T> {}
|
|
|
|
|
|
unsafe impl<'a, T: Send> Send for Iter<'a, T> {}
|
|
|
unsafe impl<'a, T: Sync> Sync for Iter<'a, T> {}
|
|
|
|
|
|
unsafe impl<'a, T: Send> Send for IterMut<'a, T> {}
|
|
|
unsafe impl<'a, T: Sync> Sync for IterMut<'a, T> {}
|
|
|
|
|
|
#[allow(dead_code)]
|
|
|
fn assert_properties() {
|
|
|
fn is_send<T: Send>() {}
|
|
|
fn is_sync<T: Sync>() {}
|
|
|
|
|
|
is_send::<LinkedList<i32>>();
|
|
|
is_sync::<LinkedList<i32>>();
|
|
|
|
|
|
is_send::<IntoIter<i32>>();
|
|
|
is_sync::<IntoIter<i32>>();
|
|
|
|
|
|
is_send::<Iter<i32>>();
|
|
|
is_sync::<Iter<i32>>();
|
|
|
|
|
|
is_send::<IterMut<i32>>();
|
|
|
is_sync::<IterMut<i32>>();
|
|
|
|
|
|
fn linked_list_covariant<'a, T>(x: LinkedList<&'static T>) -> LinkedList<&'a T> {
|
|
|
x
|
|
|
}
|
|
|
fn iter_covariant<'i, 'a, T>(x: Iter<'i, &'static T>) -> Iter<'i, &'a T> {
|
|
|
x
|
|
|
}
|
|
|
fn into_iter_covariant<'a, T>(x: IntoIter<&'static T>) -> IntoIter<&'a T> {
|
|
|
x
|
|
|
}
|
|
|
|
|
|
/// ```compile_fail,E0308
|
|
|
/// use linked_list::IterMut;
|
|
|
///
|
|
|
/// fn iter_mut_covariant<'i, 'a, T>(x: IterMut<'i, &'static T>) -> IterMut<'i, &'a T> { x }
|
|
|
/// ```
|
|
|
fn iter_mut_invariant() {}
|
|
|
}
|
|
|
|
|
|
#[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());
|
|
|
}
|
|
|
|
|
|
#[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: 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>
|
|
|
|
|
|
</main>
|
|
|
|
|
|
<nav class="nav-wrapper" aria-label="Page navigation">
|
|
|
<!-- Mobile navigation buttons -->
|
|
|
<a rel="prev" href="../../too-many-lists/production-unsafe-deque/testing-cursors.html" class="mobile-nav-chapters previous" title="Previous chapter" aria-label="Previous chapter" aria-keyshortcuts="Left">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 320 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M41.4 233.4c-12.5 12.5-12.5 32.8 0 45.3l160 160c12.5 12.5 32.8 12.5 45.3 0s12.5-32.8 0-45.3L109.3 256 246.6 118.6c12.5-12.5 12.5-32.8 0-45.3s-32.8-12.5-45.3 0l-160 160z"/></svg></span>
|
|
|
</a>
|
|
|
|
|
|
<a rel="next prefetch" href="../../too-many-lists/advanced-lists/intro.html" class="mobile-nav-chapters next" title="Next chapter" aria-label="Next chapter" aria-keyshortcuts="Right">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 320 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M278.6 233.4c12.5 12.5 12.5 32.8 0 45.3l-160 160c-12.5 12.5-32.8 12.5-45.3 0s-12.5-32.8 0-45.3L210.7 256 73.4 118.6c-12.5-12.5-12.5-32.8 0-45.3s32.8-12.5 45.3 0l160 160z"/></svg></span>
|
|
|
</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/testing-cursors.html" class="nav-chapters previous" title="Previous chapter" aria-label="Previous chapter" aria-keyshortcuts="Left">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 320 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M41.4 233.4c-12.5 12.5-12.5 32.8 0 45.3l160 160c12.5 12.5 32.8 12.5 45.3 0s12.5-32.8 0-45.3L109.3 256 246.6 118.6c12.5-12.5 12.5-32.8 0-45.3s-32.8-12.5-45.3 0l-160 160z"/></svg></span>
|
|
|
</a>
|
|
|
|
|
|
<a rel="next prefetch" href="../../too-many-lists/advanced-lists/intro.html" class="nav-chapters next" title="Next chapter" aria-label="Next chapter" aria-keyshortcuts="Right">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 320 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M278.6 233.4c12.5 12.5 12.5 32.8 0 45.3l-160 160c-12.5 12.5-32.8 12.5-45.3 0s-12.5-32.8 0-45.3L210.7 256 73.4 118.6c-12.5-12.5-12.5-32.8 0-45.3s32.8-12.5 45.3 0l160 160z"/></svg></span>
|
|
|
</a>
|
|
|
</nav>
|
|
|
|
|
|
</div>
|
|
|
|
|
|
<template id=fa-eye><span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 576 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M288 32c-80.8 0-145.5 36.8-192.6 80.6C48.6 156 17.3 208 2.5 243.7c-3.3 7.9-3.3 16.7 0 24.6C17.3 304 48.6 356 95.4 399.4C142.5 443.2 207.2 480 288 480s145.5-36.8 192.6-80.6c46.8-43.5 78.1-95.4 93-131.1c3.3-7.9 3.3-16.7 0-24.6c-14.9-35.7-46.2-87.7-93-131.1C433.5 68.8 368.8 32 288 32zM432 256c0 79.5-64.5 144-144 144s-144-64.5-144-144s64.5-144 144-144s144 64.5 144 144zM288 192c0 35.3-28.7 64-64 64c-11.5 0-22.3-3-31.6-8.4c-.2 2.8-.4 5.5-.4 8.4c0 53 43 96 96 96s96-43 96-96s-43-96-96-96c-2.8 0-5.6 .1-8.4 .4c5.3 9.3 8.4 20.1 8.4 31.6z"/></svg></span></template>
|
|
|
<template id=fa-eye-slash><span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 640 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M38.8 5.1C28.4-3.1 13.3-1.2 5.1 9.2S-1.2 34.7 9.2 42.9l592 464c10.4 8.2 25.5 6.3 33.7-4.1s6.3-25.5-4.1-33.7L525.6 386.7c39.6-40.6 66.4-86.1 79.9-118.4c3.3-7.9 3.3-16.7 0-24.6c-14.9-35.7-46.2-87.7-93-131.1C465.5 68.8 400.8 32 320 32c-68.2 0-125 26.3-169.3 60.8L38.8 5.1zM223.1 149.5C248.6 126.2 282.7 112 320 112c79.5 0 144 64.5 144 144c0 24.9-6.3 48.3-17.4 68.7L408 294.5c5.2-11.8 8-24.8 8-38.5c0-53-43-96-96-96c-2.8 0-5.6 .1-8.4 .4c5.3 9.3 8.4 20.1 8.4 31.6c0 10.2-2.4 19.8-6.6 28.3l-90.3-70.8zm223.1 298L373 389.9c-16.4 6.5-34.3 10.1-53 10.1c-79.5 0-144-64.5-144-144c0-6.9 .5-13.6 1.4-20.2L83.1 161.5C60.3 191.2 44 220.8 34.5 243.7c-3.3 7.9-3.3 16.7 0 24.6c14.9 35.7 46.2 87.7 93 131.1C174.5 443.2 239.2 480 320 480c47.8 0 89.9-12.9 126.2-32.5z"/></svg></span></template>
|
|
|
<template id=fa-copy><span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M502.6 70.63l-61.25-61.25C435.4 3.371 427.2 0 418.7 0H255.1c-35.35 0-64 28.66-64 64l.0195 256C192 355.4 220.7 384 256 384h192c35.2 0 64-28.8 64-64V93.25C512 84.77 508.6 76.63 502.6 70.63zM464 320c0 8.836-7.164 16-16 16H255.1c-8.838 0-16-7.164-16-16L239.1 64.13c0-8.836 7.164-16 16-16h128L384 96c0 17.67 14.33 32 32 32h47.1V320zM272 448c0 8.836-7.164 16-16 16H63.1c-8.838 0-16-7.164-16-16L47.98 192.1c0-8.836 7.164-16 16-16H160V128H63.99c-35.35 0-64 28.65-64 64l.0098 256C.002 483.3 28.66 512 64 512h192c35.2 0 64-28.8 64-64v-32h-47.1L272 448z"/></svg></span></template>
|
|
|
<template id=fa-play><span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 384 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M73 39c-14.8-9.1-33.4-9.4-48.5-.9S0 62.6 0 80V432c0 17.4 9.4 33.4 24.5 41.9s33.7 8.1 48.5-.9L361 297c14.3-8.7 23-24.2 23-41s-8.7-32.2-23-41L73 39z"/></svg></span></template>
|
|
|
<template id=fa-clock-rotate-left><span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M75 75L41 41C25.9 25.9 0 36.6 0 57.9V168c0 13.3 10.7 24 24 24H134.1c21.4 0 32.1-25.9 17-41l-30.8-30.8C155 85.5 203 64 256 64c106 0 192 86 192 192s-86 192-192 192c-40.8 0-78.6-12.7-109.7-34.4c-14.5-10.1-34.4-6.6-44.6 7.9s-6.6 34.4 7.9 44.6C151.2 495 201.7 512 256 512c141.4 0 256-114.6 256-256S397.4 0 256 0C185.3 0 121.3 28.7 75 75zm181 53c-13.3 0-24 10.7-24 24V256c0 6.4 2.5 12.5 7 17l72 72c9.4 9.4 24.6 9.4 33.9 0s9.4-24.6 0-33.9l-65-65V152c0-13.3-10.7-24-24-24z"/></svg></span></template>
|
|
|
|
|
|
|
|
|
|
|
|
<script>
|
|
|
window.playground_copyable = true;
|
|
|
</script>
|
|
|
|
|
|
<script src="../../ace-2a3cd908.js"></script>
|
|
|
<script src="../../mode-rust-2c9d5c9a.js"></script>
|
|
|
<script src="../../editor-16ca416c.js"></script>
|
|
|
<script src="../../theme-dawn-4493f9c8.js"></script>
|
|
|
<script src="../../theme-tomorrow_night-9dbe62a9.js"></script>
|
|
|
|
|
|
<script src="../../elasticlunr-ef4e11c1.min.js"></script>
|
|
|
<script src="../../mark-09e88c2c.min.js"></script>
|
|
|
<script src="../../searcher-c2a407aa.js"></script>
|
|
|
|
|
|
<script src="../../clipboard-1626706a.min.js"></script>
|
|
|
<script src="../../highlight-abc7f01d.js"></script>
|
|
|
<script src="../../book-a0b12cfe.js"></script>
|
|
|
|
|
|
<!-- Custom JS scripts -->
|
|
|
<script src="../../assets/custom-690c9de5.js"></script>
|
|
|
<script src="../../assets/bigPicture-be03f9c8.js"></script>
|
|
|
|
|
|
|
|
|
|
|
|
</div>
|
|
|
</body>
|
|
|
</html>
|
