var searchIndex = {};
searchIndex["bitvector"] = {"doc":"### BitVector Module","items":[[3,"BitVector","bitvector","Bitvector",null,null],[3,"BitVectorIter","","Iterator for BitVector",null,null],[11,"fmt","","",0,null],[11,"clone","","",0,null],[11,"fmt","","",0,null],[11,"eq","","",0,null],[11,"new","","Build a new empty bitvector",0,{"inputs":[{"name":"usize"}],"output":{"name":"self"}}],[11,"ones","","new bitvector contains all elements",0,{"inputs":[{"name":"usize"}],"output":{"name":"self"}}],[11,"is_empty","","return if this set is empty",0,null],[11,"len","","the number of elements in set",0,null],[11,"clear","","Clear all elements from a bitvector",0,null],[11,"contains","","If `bit` belongs to set, return `true`,\nelse return `false`.\nInsert, remove and contains do not do bound check.",0,null],[11,"eq_left","","compare if the following is true:",0,null],[11,"insert","","insert a new element to set",0,null],[11,"remove","","remove an element from set",0,null],[11,"insert_all","","import elements from another bitvector",0,null],[11,"capacity","","the max number of elements can be inserted into set",0,null],[11,"union","","set union",0,null],[11,"intersection","","set intersection",0,null],[11,"difference","","set difference",0,null],[11,"difference_d","","",0,null],[11,"union_inplace","","Union operator by modifying `self`",0,null],[11,"intersection_inplace","","Intersection operator by modifying `self`",0,null],[11,"difference_inplace","","Difference operator by modifying `self`",0,null],[11,"difference_d_inplace","","",0,null],[11,"iter","","Return a iterator of element based on current bitvector,\nfor example:",0,null],[11,"next","","",1,null],[11,"from_iter","","",0,{"inputs":[{"name":"i"}],"output":{"name":"bitvector"}}],[11,"bitand","","",0,null],[11,"bitand_assign","","",0,null],[11,"bitor","","",0,null],[11,"bitor_assign","","",0,null],[11,"bitxor","","",0,null],[11,"bitxor_assign","","",0,null]],"paths":[[3,"BitVector"],[3,"BitVectorIter"]]};
initSearch(searchIndex);