var searchIndex = {};
searchIndex["radix_heap"] = {"doc":"A monotone priority queue implemented with a radix heap.","items":[[3,"RadixHeapMap","radix_heap","A montone priority queue implemented with a radix heap.",null,null],[8,"Radix","","A number that can be compared using radix distance",null,null],[10,"radix_dist","","The radix distance between this number and another number.",0,null],[10,"radix_dist_max","","The maximum possible radix distance possible.",0,{"inputs":[],"output":{"name":"u32"}}],[11,"clone","","",1,null],[11,"new","","Creates a new `RadixHeapMap` with the highest possible top value such\nthat all keys are allowed.",1,{"inputs":[],"output":{"name":"radixheapmap"}}],[11,"clear","","Clears a new `RadixHeapMap` and sets te top value as high as possible\nvalue, so all keys can be inserted into the heap.",1,null],[11,"new_at","","Creates a new RadixHeapMap with a specific top value",1,{"inputs":[{"name":"k"}],"output":{"name":"radixheapmap"}}],[11,"clear_to","","Clears the elements in the heap and sets the top value to a new value",1,null],[11,"push","","Pushes a new key value pair onto the heap.",1,null],[11,"constrain","","Sets the top value to the current maximum key value in the heap",1,null],[11,"pop","","Pops the largest element of the heap. This might decrease the top value.",1,null],[11,"len","","Returns the number of elements in the heap",1,null],[11,"is_empty","","Returns true if there is no elements in the heap",1,null],[11,"top","","The current top value. All keys pushed onto the heap must be smaller\nthan this value.",1,null],[11,"shrink_to_fit","","Discards as much additional capacity as possible.",1,null],[11,"default","","",1,{"inputs":[],"output":{"name":"radixheapmap"}}],[11,"from_iter","","",1,{"inputs":[{"name":"i"}],"output":{"name":"radixheapmap"}}],[11,"extend","","",1,null],[11,"extend","","",1,null],[11,"fmt","","",1,null]],"paths":[[8,"Radix"],[3,"RadixHeapMap"]]};
initSearch(searchIndex);