rtic/1/api/hashbrown/hash_map/index.html
2024-12-06 13:35:18 +00:00

19 lines
No EOL
11 KiB
HTML
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

<!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-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../static.files/rustdoc-b0742ba02757f159.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.83.0 (90b35a623 2024-11-26)" data-channel="1.83.0" data-search-js="search-f0d225181b97f9a4.js" data-settings-js="settings-805db61a62df4bd2.js" ><script src="../../static.files/storage-1d39b6787ed640ff.js"></script><script defer src="../sidebar-items.js"></script><script defer src="../../static.files/main-f070b9041d14864c.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-0111fcff984fae8f.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-2c020d218678b618.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]--><nav class="mobile-topbar"><button class="sidebar-menu-toggle" title="show sidebar"></button></nav><nav class="sidebar"><div class="sidebar-crate"><h2><a href="../../hashbrown/index.html">hashbrown</a><span class="version">0.12.3</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"></div><main><div class="width-limiter"><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="main-heading"><span class="rustdoc-breadcrumbs"><a href="../index.html">hashbrown</a></span><h1>Module <span>hash_map</span><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#85">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><ul class="item-table"><li><div class="item-name"><a class="struct" href="struct.Drain.html" title="struct hashbrown::hash_map::Drain">Drain</a></div><div class="desc docblock-short">A draining iterator over the entries of a <code>HashMap</code> in arbitrary
order. The iterator element type is <code>(K, V)</code>.</div></li><li><div class="item-name"><a class="struct" href="struct.DrainFilter.html" title="struct hashbrown::hash_map::DrainFilter">Drain<wbr>Filter</a></div><div class="desc docblock-short">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>.</div></li><li><div class="item-name"><a class="struct" href="struct.HashMap.html" title="struct hashbrown::hash_map::HashMap">HashMap</a></div><div class="desc docblock-short">A hash map implemented with quadratic probing and SIMD lookup.</div></li><li><div class="item-name"><a class="struct" href="struct.IntoIter.html" title="struct hashbrown::hash_map::IntoIter">Into<wbr>Iter</a></div><div class="desc docblock-short">An owning iterator over the entries of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>(K, V)</code>.</div></li><li><div class="item-name"><a class="struct" href="struct.IntoKeys.html" title="struct hashbrown::hash_map::IntoKeys">Into<wbr>Keys</a></div><div class="desc docblock-short">An owning iterator over the keys of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>K</code>.</div></li><li><div class="item-name"><a class="struct" href="struct.IntoValues.html" title="struct hashbrown::hash_map::IntoValues">Into<wbr>Values</a></div><div class="desc docblock-short">An owning iterator over the values of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>V</code>.</div></li><li><div class="item-name"><a class="struct" href="struct.Iter.html" title="struct hashbrown::hash_map::Iter">Iter</a></div><div class="desc docblock-short">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>.</div></li><li><div class="item-name"><a class="struct" href="struct.IterMut.html" title="struct hashbrown::hash_map::IterMut">IterMut</a></div><div class="desc docblock-short">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>.</div></li><li><div class="item-name"><a class="struct" href="struct.Keys.html" title="struct hashbrown::hash_map::Keys">Keys</a></div><div class="desc docblock-short">An iterator over the keys of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>&amp;'a K</code>.</div></li><li><div class="item-name"><a class="struct" href="struct.OccupiedEntry.html" title="struct hashbrown::hash_map::OccupiedEntry">Occupied<wbr>Entry</a></div><div class="desc docblock-short">A view into an occupied entry in a <code>HashMap</code>.
It is part of the <a href="enum.Entry.html"><code>Entry</code></a> enum.</div></li><li><div class="item-name"><a class="struct" href="struct.OccupiedEntryRef.html" title="struct hashbrown::hash_map::OccupiedEntryRef">Occupied<wbr>Entry<wbr>Ref</a></div><div class="desc docblock-short">A view into an occupied entry in a <code>HashMap</code>.
It is part of the <a href="enum.EntryRef.html"><code>EntryRef</code></a> enum.</div></li><li><div class="item-name"><a class="struct" href="struct.OccupiedError.html" title="struct hashbrown::hash_map::OccupiedError">Occupied<wbr>Error</a></div><div class="desc docblock-short">The error returned by <a href="struct.HashMap.html#method.try_insert" title="method hashbrown::hash_map::HashMap::try_insert"><code>try_insert</code></a> when the key already exists.</div></li><li><div class="item-name"><a class="struct" href="struct.RawEntryBuilder.html" title="struct hashbrown::hash_map::RawEntryBuilder">RawEntry<wbr>Builder</a></div><div class="desc docblock-short">A builder for computing where in a <a href="struct.HashMap.html" title="struct hashbrown::hash_map::HashMap"><code>HashMap</code></a> a key-value pair would be stored.</div></li><li><div class="item-name"><a class="struct" href="struct.RawEntryBuilderMut.html" title="struct hashbrown::hash_map::RawEntryBuilderMut">RawEntry<wbr>Builder<wbr>Mut</a></div><div class="desc docblock-short">A builder for computing where in a <a href="struct.HashMap.html" title="struct hashbrown::hash_map::HashMap"><code>HashMap</code></a> a key-value pair would be stored.</div></li><li><div class="item-name"><a class="struct" href="struct.RawOccupiedEntryMut.html" title="struct hashbrown::hash_map::RawOccupiedEntryMut">RawOccupied<wbr>Entry<wbr>Mut</a></div><div class="desc docblock-short">A view into an occupied entry in a <code>HashMap</code>.
It is part of the <a href="enum.RawEntryMut.html"><code>RawEntryMut</code></a> enum.</div></li><li><div class="item-name"><a class="struct" href="struct.RawVacantEntryMut.html" title="struct hashbrown::hash_map::RawVacantEntryMut">RawVacant<wbr>Entry<wbr>Mut</a></div><div class="desc docblock-short">A view into a vacant entry in a <code>HashMap</code>.
It is part of the <a href="enum.RawEntryMut.html"><code>RawEntryMut</code></a> enum.</div></li><li><div class="item-name"><a class="struct" href="struct.VacantEntry.html" title="struct hashbrown::hash_map::VacantEntry">Vacant<wbr>Entry</a></div><div class="desc docblock-short">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.</div></li><li><div class="item-name"><a class="struct" href="struct.VacantEntryRef.html" title="struct hashbrown::hash_map::VacantEntryRef">Vacant<wbr>Entry<wbr>Ref</a></div><div class="desc docblock-short">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.</div></li><li><div class="item-name"><a class="struct" href="struct.Values.html" title="struct hashbrown::hash_map::Values">Values</a></div><div class="desc docblock-short">An iterator over the values of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>&amp;'a V</code>.</div></li><li><div class="item-name"><a class="struct" href="struct.ValuesMut.html" title="struct hashbrown::hash_map::ValuesMut">Values<wbr>Mut</a></div><div class="desc docblock-short">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>.</div></li></ul><h2 id="enums" class="section-header">Enums<a href="#enums" class="anchor">§</a></h2><ul class="item-table"><li><div class="item-name"><a class="enum" href="enum.DefaultHashBuilder.html" title="enum hashbrown::hash_map::DefaultHashBuilder">Default<wbr>Hash<wbr>Builder</a></div><div class="desc docblock-short">Dummy default hasher for <code>HashMap</code>.</div></li><li><div class="item-name"><a class="enum" href="enum.Entry.html" title="enum hashbrown::hash_map::Entry">Entry</a></div><div class="desc docblock-short">A view into a single entry in a map, which may either be vacant or occupied.</div></li><li><div class="item-name"><a class="enum" href="enum.EntryRef.html" title="enum hashbrown::hash_map::EntryRef">Entry<wbr>Ref</a></div><div class="desc docblock-short">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.</div></li><li><div class="item-name"><a class="enum" href="enum.RawEntryMut.html" title="enum hashbrown::hash_map::RawEntryMut">RawEntry<wbr>Mut</a></div><div class="desc docblock-short">A view into a single entry in a map, which may either be vacant or occupied.</div></li></ul></section></div></main></body></html>