rtic/1/api/search.desc/indexmap/indexmap-desc-0-.js

searchState.loadedDescShard("indexmap", 0, "<code>IndexMap</code> is a hash table where the iteration order of the …\nKey equivalence trait.\nCompare self to <code>key</code> and return <code>true</code> if they are equal.\nCreate an <code>IndexMap</code> from a list of key-value pairs\nCreate an <code>IndexSet</code> from a list of values\n<code>IndexMap</code> is a hash table where the iteration order of the …\nA hash set implemented using <code>IndexMap</code>\nA draining iterator over the entries of a <code>IndexMap</code>.\nEntry for an existing key-value pair or a vacant location …\nA hash table where the iteration order of the key-value …\nAn owning iterator over the entries of a <code>IndexMap</code>.\nAn owning iterator over the keys of a <code>IndexMap</code>.\nAn owning iterator over the values of a <code>IndexMap</code>.\nAn iterator over the entries of a <code>IndexMap</code>.\nA mutable iterator over the entries of a <code>IndexMap</code>.\nAn iterator over the keys of a <code>IndexMap</code>.\nOpt-in mutable access to keys.\nExisting slot with equivalent key.\nA view into an occupied entry in a <code>IndexMap</code>. It is part of …\nVacant slot (no equivalent key in the map).\nA view into a vacant entry in a <code>IndexMap</code>. It is part of …\nAn iterator over the values of a <code>IndexMap</code>.\nA mutable iterator over the values of a <code>IndexMap</code>.\nThis method is not useful in itself – it is there to …\nModifies the entry if it is occupied.\nComputes in <strong>O(1)</strong> time.\nRemove all key-value pairs in the map, while preserving …\nReturn <code>true</code> if an equivalent to <code>key</code> exists in the map.\nReturn an empty <code>IndexMap</code>\nClears the <code>IndexMap</code> in the given index range, returning …\nGet the given key’s corresponding entry in the map for …\nExtend the map with all key-value pairs in the iterable.\nExtend the map with all key-value pairs in the iterable.\nGet the first key-value pair\nGet the first key-value pair, with mutable access to the …\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nExamples\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nCreate an <code>IndexMap</code> from the sequence of key-value pairs in …\nGets a reference to the entry’s value in the map.\nReturn a reference to the value stored for <code>key</code>, if it is …\nReturn item index, key and value\nReturn item index, mutable reference to key and value\nGet a key-value pair by index\nGet a key-value pair by index\nReturn item index, if it exists in the map\nReturn references to the key-value pair stored for <code>key</code>, if …\nGets a mutable reference to the entry’s value in the map.\nReturn a reference to the map’s <code>BuildHasher</code>.\nReturn the index of the key-value pair\nReturn the index where the key-value pair exists or will …\nReturn the index where the key-value pair will be inserted.\nReturns a reference to the value corresponding to the …\nReturns a reference to the value at the supplied <code>index</code>.\nReturns a mutable reference to the value corresponding to …\nReturns a mutable reference to the value at the supplied …\nSets the value of the entry to <code>value</code>, and returns the entry…\nInserts the entry’s key and the given value into the …\nInsert a key-value pair in the map.\nInsert a key-value pair in the map, and get their index.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <cod