mirror of
https://github.com/rtic-rs/rtic.git
synced 2025-12-21 15:25:19 +01:00
9 lines
No EOL
6.3 KiB
HTML
9 lines
No EOL
6.3 KiB
HTML
<!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 table implemented with quadratic probing and SIMD lookup."><title>hashbrown::hash_table - 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-e56847b5.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.91.1 (ed61e7d7e 2025-11-07)" data-channel="1.91.1" data-search-js="search-e256b49e.js" data-stringdex-js="stringdex-c3e638e9.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-6dc2a7f3.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_table</a></h2></rustdoc-topbar><nav class="sidebar"><div class="sidebar-crate"><h2><a href="../../hashbrown/index.html">hashbrown</a><span class="version">0.16.0</span></h2></div><div class="sidebar-elems"><section id="rustdoc-toc"><h2 class="location"><a href="#">Module hash_<wbr>table</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>table</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#119">Source</a> </span></div><details class="toggle top-doc" open><summary class="hideme"><span>Expand description</span></summary><div class="docblock"><p>A hash table 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.AbsentEntry.html" title="struct hashbrown::hash_table::AbsentEntry">Absent<wbr>Entry</a></dt><dd>Type representing the absence of an entry, as returned by <a href="../struct.HashTable.html#method.find_entry" title="method hashbrown::HashTable::find_entry"><code>HashTable::find_entry</code></a>.</dd><dt><a class="struct" href="struct.Drain.html" title="struct hashbrown::hash_table::Drain">Drain</a></dt><dd>A draining iterator over the items of a <code>HashTable</code>.</dd><dt><a class="struct" href="struct.ExtractIf.html" title="struct hashbrown::hash_table::ExtractIf">Extract<wbr>If</a></dt><dd>A draining iterator over entries of a <code>HashTable</code> which don’t satisfy the predicate <code>f</code>.</dd><dt><a class="struct" href="struct.HashTable.html" title="struct hashbrown::hash_table::HashTable">Hash<wbr>Table</a></dt><dd>Low-level hash table with explicit hashing.</dd><dt><a class="struct" href="struct.IntoIter.html" title="struct hashbrown::hash_table::IntoIter">Into<wbr>Iter</a></dt><dd>An owning iterator over the entries of a <code>HashTable</code> in arbitrary order.
|
||
The iterator element type is <code>T</code>.</dd><dt><a class="struct" href="struct.Iter.html" title="struct hashbrown::hash_table::Iter">Iter</a></dt><dd>An iterator over the entries of a <code>HashTable</code> in arbitrary order.
|
||
The iterator element type is <code>&'a T</code>.</dd><dt><a class="struct" href="struct.IterHash.html" title="struct hashbrown::hash_table::IterHash">Iter<wbr>Hash</a></dt><dd>An iterator over the entries of a <code>HashTable</code> that could match a given hash.
|
||
The iterator element type is <code>&'a T</code>.</dd><dt><a class="struct" href="struct.IterHashMut.html" title="struct hashbrown::hash_table::IterHashMut">Iter<wbr>Hash<wbr>Mut</a></dt><dd>A mutable iterator over the entries of a <code>HashTable</code> that could match a given hash.
|
||
The iterator element type is <code>&'a mut T</code>.</dd><dt><a class="struct" href="struct.IterMut.html" title="struct hashbrown::hash_table::IterMut">IterMut</a></dt><dd>A mutable iterator over the entries of a <code>HashTable</code> in arbitrary order.
|
||
The iterator element type is <code>&'a mut T</code>.</dd><dt><a class="struct" href="struct.OccupiedEntry.html" title="struct hashbrown::hash_table::OccupiedEntry">Occupied<wbr>Entry</a></dt><dd>A view into an occupied entry in a <code>HashTable</code>.
|
||
It is part of the <a href="enum.Entry.html"><code>Entry</code></a> enum.</dd><dt><a class="struct" href="struct.VacantEntry.html" title="struct hashbrown::hash_table::VacantEntry">Vacant<wbr>Entry</a></dt><dd>A view into a vacant entry in a <code>HashTable</code>.
|
||
It is part of the <a href="enum.Entry.html"><code>Entry</code></a> enum.</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_table::Entry">Entry</a></dt><dd>A view into a single entry in a table, which may either be vacant or occupied.</dd></dl></section></div></main></body></html> |