|
|
<!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-78591068.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/boring-combinatorics.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="boring-combinatorics"><a class="header" href="#boring-combinatorics">Boring Combinatorics</a></h1>
|
|
|
<p>好了，回到我们的常规链接列表！</p>
|
|
|
<p>首先，让我们来解决 <code>Drop</code> 的问题：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>impl<T> Drop for LinkedList<T> {
|
|
|
fn drop(&mut self) {
|
|
|
// Pop until we have to stop
|
|
|
while let Some(_) = self.pop_front() { }
|
|
|
}
|
|
|
}
|
|
|
<span class="boring">}</span></code></pre>
|
|
|
<p>我们必须填写一堆非常无聊的组合实现，如 front、front_mut、back、back_mut、iter、iter_mut、into_iter……</p>
|
|
|
<p>我已经精心设计了之前的 push/pop 实现，因此我们只需前后对调，代码就能做正确的事情！痛苦的经验万岁！(对于节点来说，使用 “prev和next “是很有诱惑力的，但我发现，为了避免错误，尽量使用 “front “和 “back“才是真正对的）。</p>
|
|
|
<p>首先是 <code>front</code>:</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>pub fn front(&self) -> Option<&T> {
|
|
|
unsafe {
|
|
|
self.front.map(|node| &(*node.as_ptr()).elem)
|
|
|
}
|
|
|
}
|
|
|
<span class="boring">}</span></code></pre>
|
|
|
<p>接着是：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>pub fn front_mut(&mut self) -> Option<&mut T> {
|
|
|
unsafe {
|
|
|
self.front.map(|node| &mut (*node.as_ptr()).elem)
|
|
|
}
|
|
|
}
|
|
|
<span class="boring">}</span></code></pre>
|
|
|
<p>我会把所有的 <code>back</code> 版本放到文章最终的代码中。</p>
|
|
|
<p>接下来是迭代器。与之前的所有列表不同，我们终于解锁了双端迭代器（<a href="https://doc.rust-lang.org/std/iter/trait.DoubleEndedIterator.html">DoubleEndedIterator</a>）的功能，而且如果要达到生产质量，我们还要支持精确大小迭代器（ <a href="https://doc.rust-lang.org/std/iter/trait.ExactSizeIterator.html">ExactSizeIterator</a>）。</p>
|
|
|
<p>因此，除了 <code>next</code> 和 <code>size_hint</code>，我们还将支持 <code>next_back</code> 和 <code>len</code>。</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>pub struct Iter<'a, T> {
|
|
|
front: Link<T>,
|
|
|
back: Link<T>,
|
|
|
len: usize,
|
|
|
_boo: PhantomData<&'a T>,
|
|
|
}
|
|
|
|
|
|
impl<T> LinkedList<T> {
|
|
|
pub fn iter(&self) -> Iter<T> {
|
|
|
Iter {
|
|
|
front: self.front,
|
|
|
back: self.back,
|
|
|
len: self.len,
|
|
|
_boo: PhantomData,
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
|
|
|
|
|
|
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
|
|
|
}
|
|
|
}
|
|
|
<span class="boring">}</span></code></pre>
|
|
|
<p>…这只是 <code>.iter()</code>…</p>
|
|
|
<p>我们将在最后粘贴 IterMut，它在很多地方与 <code>mut</code> 的代码完全相同，让我们先敲掉 <code>into_iter</code>。我们仍然可以使用我们屡试不爽的解决方案，即让它包裹我们的集合，并在下一步中使用 <code>pop</code>：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>pub struct IntoIter<T> {
|
|
|
list: LinkedList<T>,
|
|
|
}
|
|
|
|
|
|
impl<T> LinkedList<T> {
|
|
|
pub fn into_iter(self) -> IntoIter<T> {
|
|
|
IntoIter {
|
|
|
list: self
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
|
|
|
|
|
|
impl<T> IntoIterator for LinkedList<T> {
|
|
|
type IntoIter = IntoIter<T>;
|
|
|
type Item = T;
|
|
|
|
|
|
fn into_iter(self) -> Self::IntoIter {
|
|
|
self.into_iter()
|
|
|
}
|
|
|
}
|
|
|
|
|
|
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
|
|
|
}
|
|
|
}
|
|
|
<span class="boring">}</span></code></pre>
|
|
|
<p>仍然是一大堆模板，但至少是令人满意的模板。</p>
|
|
|
<p>好了，这是我们所有的代码，其中包含了所有的组合：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>use std::ptr::NonNull;
|
|
|
use std::marker::PhantomData;
|
|
|
|
|
|
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>,
|
|
|
}
|
|
|
|
|
|
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 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 into_iter(self) -> IntoIter<T> {
|
|
|
IntoIter {
|
|
|
list: self
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
|
|
|
impl<T> Drop for LinkedList<T> {
|
|
|
fn drop(&mut self) {
|
|
|
// Pop until we have to stop
|
|
|
while let Some(_) = self.pop_front() { }
|
|
|
}
|
|
|
}
|
|
|
|
|
|
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 {
|
|
|
self.into_iter()
|
|
|
}
|
|
|
}
|
|
|
|
|
|
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
|
|
|
}
|
|
|
}
|
|
|
|
|
|
|
|
|
#[cfg(test)]
|
|
|
mod test {
|
|
|
use super::LinkedList;
|
|
|
|
|
|
#[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);
|
|
|
}
|
|
|
}
|
|
|
<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/drop-and-panic-safety.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/production-unsafe-deque/filling-in-random-bits.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/drop-and-panic-safety.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/production-unsafe-deque/filling-in-random-bits.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-7d8ae1df.js"></script>
|
|
|
<script src="../../assets/bigPicture-be03f9c8.js"></script>
|
|
|
|
|
|
|
|
|
|
|
|
</div>
|
|
|
</body>
|
|
|
</html>
|
