Lines Matching refs:stack
112 AstarStack* stack = rec ? rec->astar_stack : 0;
114 if (!stack)
119 rc = astar_stack_prepare(stack, n, rec);
129 if (stack->num_complete_paths)
131 *bestcost = stack->complete_paths[0]->costsofar;
144 AstarStack* stack = rec ? rec->astar_stack : 0;
145 astar_stack_clear(stack);
151 AstarStack* stack = rec ? rec->astar_stack : 0;
152 return stack ? stack->num_complete_paths : 0;
158 AstarStack* stack = rec ? rec->astar_stack : 0;
159 if (!stack)
165 stack->complete_path_confidences[choice] = confidence_value;
173 AstarStack* stack = rec ? rec->astar_stack : 0;
174 return stack->complete_path_confidences[choice];
181 AstarStack* stack = rec ? rec->astar_stack : 0;
182 if (!stack)
184 for(i=1; i<stack->num_complete_paths; i++) {
185 partial_path* parp = stack->complete_paths[i];
189 stack->complete_path_confidences[i] = stack->complete_path_confidences[i-1];
208 AstarStack* stack = rec ? rec->astar_stack : 0;
211 if (!stack || n < 0 || n >= stack->num_complete_paths)
217 free_partial_path(stack, stack->complete_paths[n]);
221 for (i = n + 1 ; i < stack->num_complete_paths; i++)
222 stack->complete_paths[i-1] = stack->complete_paths[i];
223 stack->complete_paths[i-1] = 0; /* empty the last one */
226 stack->num_complete_paths--;
234 AstarStack* stack = rec ? rec->astar_stack : 0;
239 if (!stack || index >= (size_t) stack->num_complete_paths)
247 parp = stack->complete_paths[index];
248 *cost = stack->complete_paths[index]->costsofar;
286 AstarStack* stack = rec ? rec->astar_stack : 0;
291 if (!stack || n < 0 || n >= stack->num_complete_paths)
299 parp = stack->complete_paths[n];
300 *cost = stack->complete_paths[n]->costsofar;
353 AstarStack* stack = rec ? rec->astar_stack : 0;
355 if (!stack)
358 if (ibest < 0 || ibest >= stack->num_complete_paths)
365 partial_path* parp = stack->complete_paths[ibest];
460 AstarStack* stack = rec ? rec->astar_stack : 0;
464 if (!stack || stack->num_complete_paths < 1)
467 n = stack->num_complete_paths;
473 if (stack->complete_paths[j]->costsofar < stack->complete_paths[i]->costsofar)
475 /* PLogMessage(" %d %d", stack->complete_paths[j]->costsofar, stack->complete_paths[j]->costsofar); */
476 parp = stack->complete_paths[i];
477 stack->complete_paths[i] = stack->complete_paths[j];
478 stack->complete_paths[j] = parp;
