</div></details><h2id="structs"class="section-header">Structs<ahref="#structs"class="anchor">§</a></h2><ulclass="item-table"><li><divclass="item-name"><aclass="struct"href="struct.Drain.html"title="struct hashbrown::hash_map::Drain">Drain</a></div><divclass="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><divclass="item-name"><aclass="struct"href="struct.ExtractIf.html"title="struct hashbrown::hash_map::ExtractIf">ExtractIf</a></div><divclass="desc docblock-short">A draining iterator over entries of a <code>HashMap</code> which don’t satisfy the predicate
<code>f(&k, &mut v)</code> in arbitrary order. The iterator element type is <code>(K, V)</code>.</div></li><li><divclass="item-name"><aclass="struct"href="struct.HashMap.html"title="struct hashbrown::hash_map::HashMap">HashMap</a></div><divclass="desc docblock-short">A hash map implemented with quadratic probing and SIMD lookup.</div></li><li><divclass="item-name"><aclass="struct"href="struct.IntoIter.html"title="struct hashbrown::hash_map::IntoIter">IntoIter</a></div><divclass="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><divclass="item-name"><aclass="struct"href="struct.IntoKeys.html"title="struct hashbrown::hash_map::IntoKeys">IntoKeys</a></div><divclass="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><divclass="item-name"><aclass="struct"href="struct.IntoValues.html"title="struct hashbrown::hash_map::IntoValues">IntoValues</a></div><divclass="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><divclass="item-name"><aclass="struct"href="struct.Iter.html"title="struct hashbrown::hash_map::Iter">Iter</a></div><divclass="desc docblock-short">An iterator over the entries of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>(&'a K, &'a V)</code>.</div></li><li><divclass="item-name"><aclass="struct"href="struct.IterMut.html"title="struct hashbrown::hash_map::IterMut">IterMut</a></div><divclass="desc docblock-short">A mutable iterator over the entries of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>(&'a K, &'a mut V)</code>.</div></li><li><divclass="item-name"><aclass="struct"href="struct.Keys.html"title="struct hashbrown::hash_map::Keys">Keys</a></div><divclass="desc docblock-short">An iterator over the keys of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>&'a K</code>.</div></li><li><divclass="item-name"><aclass="struct"href="struct.OccupiedEntry.html"title="struct hashbrown::hash_map::OccupiedEntry">OccupiedEntry</a></div><divclass="desc docblock-short">A view into an occupied entry in a <code>HashMap</code>.
It is part of the <ahref="enum.Entry.html"><code>Entry</code></a> enum.</div></li><li><divclass="item-name"><aclass="struct"href="struct.OccupiedEntryRef.html"title="struct hashbrown::hash_map::OccupiedEntryRef">OccupiedEntryRef</a></div><divclass="desc docblock-short">A view into an occupied entry in a <code>HashMap</code>.
It is part of the <ahref="enum.EntryRef.html"><code>EntryRef</code></a> enum.</div></li><li><divclass="item-name"><aclass="struct"href="struct.OccupiedError.html"title="struct hashbrown::hash_map::OccupiedError">OccupiedError</a></div><divclass="desc docblock-short">The error returned by <ahref="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><divclass="item-name"><aclass="struct"href="struct.RawEntryBuilder.html"title="struct hashbrown::hash_map::RawEntryBuilder">RawEntryBuilder</a></div><divclass="desc docblock-short">A builder for computing where in a <ahref="struct.HashMap.html"title="struct hashbrown::hash_map::HashMap"><code>HashMap</code></a> a key-value pair would be stored.</div></li><li><divclass="item-name"><aclass="struct"href="struct.RawEntryBuilderMut.html"title="struct hashbrown::hash_map::RawEntryBuilderMut">RawEntryBuilderMut</a></div><divclass="desc docblock-short">A builder for computing where in a <ahref="struct.HashMap.html"title="struct hashbrown::hash_map::HashMap"><code>HashMap</code></a> a key-value pair would be stored.</div></li><li><divclass="item-name"><aclass="struct"href="struct.RawOccupiedEntryMut.html"title="struct hashbrown::hash_map::RawOccupiedEntryMut">RawOccupiedEntryMut</a></div><divclass="desc docblock-short">A view into an occupied entry in a <code>HashMap</code>.
It is part of the <ahref="enum.RawEntryMut.html"><code>RawEntryMut</code></a> enum.</div></li><li><divclass="item-name"><aclass="struct"href="struct.RawVacantEntryMut.html"title="struct hashbrown::hash_map::RawVacantEntryMut">RawVacantEntryMut</a></div><divclass="desc docblock-short">A view into a vacant entry in a <code>HashMap</code>.
It is part of the <ahref="enum.RawEntryMut.html"><code>RawEntryMut</code></a> enum.</div></li><li><divclass="item-name"><aclass="struct"href="struct.VacantEntry.html"title="struct hashbrown::hash_map::VacantEntry">VacantEntry</a></div><divclass="desc docblock-short">A view into a vacant entry in a <code>HashMap</code>.
It is part of the <ahref="enum.Entry.html"><code>Entry</code></a> enum.</div></li><li><divclass="item-name"><aclass="struct"href="struct.VacantEntryRef.html"title="struct hashbrown::hash_map::VacantEntryRef">VacantEntryRef</a></div><divclass="desc docblock-short">A view into a vacant entry in a <code>HashMap</code>.
It is part of the <ahref="enum.EntryRef.html"><code>EntryRef</code></a> enum.</div></li><li><divclass="item-name"><aclass="struct"href="struct.Values.html"title="struct hashbrown::hash_map::Values">Values</a></div><divclass="desc docblock-short">An iterator over the values of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>&'a V</code>.</div></li><li><divclass="item-name"><aclass="struct"href="struct.ValuesMut.html"title="struct hashbrown::hash_map::ValuesMut">ValuesMut</a></div><divclass="desc docblock-short">A mutable iterator over the values of a <code>HashMap</code> in arbitrary order.
The iterator element type is <code>&'a mut V</code>.</div></li></ul><h2id="enums"class="section-header">Enums<ahref="#enums"class="anchor">§</a></h2><ulclass="item-table"><li><divclass="item-name"><aclass="enum"href="enum.DefaultHashBuilder.html"title="enum hashbrown::hash_map::DefaultHashBuilder">DefaultHashBuilder</a></div><divclass="desc docblock-short">Dummy default hasher for <code>HashMap</code>.</div></li><li><divclass="item-name"><aclass="enum"href="enum.Entry.html"title="enum hashbrown::hash_map::Entry">Entry</a></div><divclass="desc docblock-short">A view into a single entry in a map, which may either be vacant or occupied.</div></li><li><divclass="item-name"><aclass="enum"href="enum.EntryRef.html"title="enum hashbrown::hash_map::EntryRef">EntryRef</a></div><divclass="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 map’s key type.</div></li><li><divclass="item-name"><aclass="enum"href="enum.RawEntryMut.html"title="enum hashbrown::hash_map::RawEntryMut">RawEntryMut</a></div><divclass="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>
