| /external/srec/srec/ca/ |
| H A D | rec_resu.c | 43 int CA_FullResultScore(CA_Recog *hRecog, int *score, int do_incsil) argument
49 *score = cost;
|
| H A D | ann_api.c | 269 int score; local
279 score = annotation_compare(testAnnotation->data, refAnnotation->data);
281 return (score);
|
| /external/freetype/src/autofit/ |
| H A D | afwarp.c | 107 /* find best score */
114 AF_WarpScore score = scores[idx]; local
118 if ( score > warper->best_score ||
119 ( score == warper->best_score &&
122 warper->best_score = score;
|
| H A D | afhints.h | 137 FT_Pos score; /* used during stem matching */ member in struct:AF_SegmentRec_
162 FT_Int score; member in struct:AF_EdgeRec_
|
| H A D | aflatin.c | 673 seg0.score = 32000;
916 FT_Pos len, score; local
928 score = dist + len_score / len;
930 if ( score < seg1->score )
932 seg1->score = score;
936 if ( score < seg2->score )
938 seg2->score
[all...] |
| H A D | aflatin2.c | 674 seg0.score = 32000;
968 FT_Pos len, score; local
980 score = dist + len_score / len;
981 if ( score < seg1->score )
983 seg1->score = score;
987 if ( score < seg2->score )
989 seg2->score
[all...] |
| /external/qemu/distrib/sdl-1.2.12/src/joystick/darwin/ |
| H A D | SDL_sysjoystick.c | 172 SInt32 score = 0; local
178 kIOCFPlugInInterfaceID, &ppPlugInInterface, &score);
|
| /external/srec/srec/include/ |
| H A D | simapi.h | 217 long score; member in struct:__anon5091
268 int viterbi_prune_thresh; /*score-based pruning threshold - only keep paths within this delta of best cost*/
1985 * Returns top score
1996 int score);
2000 * score score
2017 * Returns top score
2075 int *score,
2099 * or REJECT_RESULT if the reject score is > reject threshold.
2130 * or REJECT_RESULT if the reject score i
[all...] |
| /external/qemu/ |
| H A D | block.c | 258 int score_max = 0, score; local
263 score = d->bdrv_probe_device(filename);
264 if (score > score_max) {
265 score_max = score;
276 int ret, score, score_max; local
298 score = drv1->bdrv_probe(buf, ret, filename);
299 if (score > score_max) {
300 score_max = score;
|
| /external/srec/srec/Recognizer/src/ |
| H A D | RecognizerImpl.c | 1795 /* utility function to sort the ArrayList of nbest list results by the score of the first
1961 asr_int32_t raws; /* raw score */
1969 int valid, score, recogID; local
2002 CA_FullResultScore(impl->recognizer, &score, 1);
2004 PLogMessage(L("R: %s type %d score %d from recognizer%d"), result, type, score, valid, recogID);
2005 PLogMessage(L("R: %s score %d from recognizer%d"), result, score, valid, recogID);
2008 //pfprintf(PSTDOUT, ("R: %s type %d score %d from recognizer%d\n"), result, type, score, vali
[all...] |
| /external/srec/srec/crec/ |
| H A D | srec.c | 259 to a linear in-place sort, linear looking for the 10 best score should not
334 scodata score = mixture_diagonal_gaussian_swimodel(pattern->prep, local
336 ASSERT(score <= 0 && "model score out of range");
338 current_model_scores[i] = (costdata) - score;
713 pcurrent_word_threshold is the worst score for words on the prio.q
1976 token if the first observation frame gets a score above the current pruning
1980 3. Prune. Note that the best score will have already been established for
1983 4. reset best cost to 0 (to keep scores in range). We can do this here since we already know the best score.
2055 yet know the overall best, so we use the gender score ga
[all...] |
| /external/sqlite/dist/ |
| H A D | sqlite3.c | 70534 int score = matchQuality(p, nArg, enc); local
70554 int score = matchQuality(p, nArg, enc); local
[all...] |