var searchIndex = {};
searchIndex["binomial_heap"] = {"doc":"A priority queue based on a [binomial heap].","items":[[3,"IntoIter","binomial_heap","An iterator that yields the items in a `BinomialHeap` in arbitrary order.",null,null],[3,"Iter","","An iterator that yields references to the items in a `BinomialHeap` in arbitrary order.",null,null],[3,"BinomialHeap","","A priority queue based on a binomial heap.",null,null],[3,"Drain","","An iterator that drains a `BinomialHeap`, yielding its items in arbitrary order.",null,null],[11,"clone","","",0,null],[11,"next","","",0,null],[11,"size_hint","","",0,null],[11,"len","","",0,null],[11,"next","","",1,null],[11,"size_hint","","",1,null],[11,"len","","",1,null],[11,"new","","Returns a new heap.",2,{"inputs":[],"output":{"name":"self"}}],[11,"is_empty","","Checks if the heap is empty.",2,null],[11,"len","","Returns the number of items in the heap.",2,null],[11,"iter","","Returns an iterator that yields references to the items in the heap in arbitrary order.",2,null],[11,"peek","","Returns a reference to the greatest item in the heap.",2,null],[11,"push","","Pushes the given item onto the heap.",2,null],[11,"append","","Moves the given heap's items into the heap, leaving the given heap empty.",2,null],[11,"push_pop","","Pushes the given item onto the heap, then removes the greatest item in the heap and returns\nit.",2,null],[11,"replace","","Removes the greatest item in the heap, then pushes the given item onto the heap.",2,null],[11,"pop","","Removes the greatest item in the heap and returns it.",2,null],[11,"clear","","Removes all items from the heap.",2,null],[11,"drain","","Removes all items from the heap and returns an iterator that yields them in arbitrary\norder.",2,null],[11,"fmt","","",2,null],[11,"default","","",2,{"inputs":[],"output":{"name":"self"}}],[11,"extend","","",2,null],[11,"from_iter","","",2,{"inputs":[{"name":"i"}],"output":{"name":"self"}}],[11,"into_iter","","",2,null],[11,"next","","",3,null],[11,"size_hint","","",3,null],[11,"len","","",3,null]],"paths":[[3,"Iter"],[3,"IntoIter"],[3,"BinomialHeap"],[3,"Drain"]]};
initSearch(searchIndex);