Adding large folders

This commit is contained in:
2026-02-26 12:00:21 -05:00
parent 5400d82acd
commit 49701c85ad
47332 changed files with 1942573 additions and 0 deletions

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

View File

@@ -0,0 +1,16 @@
<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="A hash map implemented with quadratic probing and SIMD lookup."><title>hashbrown::hash_map - Rust</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-6b053e98.ttf.woff2,FiraSans-Italic-81dc35de.woff2,FiraSans-Regular-0fe48ade.woff2,FiraSans-MediumItalic-ccf7e434.woff2,FiraSans-Medium-e1aa3f0a.woff2,SourceCodePro-Regular-8badfe75.ttf.woff2,SourceCodePro-Semibold-aa29a496.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2"href="../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../static.files/normalize-9960930a.css"><link rel="stylesheet" href="../../static.files/rustdoc-ca0dd0c4.css"><meta name="rustdoc-vars" data-root-path="../../" data-static-root-path="../../static.files/" data-current-crate="hashbrown" data-themes="" data-resource-suffix="" data-rustdoc-version="1.93.1 (01f6ddf75 2026-02-11) (Arch Linux rust 1:1.93.1-1)" data-channel="1.93.1" data-search-js="search-9e2438ea.js" data-stringdex-js="stringdex-a3946164.js" data-settings-js="settings-c38705f0.js" ><script src="../../static.files/storage-e2aeef58.js"></script><script defer src="../sidebar-items.js"></script><script defer src="../../static.files/main-a410ff4d.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-263c88ec.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-eab170b8.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-044be391.svg"></head><body class="rustdoc mod"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><rustdoc-topbar><h2><a href="#">Module hash_map</a></h2></rustdoc-topbar><nav class="sidebar"><div class="sidebar-crate"><h2><a href="../../hashbrown/index.html">hashbrown</a><span class="version">0.16.1</span></h2></div><div class="sidebar-elems"><section id="rustdoc-toc"><h2 class="location"><a href="#">Module hash_<wbr>map</a></h2><h3><a href="#structs">Module Items</a></h3><ul class="block"><li><a href="#structs" title="Structs">Structs</a></li><li><a href="#enums" title="Enums">Enums</a></li></ul></section><div id="rustdoc-modnav"><h2 class="in-crate"><a href="../index.html">In crate hashbrown</a></h2></div></div></nav><div class="sidebar-resizer" title="Drag to resize sidebar"></div><main><div class="width-limiter"><section id="main-content" class="content"><div class="main-heading"><div class="rustdoc-breadcrumbs"><a href="../index.html">hashbrown</a></div><h1>Module <span>hash_<wbr>map</span>&nbsp;<button id="copy-path" title="Copy item path to clipboard">Copy item path</button></h1><rustdoc-toolbar></rustdoc-toolbar><span class="sub-heading"><a class="src" href="../../src/hashbrown/lib.rs.html#89">Source</a> </span></div><details class="toggle top-doc" open><summary class="hideme"><span>Expand description</span></summary><div class="docblock"><p>A hash map implemented with quadratic probing and SIMD lookup.</p>
</div></details><h2 id="structs" class="section-header">Structs<a href="#structs" class="anchor">§</a></h2><dl class="item-table"><dt><a class="struct" href="struct.Drain.html" title="struct hashbrown::hash_map::Drain">Drain</a></dt><dd>A draining iterator over the entries of a <code>HashMap</code> in arbitrary
order. The iterator element type is <code>(K, V)</code>.</dd><dt><a class="struct" href="struct.ExtractIf.html" title="struct hashbrown::hash_map::ExtractIf">Extract<wbr>If</a></dt><dd>A draining iterator over entries of a <code>HashMap</code> which dont satisfy the predicate
<code>f(&amp;k, &amp;mut v)</code> in arbitrary order. The iterator element type is <code>(K, V)</code>.</dd><dt><a class="struct" href="struct.HashMap.html" title="struct hashbrown::hash_map::HashMap">HashMap</a></dt><dd>A hash map implemented with quadratic probing and SIMD lookup.</dd><dt><a class="struct" href="struct.IntoIter.html" title="struct hashbrown::hash_map::IntoIter">Into<wbr>Iter</a></dt><dd>An owning iterator over the entries of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>(K, V)</code>.</dd><dt><a class="struct" href="struct.IntoKeys.html" title="struct hashbrown::hash_map::IntoKeys">Into<wbr>Keys</a></dt><dd>An owning iterator over the keys of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>K</code>.</dd><dt><a class="struct" href="struct.IntoValues.html" title="struct hashbrown::hash_map::IntoValues">Into<wbr>Values</a></dt><dd>An owning iterator over the values of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>V</code>.</dd><dt><a class="struct" href="struct.Iter.html" title="struct hashbrown::hash_map::Iter">Iter</a></dt><dd>An iterator over the entries of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>(&amp;'a K, &amp;'a V)</code>.</dd><dt><a class="struct" href="struct.IterMut.html" title="struct hashbrown::hash_map::IterMut">IterMut</a></dt><dd>A mutable iterator over the entries of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>(&amp;'a K, &amp;'a mut V)</code>.</dd><dt><a class="struct" href="struct.Keys.html" title="struct hashbrown::hash_map::Keys">Keys</a></dt><dd>An iterator over the keys of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>&amp;'a K</code>.</dd><dt><a class="struct" href="struct.OccupiedEntry.html" title="struct hashbrown::hash_map::OccupiedEntry">Occupied<wbr>Entry</a></dt><dd>A view into an occupied entry in a <a href="../struct.HashMap.html" title="struct hashbrown::HashMap"><code>HashMap</code></a>.
It is part of the <a href="enum.Entry.html" title="enum hashbrown::hash_map::Entry"><code>Entry</code></a> and <a href="enum.EntryRef.html" title="enum hashbrown::hash_map::EntryRef"><code>EntryRef</code></a> enums.</dd><dt><a class="struct" href="struct.OccupiedError.html" title="struct hashbrown::hash_map::OccupiedError">Occupied<wbr>Error</a></dt><dd>The error returned by <a href="../struct.HashMap.html#method.try_insert" title="method hashbrown::HashMap::try_insert"><code>try_insert</code></a> when the key already exists.</dd><dt><a class="struct" href="struct.VacantEntry.html" title="struct hashbrown::hash_map::VacantEntry">Vacant<wbr>Entry</a></dt><dd>A view into a vacant entry in a <code>HashMap</code>.
It is part of the <a href="enum.Entry.html"><code>Entry</code></a> enum.</dd><dt><a class="struct" href="struct.VacantEntryRef.html" title="struct hashbrown::hash_map::VacantEntryRef">Vacant<wbr>Entry<wbr>Ref</a></dt><dd>A view into a vacant entry in a <code>HashMap</code>.
It is part of the <a href="enum.EntryRef.html"><code>EntryRef</code></a> enum.</dd><dt><a class="struct" href="struct.Values.html" title="struct hashbrown::hash_map::Values">Values</a></dt><dd>An iterator over the values of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>&amp;'a V</code>.</dd><dt><a class="struct" href="struct.ValuesMut.html" title="struct hashbrown::hash_map::ValuesMut">Values<wbr>Mut</a></dt><dd>A mutable iterator over the values of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>&amp;'a mut V</code>.</dd></dl><h2 id="enums" class="section-header">Enums<a href="#enums" class="anchor">§</a></h2><dl class="item-table"><dt><a class="enum" href="enum.Entry.html" title="enum hashbrown::hash_map::Entry">Entry</a></dt><dd>A view into a single entry in a map, which may either be vacant or occupied.</dd><dt><a class="enum" href="enum.EntryRef.html" title="enum hashbrown::hash_map::EntryRef">Entry<wbr>Ref</a></dt><dd>A view into a single entry in a map, which may either be vacant or occupied,
with any borrowed form of the maps key type.</dd></dl></section></div></main></body></html>

View File

@@ -0,0 +1 @@
window.SIDEBAR_ITEMS = {"enum":["Entry","EntryRef"],"struct":["Drain","ExtractIf","HashMap","IntoIter","IntoKeys","IntoValues","Iter","IterMut","Keys","OccupiedEntry","OccupiedError","VacantEntry","VacantEntryRef","Values","ValuesMut"]};

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long