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

  /external/srec/srec/crec/
srec.c 61 costdata current_best_cost);
509 static costdata reprune_new_states(srec *rec, costdata current_best_cost, costdata current_prune_delta)
515 prune_new_tokens(rec, current_best_cost + current_prune_delta);
517 ASSERT(((float)current_best_cost) + current_prune_delta < (float)SHRT_MAX);
534 current_best_cost, rec->num_new_states);
541 num_deleted = prune_new_tokens(rec, current_best_cost + current_prune_delta);
543 ASSERT(((float)current_best_cost + current_prune_delta) < (float)USHRT_MAX);
589 static costdata reprune_fsmnode_tokens(srec *rec, costdata current_best_cost, costdata current_prune_delta,
596 prune_fsmnode_tokens(rec, current_best_cost+current_prune_delta, not_this_one);
598 ASSERT((float)current_best_cost + (float)current_prune_delta < (float)SHRT_MAX)
1102 costdata current_best_cost; local
1534 costdata current_best_cost = *pcurrent_best_cost; local
2041 costdata current_best_cost; local
2167 costdata current_best_cost; local
2263 costdata current_best_cost = rec->current_best_cost; local
2340 costdata current_best_cost = MAXcostdata; local
    [all...]
srec_results.c 34 costdata current_best_cost = MAXcostdata; local
40 if (current_best_cost > recm->rec[i].current_best_cost)
42 current_best_cost = recm->rec[i].current_best_cost;
word_lattice.c 392 costdata current_best_cost = MAXcostdata; local
398 if (current_best_cost > rec->rec[i].current_best_cost)
400 current_best_cost = rec->rec[i].current_best_cost;
679 int reprune_word_tokens(srec* rec, costdata current_best_cost)
  /external/srec/srec/include/
word_lattice.h 48 int reprune_word_tokens(srec* rec, costdata current_best_cost);
srec.h 202 costdata current_best_cost; /* 0 if single recog */ member in struct:srec_t

Completed in 781 milliseconds