var searchIndex = {};
searchIndex["fixedvec"] = {"doc":"Heapless Vec implementation using only libcore","items":[[3,"Iter","fixedvec","Immutable slice iterator",null,null],[3,"IterMut","","Mutable slice iterator.",null,null],[3,"FixedVec","","",null,null],[4,"ErrorKind","","",null,null],[13,"NoSpace","","",0,null],[6,"Result","","",null,null],[11,"fmt","","",0,null],[11,"fmt","","",1,null],[11,"new","","Create a new `FixedVec` from the provided slice, in the process taking\nownership of the slice.",1,null],[11,"capacity","","Returns the capacity of the vector.",1,null],[11,"len","","Returns the number of elements in the vector. This will always be\nless than or equal to the `capacity()`.",1,null],[11,"available","","Returns the number of available elements in the vector. Adding more\nthan this number of elements (without removing some elements) will\ncause further calls to element-adding functions to fail.",1,null],[11,"is_empty","","Returns `true` if the vector contains no elements.",1,null],[11,"as_slice","","Extracts a slice containing the entire vector.",1,null],[11,"as_mut_slice","","Extracts a mutable slice of the entire vector.",1,null],[11,"insert","","Inserts an element at position `index` within the vector, shifting all\nelements after position `i` one position to the right.",1,null],[11,"remove","","Removes and returns the element at position `index` within the vector,\nshifting all elements after position `index` one position to the left.",1,null],[11,"push","","Appends an element to the back of the vector.",1,null],[11,"pop","","Removes the last element from the vector and returns it, or `None` if\nthe vector is empty",1,null],[11,"push_all","","Copies all elements from slice `other` to this vector.",1,null],[11,"clear","","Clears the vector, removing all values.",1,null],[11,"map_in_place","","Applies the function `f` to all elements in the vector, mutating the\nvector in place.",1,null],[11,"iter","","Provides a forward iterator.",1,null],[11,"iter_mut","","Provides a mutable forward iterator.",1,null],[11,"swap_remove","","Removes an element from anywhere in the vector and returns it,\nreplacing it with the last element.",1,null],[11,"resize","","Resizes the vector in-place so that `len()` is equal to `new_len`.",1,null],[11,"retain","","Retains only the elements specified by the predicate.",1,null],[11,"get","","Returns a reference to the element at the given index, or `None` if the\nindex is out of bounds.",1,null],[11,"get_mut","","Returns a mutable reference to the element at the given index, or\n`None` if the index is out of bounds.",1,null],[11,"get_unchecked","","Returns a reference to the element at the given index, without doing\nbounds checking. Note that the result of an invalid index is undefined,\nand may not panic.",1,null],[11,"get_unchecked_mut","","Returns a mutable reference to the element at the given index, without\ndoing bounds checking. Note that the result of an invalid index is\nundefined, and may not panic.",1,null],[11,"dedup","","Removes consecutive repeated elements in the vector in O(N) time.",1,null],[11,"hash","","",1,null],[11,"extend","","",1,null],[11,"index","","",1,null],[11,"index_mut","","",1,null],[11,"eq","","",1,null],[14,"alloc_stack!","","Convenience macro for use with `FixedVec`. Allocates the specified number\nof elements of specified type on the stack.",null,null],[11,"as_slice","","View the underlying data as a subslice of the original data.",2,null],[11,"fmt","","",2,null],[11,"next","","",2,null],[11,"size_hint","","",2,null],[11,"count","","",2,null],[11,"nth","","",2,null],[11,"last","","",2,null],[11,"next_back","","",2,null],[11,"clone","","",2,null],[11,"fmt","","",3,null],[11,"into_slice","","View the underlying data as a subslice of the original data.",3,null],[11,"next","","",3,null],[11,"size_hint","","",3,null],[11,"count","","",3,null],[11,"nth","","",3,null],[11,"last","","",3,null],[11,"next_back","","",3,null]],"paths":[[4,"ErrorKind"],[3,"FixedVec"],[3,"Iter"],[3,"IterMut"]]};
initSearch(searchIndex);