node = pathlib_nodeatpoint(where);
if(node)
{
+ #ifdef TURRET_DEBUG
mark_error(where, 60);
+ #endif
return node;
}
float pathlib_makenode_adaptive(entity parent,vector start, vector to, vector goal,float cost)
{
entity node;
- float h,g,f,doedge;
+ float h,g,f,doedge = 0;
vector where;
++pathlib_searched_cnt;
node.path_prev = parent;
}
- if not (best_open_node)
+ if (!best_open_node)
best_open_node = node;
else if(best_open_node.pathlib_node_f > node.pathlib_node_f)
best_open_node = node;
where = pathlib_movenode(parent.origin, to, 0);
- if not(pathlib_movenode_goodnode)
+ if (!pathlib_movenode_goodnode)
{
//pathlib_showsquare(where, 0 ,30);
//pathlib_showsquare(parent.origin, 1 ,30);
if(doedge)
- if not (tile_check(where))
+ if (!tile_check(where))
{
dprint("tile_check fail\n");
pathlib_showsquare(where, 0 ,30);
//}
}
- if not (best_open_node)
+ if (!best_open_node)
best_open_node = node;
else if(best_open_node.pathlib_node_f > node.pathlib_node_f)
best_open_node = node;
node.pathlib_node_g = g;
node.pathlib_node_f = f;
- if not (best_open_node)
+ if (!best_open_node)
best_open_node = node;
else if(best_open_node.pathlib_node_f > node.pathlib_node_f)
best_open_node = node;
return 0;
}
+float buildpath_nodefilter_none(vector n,vector c,vector p)
+{
+ return 0;
+}
+
entity path_build(entity next, vector where, entity prev, entity start)
{
entity path;
pathlib_movenode = pathlib_swimnode;
}
- if not(openlist)
+ if (!openlist)
openlist = spawn();
- if not(closedlist)
+ if (!closedlist)
closedlist = spawn();
pathlib_closed_cnt = 0;