/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
DictionaryFacilitator.java | 399 public void addWordToUserDictionary(final Context context, final String word) { 404 UserBinaryDictionary.addWordToUserDictionary(context, locale, word); 424 final PrevWordsInfo prevWordsInfo, final String word, final boolean wasAutoCapitalized, 431 final int maxFreq = getFrequency(word); 435 final String lowerCasedWord = word.toLowerCase(dictionaries.mLocale); 438 if (isValidWord(word, false /* ignoreCase */) 440 // If the word was auto-capitalized and exists only as a capitalized word in the 445 secondWord = word; 447 // If however the word is not in the dictionary, or exists as a lower-case wor [all...] |
ContactsBinaryDictionary.java | 134 for (String word : accountVocabulary) { 136 Log.d(TAG, "loadAccountVocabulary: " + word); 139 addUnigramLocked(word, FREQUENCY_FOR_CONTACTS, null /* shortcut */, 226 String word = name.substring(i, end); local 228 Log.d(TAG, "addName word = " + word); 233 final int wordLen = StringUtils.codePointCount(word); 236 Log.d(TAG, "addName " + name + ", " + word + ", " + prevWordsInfo); 239 addUnigramLocked(word, FREQUENCY_FOR_CONTACTS, 244 addNgramEntryLocked(prevWordsInfo, word, FREQUENCY_FOR_CONTACTS_BIGRAM [all...] |
ExpandableBinaryDictionary.java | 68 * The maximum length of a word in this dictionary. 297 * Adds unigram information of a word to the dictionary. May overwrite an existing entry. 299 public void addUnigramEntryWithCheckingDistracter(final String word, final int frequency, 309 PrevWordsInfo.EMPTY_PREV_WORDS_INFO, word, mLocale); 319 addUnigramLocked(word, frequency, shortcutTarget, shortcutFreq, 325 protected void addUnigramLocked(final String word, final int frequency, 328 if (!mBinaryDictionary.addUnigramEntry(word, frequency, shortcutTarget, shortcutFreq, 330 Log.e(TAG, "Cannot add unigram entry. word: " + word); 337 public void removeUnigramEntryDynamically(final String word) { [all...] |
DictionaryCollection.java | 82 public boolean isInDictionary(final String word) { 84 if (mDictionaries.get(i).isInDictionary(word)) return true; 89 public int getFrequency(final String word) { 92 final int tempFreq = mDictionaries.get(i).getFrequency(word); 99 public int getMaxFrequencyOfExactMatches(final String word) { 102 final int tempFreq = mDictionaries.get(i).getMaxFrequencyOfExactMatches(word);
|
/build/core/tasks/tools/ |
package-modules.mk | 30 $(eval ins := $(word 2,$(bui_ins)))\ 32 $(eval bui := $(word 1,$(bui_ins)))\ 43 mkdir -p $(dir $(word 2,$(pair)));\ 44 cp -rf $(word 1,$(pair)) $(word 2,$(pair));)
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/ |
dictionary.cpp | 102 int Dictionary::getProbability(const int *word, int length) const { 103 return getNgramProbability(nullptr /* prevWordsInfo */, word, length); 106 int Dictionary::getMaxProbabilityOfExactMatches(const int *word, int length) const { 109 mDictionaryStructureWithBufferPolicy.get(), word, length); 112 int Dictionary::getNgramProbability(const PrevWordsInfo *const prevWordsInfo, const int *word, 115 int nextWordPos = mDictionaryStructureWithBufferPolicy->getTerminalPtNodePositionOfWord(word, 129 bool Dictionary::addUnigramEntry(const int *const word, const int length, 138 return mDictionaryStructureWithBufferPolicy->addUnigramEntry(word, length, unigramProperty); 153 const int *const word, const int length) { 155 return mDictionaryStructureWithBufferPolicy->removeNgramEntry(prevWordsInfo, word, length) [all...] |
/external/icu/icu4c/source/test/intltest/ |
thcoll.cpp | 92 // Loop through each word in the dictionary and compare it to the previous 93 // word. They should be in sorted order. 95 UnicodeString lastWord, word; local 98 while (names.readLineSkippingComments(word, ec, FALSE) && U_SUCCESS(ec)) { 104 logln((UnicodeString)"Word " + wordCount + ": " + IntlTest::prettify(word, str)); 108 Collator::EComparisonResult result = coll->compare(lastWord, word); 109 doTest(coll, lastWord, word, result); 111 lastWord = word; 139 // Loop through each word in the dictionary and compare it to the previou 142 UnicodeString lastWord, word; local [all...] |
/external/zlib/src/contrib/gcc_gvmat64/ |
gvmat64.S | 230 //;;; It is then shifted into the high word, to make room for the wmask
289 movzx r12d,word ptr [r9]
290 movzx ebx, word ptr [r9 + r11 - 1]
298 cmp bx,word ptr [rsi + r8 - 1]
306 movzx r8d, word ptr [rdi + r8*2]
318 cmp bx,word ptr [rsi + r8 - 1]
326 movzx r8d, word ptr [rdi + r8*2]
337 cmp bx,word ptr [rsi + r8 - 1]
345 movzx r8d, word ptr [rdi + r8*2]
357 cmp bx,word ptr [rsi + r8 - 1] [all...] |
/packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/personalization/ |
UserHistoryDictionaryTests.java | 92 * Generates a random word. 115 for (String word : words) { 116 UserHistoryDictionary.addToDictionary(dict, prevWordsInfo, word, true, 119 prevWordsInfo = prevWordsInfo.getNextPrevWordsInfo(new WordInfo(word)); 137 final String word = words.get(i); local 138 assertTrue(dict.isInDictionary(word)); 267 for (final String word : words) { 268 UserHistoryDictionary.addToDictionary(dict, prevWordsInfo, word, true, mCurrentTime, 270 prevWordsInfo = prevWordsInfo.getNextPrevWordsInfo(new WordInfo(word)); 272 assertTrue(dict.isInDictionary(word)); [all...] |
/external/bison/lib/ |
ebitset.c | 600 of the word of interest. */ 618 bitset_word word; local 620 word = srcp[woffset] << (BITSET_WORD_BITS - 1 - bcount); 622 for (; word; bcount--) 624 if (word & BITSET_MSB) 633 word <<= 1; 664 bitset_word word; local 692 word = srcp[windex - woffset] >> (bitno % BITSET_WORD_BITS); 694 for (; word; bitno++) 696 if (word & 1 [all...] |
/external/chromium_org/third_party/libsrtp/srtp/crypto/math/ |
datatypes.c | 339 /* copy each word from left size to right side */ 346 /* set each word to the "or" of the two bit-shifted words */ 426 v->word = NULL; 428 v->word = (uint32_t*)crypto_alloc(l); 429 if (v->word == NULL) { 430 v->word = NULL; 446 if (v->word != NULL) 447 crypto_free(v->word); 448 v->word = NULL; 456 memset(x->word, 0, x->length >> 3) [all...] |
/external/srtp/crypto/math/ |
datatypes.c | 339 /* copy each word from left size to right side */ 346 /* set each word to the "or" of the two bit-shifted words */ 426 v->word = NULL; 428 v->word = (uint32_t*)crypto_alloc(l); 429 if (v->word == NULL) { 430 v->word = NULL; 446 if (v->word != NULL) 447 crypto_free(v->word); 448 v->word = NULL; 456 memset(x->word, 0, x->length >> 3) [all...] |
/packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
OpenWnnDictionaryImpl.java | 50 /** The type name of user word */ 52 /** The type name of learn word */ 413 * @param wnnWord The previous word for link search 466 /* If link search is enabled, insert information of the previous word */ 524 /* If no word is retrieved, deactivate the cursor for reduce the resource */ 536 /* Unset the previous word information */ 549 /* If the key string is "", no word is retrieved */ 648 /* Get the information of word */ [all...] |
SymbolList.java | 210 public int searchWords(WnnWord word) {return 0;} 218 WnnWord word = new WnnWord(str, str); local 219 return word; 223 public boolean learn(WnnWord word) {return false;} 226 public int addWord(WnnWord word) {return 0;} 229 public boolean deleteWord(WnnWord word) {return false;}
|
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
traverse_util.js | 7 * next (or previous) character, word, sentence, line, or paragraph, 427 * Finds the next word, starting from endCursor. Upon exit, startCursor 428 * and endCursor will surround the next word. A word is defined to be 431 * word returned. 433 * word. On exit, will point to the end of the word returned. 436 * @return {?string} The next word, or null if the bottom of the 455 // character in our word. It's safe to decrement |index| because 461 // Keep building up our word until we reach a whitespace character o 465 var word = c; variable 525 var word = c; variable [all...] |
/external/chromium_org/native_client_sdk/src/tools/lib/tests/ |
quote_test.py | 102 usage='Usage: %prog [options] word...') 123 for word in args: 127 qq = quote.unquote(word, options.special_chars, options.quote) 129 % (word, ''.join(qq))) 134 q = quote.quote(word, options.special_chars, options.quote) 137 % (word, q, q, ''.join(qq))) 138 if word != ''.join(qq):
|
/external/chromium_org/net/websockets/ |
websocket_deflater_test.cc | 107 const std::string word = "Chromium"; local 108 std::string input = word + std::string(256, 'a') + word; 124 const std::string word = "Chromium"; local 125 std::string input = word + std::string(256, 'a') + word;
|
/external/chromium_org/ui/gfx/ |
text_elider.cc | 344 // Add a word to the rectangular region at the current position, 346 void AddWord(const base::string16& word); 424 void RectangleString::AddWord(const base::string16& word) { 425 if (word.length() < max_cols_) { 426 // Word can be made to fit, no need to fragment it. 427 if (current_col_ + word.length() >= max_cols_) 429 Append(word); 431 // Word is so big that it must be fragmented. 434 base::i18n::UTF16CharIterator chars(&word); 438 Append(word.substr(array_start, chars.array_pos() - array_start)) 618 const base::string16& word = words.GetString(); local [all...] |
/external/llvm/test/MC/AArch64/ |
inline-asm-modifiers.s | 170 .word 0 // 0x0 177 .word 0 // 0x0 185 .word 0 // 0x0 192 .word 0 // 0x0 199 .word 0 // 0x0 206 .word 0 // 0x0
|
/external/srec/srec/include/ |
srec_context.h | 43 /* todo: for dynamic vocabs, a word should eventually be replaced 44 not so much "char* word" but "wordblock* head", Jean to merge 124 /* caching for add word, because FST_AddWordToSlot() is often sequentially 137 wordmap *olabels; /* word labels */ 140 /* word graph, for a-star */ 196 const char* word, 222 int wordmap_whether_in_rule(wordmap* wmap, wordID word, wordID rule); 223 wordID wordmap_find_index(wordmap* wmap, const char* word); 224 wordID wordmap_find_index_in_rule(wordmap* wmap, const char* word, wordID rule); 228 wordID wordmap_add_word(wordmap* wmap, const char* word); [all...] |
/frameworks/rs/cpu_ref/ |
rsCpuIntrinsics_neon_Blur.S | 97 2: ifcc .word 1f-1b-8 178 100: .word 101f-100b 179 .word 102f-100b 180 .word 103f-100b 181 .word 104f-100b 182 .word 105f-100b 183 .word 106f-100b 184 .word 107f-100b 185 .word 108f-100b 249 100: .word 101f-100 [all...] |
/prebuilts/gcc/darwin-x86/aarch64/aarch64-linux-android-4.8/share/gdb/python/gdb/command/ |
type_printers.py | 88 def add_some(self, result, word, printers): 90 if p.name.startswith(word): 93 def complete(self, text, word): 96 self.add_some(result, word, objfile.type_printers) 97 self.add_some(result, word, gdb.current_progspace().type_printers) 98 self.add_some(result, word, gdb.type_printers)
|
/prebuilts/gcc/darwin-x86/aarch64/aarch64-linux-android-4.9/share/gdb/python/gdb/command/ |
type_printers.py | 88 def add_some(self, result, word, printers): 90 if p.name.startswith(word): 93 def complete(self, text, word): 96 self.add_some(result, word, objfile.type_printers) 97 self.add_some(result, word, gdb.current_progspace().type_printers) 98 self.add_some(result, word, gdb.type_printers)
|
/prebuilts/gcc/darwin-x86/arm/arm-eabi-4.8/share/gdb/python/gdb/command/ |
type_printers.py | 88 def add_some(self, result, word, printers): 90 if p.name.startswith(word): 93 def complete(self, text, word): 96 self.add_some(result, word, objfile.type_printers) 97 self.add_some(result, word, gdb.current_progspace().type_printers) 98 self.add_some(result, word, gdb.type_printers)
|
/prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.8/share/gdb/python/gdb/command/ |
type_printers.py | 88 def add_some(self, result, word, printers): 90 if p.name.startswith(word): 93 def complete(self, text, word): 96 self.add_some(result, word, objfile.type_printers) 97 self.add_some(result, word, gdb.current_progspace().type_printers) 98 self.add_some(result, word, gdb.type_printers)
|