Home
last modified time | relevance | path

Searched refs:num_complete_paths (Results 1 – 4 of 4) sorted by relevance

/external/srec/srec/crec/
Dsrec_results.c87 if (rec->astar_stack->num_complete_paths) in srec_has_results()
129 if (stack->num_complete_paths) in srec_nbest_prepare_list()
152 return stack ? stack->num_complete_paths : 0; in srec_nbest_get_num_choices()
184 for(i=1; i<stack->num_complete_paths; i++) { in srec_nbest_fix_homonym_confidence_values()
211 if (!stack || n < 0 || n >= stack->num_complete_paths) in srec_nbest_remove_result()
221 for (i = n + 1 ; i < stack->num_complete_paths; i++) in srec_nbest_remove_result()
226 stack->num_complete_paths--; in srec_nbest_remove_result()
239 if (!stack || index >= (size_t) stack->num_complete_paths) in srec_nbest_get_resultWordIDs()
291 if (!stack || n < 0 || n >= stack->num_complete_paths) in srec_nbest_get_result()
358 if (ibest < 0 || ibest >= stack->num_complete_paths) in srec_nbest_get_choice_info()
[all …]
Dastar.c535 stack->num_complete_paths = 0; in astar_stack_make()
581 stack->num_complete_paths = 0; in astar_stack_prepare()
601 stack->num_complete_paths = 0; in astar_stack_prepare()
609 stack->complete_paths[ stack->num_complete_paths++] = parp; in astar_stack_prepare()
610 if (stack->num_complete_paths == request_nbest_len) in astar_stack_prepare()
633 for (i = 0; i < stack->num_complete_paths; i++) in astar_stack_clear()
645 stack->num_complete_paths = 0; in astar_stack_clear()
702 print_partial_paths(stack->complete_paths, stack->num_complete_paths, in astar_stack_do_backwards_search()
767 if (stack->num_complete_paths) in astar_stack_do_backwards_search()
802 ASSERT(stack->num_complete_paths < stack->max_complete_paths); in astar_stack_do_backwards_search()
[all …]
Dsrec_stats.c150 stack->num_complete_paths); in srec_stats_update_astar()
/external/srec/srec/include/
Dastar.h100 int num_complete_paths; member