var searchIndex = {};
searchIndex["algo"] = {"doc":"","items":[[0,"math","algo","",null,null],[5,"gcd","algo::math","",null,{"inputs":[{"name":"t"},{"name":"t"}],"output":{"name":"t"}}],[5,"euclid_gcd","","",null,{"inputs":[{"name":"t"},{"name":"t"}],"output":{"name":"t"}}],[5,"binary_gcd","","",null,{"inputs":[{"name":"t"},{"name":"t"}],"output":{"name":"t"}}],[5,"lcm","","",null,{"inputs":[{"name":"t"},{"name":"t"}],"output":{"name":"t"}}],[0,"search","algo","",null,null],[0,"kmp","algo::search","",null,null],[5,"build_table","algo::search::kmp","",null,null],[5,"find_first","","",null,null],[5,"find_first_with_table","","",null,null],[5,"find_all","","",null,null],[5,"find_all_with_table","","",null,null],[0,"sort","algo","",null,null],[5,"insertion_sort","algo::sort","",null,null],[5,"insertion_sort_with_copy","","",null,null],[5,"insertion_sort_with_binary_search","","",null,null],[5,"selection_sort","","",null,null],[0,"data_structures","algo","",null,null],[0,"heap","algo::data_structures","",null,null],[3,"FibonacciHeap","algo::data_structures::heap","",null,null],[3,"UnsafeFibonacciHeap","","",null,null],[11,"new","","",0,{"inputs":[],"output":{"name":"fibonacciheap"}}],[11,"min","","",0,null],[11,"is_empty","","",0,null],[11,"size","","",0,null],[11,"push","","",0,null],[11,"pop","","",0,null],[11,"merge","","",0,{"inputs":[{"name":"fibonacciheap"},{"name":"fibonacciheap"}],"output":{"name":"fibonacciheap"}}],[11,"new","","",1,{"inputs":[],"output":{"name":"fibonacciheap"}}],[11,"min","","",1,null],[11,"is_empty","","",1,null],[11,"size","","",1,null],[11,"push","","",1,null],[11,"pop","","",1,null],[11,"merge","","",1,{"inputs":[{"name":"fibonacciheap"},{"name":"fibonacciheap"}],"output":{"name":"fibonacciheap"}}]],"paths":[[3,"FibonacciHeap"],[3,"UnsafeFibonacciHeap"]]};
initSearch(searchIndex);