<!DOCTYPE html><htmllang="en"><head><metacharset="utf-8"><metaname="viewport"content="width=device-width, initial-scale=1.0"><metaname="generator"content="rustdoc"><metaname="description"content="Fixed capacity `IndexMap`"><title>IndexMap in arduboy_rust::heapless - Rust</title><linkrel="preload"as="font"type="font/woff2"crossoriginhref="../../static.files/SourceSerif4-Regular-46f98efaafac5295.ttf.woff2"><linkrel="preload"as="font"type="font/woff2"crossoriginhref="../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><linkrel="preload"as="font"type="font/woff2"crossoriginhref="../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><linkrel="preload"as="font"type="font/woff2"crossoriginhref="../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><linkrel="preload"as="font"type="font/woff2"crossoriginhref="../../static.files/SourceSerif4-Bold-a2c9cd1067f8b328.ttf.woff2"><linkrel="preload"as="font"type="font/woff2"crossoriginhref="../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><linkrel="stylesheet"href="../../static.files/normalize-76eba96aa4d2e634.css"><linkrel="stylesheet"href="../../static.files/rustdoc-cb6f1f67f1bcd037.css"id="mainThemeStyle"><metaname="rustdoc-vars"data-root-path="../../"data-static-root-path="../../static.files/"data-current-crate="arduboy_rust"data-themes=""data-resource-suffix=""data-rustdoc-version="1.73.0-nightly (8131b9774 2023-08-02)"data-channel="nightly"data-search-js="search-6dfdfced5eff6596.js"data-settings-js="settings-de11bff964e9d4e5.js"data-settings-css="settings-8c76f75bfb6bd192.css"data-theme-light-css="light-6d2c9675f3d09c26.css"data-theme-dark-css="dark-45ceb8f2e522f4d1.css"data-theme-ayu-css="ayu-fd19013d6ce078bf.css"><scriptsrc="../../static.files/storage-db41da1a38ea3cb8.js"></script><scriptdefersrc="sidebar-items.js"></script><scriptdefersrc="../../static.files/main-0795b7d26be81095.js"></script><noscript><linkrel="stylesheet"media="(prefers-color-scheme:light)"href="../../static.files/light-6d2c9675f3d09c26.css"><linkrel="stylesheet"media="(prefers-color-scheme:dark)"href="../../static.files/dark-45ceb8f2e522f4d1.css"><linkrel="stylesheet"href="../../static.files/noscript-cffde32267a19fd6.css"></noscript><linkrel="alternate icon"type="image/png"href="../../static.files/favicon-16x16-8b506e7a72182f1c.png"><linkrel="alternate icon"type="image/png"href="../../static.files/favicon-32x32-422f7d1d52889060.png"><linkrel="icon"type="image/svg+xml"href="../../static.files/favicon-2c020d218678b618.svg"></head><bodyclass="rustdoc struct"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><navclass="mobile-topbar"><buttonclass="sidebar-menu-toggle">☰</button><aclass="logo-container"href="../../arduboy_rust/index.html"><imgclass="rust-logo"src="../../static.files/rust-logo-151179464ae7ed46.svg"alt="logo"></a><h2></h2></nav><navclass="sidebar"><aclass="logo-container"href="../../arduboy_rust/index.html"><imgclass="rust-logo"src="../../static.files/rust-logo-151179464ae7ed46.svg"alt="logo"></a><h2class="location"><ahref="#">IndexMap</a></h2><divclass="sidebar-elems"><section><h3><ahref="#implementations">Methods</a></h3><ulclass="block"><li><ahref="#method.capacity">capacity</a></li><li><ahref="#method.clear">clear</a></li><li><ahref="#method.contains_key">contains_key</a></li><li><ahref="#method.entry">entry</a></li><li><ahref="#method.first">first</a></li><li><ahref="#method.first_mut">first_mut</a></li><li><ahref="#method.get">get</a></li><li><ahref="#method.get_mut">get_mut</a></li><li><ahref="#method.insert">insert</a></li><li><ahref="#method.is_empty">is_empty</a></li><li><ahref="#method.iter">iter</a></li><li><ahref="#method.iter_mut">iter_mut</a></li><li><ahref="#method.keys">keys</a></li><li><ahref="#method.last">last</a></li><li><ahref="#method.last_mut">last_mut</a></li><li><ahref="#method.len">len</a></li><li><ahref="#method.new">new</
book_reviews.insert(<spanclass="string">"Pride and Prejudice"</span>, <spanclass="string">"Very enjoyable."</span>).unwrap();
book_reviews.insert(<spanclass="string">"The Adventures of Sherlock Holmes"</span>, <spanclass="string">"Eye lyked it alot."</span>).unwrap();
<spanclass="macro">println!</span>(<spanclass="string">"We've got {} reviews, but Les Misérables ain't one."</span>,
book_reviews.len());
}
<spanclass="comment">// oops, this review has a lot of spelling mistakes, let's delete it.
</span>book_reviews.remove(<spanclass="string">"The Adventures of Sherlock Holmes"</span>);
<spanclass="comment">// look up the values associated with some keys.
</span><spanclass="kw">let </span>to_find = [<spanclass="string">"Pride and Prejudice"</span>, <spanclass="string">"Alice's Adventure in Wonderland"</span>];
S: <aclass="trait"href="../../hash32/trait.BuildHasher.html"title="trait hash32::BuildHasher">BuildHasher</a>,</span></h3></section></summary><divclass="impl-items"><detailsclass="toggle method-toggle"open><summary><sectionid="method.capacity"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#501">source</a><h4class="code-header">pub fn <ahref="#method.capacity"class="fn">capacity</a>(&self) -> usize</h4></section></summary><divclass="docblock"><p>Returns the number of elements the map can hold</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.keys"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#519">source</a><h4class="code-header">pub fn <ahref="#method.keys"class="fn">keys</a>(&self) -> impl Iterator<Item = &K></h4></section></summary><divclass="docblock"><p>Return an iterator over the keys of the map, in their order</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.values"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#537">source</a><h4class="code-header">pub fn <ahref="#method.values"class="fn">values</a>(&self) -> impl Iterator<Item = &V></h4></section></summary><divclass="docblock"><p>Return an iterator over the values of the map, in their order</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.values_mut"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#559">source</a><h4class="code-header">pub fn <ahref="#method.values_mut"class="fn">values_mut</a>(&mut self) -> impl Iterator<Item = &mut V></h4></section></summary><divclass="docblock"><p>Return an iterator over mutable references to the the values of the map, in their order</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.iter"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#577">source</a><h4class="code-header">pub fn <ahref="#method.iter"class="fn">iter</a>(&self) -> Iter<'_, K, V></h4></section></summary><divclass="docblock"><p>Return an iterator over the key-value pairs of the map, in their order</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.iter_mut"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#601">source</a><h4class="code-header">pub fn <ahref="#method.iter_mut"class="fn">iter_mut</a>(&mut self) -> IterMut<'_, K, V></h4></section></summary><divclass="docblock"><p>Return an iterator over the key-value pairs of the map, in their order</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.first"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#610">source</a><h4class="code-header">pub fn <ahref="#method.first"class="fn">first</a>(&self) -> Option<(&K, &V)></h4></section></summary><divclass="docblock"><p>Get the first key-value pair</p>
<p>Computes in <strong>O(1)</strong> time</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.first_mut"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#620">source</a><h4class="code-header">pub fn <ahref="#method.first_mut"class="fn">first_mut</a>(&mut self) -> Option<(&K, &mut V)></h4></section></summary><divclass="docblock"><p>Get the first key-value pair, with mutable access to the value</p>
<p>Computes in <strong>O(1)</strong> time</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.last"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#630">source</a><h4class="code-header">pub fn <ahref="#method.last"class="fn">last</a>(&self) -> Option<(&K, &V)></h4></section></summary><divclass="docblock"><p>Get the last key-value pair</p>
<p>Computes in <strong>O(1)</strong> time</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.last_mut"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#640">source</a><h4class="code-header">pub fn <ahref="#method.last_mut"class="fn">last_mut</a>(&mut self) -> Option<(&K, &mut V)></h4></section></summary><divclass="docblock"><p>Get the last key-value pair, with mutable access to the value</p>
<p>Computes in <strong>O(1)</strong> time</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.entry"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#662">source</a><h4class="code-header">pub fn <ahref="#method.entry"class="fn">entry</a>(&mut self, key: K) -><aclass="enum"href="enum.Entry.html"title="enum arduboy_rust::heapless::Entry">Entry</a><'_, K, V, N></h4></section></summary><divclass="docblock"><p>Returns an entry for the corresponding key</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.len"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#692">source</a><h4class="code-header">pub fn <ahref="#method.len"class="fn">len</a>(&self) -> usize</h4></section></summary><divclass="docblock"><p>Return the number of key-value pairs in the map.</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.is_empty"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#708">source</a><h4class="code-header">pub fn <ahref="#method.is_empty"class="fn">is_empty</a>(&self) -> bool</h4></section></summary><divclass="docblock"><p>Returns true if the map contains no elements.</p>
</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.clear"class="method"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#724">source</a><h4class="code-header">pub fn <ahref="#method.clear"class="fn">clear</a>(&mut self)</h4></section></summary><divclass="docblock"><p>Remove all key-value pairs in the map, while preserving its capacity.</p>
Q: <aclass="trait"href="../../hash32/trait.Hash.html"title="trait hash32::Hash">Hash</a> + Eq + ?Sized,</span></h4></section></summary><divclass="docblock"><p>Returns a reference to the value corresponding to the key.</p>
<p>The key may be any borrowed form of the map’s key type, but <code>Hash</code> and <code>Eq</code> on the borrowed
form <em>must</em> match those for the key type.</p>
<p>Computes in <strong>O(1)</strong> time (average).</p>
Q: Eq + <aclass="trait"href="../../hash32/trait.Hash.html"title="trait hash32::Hash">Hash</a> + ?Sized,</span></h4></section></summary><divclass="docblock"><p>Returns true if the map contains a value for the specified key.</p>
<p>The key may be any borrowed form of the map’s key type, but <code>Hash</code> and <code>Eq</code> on the borrowed
form <em>must</em> match those for the key type.</p>
<p>Computes in <strong>O(1)</strong> time (average).</p>
Q: <aclass="trait"href="../../hash32/trait.Hash.html"title="trait hash32::Hash">Hash</a> + Eq + ?Sized,</span></h4></section></summary><divclass="docblock"><p>Returns a mutable reference to the value corresponding to the key.</p>
<p>The key may be any borrowed form of the map’s key type, but <code>Hash</code> and <code>Eq</code> on the borrowed
form <em>must</em> match those for the key type.</p>
<p>Computes in <strong>O(1)</strong> time (average).</p>
Q: <aclass="trait"href="../../hash32/trait.Hash.html"title="trait hash32::Hash">Hash</a> + Eq + ?Sized,</span></h4></section></summary><divclass="docblock"><p>Remove the key-value pair equivalent to <code>key</code> and return its value.</p>
<p>Like <code>Vec::swap_remove</code>, the pair is removed by swapping it with the last element of the map
and popping it off. <strong>This perturbs the postion of what used to be the last element!</strong></p>
<p>Return <code>None</code> if <code>key</code> is not in map.</p>
<p>Computes in <strong>O(1)</strong> time (average).</p>
I: IntoIterator<Item = (&'a K, &'a V)>,</span></h4></section></summary><divclass='docblock'>Extends a collection with the contents of an iterator. <a>Read more</a></div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.extend_one"class="method trait-impl"><ahref="#method.extend_one"class="anchor">§</a><h4class="code-header">fn <aclass="fn">extend_one</a>(&mut self, item: A)</h4></section></summary><spanclass="item-info"><divclass="stab unstable"><spanclass="emoji">🔬</span><span>This is a nightly-only experimental API. (<code>extend_one</code>)</span></div></span><divclass='docblock'>Extends a collection with exactly one element.</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.extend_reserve"class="method trait-impl"><ahref="#method.extend_reserve"class="anchor">§</a><h4class="code-header">fn <aclass="fn">extend_reserve</a>(&mut self, additional: usize)</h4></section></summary><spanclass="item-info"><divclass="stab unstable"><spanclass="emoji">🔬</span><span>This is a nightly-only experimental API. (<code>extend_one</code>)</span></div></span><divclass='docblock'>Reserves capacity in a collection for the given number of additional elements. <a>Read more</a></div></details></div></details><detailsclass="toggle implementors-toggle"open><summary><sectionid="impl-Extend%3C(K,+V)%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="impl"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#990">source</a><ahref="#impl-Extend%3C(K,+V)%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<K, V, S, const N: usize> Extend<(K, V)> for <aclass="struct"href="struct.IndexMap.html"title="struct arduboy_rust::heapless::IndexMap">IndexMap</a><K, V, S, N><spanclass="where fmt-newline">where
I: IntoIterator<Item = (K, V)>,</span></h4></section></summary><divclass='docblock'>Extends a collection with the contents of an iterator. <a>Read more</a></div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.extend_one-1"class="method trait-impl"><ahref="#method.extend_one-1"class="anchor">§</a><h4class="code-header">fn <aclass="fn">extend_one</a>(&mut self, item: A)</h4></section></summary><spanclass="item-info"><divclass="stab unstable"><spanclass="emoji">🔬</span><span>This is a nightly-only experimental API. (<code>extend_one</code>)</span></div></span><divclass='docblock'>Extends a collection with exactly one element.</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.extend_reserve-1"class="method trait-impl"><ahref="#method.extend_reserve-1"class="anchor">§</a><h4class="code-header">fn <aclass="fn">extend_reserve</a>(&mut self, additional: usize)</h4></section></summary><spanclass="item-info"><divclass="stab unstable"><spanclass="emoji">🔬</span><span>This is a nightly-only experimental API. (<code>extend_one</code>)</span></div></span><divclass='docblock'>Reserves capacity in a collection for the given number of additional elements. <a>Read more</a></div></details></div></details><detailsclass="toggle implementors-toggle"open><summary><sectionid="impl-FromIterator%3C(K,+V)%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="impl"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#1019">source</a><ahref="#impl-FromIterator%3C(K,+V)%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<K, V, S, const N: usize> FromIterator<(K, V)> for <aclass="struct"href="struct.IndexMap.html"title="struct arduboy_rust::heapless::IndexMap">IndexMap</a><K, V, S, N><spanclass="where fmt-newline">where
I: IntoIterator<Item = (K, V)>,</span></h4></section></summary><divclass='docblock'>Creates a value from an iterator. <a>Read more</a></div></details></div></details><detailsclass="toggle implementors-toggle"open><summary><sectionid="impl-Index%3C%26'a+Q%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="impl"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#900">source</a><ahref="#impl-Index%3C%26'a+Q%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<'a, K, Q, V, S, const N: usize> Index<&'a Q> for <aclass="struct"href="struct.IndexMap.html"title="struct arduboy_rust::heapless::IndexMap">IndexMap</a><K, V, S, N><spanclass="where fmt-newline">where
S: <aclass="trait"href="../../hash32/trait.BuildHasher.html"title="trait hash32::BuildHasher">BuildHasher</a>,</span></h3></section></summary><divclass="impl-items"><detailsclass="toggle"open><summary><sectionid="associatedtype.Item"class="associatedtype trait-impl"><ahref="#associatedtype.Item"class="anchor">§</a><h4class="code-header">type <aclass="associatedtype">Item</a> = (&'a K, &'a V)</h4></section></summary><divclass='docblock'>The type of the elements being iterated over.</div></details><detailsclass="toggle"open><summary><sectionid="associatedtype.IntoIter"class="associatedtype trait-impl"><ahref="#associatedtype.IntoIter"class="anchor">§</a><h4class="code-header">type <aclass="associatedtype">IntoIter</a> = Iter<'a, K, V></h4></section></summary><divclass='docblock'>Which kind of iterator are we turning this into?</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.into_iter"class="method trait-impl"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#1070">source</a><ahref="#method.into_iter"class="anchor">§</a><h4class="code-header">fn <aclass="fn">into_iter</a>(self) -><&'a <aclass="struct"href="struct.IndexMap.html"title="struct arduboy_rust::heapless::IndexMap">IndexMap</a><K, V, S, N> as IntoIterator>::IntoIter</h4></section></summary><divclass='docblock'>Creates an iterator from a value. <a>Read more</a></div></details></div></details><detailsclass="toggle implementors-toggle"open><summary><sectionid="impl-IntoIterator-for-%26'a+mut+IndexMap%3CK,+V,+S,+N%3E"class="impl"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#1075">source</a><ahref="#impl-IntoIterator-for-%26'a+mut+IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<'a, K, V, S, const N: usize> IntoIterator for &'a mut <aclass="struct"href="struct.IndexMap.html"title="struct arduboy_rust::heapless::IndexMap">IndexMap</a><K, V, S, N><spanclass="where fmt-newline">where
S: <aclass="trait"href="../../hash32/trait.BuildHasher.html"title="trait hash32::BuildHasher">BuildHasher</a>,</span></h3></section></summary><divclass="impl-items"><detailsclass="toggle"open><summary><sectionid="associatedtype.Item-2"class="associatedtype trait-impl"><ahref="#associatedtype.Item-2"class="anchor">§</a><h4class="code-header">type <aclass="associatedtype">Item</a> = (&'a K, &'a mut V)</h4></section></summary><divclass='docblock'>The type of the elements being iterated over.</div></details><detailsclass="toggle"open><summary><sectionid="associatedtype.IntoIter-2"class="associatedtype trait-impl"><ahref="#associatedtype.IntoIter-2"class="anchor">§</a><h4class="code-header">type <aclass="associatedtype">IntoIter</a> = IterMut<'a, K, V></h4></section></summary><divclass='docblock'>Which kind of iterator are we turning this into?</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.into_iter-2"class="method trait-impl"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#1083">source</a><ahref="#method.into_iter-2"class="anchor">§</a><h4class="code-header">fn <aclass="fn">into_iter</a>(self) -><&'a mut <aclass="struct"href="struct.IndexMap.html"title="struct arduboy_rust::heapless::IndexMap">IndexMap</a><K, V, S, N> as IntoIterator>::IntoIter</h4></section></summary><divclass='docblock'>Creates an iterator from a value. <a>Read more</a></div></details></div></details><detailsclass="toggle implementors-toggle"open><summary><sectionid="impl-IntoIterator-for-IndexMap%3CK,+V,+S,+N%3E"class="impl"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#1047">source</a><ahref="#impl-IntoIterator-for-IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<K, V, S, const N: usize> IntoIterator for <aclass="struct"href="struct.IndexMap.html"title="struct arduboy_rust::heapless::IndexMap">IndexMap</a><K, V, S, N><spanclass="where fmt-newline">where
S: <aclass="trait"href="../../hash32/trait.BuildHasher.html"title="trait hash32::BuildHasher">BuildHasher</a>,</span></h3></section></summary><divclass="impl-items"><detailsclass="toggle"open><summary><sectionid="associatedtype.Item-1"class="associatedtype trait-impl"><ahref="#associatedtype.Item-1"class="anchor">§</a><h4class="code-header">type <aclass="associatedtype">Item</a> = (K, V)</h4></section></summary><divclass='docblock'>The type of the elements being iterated over.</div></details><detailsclass="toggle"open><summary><sectionid="associatedtype.IntoIter-1"class="associatedtype trait-impl"><ahref="#associatedtype.IntoIter-1"class="anchor">§</a><h4class="code-header">type <aclass="associatedtype">IntoIter</a> = IntoIter<K, V, N></h4></section></summary><divclass='docblock'>Which kind of iterator are we turning this into?</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.into_iter-1"class="method trait-impl"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#1055">source</a><ahref="#method.into_iter-1"class="anchor">§</a><h4class="code-header">fn <aclass="fn">into_iter</a>(self) -><<aclass="struct"href="struct.IndexMap.html"title="struct arduboy_rust::heapless::IndexMap">IndexMap</a><K, V, S, N> as IntoIterator>::IntoIter</h4></section></summary><divclass='docblock'>Creates an iterator from a value. <a>Read more</a></div></details></div></details><detailsclass="toggle implementors-toggle"open><summary><sectionid="impl-PartialEq%3CIndexMap%3CK,+V,+S2,+N2%3E%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="impl"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#966-967">source</a><ahref="#impl-PartialEq%3CIndexMap%3CK,+V,+S2,+N2%3E%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<K, V, S, S2, const N: usize, const N2: usize> PartialEq<<aclass="struct"href="struct.IndexMap.html"title="struct arduboy_rust::heapless::IndexMap">IndexMap</a><K, V, S2, N2>> for <aclass="struct"href="struct.IndexMap.html"title="struct arduboy_rust::heapless::IndexMap">IndexMap</a><K, V, S, N><spanclass="where fmt-newline">where
S2: <aclass="trait"href="../../hash32/trait.BuildHasher.html"title="trait hash32::BuildHasher">BuildHasher</a>,</span></h3></section></summary><divclass="impl-items"><detailsclass="toggle method-toggle"open><summary><sectionid="method.eq"class="method trait-impl"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#974">source</a><ahref="#method.eq"class="anchor">§</a><h4class="code-header">fn <aclass="fn">eq</a>(&self, other: &<aclass="struct"href="struct.IndexMap.html"title="struct arduboy_rust::heapless::IndexMap">IndexMap</a><K, V, S2, N2>) -> bool</h4></section></summary><divclass='docblock'>This method tests for <code>self</code> and <code>other</code> values to be equal, and is used
by <code>==</code>.</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.ne"class="method trait-impl"><spanclass="since rightside"title="Stable since Rust version 1.0.0">1.0.0</span><ahref="#method.ne"class="anchor">§</a><h4class="code-header">fn <aclass="fn">ne</a>(&self, other: &Rhs) -> bool</h4></section></summary><divclass='docblock'>This method tests for <code>!=</code>. The default implementation is almost always
sufficient, and should not be overridden without very good reason.</div></details></div></details><sectionid="impl-Eq-for-IndexMap%3CK,+V,+S,+N%3E"class="impl"><aclass="src rightside"href="../../src/heapless/indexmap.rs.html#982">source</a><ahref="#impl-Eq-for-IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<K, V, S, const N: usize> Eq for <aclass="struct"href="struct.IndexMap.html"title="struct arduboy_rust::heapless::IndexMap">IndexMap</a><K, V, S, N><spanclass="where fmt-newline">where
V: UnwindSafe,</span></h3></section></div><h2id="blanket-implementations"class="small-section-header">Blanket Implementations<ahref="#blanket-implementations"class="anchor">§</a></h2><divid="blanket-implementations-list"><detailsclass="toggle implementors-toggle"><summary><sectionid="impl-Any-for-IndexMap%3CK,+V,+S,+N%3E"class="impl"><ahref="#impl-Any-for-IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<T> Any for T<spanclass="where fmt-newline">where
T: 'static + ?Sized,</span></h3></section></summary><divclass="impl-items"><detailsclass="toggle method-toggle"open><summary><sectionid="method.type_id"class="method trait-impl"><ahref="#method.type_id"class="anchor">§</a><h4class="code-header">fn <aclass="fn">type_id</a>(&self) -> TypeId</h4></section></summary><divclass='docblock'>Gets the <code>TypeId</code> of <code>self</code>. <a>Read more</a></div></details></div></details><detailsclass="toggle implementors-toggle"><summary><sectionid="impl-Borrow%3CT%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="impl"><ahref="#impl-Borrow%3CT%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<T> Borrow<T> for T<spanclass="where fmt-newline">where
T: ?Sized,</span></h3></section></summary><divclass="impl-items"><detailsclass="toggle method-toggle"open><summary><sectionid="method.borrow"class="method trait-impl"><ahref="#method.borrow"class="anchor">§</a><h4class="code-header">fn <aclass="fn">borrow</a>(&self) ->&T</h4></section></summary><divclass='docblock'>Immutably borrows from an owned value. <a>Read more</a></div></details></div></details><detailsclass="toggle implementors-toggle"><summary><sectionid="impl-BorrowMut%3CT%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="impl"><ahref="#impl-BorrowMut%3CT%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<T> BorrowMut<T> for T<spanclass="where fmt-newline">where
T: ?Sized,</span></h3></section></summary><divclass="impl-items"><detailsclass="toggle method-toggle"open><summary><sectionid="method.borrow_mut"class="method trait-impl"><ahref="#method.borrow_mut"class="anchor">§</a><h4class="code-header">fn <aclass="fn">borrow_mut</a>(&mut self) ->&mut T</h4></section></summary><divclass='docblock'>Mutably borrows from an owned value. <a>Read more</a></div></details></div></details><detailsclass="toggle implementors-toggle"><summary><sectionid="impl-From%3CT%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="impl"><ahref="#impl-From%3CT%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<T> From<T> for T</h3></section></summary><divclass="impl-items"><detailsclass="toggle method-toggle"open><summary><sectionid="method.from"class="method trait-impl"><ahref="#method.from"class="anchor">§</a><h4class="code-header">fn <aclass="fn">from</a>(t: T) -> T</h4></section></summary><divclass="docblock"><p>Returns the argument unchanged.</p>
</div></details></div></details><detailsclass="toggle implementors-toggle"><summary><sectionid="impl-Into%3CU%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="impl"><ahref="#impl-Into%3CU%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<T, U> Into<U> for T<spanclass="where fmt-newline">where
U: Into<T>,</span></h3></section></summary><divclass="impl-items"><detailsclass="toggle"open><summary><sectionid="associatedtype.Error-1"class="associatedtype trait-impl"><ahref="#associatedtype.Error-1"class="anchor">§</a><h4class="code-header">type <aclass="associatedtype">Error</a> = Infallible</h4></section></summary><divclass='docblock'>The type returned in the event of a conversion error.</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.try_from"class="method trait-impl"><ahref="#method.try_from"class="anchor">§</a><h4class="code-header">fn <aclass="fn">try_from</a>(value: U) -> Result<T, <T as TryFrom<U>>::Error></h4></section></summary><divclass='docblock'>Performs the conversion.</div></details></div></details><detailsclass="toggle implementors-toggle"><summary><sectionid="impl-TryInto%3CU%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="impl"><ahref="#impl-TryInto%3CU%3E-for-IndexMap%3CK,+V,+S,+N%3E"class="anchor">§</a><h3class="code-header">impl<T, U> TryInto<U> for T<spanclass="where fmt-newline">where
U: TryFrom<T>,</span></h3></section></summary><divclass="impl-items"><detailsclass="toggle"open><summary><sectionid="associatedtype.Error"class="associatedtype trait-impl"><ahref="#associatedtype.Error"class="anchor">§</a><h4class="code-header">type <aclass="associatedtype">Error</a> = <U as TryFrom<T>>::Error</h4></section></summary><divclass='docblock'>The type returned in the event of a conversion error.</div></details><detailsclass="toggle method-toggle"open><summary><sectionid="method.try_into"class="method trait-impl"><ahref="#method.try_into"class="anchor">§</a><h4class="code-header">fn <aclass="fn">try_into</a>(self) -> Result<U, <U as TryFrom<T>>::Error></h4></section></summary><divclass='docblock'>Performs the conversion.</div></details></div></details></div></section></div></main></body></html>
