549 lines
138 KiB
HTML
549 lines
138 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="API documentation for the Rust `BTreeMap` struct in crate `nom`."><meta name="keywords" content="rust, rustlang, rust-lang, BTreeMap"><title>nom::lib::std::collections::BTreeMap - Rust</title><link rel="stylesheet" type="text/css" href="../../../../normalize.css"><link rel="stylesheet" type="text/css" href="../../../../rustdoc.css" id="mainThemeStyle"><link rel="stylesheet" type="text/css" href="../../../../dark.css"><link rel="stylesheet" type="text/css" href="../../../../light.css" id="themeStyle"><script src="../../../../storage.js"></script><noscript><link rel="stylesheet" href="../../../../noscript.css"></noscript><link rel="shortcut icon" href="../../../../favicon.ico"><style type="text/css">#crate-search{background-image:url("../../../../down-arrow.svg");}</style></head><body class="rustdoc struct"><!--[if lte IE 8]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="sidebar-menu">☰</div><a href='../../../../nom/index.html'><div class='logo-container'><img src='../../../../rust-logo.png' alt='logo'></div></a><p class='location'>Struct BTreeMap</p><div class="sidebar-elems"><div class="block items"><a class="sidebar-title" href="#methods">Methods</a><div class="sidebar-links"><a href="#method.append">append</a><a href="#method.clear">clear</a><a href="#method.contains_key">contains_key</a><a href="#method.entry">entry</a><a href="#method.first_entry">first_entry</a><a href="#method.first_key_value">first_key_value</a><a href="#method.get">get</a><a href="#method.get_key_value">get_key_value</a><a href="#method.get_mut">get_mut</a><a href="#method.insert">insert</a><a href="#method.is_empty">is_empty</a><a href="#method.iter">iter</a><a href="#method.iter_mut">iter_mut</a><a href="#method.keys">keys</a><a href="#method.last_entry">last_entry</a><a href="#method.last_key_value">last_key_value</a><a href="#method.len">len</a><a href="#method.new">new</a><a href="#method.range">range</a><a href="#method.range_mut">range_mut</a><a href="#method.remove">remove</a><a href="#method.remove_entry">remove_entry</a><a href="#method.split_off">split_off</a><a href="#method.values">values</a><a href="#method.values_mut">values_mut</a></div><a class="sidebar-title" href="#implementations">Trait Implementations</a><div class="sidebar-links"><a href="#impl-Clone">Clone</a><a href="#impl-Debug">Debug</a><a href="#impl-Default">Default</a><a href="#impl-Drop">Drop</a><a href="#impl-Eq">Eq</a><a href="#impl-Extend%3C(%26%27a%20K%2C%20%26%27a%20V)%3E">Extend<(&'a K, &'a V)></a><a href="#impl-Extend%3C(K%2C%20V)%3E">Extend<(K, V)></a><a href="#impl-FromIterator%3C(K%2C%20V)%3E">FromIterator<(K, V)></a><a href="#impl-Hash">Hash</a><a href="#impl-Index%3C%26%27_%20Q%3E">Index<&'_ Q></a><a href="#impl-IntoIterator">IntoIterator</a><a href="#impl-Ord">Ord</a><a href="#impl-PartialEq%3CBTreeMap%3CK%2C%20V%3E%3E">PartialEq<BTreeMap<K, V>></a><a href="#impl-PartialOrd%3CBTreeMap%3CK%2C%20V%3E%3E">PartialOrd<BTreeMap<K, V>></a></div><a class="sidebar-title" href="#synthetic-implementations">Auto Trait Implementations</a><div class="sidebar-links"><a href="#impl-RefUnwindSafe">RefUnwindSafe</a><a href="#impl-Send">Send</a><a href="#impl-Sync">Sync</a><a href="#impl-Unpin">Unpin</a><a href="#impl-UnwindSafe">UnwindSafe</a></div><a class="sidebar-title" href="#blanket-implementations">Blanket Implementations</a><div class="sidebar-links"><a href="#impl-Any">Any</a><a href="#impl-Borrow%3CT%3E">Borrow<T></a><a href="#impl-BorrowMut%3CT%3E">BorrowMut<T></a><a href="#impl-From%3CT%3E">From<T></a><a href="#impl-Into%3CU%3E">Into<U></a><a href="#impl-IntoIterator">IntoIterator</a><a href="#impl-ToOwned">ToOwned</a><a href="#impl-TryFrom%3CU%3E">TryFrom<U></a><a href="#impl-TryInto%3CU%3E">TryInto<U></a></div></div><p class='location'><a href='../../../index.html'>nom</a>::<wbr><a href='../../index.html'>lib</a>::<wbr><a href='../index.html'>std</a>::<wbr><a href='index.html'>collections</a></p><script>window.sidebarCurrent = {name: 'BTreeMap', ty: 'struct', relpath: ''};</script><script defer src="sidebar-items.js"></script></div></nav><div class="theme-picker"><button id="theme-picker" aria-label="Pick another theme!"><img src="../../../../brush.svg" width="18" alt="Pick another theme!"></button><div id="theme-choices"></div></div><script src="../../../../theme.js"></script><nav class="sub"><form class="search-form"><div class="search-container"><div><select id="crate-search"><option value="All crates">All crates</option></select><input class="search-input" name="search" disabled autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"></div><a id="settings-menu" href="../../../../settings.html"><img src="../../../../wheel.svg" width="18" alt="Change settings"></a></div></form></nav><section id="main" class="content"><h1 class='fqn'><span class='out-of-band'><span class='since' title='Stable since Rust version 1.0.0'>1.0.0</span><span id='render-detail'><a id="toggle-all-docs" href="javascript:void(0)" title="collapse all docs">[<span class='inner'>−</span>]</a></span><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#124-127' title='goto source code'>[src]</a></span><span class='in-band'>Struct <a href='../../../index.html'>nom</a>::<wbr><a href='../../index.html'>lib</a>::<wbr><a href='../index.html'>std</a>::<wbr><a href='index.html'>collections</a>::<wbr><a class="struct" href=''>BTreeMap</a></span></h1><div class="docblock type-decl hidden-by-usual-hider"><pre class='rust struct'>pub struct BTreeMap<K, V> { /* fields omitted */ }</pre></div><div class='docblock'><p>A map based on a B-Tree.</p>
|
||
<p>B-Trees represent a fundamental compromise between cache-efficiency and actually minimizing
|
||
the amount of work performed in a search. In theory, a binary search tree (BST) is the optimal
|
||
choice for a sorted map, as a perfectly balanced BST performs the theoretical minimum amount of
|
||
comparisons necessary to find an element (log<sub>2</sub>n). However, in practice the way this
|
||
is done is <em>very</em> inefficient for modern computer architectures. In particular, every element
|
||
is stored in its own individually heap-allocated node. This means that every single insertion
|
||
triggers a heap-allocation, and every single comparison should be a cache-miss. Since these
|
||
are both notably expensive things to do in practice, we are forced to at very least reconsider
|
||
the BST strategy.</p>
|
||
<p>A B-Tree instead makes each node contain B-1 to 2B-1 elements in a contiguous array. By doing
|
||
this, we reduce the number of allocations by a factor of B, and improve cache efficiency in
|
||
searches. However, this does mean that searches will have to do <em>more</em> comparisons on average.
|
||
The precise number of comparisons depends on the node search strategy used. For optimal cache
|
||
efficiency, one could search the nodes linearly. For optimal comparisons, one could search
|
||
the node using binary search. As a compromise, one could also perform a linear search
|
||
that initially only checks every i<sup>th</sup> element for some choice of i.</p>
|
||
<p>Currently, our implementation simply performs naive linear search. This provides excellent
|
||
performance on <em>small</em> nodes of elements which are cheap to compare. However in the future we
|
||
would like to further explore choosing the optimal search strategy based on the choice of B,
|
||
and possibly other factors. Using linear search, searching for a random element is expected
|
||
to take O(B log<sub>B</sub>n) comparisons, which is generally worse than a BST. In practice,
|
||
however, performance is excellent.</p>
|
||
<p>It is a logic error for a key to be modified in such a way that the key's ordering relative to
|
||
any other key, as determined by the <a href="../../std/cmp/trait.Ord.html"><code>Ord</code></a> trait, changes while it is in the map. This is
|
||
normally only possible through <a href="../../std/cell/struct.Cell.html"><code>Cell</code></a>, <a href="../../std/cell/struct.RefCell.html"><code>RefCell</code></a>, global state, I/O, or unsafe code.</p>
|
||
<h1 id="examples" class="section-header"><a href="#examples">Examples</a></h1>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="comment">// type inference lets us omit an explicit type signature (which</span>
|
||
<span class="comment">// would be `BTreeMap<&str, &str>` in this example).</span>
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">movie_reviews</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
|
||
<span class="comment">// review some movies.</span>
|
||
<span class="ident">movie_reviews</span>.<span class="ident">insert</span>(<span class="string">"Office Space"</span>, <span class="string">"Deals with real issues in the workplace."</span>);
|
||
<span class="ident">movie_reviews</span>.<span class="ident">insert</span>(<span class="string">"Pulp Fiction"</span>, <span class="string">"Masterpiece."</span>);
|
||
<span class="ident">movie_reviews</span>.<span class="ident">insert</span>(<span class="string">"The Godfather"</span>, <span class="string">"Very enjoyable."</span>);
|
||
<span class="ident">movie_reviews</span>.<span class="ident">insert</span>(<span class="string">"The Blues Brothers"</span>, <span class="string">"Eye lyked it a lot."</span>);
|
||
|
||
<span class="comment">// check for a specific one.</span>
|
||
<span class="kw">if</span> <span class="op">!</span><span class="ident">movie_reviews</span>.<span class="ident">contains_key</span>(<span class="string">"Les Misérables"</span>) {
|
||
<span class="macro">println</span><span class="macro">!</span>(<span class="string">"We've got {} reviews, but Les Misérables ain't one."</span>,
|
||
<span class="ident">movie_reviews</span>.<span class="ident">len</span>());
|
||
}
|
||
|
||
<span class="comment">// oops, this review has a lot of spelling mistakes, let's delete it.</span>
|
||
<span class="ident">movie_reviews</span>.<span class="ident">remove</span>(<span class="string">"The Blues Brothers"</span>);
|
||
|
||
<span class="comment">// look up the values associated with some keys.</span>
|
||
<span class="kw">let</span> <span class="ident">to_find</span> <span class="op">=</span> [<span class="string">"Up!"</span>, <span class="string">"Office Space"</span>];
|
||
<span class="kw">for</span> <span class="ident">movie</span> <span class="kw">in</span> <span class="kw-2">&</span><span class="ident">to_find</span> {
|
||
<span class="kw">match</span> <span class="ident">movie_reviews</span>.<span class="ident">get</span>(<span class="ident">movie</span>) {
|
||
<span class="prelude-val">Some</span>(<span class="ident">review</span>) <span class="op">=</span><span class="op">></span> <span class="macro">println</span><span class="macro">!</span>(<span class="string">"{}: {}"</span>, <span class="ident">movie</span>, <span class="ident">review</span>),
|
||
<span class="prelude-val">None</span> <span class="op">=</span><span class="op">></span> <span class="macro">println</span><span class="macro">!</span>(<span class="string">"{} is unreviewed."</span>, <span class="ident">movie</span>)
|
||
}
|
||
}
|
||
|
||
<span class="comment">// Look up the value for a key (will panic if the key is not found).</span>
|
||
<span class="macro">println</span><span class="macro">!</span>(<span class="string">"Movie review: {}"</span>, <span class="ident">movie_reviews</span>[<span class="string">"Office Space"</span>]);
|
||
|
||
<span class="comment">// iterate over everything.</span>
|
||
<span class="kw">for</span> (<span class="ident">movie</span>, <span class="ident">review</span>) <span class="kw">in</span> <span class="kw-2">&</span><span class="ident">movie_reviews</span> {
|
||
<span class="macro">println</span><span class="macro">!</span>(<span class="string">"{}: \"{}\""</span>, <span class="ident">movie</span>, <span class="ident">review</span>);
|
||
}</pre></div>
|
||
<p><code>BTreeMap</code> also implements an <a href="#method.entry"><code>Entry API</code></a>, which allows
|
||
for more complex methods of getting, setting, updating and removing keys and
|
||
their values:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="comment">// type inference lets us omit an explicit type signature (which</span>
|
||
<span class="comment">// would be `BTreeMap<&str, u8>` in this example).</span>
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">player_stats</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
|
||
<span class="kw">fn</span> <span class="ident">random_stat_buff</span>() <span class="op">-</span><span class="op">></span> <span class="ident">u8</span> {
|
||
<span class="comment">// could actually return some random value here - let's just return</span>
|
||
<span class="comment">// some fixed value for now</span>
|
||
<span class="number">42</span>
|
||
}
|
||
|
||
<span class="comment">// insert a key only if it doesn't already exist</span>
|
||
<span class="ident">player_stats</span>.<span class="ident">entry</span>(<span class="string">"health"</span>).<span class="ident">or_insert</span>(<span class="number">100</span>);
|
||
|
||
<span class="comment">// insert a key using a function that provides a new value only if it</span>
|
||
<span class="comment">// doesn't already exist</span>
|
||
<span class="ident">player_stats</span>.<span class="ident">entry</span>(<span class="string">"defence"</span>).<span class="ident">or_insert_with</span>(<span class="ident">random_stat_buff</span>);
|
||
|
||
<span class="comment">// update a key, guarding against the key possibly not being set</span>
|
||
<span class="kw">let</span> <span class="ident">stat</span> <span class="op">=</span> <span class="ident">player_stats</span>.<span class="ident">entry</span>(<span class="string">"attack"</span>).<span class="ident">or_insert</span>(<span class="number">100</span>);
|
||
<span class="kw-2">*</span><span class="ident">stat</span> <span class="op">+</span><span class="op">=</span> <span class="ident">random_stat_buff</span>();</pre></div>
|
||
</div><h2 id='methods' class='small-section-header'>Methods<a href='#methods' class='anchor'></a></h2><h3 id='impl' class='impl'><code class='in-band'>impl<K, V> <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a>, </span></code><a href='#impl' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#530-1336' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.new' class="method"><code id='new.v'>pub fn <a href='#method.new' class='fnname'>new</a>() -> <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#546-548' title='goto source code'>[src]</a></h4><div class='docblock'><p>Makes a new empty BTreeMap with a reasonable choice for B.</p>
|
||
<h1 id="examples-1" class="section-header"><a href="#examples-1">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
|
||
<span class="comment">// entries can now be inserted into the empty map</span>
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);</pre></div>
|
||
</div><h4 id='method.clear' class="method"><code id='clear.v'>pub fn <a href='#method.clear' class='fnname'>clear</a>(&mut self)</code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#565-567' title='goto source code'>[src]</a></h4><div class='docblock'><p>Clears the map, removing all elements.</p>
|
||
<h1 id="examples-2" class="section-header"><a href="#examples-2">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">a</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="ident">a</span>.<span class="ident">clear</span>();
|
||
<span class="macro">assert</span><span class="macro">!</span>(<span class="ident">a</span>.<span class="ident">is_empty</span>());</pre></div>
|
||
</div><h4 id='method.get' class="method"><code id='get.v'>pub fn <a href='#method.get' class='fnname'>get</a><Q>(&self, key: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Q) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Option.html" title="enum nom::lib::std::prelude::v1::v1::Option">Option</a><<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>V> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><Q>,<br> Q: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#587-596' title='goto source code'>[src]</a></h4><div class='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 the ordering
|
||
on the borrowed form <em>must</em> match the ordering on the key type.</p>
|
||
<h1 id="examples-3" class="section-header"><a href="#examples-3">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">get</span>(<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><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">get</span>(<span class="kw-2">&</span><span class="number">2</span>), <span class="prelude-val">None</span>);</pre></div>
|
||
</div><h4 id='method.get_key_value' class="method"><code id='get_key_value.v'>pub fn <a href='#method.get_key_value' class='fnname'>get_key_value</a><Q>(&self, k: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Q) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Option.html" title="enum nom::lib::std::prelude::v1::v1::Option">Option</a><<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a><a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>K, <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a>> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><Q>,<br> Q: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><span class='since' title='Stable since Rust version 1.40.0'>1.40.0</span><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#614-623' title='goto source code'>[src]</a></h4><div class='docblock'><p>Returns the key-value pair corresponding to the supplied key.</p>
|
||
<p>The supplied key may be any borrowed form of the map's key type, but the ordering
|
||
on the borrowed form <em>must</em> match the ordering on the key type.</p>
|
||
<h1 id="examples-4" class="section-header"><a href="#examples-4">Examples</a></h1>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">get_key_value</span>(<span class="kw-2">&</span><span class="number">1</span>), <span class="prelude-val">Some</span>((<span class="kw-2">&</span><span class="number">1</span>, <span class="kw-2">&</span><span class="string">"a"</span>)));
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">get_key_value</span>(<span class="kw-2">&</span><span class="number">2</span>), <span class="prelude-val">None</span>);</pre></div>
|
||
</div><h4 id='method.first_key_value' class="method"><code id='first_key_value.v'>pub fn <a href='#method.first_key_value' class='fnname'>first_key_value</a><T>(&self) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Option.html" title="enum nom::lib::std::prelude::v1::v1::Option">Option</a><<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a><a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>K, <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a>> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><T>,<br> T: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#643-650' title='goto source code'>[src]</a></h4><div class='stability'><div class='stab unstable'><span class='emoji'>🔬</span> This is a nightly-only experimental API. (<code>map_first_last</code>)</div></div><div class='docblock'><p>Returns the first key-value pair in the map.
|
||
The key in this pair is the minimum key in the map.</p>
|
||
<h1 id="examples-5" class="section-header"><a href="#examples-5">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="attribute">#![<span class="ident">feature</span>(<span class="ident">map_first_last</span>)]</span>
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">first_key_value</span>(), <span class="prelude-val">None</span>);
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"b"</span>);
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">2</span>, <span class="string">"a"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">first_key_value</span>(), <span class="prelude-val">Some</span>((<span class="kw-2">&</span><span class="number">1</span>, <span class="kw-2">&</span><span class="string">"b"</span>)));</pre></div>
|
||
</div><h4 id='method.first_entry' class="method"><code id='first_entry.v'>pub fn <a href='#method.first_entry' class='fnname'>first_entry</a><T>(&mut self) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Option.html" title="enum nom::lib::std::prelude::v1::v1::Option">Option</a><<a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.OccupiedEntry.html" title="struct nom::lib::std::collections::btree_map::OccupiedEntry">OccupiedEntry</a><K, V>> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><T>,<br> T: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#672-687' title='goto source code'>[src]</a></h4><div class='stability'><div class='stab unstable'><span class='emoji'>🔬</span> This is a nightly-only experimental API. (<code>map_first_last</code>)</div></div><div class='docblock'><p>Returns the first entry in the map for in-place manipulation.
|
||
The key of this entry is the minimum key in the map.</p>
|
||
<h1 id="examples-6" class="section-header"><a href="#examples-6">Examples</a></h1>
|
||
<p>Contrived way to <code>clear</code> a map:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="attribute">#![<span class="ident">feature</span>(<span class="ident">map_first_last</span>)]</span>
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">2</span>, <span class="string">"b"</span>);
|
||
<span class="kw">while</span> <span class="kw">let</span> <span class="prelude-val">Some</span>(<span class="ident">entry</span>) <span class="op">=</span> <span class="ident">map</span>.<span class="ident">first_entry</span>() {
|
||
<span class="kw">let</span> (<span class="ident">key</span>, <span class="ident">val</span>) <span class="op">=</span> <span class="ident">entry</span>.<span class="ident">remove_entry</span>();
|
||
<span class="macro">assert</span><span class="macro">!</span>(<span class="op">!</span><span class="ident">map</span>.<span class="ident">contains_key</span>(<span class="kw-2">&</span><span class="ident">key</span>));
|
||
}</pre></div>
|
||
</div><h4 id='method.last_key_value' class="method"><code id='last_key_value.v'>pub fn <a href='#method.last_key_value' class='fnname'>last_key_value</a><T>(&self) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Option.html" title="enum nom::lib::std::prelude::v1::v1::Option">Option</a><<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a><a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>K, <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a>> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><T>,<br> T: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#706-713' title='goto source code'>[src]</a></h4><div class='stability'><div class='stab unstable'><span class='emoji'>🔬</span> This is a nightly-only experimental API. (<code>map_first_last</code>)</div></div><div class='docblock'><p>Returns the last key-value pair in the map.
|
||
The key in this pair is the maximum key in the map.</p>
|
||
<h1 id="examples-7" class="section-header"><a href="#examples-7">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="attribute">#![<span class="ident">feature</span>(<span class="ident">map_first_last</span>)]</span>
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"b"</span>);
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">2</span>, <span class="string">"a"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">last_key_value</span>(), <span class="prelude-val">Some</span>((<span class="kw-2">&</span><span class="number">2</span>, <span class="kw-2">&</span><span class="string">"a"</span>)));</pre></div>
|
||
</div><h4 id='method.last_entry' class="method"><code id='last_entry.v'>pub fn <a href='#method.last_entry' class='fnname'>last_entry</a><T>(&mut self) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Option.html" title="enum nom::lib::std::prelude::v1::v1::Option">Option</a><<a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.OccupiedEntry.html" title="struct nom::lib::std::collections::btree_map::OccupiedEntry">OccupiedEntry</a><K, V>> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><T>,<br> T: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#735-750' title='goto source code'>[src]</a></h4><div class='stability'><div class='stab unstable'><span class='emoji'>🔬</span> This is a nightly-only experimental API. (<code>map_first_last</code>)</div></div><div class='docblock'><p>Returns the last entry in the map for in-place manipulation.
|
||
The key of this entry is the maximum key in the map.</p>
|
||
<h1 id="examples-8" class="section-header"><a href="#examples-8">Examples</a></h1>
|
||
<p>Contrived way to <code>clear</code> a map:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="attribute">#![<span class="ident">feature</span>(<span class="ident">map_first_last</span>)]</span>
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">2</span>, <span class="string">"b"</span>);
|
||
<span class="kw">while</span> <span class="kw">let</span> <span class="prelude-val">Some</span>(<span class="ident">entry</span>) <span class="op">=</span> <span class="ident">map</span>.<span class="ident">last_entry</span>() {
|
||
<span class="kw">let</span> (<span class="ident">key</span>, <span class="ident">val</span>) <span class="op">=</span> <span class="ident">entry</span>.<span class="ident">remove_entry</span>();
|
||
<span class="macro">assert</span><span class="macro">!</span>(<span class="op">!</span><span class="ident">map</span>.<span class="ident">contains_key</span>(<span class="kw-2">&</span><span class="ident">key</span>));
|
||
}</pre></div>
|
||
</div><h4 id='method.contains_key' class="method"><code id='contains_key.v'>pub fn <a href='#method.contains_key' class='fnname'>contains_key</a><Q>(&self, key: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Q) -> <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.bool.html">bool</a> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><Q>,<br> Q: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#770-776' title='goto source code'>[src]</a></h4><div class='docblock'><p>Returns <code>true</code> 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 the ordering
|
||
on the borrowed form <em>must</em> match the ordering on the key type.</p>
|
||
<h1 id="examples-9" class="section-header"><a href="#examples-9">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">contains_key</span>(<span class="kw-2">&</span><span class="number">1</span>), <span class="bool-val">true</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">contains_key</span>(<span class="kw-2">&</span><span class="number">2</span>), <span class="bool-val">false</span>);</pre></div>
|
||
</div><h4 id='method.get_mut' class="method"><code id='get_mut.v'>pub fn <a href='#method.get_mut' class='fnname'>get_mut</a><Q>(&mut self, key: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Q) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Option.html" title="enum nom::lib::std::prelude::v1::v1::Option">Option</a><<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&mut </a>V> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><Q>,<br> Q: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#799-808' title='goto source code'>[src]</a></h4><div class='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 the ordering
|
||
on the borrowed form <em>must</em> match the ordering on the key type.</p>
|
||
<h1 id="examples-10" class="section-header"><a href="#examples-10">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="kw">if</span> <span class="kw">let</span> <span class="prelude-val">Some</span>(<span class="ident">x</span>) <span class="op">=</span> <span class="ident">map</span>.<span class="ident">get_mut</span>(<span class="kw-2">&</span><span class="number">1</span>) {
|
||
<span class="kw-2">*</span><span class="ident">x</span> <span class="op">=</span> <span class="string">"b"</span>;
|
||
}
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>[<span class="kw-2">&</span><span class="number">1</span>], <span class="string">"b"</span>);</pre></div>
|
||
</div><h4 id='method.insert' class="method"><code id='insert.v'>pub fn <a href='#method.insert' class='fnname'>insert</a>(&mut self, key: K, value: V) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Option.html" title="enum nom::lib::std::prelude::v1::v1::Option">Option</a><V></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#837-845' title='goto source code'>[src]</a></h4><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. The key is not updated, though; this matters for
|
||
types that can be <code>==</code> without being identical. See the <a href="index.html#insert-and-complex-keys">module-level
|
||
documentation</a> for more.</p>
|
||
<h1 id="examples-11" class="section-header"><a href="#examples-11">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">37</span>, <span class="string">"a"</span>), <span class="prelude-val">None</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">is_empty</span>(), <span class="bool-val">false</span>);
|
||
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">37</span>, <span class="string">"b"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">37</span>, <span class="string">"c"</span>), <span class="prelude-val">Some</span>(<span class="string">"b"</span>));
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>[<span class="kw-2">&</span><span class="number">37</span>], <span class="string">"c"</span>);</pre></div>
|
||
</div><h4 id='method.remove' class="method"><code id='remove.v'>pub fn <a href='#method.remove' class='fnname'>remove</a><Q>(&mut self, key: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Q) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Option.html" title="enum nom::lib::std::prelude::v1::v1::Option">Option</a><V> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><Q>,<br> Q: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#866-872' title='goto source code'>[src]</a></h4><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>The key may be any borrowed form of the map's key type, but the ordering
|
||
on the borrowed form <em>must</em> match the ordering on the key type.</p>
|
||
<h1 id="examples-12" class="section-header"><a href="#examples-12">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">remove</span>(<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><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">remove</span>(<span class="kw-2">&</span><span class="number">1</span>), <span class="prelude-val">None</span>);</pre></div>
|
||
</div><h4 id='method.remove_entry' class="method"><code id='remove_entry.v'>pub fn <a href='#method.remove_entry' class='fnname'>remove_entry</a><Q>(&mut self, key: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Q) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Option.html" title="enum nom::lib::std::prelude::v1::v1::Option">Option</a><<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a>K, V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a>> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><Q>,<br> Q: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#894-906' title='goto source code'>[src]</a></h4><div class='stability'><div class='stab unstable'><span class='emoji'>🔬</span> This is a nightly-only experimental API. (<code>btreemap_remove_entry</code>)</div></div><div class='docblock'><p>Removes a key from the map, returning the stored key and value if the key
|
||
was previously in the map.</p>
|
||
<p>The key may be any borrowed form of the map's key type, but the ordering
|
||
on the borrowed form <em>must</em> match the ordering on the key type.</p>
|
||
<h1 id="examples-13" class="section-header"><a href="#examples-13">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="attribute">#![<span class="ident">feature</span>(<span class="ident">btreemap_remove_entry</span>)]</span>
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">remove_entry</span>(<span class="kw-2">&</span><span class="number">1</span>), <span class="prelude-val">Some</span>((<span class="number">1</span>, <span class="string">"a"</span>)));
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">map</span>.<span class="ident">remove_entry</span>(<span class="kw-2">&</span><span class="number">1</span>), <span class="prelude-val">None</span>);</pre></div>
|
||
</div><h4 id='method.append' class="method"><code id='append.v'>pub fn <a href='#method.append' class='fnname'>append</a>(&mut self, other: &mut <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V>)</code><span class='since' title='Stable since Rust version 1.11.0'>1.11.0</span><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#937-957' title='goto source code'>[src]</a></h4><div class='docblock'><p>Moves all elements from <code>other</code> into <code>Self</code>, leaving <code>other</code> empty.</p>
|
||
<h1 id="examples-14" class="section-header"><a href="#examples-14">Examples</a></h1>
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">a</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">2</span>, <span class="string">"b"</span>);
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">3</span>, <span class="string">"c"</span>);
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">b</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">b</span>.<span class="ident">insert</span>(<span class="number">3</span>, <span class="string">"d"</span>);
|
||
<span class="ident">b</span>.<span class="ident">insert</span>(<span class="number">4</span>, <span class="string">"e"</span>);
|
||
<span class="ident">b</span>.<span class="ident">insert</span>(<span class="number">5</span>, <span class="string">"f"</span>);
|
||
|
||
<span class="ident">a</span>.<span class="ident">append</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">b</span>);
|
||
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">a</span>.<span class="ident">len</span>(), <span class="number">5</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">b</span>.<span class="ident">len</span>(), <span class="number">0</span>);
|
||
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">a</span>[<span class="kw-2">&</span><span class="number">1</span>], <span class="string">"a"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">a</span>[<span class="kw-2">&</span><span class="number">2</span>], <span class="string">"b"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">a</span>[<span class="kw-2">&</span><span class="number">3</span>], <span class="string">"d"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">a</span>[<span class="kw-2">&</span><span class="number">4</span>], <span class="string">"e"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">a</span>[<span class="kw-2">&</span><span class="number">5</span>], <span class="string">"f"</span>);</pre></div>
|
||
</div><h4 id='method.range' class="method"><code id='range.v'>pub fn <a href='#method.range' class='fnname'>range</a><T, R>(&self, range: R) -> <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.Range.html" title="struct nom::lib::std::collections::btree_map::Range">Range</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><T>,<br> R: <a class="trait" href="../../../../nom/lib/std/ops/trait.RangeBounds.html" title="trait nom::lib::std::ops::RangeBounds">RangeBounds</a><T>,<br> T: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><span class='since' title='Stable since Rust version 1.17.0'>1.17.0</span><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#989-1000' title='goto source code'>[src]</a></h4><div class='docblock'><p>Constructs a double-ended iterator over a sub-range of elements in the map.
|
||
The simplest way is to use the range syntax <code>min..max</code>, thus <code>range(min..max)</code> will
|
||
yield elements from min (inclusive) to max (exclusive).
|
||
The range may also be entered as <code>(Bound<T>, Bound<T>)</code>, so for example
|
||
<code>range((Excluded(4), Included(10)))</code> will yield a left-exclusive, right-inclusive
|
||
range from 4 to 10.</p>
|
||
<h1 id="panics" class="section-header"><a href="#panics">Panics</a></h1>
|
||
<p>Panics if range <code>start > end</code>.
|
||
Panics if range <code>start == end</code> and both bounds are <code>Excluded</code>.</p>
|
||
<h1 id="examples-15" class="section-header"><a href="#examples-15">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">ops</span>::<span class="ident">Bound</span>::<span class="ident">Included</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">3</span>, <span class="string">"a"</span>);
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">5</span>, <span class="string">"b"</span>);
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">8</span>, <span class="string">"c"</span>);
|
||
<span class="kw">for</span> (<span class="kw-2">&</span><span class="ident">key</span>, <span class="kw-2">&</span><span class="ident">value</span>) <span class="kw">in</span> <span class="ident">map</span>.<span class="ident">range</span>((<span class="ident">Included</span>(<span class="kw-2">&</span><span class="number">4</span>), <span class="ident">Included</span>(<span class="kw-2">&</span><span class="number">8</span>))) {
|
||
<span class="macro">println</span><span class="macro">!</span>(<span class="string">"{}: {}"</span>, <span class="ident">key</span>, <span class="ident">value</span>);
|
||
}
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="prelude-val">Some</span>((<span class="kw-2">&</span><span class="number">5</span>, <span class="kw-2">&</span><span class="string">"b"</span>)), <span class="ident">map</span>.<span class="ident">range</span>(<span class="number">4</span>..).<span class="ident">next</span>());</pre></div>
|
||
</div><h4 id='method.range_mut' class="method"><code id='range_mut.v'>pub fn <a href='#method.range_mut' class='fnname'>range_mut</a><T, R>(&mut self, range: R) -> <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.RangeMut.html" title="struct nom::lib::std::collections::btree_map::RangeMut">RangeMut</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><T>,<br> R: <a class="trait" href="../../../../nom/lib/std/ops/trait.RangeBounds.html" title="trait nom::lib::std::ops::RangeBounds">RangeBounds</a><T>,<br> T: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><span class='since' title='Stable since Rust version 1.17.0'>1.17.0</span><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1033-1044' title='goto source code'>[src]</a></h4><div class='docblock'><p>Constructs a mutable double-ended iterator over a sub-range of elements in the map.
|
||
The simplest way is to use the range syntax <code>min..max</code>, thus <code>range(min..max)</code> will
|
||
yield elements from min (inclusive) to max (exclusive).
|
||
The range may also be entered as <code>(Bound<T>, Bound<T>)</code>, so for example
|
||
<code>range((Excluded(4), Included(10)))</code> will yield a left-exclusive, right-inclusive
|
||
range from 4 to 10.</p>
|
||
<h1 id="panics-1" class="section-header"><a href="#panics-1">Panics</a></h1>
|
||
<p>Panics if range <code>start > end</code>.
|
||
Panics if range <code>start == end</code> and both bounds are <code>Excluded</code>.</p>
|
||
<h1 id="examples-16" class="section-header"><a href="#examples-16">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span>: <span class="ident">BTreeMap</span><span class="op"><</span><span class="kw-2">&</span><span class="ident">str</span>, <span class="ident">i32</span><span class="op">></span> <span class="op">=</span> [<span class="string">"Alice"</span>, <span class="string">"Bob"</span>, <span class="string">"Carol"</span>, <span class="string">"Cheryl"</span>]
|
||
.<span class="ident">iter</span>()
|
||
.<span class="ident">map</span>(<span class="op">|</span><span class="kw-2">&</span><span class="ident">s</span><span class="op">|</span> (<span class="ident">s</span>, <span class="number">0</span>))
|
||
.<span class="ident">collect</span>();
|
||
<span class="kw">for</span> (<span class="kw">_</span>, <span class="ident">balance</span>) <span class="kw">in</span> <span class="ident">map</span>.<span class="ident">range_mut</span>(<span class="string">"B"</span>..<span class="string">"Cheryl"</span>) {
|
||
<span class="kw-2">*</span><span class="ident">balance</span> <span class="op">+</span><span class="op">=</span> <span class="number">100</span>;
|
||
}
|
||
<span class="kw">for</span> (<span class="ident">name</span>, <span class="ident">balance</span>) <span class="kw">in</span> <span class="kw-2">&</span><span class="ident">map</span> {
|
||
<span class="macro">println</span><span class="macro">!</span>(<span class="string">"{} => {}"</span>, <span class="ident">name</span>, <span class="ident">balance</span>);
|
||
}</pre></div>
|
||
</div><h4 id='method.entry' class="method"><code id='entry.v'>pub fn <a href='#method.entry' class='fnname'>entry</a>(&mut self, key: K) -> <a class="enum" href="../../../../nom/lib/std/collections/btree_map/enum.Entry.html" title="enum nom::lib::std::collections::btree_map::Entry">Entry</a><K, V></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1065-1076' title='goto source code'>[src]</a></h4><div class='docblock'><p>Gets the given key's corresponding entry in the map for in-place manipulation.</p>
|
||
<h1 id="examples-17" class="section-header"><a href="#examples-17">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">count</span>: <span class="ident">BTreeMap</span><span class="op"><</span><span class="kw-2">&</span><span class="ident">str</span>, <span class="ident">usize</span><span class="op">></span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
|
||
<span class="comment">// count the number of occurrences of letters in the vec</span>
|
||
<span class="kw">for</span> <span class="ident">x</span> <span class="kw">in</span> <span class="macro">vec</span><span class="macro">!</span>[<span class="string">"a"</span>,<span class="string">"b"</span>,<span class="string">"a"</span>,<span class="string">"c"</span>,<span class="string">"a"</span>,<span class="string">"b"</span>] {
|
||
<span class="kw-2">*</span><span class="ident">count</span>.<span class="ident">entry</span>(<span class="ident">x</span>).<span class="ident">or_insert</span>(<span class="number">0</span>) <span class="op">+</span><span class="op">=</span> <span class="number">1</span>;
|
||
}
|
||
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">count</span>[<span class="string">"a"</span>], <span class="number">3</span>);</pre></div>
|
||
</div><h4 id='method.split_off' class="method"><code id='split_off.v'>pub fn <a href='#method.split_off' class='fnname'>split_off</a><Q>(&mut self, key: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Q) -> <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><Q>,<br> Q: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><span class='since' title='Stable since Rust version 1.11.0'>1.11.0</span><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1179-1235' title='goto source code'>[src]</a></h4><div class='docblock'><p>Splits the collection into two at the given key. Returns everything after the given key,
|
||
including the key.</p>
|
||
<h1 id="examples-18" class="section-header"><a href="#examples-18">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">a</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">2</span>, <span class="string">"b"</span>);
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">3</span>, <span class="string">"c"</span>);
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">17</span>, <span class="string">"d"</span>);
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">41</span>, <span class="string">"e"</span>);
|
||
|
||
<span class="kw">let</span> <span class="ident">b</span> <span class="op">=</span> <span class="ident">a</span>.<span class="ident">split_off</span>(<span class="kw-2">&</span><span class="number">3</span>);
|
||
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">a</span>.<span class="ident">len</span>(), <span class="number">2</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">b</span>.<span class="ident">len</span>(), <span class="number">3</span>);
|
||
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">a</span>[<span class="kw-2">&</span><span class="number">1</span>], <span class="string">"a"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">a</span>[<span class="kw-2">&</span><span class="number">2</span>], <span class="string">"b"</span>);
|
||
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">b</span>[<span class="kw-2">&</span><span class="number">3</span>], <span class="string">"c"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">b</span>[<span class="kw-2">&</span><span class="number">17</span>], <span class="string">"d"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">b</span>[<span class="kw-2">&</span><span class="number">41</span>], <span class="string">"e"</span>);</pre></div>
|
||
</div></div><h3 id='impl-1' class='impl'><code class='in-band'>impl<K, V> <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V></code><a href='#impl-1' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1946-2119' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.iter' class="method"><code id='iter.v'>pub fn <a href='#method.iter' class='fnname'>iter</a>(&self) -> <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.Iter.html" title="struct nom::lib::std::collections::btree_map::Iter">Iter</a><K, V></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1969-1977' title='goto source code'>[src]</a></h4><div class='docblock'><p>Gets an iterator over the entries of the map, sorted by key.</p>
|
||
<h1 id="examples-19" class="section-header"><a href="#examples-19">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">3</span>, <span class="string">"c"</span>);
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">2</span>, <span class="string">"b"</span>);
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
|
||
<span class="kw">for</span> (<span class="ident">key</span>, <span class="ident">value</span>) <span class="kw">in</span> <span class="ident">map</span>.<span class="ident">iter</span>() {
|
||
<span class="macro">println</span><span class="macro">!</span>(<span class="string">"{}: {}"</span>, <span class="ident">key</span>, <span class="ident">value</span>);
|
||
}
|
||
|
||
<span class="kw">let</span> (<span class="ident">first_key</span>, <span class="ident">first_value</span>) <span class="op">=</span> <span class="ident">map</span>.<span class="ident">iter</span>().<span class="ident">next</span>().<span class="ident">unwrap</span>();
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>((<span class="kw-2">*</span><span class="ident">first_key</span>, <span class="kw-2">*</span><span class="ident">first_value</span>), (<span class="number">1</span>, <span class="string">"a"</span>));</pre></div>
|
||
</div><h4 id='method.iter_mut' class="method"><code id='iter_mut.v'>pub fn <a href='#method.iter_mut' class='fnname'>iter_mut</a>(&mut self) -> <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.IterMut.html" title="struct nom::lib::std::collections::btree_map::IterMut">IterMut</a><K, V></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#2001-2012' title='goto source code'>[src]</a></h4><div class='docblock'><p>Gets a mutable iterator over the entries of the map, sorted by key.</p>
|
||
<h1 id="examples-20" class="section-header"><a href="#examples-20">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">map</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="string">"a"</span>, <span class="number">1</span>);
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="string">"b"</span>, <span class="number">2</span>);
|
||
<span class="ident">map</span>.<span class="ident">insert</span>(<span class="string">"c"</span>, <span class="number">3</span>);
|
||
|
||
<span class="comment">// add 10 to the value if the key isn't "a"</span>
|
||
<span class="kw">for</span> (<span class="ident">key</span>, <span class="ident">value</span>) <span class="kw">in</span> <span class="ident">map</span>.<span class="ident">iter_mut</span>() {
|
||
<span class="kw">if</span> <span class="ident">key</span> <span class="op">!</span><span class="op">=</span> <span class="kw-2">&</span><span class="string">"a"</span> {
|
||
<span class="kw-2">*</span><span class="ident">value</span> <span class="op">+</span><span class="op">=</span> <span class="number">10</span>;
|
||
}
|
||
}</pre></div>
|
||
</div><h4 id='method.keys' class="method"><code id='keys.v'>pub fn <a href='#method.keys' class='fnname'>keys</a>(&self) -> <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.Keys.html" title="struct nom::lib::std::collections::btree_map::Keys">Keys</a><K, V></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#2031-2033' title='goto source code'>[src]</a></h4><div class='docblock'><p>Gets an iterator over the keys of the map, in sorted order.</p>
|
||
<h1 id="examples-21" class="section-header"><a href="#examples-21">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">a</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">2</span>, <span class="string">"b"</span>);
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
|
||
<span class="kw">let</span> <span class="ident">keys</span>: <span class="ident">Vec</span><span class="op"><</span><span class="kw">_</span><span class="op">></span> <span class="op">=</span> <span class="ident">a</span>.<span class="ident">keys</span>().<span class="ident">cloned</span>().<span class="ident">collect</span>();
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">keys</span>, [<span class="number">1</span>, <span class="number">2</span>]);</pre></div>
|
||
</div><h4 id='method.values' class="method"><code id='values.v'>pub fn <a href='#method.values' class='fnname'>values</a>(&self) -> <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.Values.html" title="struct nom::lib::std::collections::btree_map::Values">Values</a><K, V></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#2052-2054' title='goto source code'>[src]</a></h4><div class='docblock'><p>Gets an iterator over the values of the map, in order by key.</p>
|
||
<h1 id="examples-22" class="section-header"><a href="#examples-22">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">a</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"hello"</span>);
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">2</span>, <span class="string">"goodbye"</span>);
|
||
|
||
<span class="kw">let</span> <span class="ident">values</span>: <span class="ident">Vec</span><span class="op"><</span><span class="kw-2">&</span><span class="ident">str</span><span class="op">></span> <span class="op">=</span> <span class="ident">a</span>.<span class="ident">values</span>().<span class="ident">cloned</span>().<span class="ident">collect</span>();
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">values</span>, [<span class="string">"hello"</span>, <span class="string">"goodbye"</span>]);</pre></div>
|
||
</div><h4 id='method.values_mut' class="method"><code id='values_mut.v'>pub fn <a href='#method.values_mut' class='fnname'>values_mut</a>(&mut self) -> <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.ValuesMut.html" title="struct nom::lib::std::collections::btree_map::ValuesMut">ValuesMut</a><K, V></code><span class='since' title='Stable since Rust version 1.10.0'>1.10.0</span><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#2078-2080' title='goto source code'>[src]</a></h4><div class='docblock'><p>Gets a mutable iterator over the values of the map, in order by key.</p>
|
||
<h1 id="examples-23" class="section-header"><a href="#examples-23">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">a</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="ident">String</span>::<span class="ident">from</span>(<span class="string">"hello"</span>));
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">2</span>, <span class="ident">String</span>::<span class="ident">from</span>(<span class="string">"goodbye"</span>));
|
||
|
||
<span class="kw">for</span> <span class="ident">value</span> <span class="kw">in</span> <span class="ident">a</span>.<span class="ident">values_mut</span>() {
|
||
<span class="ident">value</span>.<span class="ident">push_str</span>(<span class="string">"!"</span>);
|
||
}
|
||
|
||
<span class="kw">let</span> <span class="ident">values</span>: <span class="ident">Vec</span><span class="op"><</span><span class="ident">String</span><span class="op">></span> <span class="op">=</span> <span class="ident">a</span>.<span class="ident">values</span>().<span class="ident">cloned</span>().<span class="ident">collect</span>();
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">values</span>, [<span class="ident">String</span>::<span class="ident">from</span>(<span class="string">"hello!"</span>),
|
||
<span class="ident">String</span>::<span class="ident">from</span>(<span class="string">"goodbye!"</span>)]);</pre></div>
|
||
</div><h4 id='method.len' class="method"><code id='len.v'>pub fn <a href='#method.len' class='fnname'>len</a>(&self) -> <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.usize.html">usize</a></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#2097-2099' title='goto source code'>[src]</a></h4><div class='docblock'><p>Returns the number of elements in the map.</p>
|
||
<h1 id="examples-24" class="section-header"><a href="#examples-24">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">a</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">a</span>.<span class="ident">len</span>(), <span class="number">0</span>);
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">a</span>.<span class="ident">len</span>(), <span class="number">1</span>);</pre></div>
|
||
</div><h4 id='method.is_empty' class="method"><code id='is_empty.v'>pub fn <a href='#method.is_empty' class='fnname'>is_empty</a>(&self) -> <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.bool.html">bool</a></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#2116-2118' title='goto source code'>[src]</a></h4><div class='docblock'><p>Returns <code>true</code> if the map contains no elements.</p>
|
||
<h1 id="examples-25" class="section-header"><a href="#examples-25">Examples</a></h1>
|
||
<p>Basic usage:</p>
|
||
|
||
<div class="example-wrap"><pre class="rust rust-example-rendered">
|
||
<span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeMap</span>;
|
||
|
||
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">a</span> <span class="op">=</span> <span class="ident">BTreeMap</span>::<span class="ident">new</span>();
|
||
<span class="macro">assert</span><span class="macro">!</span>(<span class="ident">a</span>.<span class="ident">is_empty</span>());
|
||
<span class="ident">a</span>.<span class="ident">insert</span>(<span class="number">1</span>, <span class="string">"a"</span>);
|
||
<span class="macro">assert</span><span class="macro">!</span>(<span class="op">!</span><span class="ident">a</span>.<span class="ident">is_empty</span>());</pre></div>
|
||
</div></div><h2 id='implementations' class='small-section-header'>Trait Implementations<a href='#implementations' class='anchor'></a></h2><div id='implementations-list'><h3 id='impl-Clone' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Clone.html" title="trait nom::lib::std::prelude::v1::v1::Clone">Clone</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Clone.html" title="trait nom::lib::std::prelude::v1::v1::Clone">Clone</a>,<br> V: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Clone.html" title="trait nom::lib::std::prelude::v1::v1::Clone">Clone</a>, </span></code><a href='#impl-Clone' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#139-215' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.clone' class="method hidden"><code id='clone.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.Clone.html#tymethod.clone' class='fnname'>clone</a>(&self) -> <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#140-210' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Returns a copy of the value. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.Clone.html#tymethod.clone">Read more</a></p>
|
||
</div><h4 id='method.clone_from' class="method hidden"><code id='clone_from.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.Clone.html#method.clone_from' class='fnname'>clone_from</a>(&mut self, other: &<a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V>)</code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#212-214' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Performs copy-assignment from <code>source</code>. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.Clone.html#method.clone_from">Read more</a></p>
|
||
</div></div><h3 id='impl-Debug' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/fmt/trait.Debug.html" title="trait nom::lib::std::fmt::Debug">Debug</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/fmt/trait.Debug.html" title="trait nom::lib::std::fmt::Debug">Debug</a>,<br> V: <a class="trait" href="../../../../nom/lib/std/fmt/trait.Debug.html" title="trait nom::lib::std::fmt::Debug">Debug</a>, </span></code><a href='#impl-Debug' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1832-1836' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.fmt' class="method hidden"><code id='fmt.v'>fn <a href='../../../../nom/lib/std/fmt/trait.Debug.html#tymethod.fmt' class='fnname'>fmt</a>(&self, f: &mut <a class="struct" href="../../../../nom/lib/std/fmt/struct.Formatter.html" title="struct nom::lib::std::fmt::Formatter">Formatter</a>) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Result.html" title="enum nom::lib::std::prelude::v1::v1::Result">Result</a><<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.unit.html">()</a>, <a class="struct" href="../../../../nom/lib/std/fmt/struct.Error.html" title="struct nom::lib::std::fmt::Error">Error</a>></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1833-1835' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Formats the value using the given formatter. <a href="../../../../nom/lib/std/fmt/trait.Debug.html#tymethod.fmt">Read more</a></p>
|
||
</div></div><h3 id='impl-Default' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Default.html" title="trait nom::lib::std::prelude::v1::v1::Default">Default</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a>, </span></code><a href='#impl-Default' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1798-1803' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.default' class="method"><code id='default.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.Default.html#tymethod.default' class='fnname'>default</a>() -> <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1800-1802' title='goto source code'>[src]</a></h4><div class='docblock'><p>Creates an empty <code>BTreeMap<K, V></code>.</p>
|
||
</div></div><h3 id='impl-Drop' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Drop.html" title="trait nom::lib::std::prelude::v1::v1::Drop">Drop</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V></code><a href='#impl-Drop' class='anchor'></a><span class='since' title='Stable since Rust version 1.7.0'>1.7.0</span><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#130-136' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.drop' class="method hidden"><code id='drop.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.Drop.html#tymethod.drop' class='fnname'>drop</a>(&mut self)</code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#131-135' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Executes the destructor for this type. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.Drop.html#tymethod.drop">Read more</a></p>
|
||
</div></div><h3 id='impl-Eq' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Eq.html" title="trait nom::lib::std::prelude::v1::v1::Eq">Eq</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Eq.html" title="trait nom::lib::std::prelude::v1::v1::Eq">Eq</a>,<br> V: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Eq.html" title="trait nom::lib::std::prelude::v1::v1::Eq">Eq</a>, </span></code><a href='#impl-Eq' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1813' title='goto source code'>[src]</a></h3><div class='impl-items'></div><h3 id='impl-Extend%3C(%26%27a%20K%2C%20%26%27a%20V)%3E' class='impl'><code class='in-band'>impl<'a, K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Extend.html" title="trait nom::lib::std::prelude::v1::v1::Extend">Extend</a><<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a><a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&'a </a>K, <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&'a </a>V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a>> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Copy.html" title="trait nom::lib::std::prelude::v1::v1::Copy">Copy</a>,<br> V: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Copy.html" title="trait nom::lib::std::prelude::v1::v1::Copy">Copy</a>, </span></code><a href='#impl-Extend%3C(%26%27a%20K%2C%20%26%27a%20V)%3E' class='anchor'></a><span class='since' title='Stable since Rust version 1.2.0'>1.2.0</span><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1782-1786' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.extend-1' class="method hidden"><code id='extend.v-1'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.Extend.html#tymethod.extend' class='fnname'>extend</a><I>(&mut self, iter: I) <span class="where fmt-newline">where<br> I: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html" title="trait nom::lib::std::prelude::v1::v1::IntoIterator">IntoIterator</a><Item = <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a><a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&'a </a>K, <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&'a </a>V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a>>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1783-1785' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Extends a collection with the contents of an iterator. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.Extend.html#tymethod.extend">Read more</a></p>
|
||
</div></div><h3 id='impl-Extend%3C(K%2C%20V)%3E' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Extend.html" title="trait nom::lib::std::prelude::v1::v1::Extend">Extend</a><<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a>K, V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a>> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a>, </span></code><a href='#impl-Extend%3C(K%2C%20V)%3E' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1772-1779' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.extend' class="method hidden"><code id='extend.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.Extend.html#tymethod.extend' class='fnname'>extend</a><T>(&mut self, iter: T) <span class="where fmt-newline">where<br> T: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html" title="trait nom::lib::std::prelude::v1::v1::IntoIterator">IntoIterator</a><Item = <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a>K, V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a>>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1774-1778' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Extends a collection with the contents of an iterator. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.Extend.html#tymethod.extend">Read more</a></p>
|
||
</div></div><h3 id='impl-FromIterator%3C(K%2C%20V)%3E' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/iter/trait.FromIterator.html" title="trait nom::lib::std::iter::FromIterator">FromIterator</a><<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a>K, V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a>> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a>, </span></code><a href='#impl-FromIterator%3C(K%2C%20V)%3E' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1763-1769' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.from_iter' class="method hidden"><code id='from_iter.v'>fn <a href='../../../../nom/lib/std/iter/trait.FromIterator.html#tymethod.from_iter' class='fnname'>from_iter</a><T>(iter: T) -> <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> T: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html" title="trait nom::lib::std::prelude::v1::v1::IntoIterator">IntoIterator</a><Item = <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a>K, V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a>>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1764-1768' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Creates a value from an iterator. <a href="../../../../nom/lib/std/iter/trait.FromIterator.html#tymethod.from_iter">Read more</a></p>
|
||
</div></div><h3 id='impl-Hash' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/hash/trait.Hash.html" title="trait nom::lib::std::hash::Hash">Hash</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/hash/trait.Hash.html" title="trait nom::lib::std::hash::Hash">Hash</a>,<br> V: <a class="trait" href="../../../../nom/lib/std/hash/trait.Hash.html" title="trait nom::lib::std::hash::Hash">Hash</a>, </span></code><a href='#impl-Hash' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1789-1795' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.hash' class="method hidden"><code id='hash.v'>fn <a href='../../../../nom/lib/std/hash/trait.Hash.html#tymethod.hash' class='fnname'>hash</a><H>(&self, state: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&mut </a>H) <span class="where fmt-newline">where<br> H: <a class="trait" href="../../../../nom/lib/std/hash/trait.Hasher.html" title="trait nom::lib::std::hash::Hasher">Hasher</a>, </span></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1790-1794' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Feeds this value into the given [<code>Hasher</code>]. <a href="../../../../nom/lib/std/hash/trait.Hash.html#tymethod.hash">Read more</a></p>
|
||
</div><h4 id='method.hash_slice' class="method hidden"><code id='hash_slice.v'>fn <a href='../../../../nom/lib/std/hash/trait.Hash.html#method.hash_slice' class='fnname'>hash_slice</a><H>(data: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.slice.html">&[Self]</a>, state: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&mut </a>H) <span class="where fmt-newline">where<br> H: <a class="trait" href="../../../../nom/lib/std/hash/trait.Hasher.html" title="trait nom::lib::std::hash::Hasher">Hasher</a>, </span></code><span class='since' title='Stable since Rust version 1.3.0'>1.3.0</span><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/hash/mod.rs.html#194-201' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Feeds a slice of this type into the given [<code>Hasher</code>]. <a href="../../../../nom/lib/std/hash/trait.Hash.html#method.hash_slice">Read more</a></p>
|
||
</div></div><h3 id='impl-Index%3C%26%27_%20Q%3E' class='impl'><code class='in-band'>impl<'_, K, Q, V> <a class="trait" href="../../../../nom/lib/std/ops/trait.Index.html" title="trait nom::lib::std::ops::Index">Index</a><<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&'_ </a>Q> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><Q>,<br> Q: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a href='#impl-Index%3C%26%27_%20Q%3E' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1839-1855' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='associatedtype.Output' class="type"><code id='Output.t'>type <a href='../../../../nom/lib/std/ops/trait.Index.html#associatedtype.Output' class="type">Output</a> = V</code></h4><div class='docblock'><p>The returned type after indexing.</p>
|
||
</div><h4 id='method.index' class="method"><code id='index.v'>fn <a href='../../../../nom/lib/std/ops/trait.Index.html#tymethod.index' class='fnname'>index</a>(&self, key: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Q) -> <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>V</code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1852-1854' title='goto source code'>[src]</a></h4><div class='docblock'><p>Returns a reference to the value corresponding to the supplied key.</p>
|
||
<h1 id="panics-2" class="section-header"><a href="#panics-2">Panics</a></h1>
|
||
<p>Panics if the key is not present in the <code>BTreeMap</code>.</p>
|
||
</div></div><h3 id='impl-IntoIterator' class='impl'><code class='in-band'>impl<'a, K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html" title="trait nom::lib::std::prelude::v1::v1::IntoIterator">IntoIterator</a> for &'a <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: 'a,<br> V: 'a, </span></code><a href='#impl-IntoIterator' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1339-1346' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='associatedtype.Item' class="type"><code id='Item.t'>type <a href='../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#associatedtype.Item' class="type">Item</a> = <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a><a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&'a </a>K, <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&'a </a>V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a></code></h4><div class='docblock'><p>The type of the elements being iterated over.</p>
|
||
</div><h4 id='associatedtype.IntoIter' class="type"><code id='IntoIter.t'>type <a href='../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#associatedtype.IntoIter' class="type">IntoIter</a> = <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.Iter.html" title="struct nom::lib::std::collections::btree_map::Iter">Iter</a><'a, K, V></code></h4><div class='docblock'><p>Which kind of iterator are we turning this into?</p>
|
||
</div><h4 id='method.into_iter' class="method hidden"><code id='into_iter.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#tymethod.into_iter' class='fnname'>into_iter</a>(self) -> <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.Iter.html" title="struct nom::lib::std::collections::btree_map::Iter">Iter</a><'a, K, V></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1343-1345' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Creates an iterator from a value. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#tymethod.into_iter">Read more</a></p>
|
||
</div></div><h3 id='impl-IntoIterator-1' class='impl'><code class='in-band'>impl<'a, K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html" title="trait nom::lib::std::prelude::v1::v1::IntoIterator">IntoIterator</a> for &'a mut <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: 'a,<br> V: 'a, </span></code><a href='#impl-IntoIterator-1' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1400-1407' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='associatedtype.Item-1' class="type"><code id='Item.t-1'>type <a href='../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#associatedtype.Item' class="type">Item</a> = <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a><a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&'a </a>K, <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&'a mut </a>V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a></code></h4><div class='docblock'><p>The type of the elements being iterated over.</p>
|
||
</div><h4 id='associatedtype.IntoIter-1' class="type"><code id='IntoIter.t-1'>type <a href='../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#associatedtype.IntoIter' class="type">IntoIter</a> = <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.IterMut.html" title="struct nom::lib::std::collections::btree_map::IterMut">IterMut</a><'a, K, V></code></h4><div class='docblock'><p>Which kind of iterator are we turning this into?</p>
|
||
</div><h4 id='method.into_iter-1' class="method hidden"><code id='into_iter.v-1'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#tymethod.into_iter' class='fnname'>into_iter</a>(self) -> <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.IterMut.html" title="struct nom::lib::std::collections::btree_map::IterMut">IterMut</a><'a, K, V></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1404-1406' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Creates an iterator from a value. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#tymethod.into_iter">Read more</a></p>
|
||
</div></div><h3 id='impl-IntoIterator-2' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html" title="trait nom::lib::std::prelude::v1::v1::IntoIterator">IntoIterator</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V></code><a href='#impl-IntoIterator-2' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1456-1468' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='associatedtype.Item-2' class="type"><code id='Item.t-2'>type <a href='../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#associatedtype.Item' class="type">Item</a> = <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">(</a>K, V<a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.tuple.html">)</a></code></h4><div class='docblock'><p>The type of the elements being iterated over.</p>
|
||
</div><h4 id='associatedtype.IntoIter-2' class="type"><code id='IntoIter.t-2'>type <a href='../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#associatedtype.IntoIter' class="type">IntoIter</a> = <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.IntoIter.html" title="struct nom::lib::std::collections::btree_map::IntoIter">IntoIter</a><K, V></code></h4><div class='docblock'><p>Which kind of iterator are we turning this into?</p>
|
||
</div><h4 id='method.into_iter-2' class="method hidden"><code id='into_iter.v-2'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#tymethod.into_iter' class='fnname'>into_iter</a>(self) -> <a class="struct" href="../../../../nom/lib/std/collections/btree_map/struct.IntoIter.html" title="struct nom::lib::std::collections::btree_map::IntoIter">IntoIter</a><K, V></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1460-1467' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Creates an iterator from a value. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#tymethod.into_iter">Read more</a></p>
|
||
</div></div><h3 id='impl-Ord' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a>,<br> V: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html" title="trait nom::lib::std::prelude::v1::v1::Ord">Ord</a>, </span></code><a href='#impl-Ord' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1824-1829' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.cmp' class="method hidden"><code id='cmp.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html#tymethod.cmp' class='fnname'>cmp</a>(&self, other: &<a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V>) -> <a class="enum" href="../../../../nom/lib/std/cmp/enum.Ordering.html" title="enum nom::lib::std::cmp::Ordering">Ordering</a></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1826-1828' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>This method returns an [<code>Ordering</code>] between <code>self</code> and <code>other</code>. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html#tymethod.cmp">Read more</a></p>
|
||
</div><h4 id='method.max' class="method hidden"><code id='max.v'><span class="docblock attributes">#[must_use]
|
||
</span>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html#method.max' class='fnname'>max</a>(self, other: Self) -> Self</code><span class='since' title='Stable since Rust version 1.21.0'>1.21.0</span><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/cmp.rs.html#599-604' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Compares and returns the maximum of two values. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html#method.max">Read more</a></p>
|
||
</div><h4 id='method.min' class="method hidden"><code id='min.v'><span class="docblock attributes">#[must_use]
|
||
</span>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html#method.min' class='fnname'>min</a>(self, other: Self) -> Self</code><span class='since' title='Stable since Rust version 1.21.0'>1.21.0</span><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/cmp.rs.html#619-624' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Compares and returns the minimum of two values. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html#method.min">Read more</a></p>
|
||
</div><h4 id='method.clamp' class="method hidden"><code id='clamp.v'><span class="docblock attributes">#[must_use]
|
||
</span>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html#method.clamp' class='fnname'>clamp</a>(self, min: Self, max: Self) -> Self</code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/cmp.rs.html#646-658' title='goto source code'>[src]</a></h4><div class='stability hidden'><div class='stab unstable'><span class='emoji'>🔬</span> This is a nightly-only experimental API. (<code>clamp</code>)</div></div><div class='docblock hidden'><p>Restrict a value to a certain interval. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.Ord.html#method.clamp">Read more</a></p>
|
||
</div></div><h3 id='impl-PartialEq%3CBTreeMap%3CK%2C%20V%3E%3E' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.PartialEq.html" title="trait nom::lib::std::prelude::v1::v1::PartialEq">PartialEq</a><<a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V>> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.PartialEq.html" title="trait nom::lib::std::prelude::v1::v1::PartialEq">PartialEq</a><K>,<br> V: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.PartialEq.html" title="trait nom::lib::std::prelude::v1::v1::PartialEq">PartialEq</a><V>, </span></code><a href='#impl-PartialEq%3CBTreeMap%3CK%2C%20V%3E%3E' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1806-1810' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.eq' class="method hidden"><code id='eq.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.PartialEq.html#tymethod.eq' class='fnname'>eq</a>(&self, other: &<a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V>) -> <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.bool.html">bool</a></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1807-1809' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>This method tests for <code>self</code> and <code>other</code> values to be equal, and is used by <code>==</code>. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.PartialEq.html#tymethod.eq">Read more</a></p>
|
||
</div><h4 id='method.ne' class="method hidden"><code id='ne.v'><span class="docblock attributes">#[must_use]
|
||
</span>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.PartialEq.html#method.ne' class='fnname'>ne</a>(&self, other: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Rhs) -> <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.bool.html">bool</a></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/cmp.rs.html#215-217' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>This method tests for <code>!=</code>.</p>
|
||
</div></div><h3 id='impl-PartialOrd%3CBTreeMap%3CK%2C%20V%3E%3E' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html" title="trait nom::lib::std::prelude::v1::v1::PartialOrd">PartialOrd</a><<a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V>> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html" title="trait nom::lib::std::prelude::v1::v1::PartialOrd">PartialOrd</a><K>,<br> V: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html" title="trait nom::lib::std::prelude::v1::v1::PartialOrd">PartialOrd</a><V>, </span></code><a href='#impl-PartialOrd%3CBTreeMap%3CK%2C%20V%3E%3E' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1816-1821' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.partial_cmp' class="method hidden"><code id='partial_cmp.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html#tymethod.partial_cmp' class='fnname'>partial_cmp</a>(&self, other: &<a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V>) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Option.html" title="enum nom::lib::std::prelude::v1::v1::Option">Option</a><<a class="enum" href="../../../../nom/lib/std/cmp/enum.Ordering.html" title="enum nom::lib::std::cmp::Ordering">Ordering</a>></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/collections/btree/map.rs.html#1818-1820' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>This method returns an ordering between <code>self</code> and <code>other</code> values if one exists. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html#tymethod.partial_cmp">Read more</a></p>
|
||
</div><h4 id='method.lt' class="method hidden"><code id='lt.v'><span class="docblock attributes">#[must_use]
|
||
</span>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html#method.lt' class='fnname'>lt</a>(&self, other: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Rhs) -> <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.bool.html">bool</a></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/cmp.rs.html#841-843' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>This method tests less than (for <code>self</code> and <code>other</code>) and is used by the <code><</code> operator. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html#method.lt">Read more</a></p>
|
||
</div><h4 id='method.le' class="method hidden"><code id='le.v'><span class="docblock attributes">#[must_use]
|
||
</span>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html#method.le' class='fnname'>le</a>(&self, other: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Rhs) -> <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.bool.html">bool</a></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/cmp.rs.html#860-862' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>This method tests less than or equal to (for <code>self</code> and <code>other</code>) and is used by the <code><=</code> operator. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html#method.le">Read more</a></p>
|
||
</div><h4 id='method.gt' class="method hidden"><code id='gt.v'><span class="docblock attributes">#[must_use]
|
||
</span>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html#method.gt' class='fnname'>gt</a>(&self, other: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Rhs) -> <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.bool.html">bool</a></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/cmp.rs.html#878-880' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>This method tests greater than (for <code>self</code> and <code>other</code>) and is used by the <code>></code> operator. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html#method.gt">Read more</a></p>
|
||
</div><h4 id='method.ge' class="method hidden"><code id='ge.v'><span class="docblock attributes">#[must_use]
|
||
</span>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html#method.ge' class='fnname'>ge</a>(&self, other: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>Rhs) -> <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.bool.html">bool</a></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/cmp.rs.html#897-899' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>This method tests greater than or equal to (for <code>self</code> and <code>other</code>) and is used by the <code>>=</code> operator. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.PartialOrd.html#method.ge">Read more</a></p>
|
||
</div></div></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'><h3 id='impl-RefUnwindSafe' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="https://doc.rust-lang.org/nightly/std/panic/trait.RefUnwindSafe.html" title="trait std::panic::RefUnwindSafe">RefUnwindSafe</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/std/panic/trait.RefUnwindSafe.html" title="trait std::panic::RefUnwindSafe">RefUnwindSafe</a>,<br> V: <a class="trait" href="https://doc.rust-lang.org/nightly/std/panic/trait.RefUnwindSafe.html" title="trait std::panic::RefUnwindSafe">RefUnwindSafe</a>, </span></code><a href='#impl-RefUnwindSafe' class='anchor'></a></h3><div class='impl-items'></div><h3 id='impl-Send' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Send.html" title="trait nom::lib::std::prelude::v1::v1::Send">Send</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Send.html" title="trait nom::lib::std::prelude::v1::v1::Send">Send</a>,<br> V: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Send.html" title="trait nom::lib::std::prelude::v1::v1::Send">Send</a>, </span></code><a href='#impl-Send' class='anchor'></a></h3><div class='impl-items'></div><h3 id='impl-Sync' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sync.html" title="trait nom::lib::std::prelude::v1::v1::Sync">Sync</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sync.html" title="trait nom::lib::std::prelude::v1::v1::Sync">Sync</a>,<br> V: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sync.html" title="trait nom::lib::std::prelude::v1::v1::Sync">Sync</a>, </span></code><a href='#impl-Sync' class='anchor'></a></h3><div class='impl-items'></div><h3 id='impl-Unpin' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Unpin.html" title="trait nom::lib::std::prelude::v1::v1::Unpin">Unpin</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Unpin.html" title="trait nom::lib::std::prelude::v1::v1::Unpin">Unpin</a>,<br> V: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Unpin.html" title="trait nom::lib::std::prelude::v1::v1::Unpin">Unpin</a>, </span></code><a href='#impl-Unpin' class='anchor'></a></h3><div class='impl-items'></div><h3 id='impl-UnwindSafe' class='impl'><code class='in-band'>impl<K, V> <a class="trait" href="https://doc.rust-lang.org/nightly/std/panic/trait.UnwindSafe.html" title="trait std::panic::UnwindSafe">UnwindSafe</a> for <a class="struct" href="../../../../nom/lib/std/collections/struct.BTreeMap.html" title="struct nom::lib::std::collections::BTreeMap">BTreeMap</a><K, V> <span class="where fmt-newline">where<br> K: <a class="trait" href="https://doc.rust-lang.org/nightly/std/panic/trait.RefUnwindSafe.html" title="trait std::panic::RefUnwindSafe">RefUnwindSafe</a> + <a class="trait" href="https://doc.rust-lang.org/nightly/std/panic/trait.UnwindSafe.html" title="trait std::panic::UnwindSafe">UnwindSafe</a>,<br> V: <a class="trait" href="https://doc.rust-lang.org/nightly/std/panic/trait.RefUnwindSafe.html" title="trait std::panic::RefUnwindSafe">RefUnwindSafe</a> + <a class="trait" href="https://doc.rust-lang.org/nightly/std/panic/trait.UnwindSafe.html" title="trait std::panic::UnwindSafe">UnwindSafe</a>, </span></code><a href='#impl-UnwindSafe' class='anchor'></a></h3><div class='impl-items'></div></div><h2 id='blanket-implementations' class='small-section-header'>Blanket Implementations<a href='#blanket-implementations' class='anchor'></a></h2><div id='blanket-implementations-list'><h3 id='impl-Any' class='impl'><code class='in-band'>impl<T> <a class="trait" href="https://doc.rust-lang.org/nightly/core/any/trait.Any.html" title="trait core::any::Any">Any</a> for T <span class="where fmt-newline">where<br> T: 'static + ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a href='#impl-Any' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/any.rs.html#108-112' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.type_id' class="method hidden"><code id='type_id.v'>fn <a href='https://doc.rust-lang.org/nightly/core/any/trait.Any.html#tymethod.type_id' class='fnname'>type_id</a>(&self) -> <a class="struct" href="https://doc.rust-lang.org/nightly/core/any/struct.TypeId.html" title="struct core::any::TypeId">TypeId</a></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/any.rs.html#109-111' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Gets the <code>TypeId</code> of <code>self</code>. <a href="https://doc.rust-lang.org/nightly/core/any/trait.Any.html#tymethod.type_id">Read more</a></p>
|
||
</div></div><h3 id='impl-Borrow%3CT%3E' class='impl'><code class='in-band'>impl<T> <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html" title="trait core::borrow::Borrow">Borrow</a><T> for T <span class="where fmt-newline">where<br> T: ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a href='#impl-Borrow%3CT%3E' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/borrow.rs.html#213-217' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.borrow' class="method hidden"><code id='borrow.v'>fn <a href='https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html#tymethod.borrow' class='fnname'>borrow</a>(&self) -> <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&</a>T</code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/borrow.rs.html#214-216' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Immutably borrows from an owned value. <a href="https://doc.rust-lang.org/nightly/core/borrow/trait.Borrow.html#tymethod.borrow">Read more</a></p>
|
||
</div></div><h3 id='impl-BorrowMut%3CT%3E' class='impl'><code class='in-band'>impl<T> <a class="trait" href="https://doc.rust-lang.org/nightly/core/borrow/trait.BorrowMut.html" title="trait core::borrow::BorrowMut">BorrowMut</a><T> for T <span class="where fmt-newline">where<br> T: ?<a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Sized.html" title="trait nom::lib::std::prelude::v1::v1::Sized">Sized</a>, </span></code><a href='#impl-BorrowMut%3CT%3E' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/borrow.rs.html#220-224' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.borrow_mut' class="method hidden"><code id='borrow_mut.v'>fn <a href='https://doc.rust-lang.org/nightly/core/borrow/trait.BorrowMut.html#tymethod.borrow_mut' class='fnname'>borrow_mut</a>(&mut self) -> <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&mut </a>T</code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/borrow.rs.html#221-223' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Mutably borrows from an owned value. <a href="https://doc.rust-lang.org/nightly/core/borrow/trait.BorrowMut.html#tymethod.borrow_mut">Read more</a></p>
|
||
</div></div><h3 id='impl-From%3CT%3E' class='impl'><code class='in-band'>impl<T> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.From.html" title="trait nom::lib::std::prelude::v1::v1::From">From</a><T> for T</code><a href='#impl-From%3CT%3E' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/convert/mod.rs.html#564-568' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.from' class="method hidden"><code id='from.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.From.html#tymethod.from' class='fnname'>from</a>(t: T) -> T</code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/convert/mod.rs.html#565-567' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Performs the conversion.</p>
|
||
</div></div><h3 id='impl-Into%3CU%3E' class='impl'><code class='in-band'>impl<T, U> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Into.html" title="trait nom::lib::std::prelude::v1::v1::Into">Into</a><U> for T <span class="where fmt-newline">where<br> U: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.From.html" title="trait nom::lib::std::prelude::v1::v1::From">From</a><T>, </span></code><a href='#impl-Into%3CU%3E' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/convert/mod.rs.html#553-560' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='method.into' class="method hidden"><code id='into.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.Into.html#tymethod.into' class='fnname'>into</a>(self) -> U</code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/convert/mod.rs.html#557-559' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Performs the conversion.</p>
|
||
</div></div><h3 id='impl-IntoIterator-3' class='impl'><code class='in-band'>impl<I> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html" title="trait nom::lib::std::prelude::v1::v1::IntoIterator">IntoIterator</a> for I <span class="where fmt-newline">where<br> I: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Iterator.html" title="trait nom::lib::std::prelude::v1::v1::Iterator">Iterator</a>, </span></code><a href='#impl-IntoIterator-3' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/iter/traits/collect.rs.html#243-250' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='associatedtype.Item-3' class="type"><code id='Item.t-3'>type <a href='../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#associatedtype.Item' class="type">Item</a> = <I as <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Iterator.html" title="trait nom::lib::std::prelude::v1::v1::Iterator">Iterator</a>>::<a class="type" href="../../../../nom/lib/std/prelude/v1/v1/trait.Iterator.html#associatedtype.Item" title="type nom::lib::std::prelude::v1::v1::Iterator::Item">Item</a></code></h4><div class='docblock'><p>The type of the elements being iterated over.</p>
|
||
</div><h4 id='associatedtype.IntoIter-3' class="type"><code id='IntoIter.t-3'>type <a href='../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#associatedtype.IntoIter' class="type">IntoIter</a> = I</code></h4><div class='docblock'><p>Which kind of iterator are we turning this into?</p>
|
||
</div><h4 id='method.into_iter-3' class="method hidden"><code id='into_iter.v-3'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#tymethod.into_iter' class='fnname'>into_iter</a>(self) -> I</code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/iter/traits/collect.rs.html#247-249' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Creates an iterator from a value. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.IntoIterator.html#tymethod.into_iter">Read more</a></p>
|
||
</div></div><h3 id='impl-ToOwned' class='impl'><code class='in-band'>impl<T> <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.ToOwned.html" title="trait nom::lib::std::prelude::v1::v1::ToOwned">ToOwned</a> for T <span class="where fmt-newline">where<br> T: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Clone.html" title="trait nom::lib::std::prelude::v1::v1::Clone">Clone</a>, </span></code><a href='#impl-ToOwned' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/borrow.rs.html#80-92' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='associatedtype.Owned' class="type"><code id='Owned.t'>type <a href='../../../../nom/lib/std/prelude/v1/v1/trait.ToOwned.html#associatedtype.Owned' class="type">Owned</a> = T</code></h4><div class='docblock'><p>The resulting type after obtaining ownership.</p>
|
||
</div><h4 id='method.to_owned' class="method hidden"><code id='to_owned.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.ToOwned.html#tymethod.to_owned' class='fnname'>to_owned</a>(&self) -> T</code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/borrow.rs.html#85-87' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Creates owned data from borrowed data, usually by cloning. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.ToOwned.html#tymethod.to_owned">Read more</a></p>
|
||
</div><h4 id='method.clone_into' class="method hidden"><code id='clone_into.v'>fn <a href='../../../../nom/lib/std/prelude/v1/v1/trait.ToOwned.html#method.clone_into' class='fnname'>clone_into</a>(&self, target: <a class="primitive" href="https://doc.rust-lang.org/nightly/std/primitive.reference.html">&mut </a>T)</code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/alloc/borrow.rs.html#89-91' title='goto source code'>[src]</a></h4><div class='stability hidden'><div class='stab unstable'><details><summary><span class='emoji'>🔬</span> This is a nightly-only experimental API. (<code>toowned_clone_into</code>)</summary><p>recently added</p>
|
||
</details></div></div><div class='docblock hidden'><p>Uses borrowed data to replace owned data, usually by cloning. <a href="../../../../nom/lib/std/prelude/v1/v1/trait.ToOwned.html#method.clone_into">Read more</a></p>
|
||
</div></div><h3 id='impl-TryFrom%3CU%3E' class='impl'><code class='in-band'>impl<T, U> <a class="trait" href="../../../../nom/lib/std/convert/trait.TryFrom.html" title="trait nom::lib::std::convert::TryFrom">TryFrom</a><U> for T <span class="where fmt-newline">where<br> U: <a class="trait" href="../../../../nom/lib/std/prelude/v1/v1/trait.Into.html" title="trait nom::lib::std::prelude::v1::v1::Into">Into</a><T>, </span></code><a href='#impl-TryFrom%3CU%3E' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/convert/mod.rs.html#601-610' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='associatedtype.Error' class="type"><code id='Error.t'>type <a href='../../../../nom/lib/std/convert/trait.TryFrom.html#associatedtype.Error' class="type">Error</a> = <a class="enum" href="../../../../nom/lib/std/convert/enum.Infallible.html" title="enum nom::lib::std::convert::Infallible">Infallible</a></code></h4><div class='docblock'><p>The type returned in the event of a conversion error.</p>
|
||
</div><h4 id='method.try_from' class="method hidden"><code id='try_from.v'>fn <a href='../../../../nom/lib/std/convert/trait.TryFrom.html#tymethod.try_from' class='fnname'>try_from</a>(value: U) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Result.html" title="enum nom::lib::std::prelude::v1::v1::Result">Result</a><T, <T as <a class="trait" href="../../../../nom/lib/std/convert/trait.TryFrom.html" title="trait nom::lib::std::convert::TryFrom">TryFrom</a><U>>::<a class="type" href="../../../../nom/lib/std/convert/trait.TryFrom.html#associatedtype.Error" title="type nom::lib::std::convert::TryFrom::Error">Error</a>></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/convert/mod.rs.html#607-609' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Performs the conversion.</p>
|
||
</div></div><h3 id='impl-TryInto%3CU%3E' class='impl'><code class='in-band'>impl<T, U> <a class="trait" href="../../../../nom/lib/std/convert/trait.TryInto.html" title="trait nom::lib::std::convert::TryInto">TryInto</a><U> for T <span class="where fmt-newline">where<br> U: <a class="trait" href="../../../../nom/lib/std/convert/trait.TryFrom.html" title="trait nom::lib::std::convert::TryFrom">TryFrom</a><T>, </span></code><a href='#impl-TryInto%3CU%3E' class='anchor'></a><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/convert/mod.rs.html#587-596' title='goto source code'>[src]</a></h3><div class='impl-items'><h4 id='associatedtype.Error-1' class="type"><code id='Error.t-1'>type <a href='../../../../nom/lib/std/convert/trait.TryInto.html#associatedtype.Error' class="type">Error</a> = <U as <a class="trait" href="../../../../nom/lib/std/convert/trait.TryFrom.html" title="trait nom::lib::std::convert::TryFrom">TryFrom</a><T>>::<a class="type" href="../../../../nom/lib/std/convert/trait.TryFrom.html#associatedtype.Error" title="type nom::lib::std::convert::TryFrom::Error">Error</a></code></h4><div class='docblock'><p>The type returned in the event of a conversion error.</p>
|
||
</div><h4 id='method.try_into' class="method hidden"><code id='try_into.v'>fn <a href='../../../../nom/lib/std/convert/trait.TryInto.html#tymethod.try_into' class='fnname'>try_into</a>(self) -> <a class="enum" href="../../../../nom/lib/std/prelude/v1/v1/enum.Result.html" title="enum nom::lib::std::prelude::v1::v1::Result">Result</a><U, <U as <a class="trait" href="../../../../nom/lib/std/convert/trait.TryFrom.html" title="trait nom::lib::std::convert::TryFrom">TryFrom</a><T>>::<a class="type" href="../../../../nom/lib/std/convert/trait.TryFrom.html#associatedtype.Error" title="type nom::lib::std::convert::TryFrom::Error">Error</a>></code><a class='srclink' href='https://doc.rust-lang.org/nightly/src/core/convert/mod.rs.html#593-595' title='goto source code'>[src]</a></h4><div class='docblock hidden'><p>Performs the conversion.</p>
|
||
</div></div></div></section><section id="search" class="content hidden"></section><section class="footer"></section><script>window.rootPath = "../../../../";window.currentCrate = "nom";</script><script src="../../../../aliases.js"></script><script src="../../../../main.js"></script><script defer src="../../../../search-index.js"></script></body></html> |