MCPcopy Create free account
hub / github.com/diasurgical/devilution / path_get_node2

Function path_get_node2

Source/path.cpp:276–282  ·  view source on GitHub ↗

* @brief return a node for (dx,dy) if it was visited, or NULL if not found */

Source from the content-addressed store, hash-verified

274 * @brief return a node for (dx,dy) if it was visited, or NULL if not found
275 */
276PATHNODE *path_get_node2(int dx, int dy)
277{
278 PATHNODE *result = pnode_ptr->NextNode;
279 while (result != NULL && (result->x != dx || result->y != dy))
280 result = result->NextNode;
281 return result;
282}
283
284/**
285 * @brief insert pPath into the frontier (keeping the frontier sorted by total distance)

Callers 1

path_parent_pathFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected