var searchIndex = {};
searchIndex["primal_bit"] = {"doc":"A very simple bit-vector that serves the needs of `primal`.","items":[[3,"BitVec","primal_bit","The bitvector type.",null,null],[3,"Iter","","An iterator for `BitVec`.",null,null],[11,"index","","",0,null],[11,"new","","Creates an empty `BitVec`.",0,{"inputs":[],"output":{"name":"bitvec"}}],[11,"from_u64s","","",0,{"inputs":[{"name":"vec"},{"name":"usize"}],"output":{"name":"bitvec"}}],[11,"as_bytes_mut","","",0,null],[11,"as_bytes","","",0,null],[11,"as_u64s","","",0,null],[11,"count_ones_before","","Count the number of ones for the bits up to but not including\nthe `bit`th bit.",0,null],[11,"find_nth_bit","","Find the index of the `n`th (0-indexed) set bit.",0,null],[11,"from_elem","","Creates a `BitVec` that holds `nbits` elements, setting each element\nto `bit`.",0,{"inputs":[{"name":"usize"},{"name":"bool"}],"output":{"name":"bitvec"}}],[11,"get","","Retrieves the value at index `i`, or `None` if the index is out of bounds.",0,null],[11,"set","","Sets the value of a bit at an index `i`.",0,null],[11,"set_unchecked","","",0,null],[11,"set_all","","Sets all bits to 1.",0,null],[11,"iter","","Returns an iterator over the elements of the vector in order.",0,null],[11,"len","","Returns the total number of bits in this vector",0,null],[11,"is_empty","","Returns true if there are no bits in this vector",0,null],[11,"clear","","Clears all bits in this vector.",0,null],[11,"default","","",0,{"inputs":[],"output":{"name":"bitvec"}}],[11,"clone","","",0,null],[11,"clone_from","","",0,null],[11,"fmt","","",0,null],[11,"hash","","",0,null],[11,"eq","","",0,null],[11,"clone","","",1,null],[11,"next","","",1,null],[11,"size_hint","","",1,null],[11,"next_back","","",1,null]],"paths":[[3,"BitVec"],[3,"Iter"]]};
initSearch(searchIndex);