214 lines
No EOL
48 KiB
HTML
214 lines
No EOL
48 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 fixed capacity map / dictionary that performs lookups via linear search"><title>LinearMap in heapless - Rust</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../static.files/SourceSerif4-Regular-46f98efaafac5295.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../static.files/SourceSerif4-Bold-a2c9cd1067f8b328.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../static.files/rustdoc-cb6f1f67f1bcd037.css" id="mainThemeStyle"><meta name="rustdoc-vars" data-root-path="../" data-static-root-path="../static.files/" data-current-crate="heapless" data-themes="" data-resource-suffix="" data-rustdoc-version="1.73.0-nightly (500647fd8 2023-07-27)" 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" ><script src="../static.files/storage-db41da1a38ea3cb8.js"></script><script defer src="sidebar-items.js"></script><script defer src="../static.files/main-0795b7d26be81095.js"></script><noscript><link rel="stylesheet" media="(prefers-color-scheme:light)" href="../static.files/light-6d2c9675f3d09c26.css"><link rel="stylesheet" media="(prefers-color-scheme:dark)" href="../static.files/dark-45ceb8f2e522f4d1.css"><link rel="stylesheet" href="../static.files/noscript-cffde32267a19fd6.css"></noscript><link rel="alternate icon" type="image/png" href="../static.files/favicon-16x16-8b506e7a72182f1c.png"><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 struct"><!--[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">☰</button><a class="logo-container" href="../heapless/index.html"><img class="rust-logo" src="../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><h2></h2></nav><nav class="sidebar"><a class="logo-container" href="../heapless/index.html"><img class="rust-logo" src="../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><h2 class="location"><a href="#">LinearMap</a></h2><div class="sidebar-elems"><section><h3><a href="#implementations">Methods</a></h3><ul class="block"><li><a href="#method.capacity">capacity</a></li><li><a href="#method.clear">clear</a></li><li><a href="#method.contains_key">contains_key</a></li><li><a href="#method.get">get</a></li><li><a href="#method.get_mut">get_mut</a></li><li><a href="#method.insert">insert</a></li><li><a href="#method.is_empty">is_empty</a></li><li><a href="#method.iter">iter</a></li><li><a href="#method.iter_mut">iter_mut</a></li><li><a href="#method.keys">keys</a></li><li><a href="#method.len">len</a></li><li><a href="#method.new">new</a></li><li><a href="#method.remove">remove</a></li><li><a href="#method.values">values</a></li><li><a href="#method.values_mut">values_mut</a></li></ul><h3><a href="#trait-implementations">Trait Implementations</a></h3><ul class="block"><li><a href="#impl-Clone-for-LinearMap%3CK,+V,+N%3E">Clone</a></li><li><a href="#impl-Debug-for-LinearMap%3CK,+V,+N%3E">Debug</a></li><li><a href="#impl-Default-for-LinearMap%3CK,+V,+N%3E">Default</a></li><li><a href="#impl-Drop-for-LinearMap%3CK,+V,+N%3E">Drop</a></li><li><a href="#impl-Eq-for-LinearMap%3CK,+V,+N%3E">Eq</a></li><li><a href="#impl-FromIterator%3C(K,+V)%3E-for-LinearMap%3CK,+V,+N%3E">FromIterator<(K, V)></a></li><li><a href="#impl-Index%3C%26'a+Q%3E-for-LinearMap%3CK,+V,+N%3E">Index<&'a Q></a></li><li><a href="#impl-IndexMut%3C%26'a+Q%3E-for-LinearMap%3CK,+V,+N%3E">IndexMut<&'a Q></a></li><li><a href="#impl-IntoIterator-for-%26'a+LinearMap%3CK,+V,+N%3E">IntoIterator</a></li><li><a href="#impl-PartialEq%3CLinearMap%3CK,+V,+N2%3E%3E-for-LinearMap%3CK,+V,+N%3E">PartialEq<LinearMap<K, V, N2>></a></li></ul><h3><a href="#synthetic-implementations">Auto Trait Implementations</a></h3><ul class="block"><li><a href="#impl-RefUnwindSafe-for-LinearMap%3CK,+V,+N%3E">RefUnwindSafe</a></li><li><a href="#impl-Send-for-LinearMap%3CK,+V,+N%3E">Send</a></li><li><a href="#impl-Sync-for-LinearMap%3CK,+V,+N%3E">Sync</a></li><li><a href="#impl-Unpin-for-LinearMap%3CK,+V,+N%3E">Unpin</a></li><li><a href="#impl-UnwindSafe-for-LinearMap%3CK,+V,+N%3E">UnwindSafe</a></li></ul><h3><a href="#blanket-implementations">Blanket Implementations</a></h3><ul class="block"><li><a href="#impl-Any-for-LinearMap%3CK,+V,+N%3E">Any</a></li><li><a href="#impl-Borrow%3CT%3E-for-LinearMap%3CK,+V,+N%3E">Borrow<T></a></li><li><a href="#impl-BorrowMut%3CT%3E-for-LinearMap%3CK,+V,+N%3E">BorrowMut<T></a></li><li><a href="#impl-From%3CT%3E-for-LinearMap%3CK,+V,+N%3E">From<T></a></li><li><a href="#impl-Into%3CU%3E-for-LinearMap%3CK,+V,+N%3E">Into<U></a></li><li><a href="#impl-TryFrom%3CU%3E-for-LinearMap%3CK,+V,+N%3E">TryFrom<U></a></li><li><a href="#impl-TryInto%3CU%3E-for-LinearMap%3CK,+V,+N%3E">TryInto<U></a></li></ul></section><h2><a href="index.html">In heapless</a></h2></div></nav><main><div class="width-limiter"><nav class="sub"><form class="search-form"><span></span><input class="search-input" name="search" aria-label="Run search in the documentation" autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"><div id="help-button" title="help" tabindex="-1"><a href="../help.html">?</a></div><div id="settings-menu" tabindex="-1"><a href="../settings.html" title="settings"><img width="22" height="22" alt="Change settings" src="../static.files/wheel-7b819b6101059cd0.svg"></a></div></form></nav><section id="main-content" class="content"><div class="main-heading"><h1>Struct <a href="index.html">heapless</a>::<wbr><a class="struct" href="#">LinearMap</a><button id="copy-path" title="Copy item path to clipboard"><img src="../static.files/clipboard-7571035ce49a181d.svg" width="19" height="18" alt="Copy item path"></button></h1><span class="out-of-band"><a class="src" href="../src/heapless/linear_map.rs.html#8-10">source</a> · <button id="toggle-all-docs" title="collapse all docs">[<span>−</span>]</button></span></div><pre class="rust item-decl"><code>pub struct LinearMap<K, V, const N: usize> { /* private fields */ }</code></pre><details class="toggle top-doc" open><summary class="hideme"><span>Expand description</span></summary><div class="docblock"><p>A fixed capacity map / dictionary that performs lookups via linear search</p>
|
||
<p>Note that as this map doesn’t use hashing so most operations are <strong>O(N)</strong> instead of O(1)</p>
|
||
</div></details><h2 id="implementations" class="small-section-header">Implementations<a href="#implementations" class="anchor">§</a></h2><div id="implementations-list"><details class="toggle implementors-toggle" open><summary><section id="impl-LinearMap%3CK,+V,+N%3E" class="impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#12-29">source</a><a href="#impl-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.new" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#26-28">source</a><h4 class="code-header">pub const fn <a href="#method.new" class="fn">new</a>() -> Self</h4></section></summary><div class="docblock"><p>Creates an empty <code>LinearMap</code></p>
|
||
<h5 id="examples"><a href="#examples">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="comment">// allocate the map on the stack
|
||
</span><span class="kw">let </span><span class="kw-2">mut </span>map: LinearMap<<span class="kw-2">&</span>str, isize, <span class="number">8</span>> = LinearMap::new();
|
||
|
||
<span class="comment">// allocate the map in a static variable
|
||
</span><span class="kw">static </span><span class="kw-2">mut </span>MAP: LinearMap<<span class="kw-2">&</span>str, isize, <span class="number">8</span>> = LinearMap::new();</code></pre></div>
|
||
</div></details></div></details><details class="toggle implementors-toggle" open><summary><section id="impl-LinearMap%3CK,+V,+N%3E-1" class="impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#31-346">source</a><a href="#impl-LinearMap%3CK,+V,+N%3E-1" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Eq,</span></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.capacity" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#47-49">source</a><h4 class="code-header">pub fn <a href="#method.capacity" class="fn">capacity</a>(&self) -> usize</h4></section></summary><div class="docblock"><p>Returns the number of elements that the map can hold</p>
|
||
<p>Computes in <strong>O(1)</strong> time</p>
|
||
<h5 id="examples-1"><a href="#examples-1">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span>map: LinearMap<<span class="kw-2">&</span>str, isize, <span class="number">8</span>> = LinearMap::new();
|
||
<span class="macro">assert_eq!</span>(map.capacity(), <span class="number">8</span>);</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.clear" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#65-67">source</a><h4 class="code-header">pub fn <a href="#method.clear" class="fn">clear</a>(&mut self)</h4></section></summary><div class="docblock"><p>Clears the map, removing all key-value pairs</p>
|
||
<p>Computes in <strong>O(1)</strong> time</p>
|
||
<h5 id="examples-2"><a href="#examples-2">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>map: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
map.insert(<span class="number">1</span>, <span class="string">"a"</span>).unwrap();
|
||
map.clear();
|
||
<span class="macro">assert!</span>(map.is_empty());</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.contains_key" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#83-85">source</a><h4 class="code-header">pub fn <a href="#method.contains_key" class="fn">contains_key</a>(&self, key: &K) -> bool</h4></section></summary><div class="docblock"><p>Returns true if the map contains a value for the specified key.</p>
|
||
<p>Computes in <strong>O(N)</strong> time</p>
|
||
<h5 id="examples-3"><a href="#examples-3">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>map: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
map.insert(<span class="number">1</span>, <span class="string">"a"</span>).unwrap();
|
||
<span class="macro">assert_eq!</span>(map.contains_key(<span class="kw-2">&</span><span class="number">1</span>), <span class="bool-val">true</span>);
|
||
<span class="macro">assert_eq!</span>(map.contains_key(<span class="kw-2">&</span><span class="number">2</span>), <span class="bool-val">false</span>);</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.get" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#101-109">source</a><h4 class="code-header">pub fn <a href="#method.get" class="fn">get</a><Q>(&self, key: &Q) -> Option<&V><span class="where fmt-newline">where
|
||
K: Borrow<Q>,
|
||
Q: Eq + ?Sized,</span></h4></section></summary><div class="docblock"><p>Returns a reference to the value corresponding to the key</p>
|
||
<p>Computes in <strong>O(N)</strong> time</p>
|
||
<h5 id="examples-4"><a href="#examples-4">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>map: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
map.insert(<span class="number">1</span>, <span class="string">"a"</span>).unwrap();
|
||
<span class="macro">assert_eq!</span>(map.get(<span class="kw-2">&</span><span class="number">1</span>), <span class="prelude-val">Some</span>(<span class="kw-2">&</span><span class="string">"a"</span>));
|
||
<span class="macro">assert_eq!</span>(map.get(<span class="kw-2">&</span><span class="number">2</span>), <span class="prelude-val">None</span>);</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.get_mut" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#127-135">source</a><h4 class="code-header">pub fn <a href="#method.get_mut" class="fn">get_mut</a><Q>(&mut self, key: &Q) -> Option<&mut V><span class="where fmt-newline">where
|
||
K: Borrow<Q>,
|
||
Q: Eq + ?Sized,</span></h4></section></summary><div class="docblock"><p>Returns a mutable reference to the value corresponding to the key</p>
|
||
<p>Computes in <strong>O(N)</strong> time</p>
|
||
<h5 id="examples-5"><a href="#examples-5">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>map: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
map.insert(<span class="number">1</span>, <span class="string">"a"</span>).unwrap();
|
||
<span class="kw">if let </span><span class="prelude-val">Some</span>(x) = map.get_mut(<span class="kw-2">&</span><span class="number">1</span>) {
|
||
<span class="kw-2">*</span>x = <span class="string">"b"</span>;
|
||
}
|
||
<span class="macro">assert_eq!</span>(map[<span class="kw-2">&</span><span class="number">1</span>], <span class="string">"b"</span>);</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.len" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#151-153">source</a><h4 class="code-header">pub fn <a href="#method.len" class="fn">len</a>(&self) -> usize</h4></section></summary><div class="docblock"><p>Returns the number of elements in this map</p>
|
||
<p>Computes in <strong>O(1)</strong> time</p>
|
||
<h5 id="examples-6"><a href="#examples-6">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>a: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
<span class="macro">assert_eq!</span>(a.len(), <span class="number">0</span>);
|
||
a.insert(<span class="number">1</span>, <span class="string">"a"</span>).unwrap();
|
||
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.insert" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#176-184">source</a><h4 class="code-header">pub fn <a href="#method.insert" class="fn">insert</a>(&mut self, key: K, value: V) -> Result<Option<V>, (K, V)></h4></section></summary><div class="docblock"><p>Inserts a key-value pair into the map.</p>
|
||
<p>If the map did not have this key present, <code>None</code> is returned.</p>
|
||
<p>If the map did have this key present, the value is updated, and the old value is returned.</p>
|
||
<p>Computes in <strong>O(N)</strong> time</p>
|
||
<h5 id="examples-7"><a href="#examples-7">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>map: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
<span class="macro">assert_eq!</span>(map.insert(<span class="number">37</span>, <span class="string">"a"</span>).unwrap(), <span class="prelude-val">None</span>);
|
||
<span class="macro">assert_eq!</span>(map.is_empty(), <span class="bool-val">false</span>);
|
||
|
||
map.insert(<span class="number">37</span>, <span class="string">"b"</span>).unwrap();
|
||
<span class="macro">assert_eq!</span>(map.insert(<span class="number">37</span>, <span class="string">"c"</span>).unwrap(), <span class="prelude-val">Some</span>(<span class="string">"b"</span>));
|
||
<span class="macro">assert_eq!</span>(map[<span class="kw-2">&</span><span class="number">37</span>], <span class="string">"c"</span>);</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.is_empty" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#200-202">source</a><h4 class="code-header">pub fn <a href="#method.is_empty" class="fn">is_empty</a>(&self) -> bool</h4></section></summary><div class="docblock"><p>Returns true if the map contains no elements</p>
|
||
<p>Computes in <strong>O(1)</strong> time</p>
|
||
<h5 id="examples-8"><a href="#examples-8">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>a: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
<span class="macro">assert!</span>(a.is_empty());
|
||
a.insert(<span class="number">1</span>, <span class="string">"a"</span>).unwrap();
|
||
<span class="macro">assert!</span>(!a.is_empty());</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.iter" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#220-224">source</a><h4 class="code-header">pub fn <a href="#method.iter" class="fn">iter</a>(&self) -> Iter<'_, K, V></h4></section></summary><div class="docblock"><p>An iterator visiting all key-value pairs in arbitrary order.</p>
|
||
<h5 id="examples-9"><a href="#examples-9">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>map: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
map.insert(<span class="string">"a"</span>, <span class="number">1</span>).unwrap();
|
||
map.insert(<span class="string">"b"</span>, <span class="number">2</span>).unwrap();
|
||
map.insert(<span class="string">"c"</span>, <span class="number">3</span>).unwrap();
|
||
|
||
<span class="kw">for </span>(key, val) <span class="kw">in </span>map.iter() {
|
||
<span class="macro">println!</span>(<span class="string">"key: {} val: {}"</span>, key, val);
|
||
}</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.iter_mut" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#248-252">source</a><h4 class="code-header">pub fn <a href="#method.iter_mut" class="fn">iter_mut</a>(&mut self) -> IterMut<'_, K, V></h4></section></summary><div class="docblock"><p>An iterator visiting all key-value pairs in arbitrary order, with mutable references to the
|
||
values</p>
|
||
<h5 id="examples-10"><a href="#examples-10">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>map: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
map.insert(<span class="string">"a"</span>, <span class="number">1</span>).unwrap();
|
||
map.insert(<span class="string">"b"</span>, <span class="number">2</span>).unwrap();
|
||
map.insert(<span class="string">"c"</span>, <span class="number">3</span>).unwrap();
|
||
|
||
<span class="comment">// Update all values
|
||
</span><span class="kw">for </span>(<span class="kw">_</span>, val) <span class="kw">in </span>map.iter_mut() {
|
||
<span class="kw-2">*</span>val = <span class="number">2</span>;
|
||
}
|
||
|
||
<span class="kw">for </span>(key, val) <span class="kw">in </span><span class="kw-2">&</span>map {
|
||
<span class="macro">println!</span>(<span class="string">"key: {} val: {}"</span>, key, val);
|
||
}</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.keys" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#270-272">source</a><h4 class="code-header">pub fn <a href="#method.keys" class="fn">keys</a>(&self) -> impl Iterator<Item = &K></h4></section></summary><div class="docblock"><p>An iterator visiting all keys in arbitrary order</p>
|
||
<h5 id="examples-11"><a href="#examples-11">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>map: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
map.insert(<span class="string">"a"</span>, <span class="number">1</span>).unwrap();
|
||
map.insert(<span class="string">"b"</span>, <span class="number">2</span>).unwrap();
|
||
map.insert(<span class="string">"c"</span>, <span class="number">3</span>).unwrap();
|
||
|
||
<span class="kw">for </span>key <span class="kw">in </span>map.keys() {
|
||
<span class="macro">println!</span>(<span class="string">"{}"</span>, key);
|
||
}</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.remove" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#289-301">source</a><h4 class="code-header">pub fn <a href="#method.remove" class="fn">remove</a><Q>(&mut self, key: &Q) -> Option<V><span class="where fmt-newline">where
|
||
K: Borrow<Q>,
|
||
Q: Eq + ?Sized,</span></h4></section></summary><div class="docblock"><p>Removes a key from the map, returning the value at the key if the key was previously in the
|
||
map</p>
|
||
<p>Computes in <strong>O(N)</strong> time</p>
|
||
<h5 id="examples-12"><a href="#examples-12">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>map: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
map.insert(<span class="number">1</span>, <span class="string">"a"</span>).unwrap();
|
||
<span class="macro">assert_eq!</span>(map.remove(<span class="kw-2">&</span><span class="number">1</span>), <span class="prelude-val">Some</span>(<span class="string">"a"</span>));
|
||
<span class="macro">assert_eq!</span>(map.remove(<span class="kw-2">&</span><span class="number">1</span>), <span class="prelude-val">None</span>);</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.values" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#319-321">source</a><h4 class="code-header">pub fn <a href="#method.values" class="fn">values</a>(&self) -> impl Iterator<Item = &V></h4></section></summary><div class="docblock"><p>An iterator visiting all values in arbitrary order</p>
|
||
<h5 id="examples-13"><a href="#examples-13">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>map: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
map.insert(<span class="string">"a"</span>, <span class="number">1</span>).unwrap();
|
||
map.insert(<span class="string">"b"</span>, <span class="number">2</span>).unwrap();
|
||
map.insert(<span class="string">"c"</span>, <span class="number">3</span>).unwrap();
|
||
|
||
<span class="kw">for </span>val <span class="kw">in </span>map.values() {
|
||
<span class="macro">println!</span>(<span class="string">"{}"</span>, val);
|
||
}</code></pre></div>
|
||
</div></details><details class="toggle method-toggle" open><summary><section id="method.values_mut" class="method"><a class="src rightside" href="../src/heapless/linear_map.rs.html#343-345">source</a><h4 class="code-header">pub fn <a href="#method.values_mut" class="fn">values_mut</a>(&mut self) -> impl Iterator<Item = &mut V></h4></section></summary><div class="docblock"><p>An iterator visiting all values mutably in arbitrary order</p>
|
||
<h5 id="examples-14"><a href="#examples-14">Examples</a></h5>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered"><code><span class="kw">use </span>heapless::LinearMap;
|
||
|
||
<span class="kw">let </span><span class="kw-2">mut </span>map: LinearMap<<span class="kw">_</span>, <span class="kw">_</span>, <span class="number">8</span>> = LinearMap::new();
|
||
map.insert(<span class="string">"a"</span>, <span class="number">1</span>).unwrap();
|
||
map.insert(<span class="string">"b"</span>, <span class="number">2</span>).unwrap();
|
||
map.insert(<span class="string">"c"</span>, <span class="number">3</span>).unwrap();
|
||
|
||
<span class="kw">for </span>val <span class="kw">in </span>map.values_mut() {
|
||
<span class="kw-2">*</span>val += <span class="number">10</span>;
|
||
}
|
||
|
||
<span class="kw">for </span>val <span class="kw">in </span>map.values() {
|
||
<span class="macro">println!</span>(<span class="string">"{}"</span>, val);
|
||
}</code></pre></div>
|
||
</div></details></div></details></div><h2 id="trait-implementations" class="small-section-header">Trait Implementations<a href="#trait-implementations" class="anchor">§</a></h2><div id="trait-implementations-list"><details class="toggle implementors-toggle" open><summary><section id="impl-Clone-for-LinearMap%3CK,+V,+N%3E" class="impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#379-389">source</a><a href="#impl-Clone-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> Clone for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Eq + Clone,
|
||
V: Clone,</span></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.clone" class="method trait-impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#384-388">source</a><a href="#method.clone" class="anchor">§</a><h4 class="code-header">fn <a class="fn">clone</a>(&self) -> Self</h4></section></summary><div class='docblock'>Returns a copy of the value. <a>Read more</a></div></details><details class="toggle method-toggle" open><summary><section id="method.clone_from" class="method trait-impl"><span class="since rightside" title="Stable since Rust version 1.0.0">1.0.0</span><a href="#method.clone_from" class="anchor">§</a><h4 class="code-header">fn <a class="fn">clone_from</a>(&mut self, source: &Self)</h4></section></summary><div class='docblock'>Performs copy-assignment from <code>source</code>. <a>Read more</a></div></details></div></details><details class="toggle implementors-toggle" open><summary><section id="impl-Debug-for-LinearMap%3CK,+V,+N%3E" class="impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#391-399">source</a><a href="#impl-Debug-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> Debug for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Eq + Debug,
|
||
V: Debug,</span></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.fmt" class="method trait-impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#396-398">source</a><a href="#method.fmt" class="anchor">§</a><h4 class="code-header">fn <a class="fn">fmt</a>(&self, f: &mut Formatter<'_>) -> Result</h4></section></summary><div class='docblock'>Formats the value using the given formatter. <a>Read more</a></div></details></div></details><details class="toggle implementors-toggle" open><summary><section id="impl-Default-for-LinearMap%3CK,+V,+N%3E" class="impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#370-377">source</a><a href="#impl-Default-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> Default for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Eq,</span></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.default" class="method trait-impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#374-376">source</a><a href="#method.default" class="anchor">§</a><h4 class="code-header">fn <a class="fn">default</a>() -> Self</h4></section></summary><div class='docblock'>Returns the “default value” for a type. <a>Read more</a></div></details></div></details><details class="toggle implementors-toggle" open><summary><section id="impl-Drop-for-LinearMap%3CK,+V,+N%3E" class="impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#464-471">source</a><a href="#impl-Drop-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> Drop for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.drop" class="method trait-impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#465-470">source</a><a href="#method.drop" class="anchor">§</a><h4 class="code-header">fn <a class="fn">drop</a>(&mut self)</h4></section></summary><div class='docblock'>Executes the destructor for this type. <a>Read more</a></div></details></div></details><details class="toggle implementors-toggle" open><summary><section id="impl-FromIterator%3C(K,+V)%3E-for-LinearMap%3CK,+V,+N%3E" class="impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#401-413">source</a><a href="#impl-FromIterator%3C(K,+V)%3E-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> FromIterator<(K, V)> for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Eq,</span></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.from_iter" class="method trait-impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#405-412">source</a><a href="#method.from_iter" class="anchor">§</a><h4 class="code-header">fn <a class="fn">from_iter</a><I>(iter: I) -> Self<span class="where fmt-newline">where
|
||
I: IntoIterator<Item = (K, V)>,</span></h4></section></summary><div class='docblock'>Creates a value from an iterator. <a>Read more</a></div></details></div></details><details class="toggle implementors-toggle" open><summary><section id="impl-Index%3C%26'a+Q%3E-for-LinearMap%3CK,+V,+N%3E" class="impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#348-358">source</a><a href="#impl-Index%3C%26'a+Q%3E-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<'a, K, V, Q, const N: usize> Index<&'a Q> for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Borrow<Q> + Eq,
|
||
Q: Eq + ?Sized,</span></h3></section></summary><div class="impl-items"><details class="toggle" open><summary><section id="associatedtype.Output" class="associatedtype trait-impl"><a href="#associatedtype.Output" class="anchor">§</a><h4 class="code-header">type <a class="associatedtype">Output</a> = V</h4></section></summary><div class='docblock'>The returned type after indexing.</div></details><details class="toggle method-toggle" open><summary><section id="method.index" class="method trait-impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#355-357">source</a><a href="#method.index" class="anchor">§</a><h4 class="code-header">fn <a class="fn">index</a>(&self, key: &Q) -> &V</h4></section></summary><div class='docblock'>Performs the indexing (<code>container[index]</code>) operation. <a>Read more</a></div></details></div></details><details class="toggle implementors-toggle" open><summary><section id="impl-IndexMut%3C%26'a+Q%3E-for-LinearMap%3CK,+V,+N%3E" class="impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#360-368">source</a><a href="#impl-IndexMut%3C%26'a+Q%3E-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<'a, K, V, Q, const N: usize> IndexMut<&'a Q> for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Borrow<Q> + Eq,
|
||
Q: Eq + ?Sized,</span></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.index_mut" class="method trait-impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#365-367">source</a><a href="#method.index_mut" class="anchor">§</a><h4 class="code-header">fn <a class="fn">index_mut</a>(&mut self, key: &Q) -> &mut V</h4></section></summary><div class='docblock'>Performs the mutable indexing (<code>container[index]</code>) operation. <a>Read more</a></div></details></div></details><details class="toggle implementors-toggle" open><summary><section id="impl-IntoIterator-for-%26'a+LinearMap%3CK,+V,+N%3E" class="impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#432-442">source</a><a href="#impl-IntoIterator-for-%26'a+LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<'a, K, V, const N: usize> IntoIterator for &'a <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Eq,</span></h3></section></summary><div class="impl-items"><details class="toggle" open><summary><section id="associatedtype.Item" class="associatedtype trait-impl"><a href="#associatedtype.Item" class="anchor">§</a><h4 class="code-header">type <a class="associatedtype">Item</a> = (&'a K, &'a V)</h4></section></summary><div class='docblock'>The type of the elements being iterated over.</div></details><details class="toggle" open><summary><section id="associatedtype.IntoIter" class="associatedtype trait-impl"><a href="#associatedtype.IntoIter" class="anchor">§</a><h4 class="code-header">type <a class="associatedtype">IntoIter</a> = Iter<'a, K, V></h4></section></summary><div class='docblock'>Which kind of iterator are we turning this into?</div></details><details class="toggle method-toggle" open><summary><section id="method.into_iter" class="method trait-impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#439-441">source</a><a href="#method.into_iter" class="anchor">§</a><h4 class="code-header">fn <a class="fn">into_iter</a>(self) -> Self::IntoIter</h4></section></summary><div class='docblock'>Creates an iterator from a value. <a>Read more</a></div></details></div></details><details class="toggle implementors-toggle" open><summary><section id="impl-PartialEq%3CLinearMap%3CK,+V,+N2%3E%3E-for-LinearMap%3CK,+V,+N%3E" class="impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#485-496">source</a><a href="#impl-PartialEq%3CLinearMap%3CK,+V,+N2%3E%3E-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize, const N2: usize> PartialEq<<a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N2>> for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Eq,
|
||
V: PartialEq,</span></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.eq" class="method trait-impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#490-495">source</a><a href="#method.eq" class="anchor">§</a><h4 class="code-header">fn <a class="fn">eq</a>(&self, other: &<a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N2>) -> bool</h4></section></summary><div class='docblock'>This method tests for <code>self</code> and <code>other</code> values to be equal, and is used
|
||
by <code>==</code>.</div></details><details class="toggle method-toggle" open><summary><section id="method.ne" class="method trait-impl"><span class="since rightside" title="Stable since Rust version 1.0.0">1.0.0</span><a href="#method.ne" class="anchor">§</a><h4 class="code-header">fn <a class="fn">ne</a>(&self, other: &Rhs) -> bool</h4></section></summary><div class='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><section id="impl-Eq-for-LinearMap%3CK,+V,+N%3E" class="impl"><a class="src rightside" href="../src/heapless/linear_map.rs.html#498-503">source</a><a href="#impl-Eq-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> Eq for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Eq,
|
||
V: PartialEq,</span></h3></section></div><h2 id="synthetic-implementations" class="small-section-header">Auto Trait Implementations<a href="#synthetic-implementations" class="anchor">§</a></h2><div id="synthetic-implementations-list"><section id="impl-RefUnwindSafe-for-LinearMap%3CK,+V,+N%3E" class="impl"><a href="#impl-RefUnwindSafe-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> RefUnwindSafe for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: RefUnwindSafe,
|
||
V: RefUnwindSafe,</span></h3></section><section id="impl-Send-for-LinearMap%3CK,+V,+N%3E" class="impl"><a href="#impl-Send-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> Send for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Send,
|
||
V: Send,</span></h3></section><section id="impl-Sync-for-LinearMap%3CK,+V,+N%3E" class="impl"><a href="#impl-Sync-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> Sync for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Sync,
|
||
V: Sync,</span></h3></section><section id="impl-Unpin-for-LinearMap%3CK,+V,+N%3E" class="impl"><a href="#impl-Unpin-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> Unpin for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: Unpin,
|
||
V: Unpin,</span></h3></section><section id="impl-UnwindSafe-for-LinearMap%3CK,+V,+N%3E" class="impl"><a href="#impl-UnwindSafe-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<K, V, const N: usize> UnwindSafe for <a class="struct" href="struct.LinearMap.html" title="struct heapless::LinearMap">LinearMap</a><K, V, N><span class="where fmt-newline">where
|
||
K: UnwindSafe,
|
||
V: UnwindSafe,</span></h3></section></div><h2 id="blanket-implementations" class="small-section-header">Blanket Implementations<a href="#blanket-implementations" class="anchor">§</a></h2><div id="blanket-implementations-list"><details class="toggle implementors-toggle"><summary><section id="impl-Any-for-LinearMap%3CK,+V,+N%3E" class="impl"><a href="#impl-Any-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<T> Any for T<span class="where fmt-newline">where
|
||
T: 'static + ?Sized,</span></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.type_id" class="method trait-impl"><a href="#method.type_id" class="anchor">§</a><h4 class="code-header">fn <a class="fn">type_id</a>(&self) -> TypeId</h4></section></summary><div class='docblock'>Gets the <code>TypeId</code> of <code>self</code>. <a>Read more</a></div></details></div></details><details class="toggle implementors-toggle"><summary><section id="impl-Borrow%3CT%3E-for-LinearMap%3CK,+V,+N%3E" class="impl"><a href="#impl-Borrow%3CT%3E-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<T> Borrow<T> for T<span class="where fmt-newline">where
|
||
T: ?Sized,</span></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.borrow" class="method trait-impl"><a href="#method.borrow" class="anchor">§</a><h4 class="code-header">fn <a class="fn">borrow</a>(&self) -> &T</h4></section></summary><div class='docblock'>Immutably borrows from an owned value. <a>Read more</a></div></details></div></details><details class="toggle implementors-toggle"><summary><section id="impl-BorrowMut%3CT%3E-for-LinearMap%3CK,+V,+N%3E" class="impl"><a href="#impl-BorrowMut%3CT%3E-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<T> BorrowMut<T> for T<span class="where fmt-newline">where
|
||
T: ?Sized,</span></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.borrow_mut" class="method trait-impl"><a href="#method.borrow_mut" class="anchor">§</a><h4 class="code-header">fn <a class="fn">borrow_mut</a>(&mut self) -> &mut T</h4></section></summary><div class='docblock'>Mutably borrows from an owned value. <a>Read more</a></div></details></div></details><details class="toggle implementors-toggle"><summary><section id="impl-From%3CT%3E-for-LinearMap%3CK,+V,+N%3E" class="impl"><a href="#impl-From%3CT%3E-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<T> From<T> for T</h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.from" class="method trait-impl"><a href="#method.from" class="anchor">§</a><h4 class="code-header">fn <a class="fn">from</a>(t: T) -> T</h4></section></summary><div class="docblock"><p>Returns the argument unchanged.</p>
|
||
</div></details></div></details><details class="toggle implementors-toggle"><summary><section id="impl-Into%3CU%3E-for-LinearMap%3CK,+V,+N%3E" class="impl"><a href="#impl-Into%3CU%3E-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<T, U> Into<U> for T<span class="where fmt-newline">where
|
||
U: From<T>,</span></h3></section></summary><div class="impl-items"><details class="toggle method-toggle" open><summary><section id="method.into" class="method trait-impl"><a href="#method.into" class="anchor">§</a><h4 class="code-header">fn <a class="fn">into</a>(self) -> U</h4></section></summary><div class="docblock"><p>Calls <code>U::from(self)</code>.</p>
|
||
<p>That is, this conversion is whatever the implementation of
|
||
<code>[From]<T> for U</code> chooses to do.</p>
|
||
</div></details></div></details><details class="toggle implementors-toggle"><summary><section id="impl-TryFrom%3CU%3E-for-LinearMap%3CK,+V,+N%3E" class="impl"><a href="#impl-TryFrom%3CU%3E-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<T, U> TryFrom<U> for T<span class="where fmt-newline">where
|
||
U: Into<T>,</span></h3></section></summary><div class="impl-items"><details class="toggle" open><summary><section id="associatedtype.Error" class="associatedtype trait-impl"><a href="#associatedtype.Error" class="anchor">§</a><h4 class="code-header">type <a class="associatedtype">Error</a> = Infallible</h4></section></summary><div class='docblock'>The type returned in the event of a conversion error.</div></details><details class="toggle method-toggle" open><summary><section id="method.try_from" class="method trait-impl"><a href="#method.try_from" class="anchor">§</a><h4 class="code-header">fn <a class="fn">try_from</a>(value: U) -> Result<T, <T as TryFrom<U>>::Error></h4></section></summary><div class='docblock'>Performs the conversion.</div></details></div></details><details class="toggle implementors-toggle"><summary><section id="impl-TryInto%3CU%3E-for-LinearMap%3CK,+V,+N%3E" class="impl"><a href="#impl-TryInto%3CU%3E-for-LinearMap%3CK,+V,+N%3E" class="anchor">§</a><h3 class="code-header">impl<T, U> TryInto<U> for T<span class="where fmt-newline">where
|
||
U: TryFrom<T>,</span></h3></section></summary><div class="impl-items"><details class="toggle" open><summary><section id="associatedtype.Error-1" class="associatedtype trait-impl"><a href="#associatedtype.Error-1" class="anchor">§</a><h4 class="code-header">type <a class="associatedtype">Error</a> = <U as TryFrom<T>>::Error</h4></section></summary><div class='docblock'>The type returned in the event of a conversion error.</div></details><details class="toggle method-toggle" open><summary><section id="method.try_into" class="method trait-impl"><a href="#method.try_into" class="anchor">§</a><h4 class="code-header">fn <a class="fn">try_into</a>(self) -> Result<U, <U as TryFrom<T>>::Error></h4></section></summary><div class='docblock'>Performs the conversion.</div></details></div></details></div></section></div></main></body></html> |