/packages/apps/Camera/jni/feature_stab/db_vlvm/ |
H A D | db_framestitching.cpp | 28 inline void db_RotationFromMOuterProductSum(double R[9],double *score,double M[9]) argument 72 if(score) 74 /*Compute score=transpose(q)*N*q */ 76 *score=db_ScalarProduct4(q,y);
|
H A D | db_feature_matching.cpp | 2930 double score; local 2945 score=db_SignedSquareNormCorr11x11Aligned_Post_f(pir_l->patch,pir_r->patch, 2949 if((!(pir_l->pir)) || (score>pir_l->s)) 2952 pir_l->s=score; 2955 if((!(pir_r->pir)) || (score>pir_r->s)) 2958 pir_r->s=score; 2968 double score; local 2988 score=db_SignedSquareNormCorr21x21Aligned_Post_s(pir_l->patch,pir_r->patch, 2997 score=db_SignedSquareNormCorr11x11Aligned_Post_s(pir_l->patch,pir_r->patch, 3003 score [all...] |
/packages/apps/Gallery2/jni_mosaic/feature_stab/db_vlvm/ |
H A D | db_framestitching.cpp | 28 inline void db_RotationFromMOuterProductSum(double R[9],double *score,double M[9]) argument 72 if(score) 74 /*Compute score=transpose(q)*N*q */ 76 *score=db_ScalarProduct4(q,y);
|
H A D | db_feature_matching.cpp | 2930 double score; local 2945 score=db_SignedSquareNormCorr11x11Aligned_Post_f(pir_l->patch,pir_r->patch, 2949 if((!(pir_l->pir)) || (score>pir_l->s)) 2952 pir_l->s=score; 2955 if((!(pir_r->pir)) || (score>pir_r->s)) 2958 pir_r->s=score; 2968 double score; local 2988 score=db_SignedSquareNormCorr21x21Aligned_Post_s(pir_l->patch,pir_r->patch, 2997 score=db_SignedSquareNormCorr11x11Aligned_Post_s(pir_l->patch,pir_r->patch, 3003 score [all...] |
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
H A D | db_framestitching.cpp | 28 inline void db_RotationFromMOuterProductSum(double R[9],double *score,double M[9]) argument 72 if(score) 74 /*Compute score=transpose(q)*N*q */ 76 *score=db_ScalarProduct4(q,y);
|
H A D | db_feature_matching.cpp | 2930 double score; local 2945 score=db_SignedSquareNormCorr11x11Aligned_Post_f(pir_l->patch,pir_r->patch, 2949 if((!(pir_l->pir)) || (score>pir_l->s)) 2952 pir_l->s=score; 2955 if((!(pir_r->pir)) || (score>pir_r->s)) 2958 pir_r->s=score; 2968 double score; local 2988 score=db_SignedSquareNormCorr21x21Aligned_Post_s(pir_l->patch,pir_r->patch, 2997 score=db_SignedSquareNormCorr11x11Aligned_Post_s(pir_l->patch,pir_r->patch, 3003 score [all...] |
/packages/inputmethods/PinyinIME/jni/share/ |
H A D | spellingtable.cpp | 271 double score = log(raw_spellings_[pos].freq) * score_amplifier_; local 272 assert(score >= 0); 274 average_score += score; 276 // Because of calculation precision issue, score might be a little bigger 278 if (score > 255) 279 score = 255; 282 static_cast<char>((unsigned char)score);
|
H A D | ngram.cpp | 235 float score = static_cast<float>( local 237 if (score > static_cast<float>(kMaxScore)) { 238 score = static_cast<float>(kMaxScore); 240 return score; 331 printf("code:%d, probability:%.9f, log score:%.3f, final score: %.3f\n",
|
H A D | matrixsearch.cpp | 220 node->score = 0; 653 float score) { 721 .mtrx_nd_pos].score - score_from; 746 .mtrx_nd_pos].score - score_from; 761 // to add new items or update score of some existing items. 1178 printf("-----Prepare candidates, score:\n"); 1527 lpi_items_[0].psb = 0; // 0 is bigger than normal lemma score. 1553 float score = mtrx_nd->score + lpi_items[pos].psb; local 1554 if (pos > 0 && score 652 add_lma_to_userdict(uint16 lma_fr, uint16 lma_to, float score) argument [all...] |
/packages/inputmethods/LatinIME/native/jni/src/ |
H A D | words_priority_queue.h | 37 void setParams(int score, int *word, int wordLength, int type) { argument 38 mScore = score; 59 void push(int score, int *word, int wordLength, int type) { argument 64 if (minScore >= score) { 71 sw = getFreeSuggestedWord(score, word, wordLength, type); 73 sw->setParams(score, word, wordLength, type); 80 AKLOGI("Push word. %d, %d", score, wordLength); 139 SuggestedWord *getFreeSuggestedWord(int score, int *word, int wordLength, int type) const { argument 142 mSuggestedWords[i].setParams(score, word, wordLength, type); 151 const int score local [all...] |
H A D | correction.cpp | 863 // In calcNormalizedScore the score will be demoted by (1 - 1 / length) 877 // In calcNormalizedScore the score will be demoted by (1 - 1 / length) so we have to promote 923 // score = (int)((original score) * SUGGEST_INTERFACE_OUTPUT_SCALE) 924 // Undo the scaling here to recover the original score. 925 // normalizedScore = ((float)score) / SUGGEST_INTERFACE_OUTPUT_SCALE 927 // original score 930 // * (individual word's score which defined in the unigram dictionary, 931 // and this score is defined in range [0, 255].) 937 // capitalization, then treat it as if the score wa 946 calcNormalizedScore(const int *before, const int beforeLength, const int *after, const int afterLength, const int score) argument [all...] |
H A D | unigram_dictionary.cpp | 186 AKLOGI("Max normalized score = %f", ns); 263 const int score = sw->mScore; local 267 correction->getPrimaryInputWord(), i, word, wordLength, score); 269 AKLOGI("--- TOP SUB WORDS for %d --- %d %f [%d]", i, score, ns, 381 // with the same score. For the moment we use -1 to make sure the shortcut will 502 int score = 0; local 505 &tempOutputWord, &score, &nextWordLength); 507 AKLOGI("NS(%d) = %f, Score = %d", currentWordIndex, ns, score); 509 // Two words correction won't be done if the score of the first word doesn't exceed the 515 freq = score >> (nextWordLengt [all...] |
H A D | proximity_info_state_utils.cpp | 397 // Calculating a point score that indicates usefulness of the point. 417 float score = 0.0f; local 422 score += ProximityInfoParams::NOT_LOCALMIN_DISTANCE_SCORE; 425 score += ProximityInfoParams::LOCALMIN_DISTANCE_AND_NEAR_TO_KEY_SCORE; 437 score += ProximityInfoParams::CORNER_SCORE; 439 return score; 461 const float score = getPointScore(mostCommonKeyWidth, x, y, time, isLastPoint, nearest, local 464 if (score < 0) {
|
/packages/inputmethods/PinyinIME/jni/include/ |
H A D | spellingtrie.h | 36 unsigned char score; member in struct:ime_pinyin::SpellingNode 62 // store score. For example, "zhuang" is the longgest item in Pinyin list, 64 // Structure: The string ended with '\0' + score char. 65 // An item with a lower score has a higher probability. 129 // parent is used to update its num_of_son and score. 168 // score_amplifier is used to convert a possibility value into score. 170 // assigned with this score.
|
H A D | matrixsearch.h | 59 float score; member in struct:ime_pinyin::MatrixNode 236 // Lemma Items with possibility score, two purposes: 288 // The result is sorted in descendant order by the frequency score. 367 bool add_lma_to_userdict(uint16 lma_from, uint16 lma_num, float score);
|
H A D | userdict.h | 390 int score; member in struct:ime_pinyin::UserDict::UserDictScoreOffsetPair
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
H A D | BinaryDictionary.java | 99 private static native float calcNormalizedScoreNative(int[] before, int[] after, int score); argument 162 final int score = SuggestedWordInfo.KIND_WHITELIST == kind 167 score, kind, mDictType)); 178 final int score) { 180 StringUtils.toCodePointArray(after), score); 177 calcNormalizedScore(final String before, final String after, final int score) argument
|
H A D | SuggestedWords.java | 148 public SuggestedWordInfo(final String word, final int score, final int kind, argument 151 mScore = score;
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/spellcheck/ |
H A D | AndroidSpellCheckerService.java | 247 int wordLength, int score) { 248 final int positionIndex = Arrays.binarySearch(mScores, 0, mLength, score); 254 // In the future, we may want to keep track of the best suggestion score even if 260 // the score cutoff, since we need to know that to return a meaningful 263 // if (score > mBestScore) { 264 // mBestScore = score; 271 // We found a suggestion, but its score is too weak to be kept considering 287 mScores[insertIndex] = score; 345 Log.i(TAG, "Best suggestion : " + bestSuggestion + ", score " + bestScore); 346 Log.i(TAG, "Normalized score 246 addWord(char[] word, int[] spaceIndices, int wordOffset, int wordLength, int score) argument [all...] |
/packages/inputmethods/LatinIME/native/jni/ |
H A D | com_android_inputmethod_latin_BinaryDictionary.cpp | 231 jintArray before, jintArray after, jint score) { 239 afterCodePoints, afterLength, score); 230 latinime_BinaryDictionary_calcNormalizedScore(JNIEnv *env, jclass clazz, jintArray before, jintArray after, jint score) argument
|
/packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/ |
H A D | ContactMatcher.java | 34 // Best possible match score 37 // Suggest to aggregate contacts if their match score is equal or greater than this threshold 40 // Automatically aggregate contacts if their match score is equal or greater than this threshold 43 // Automatically aggregate contacts if the match score is equal or greater than this threshold 81 * "full name", the score may be 99. If we are looking for a "nickname" but 82 * find "first name", the score may be 50 (see specific scores defined 86 * similar the two strings are, the score will be somewhere between 40 and 70, with the exact 87 * match producing the score of 70. The score may also be 0 if the similarity (distance) 135 * Populates the cells of the score matri 191 updatePrimaryScore(int score) argument 198 updateSecondaryScore(int score) argument 344 updatePrimaryScore(long contactId, int score) argument 348 updateSecondaryScore(long contactId, int score) argument [all...] |