var searchIndex = {};
searchIndex["hex2d_dpcext"] = {"doc":"Dpc's hacky extensions","items":[[0,"algo","hex2d_dpcext","Useful algorithms",null,null],[0,"bfs","hex2d_dpcext::algo","Breadth First Search",null,null],[3,"Traverser","hex2d_dpcext::algo::bfs","Breadth First Search",null,null],[11,"new","","Create a Traverser instance with initial conditions",0,{"inputs":[{"name":"fcanpass"},{"name":"fisdest"},{"name":"coordinate"}],"output":{"name":"traverser"}}],[11,"find","","Find next closest coordinate.",0,null],[11,"backtrace","","Return neighbor Coordinate to `pos` that is one step closer to\n`start` from initial conditions.",0,null],[11,"backtrace_last","","Perform a recursive `backtrace` walk to find a neighbor of `start` that leads to the\nCoordinate returned by `find()`.",0,null],[0,"los","hex2d_dpcext::algo","Very tricky, but (hopefully) good enough, recursive LoS algorithm",null,null],[5,"los","hex2d_dpcext::algo::los","Starting from `pos` in direction `dir`, call `visible` for each visible Coordinate.",null,null],[0,"los2","hex2d_dpcext::algo","Combination of tricky Los with straight line checking",null,null],[5,"los","hex2d_dpcext::algo::los2","Starting from `pos` in direction `dir`, call `visible` for each visible Coordinate.",null,null]],"paths":[[3,"Traverser"]]};
initSearch(searchIndex);