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

searchState.loadedDescShard("heapless", 0, "<code>static</code> friendly data structures that don’t require …\nA fixed capacity double-ended queue.\nA view into an entry in the map\nA <code>heapless::IndexMap</code> using the default FNV hasher\nA <code>heapless::IndexSet</code> using the default FNV hasher. A list …\nA “history buffer”, similar to a write-only ring …\nFixed capacity <code>IndexMap</code>\nFixed capacity <code>IndexSet</code>.\nA fixed capacity map / dictionary that performs lookups …\nThe entry corresponding to the key <code>K</code> exists in the map\nAn occupied entry which can be manipulated\nAn iterator on the underlying buffer ordered from oldest …\nA fixed capacity <code>String</code>\nThe entry corresponding to the key <code>K</code> does not exist in the …\nA view into an empty slot in the underlying map\nA fixed capacity <code>Vec</code>\nReturns a raw pointer to the vector’s buffer, which may …\nReturns a pair of mutable slices which contain, in order, …\nConverts a <code>String</code> into a mutable string slice.\nReturns a mutable reference to the contents of this <code>String</code>.\nReturns a raw pointer to the vector’s buffer.\nReturns the array slice backing the buffer, without …\nExtracts a slice containing the entire vector.\nReturns a pair of slices which contain, in order, the …\nExtracts a string slice containing the entire string.\nProvides a reference to the back element, or None if the …\nProvides a mutable reference to the back element, or None …\nA priority queue implemented with a binary heap.\nReturns the maximum number of elements the deque can hold.\nReturns the capacity of the buffer, which is the length of …\nReturns the number of elements the map can hold\nReturns the number of elements the set can hold\nReturns the number of elements that the map can hold\nReturns the maximum number of elements the String can hold\nReturns the maximum number of elements the vector can hold.\nClears the deque, removing all values.\nClears the buffer, replacing every element with the …\nRemove all key-value pairs in the map, while preserving …\nClears the set, removing all values.\nClears the map, removing all key-value pairs\nTruncates this <code>String</code>, removing all contents.\nClears the vector, removing all values.\nClears the buffer, replacing every element with the given …\nReturns <code>true</code> if the set contains a value.\nReturns true if the map contains a value for the specified …\nReturns true if the map contains a value for the specified …\nVisits the values representing the difference, i.e. the …\nReturns <code>true</code> if <code>needle</code> is a suffix of the Vec.\nReturns an entry for the corresponding key\nExtends the vec from an iterator.\nClones and writes all elements in a slice to the buffer.\nClones and appends all elements in a slice to the <code>Vec</code>.\nGet the first key-value pair\nGet the first value\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.\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.\nConstructs a new vector with a fixed capacity of <code>N</code> and …\nProvides a reference to the front element, or None if the …\nProvides a mutable reference to the front element, or None …\nGets a reference to the value associated with this entry\nReturns a reference to the value corresponding to the key.\nReturns a reference to the value corresponding to the key\nGets a mutable reference to the value associated with this …\nReturns a mutable reference to the value corresponding to …\nReturns a mutable reference to the value corresponding to …\nOverwrites the underlying map’s value with this entry’…\nInserts this entry into to underlying map, yields a …\nInse