HomeSort by relevance Sort by last modified time
    Searched refs:num_complete_paths (Results 1 - 4 of 4) sorted by null

  /external/srec/srec/crec/
srec_results.c 87 if (rec->astar_stack->num_complete_paths)
129 if (stack->num_complete_paths)
152 return stack ? stack->num_complete_paths : 0;
184 for(i=1; i<stack->num_complete_paths; i++) {
211 if (!stack || n < 0 || n >= stack->num_complete_paths)
221 for (i = n + 1 ; i < stack->num_complete_paths; i++)
226 stack->num_complete_paths--;
239 if (!stack || index >= (size_t) stack->num_complete_paths)
291 if (!stack || n < 0 || n >= stack->num_complete_paths)
358 if (ibest < 0 || ibest >= stack->num_complete_paths)
    [all...]
astar.c 535 stack->num_complete_paths = 0;
581 stack->num_complete_paths = 0;
601 stack->num_complete_paths = 0;
609 stack->complete_paths[ stack->num_complete_paths++] = parp;
610 if (stack->num_complete_paths == request_nbest_len)
633 for (i = 0; i < stack->num_complete_paths; i++)
645 stack->num_complete_paths = 0;
702 print_partial_paths(stack->complete_paths, stack->num_complete_paths,
767 if (stack->num_complete_paths)
802 ASSERT(stack->num_complete_paths < stack->max_complete_paths)
    [all...]
srec_stats.c 150 stack->num_complete_paths);
  /external/srec/srec/include/
astar.h 100 int num_complete_paths; member in struct:__anon29183

Completed in 53 milliseconds