/packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/ |
SuggestedWordsTests.java | 40 final SuggestedWords words = new SuggestedWords( local 47 assertEquals(NUMBER_OF_ADDED_SUGGESTIONS + 1, words.size()); 48 assertEquals("typed", words.getWord(0)); 49 assertEquals(SuggestedWordInfo.KIND_TYPED, words.getInfo(0).mKind); 50 assertEquals("0", words.getWord(1)); 51 assertEquals(SuggestedWordInfo.KIND_CORRECTION, words.getInfo(1).mKind); 52 assertEquals("4", words.getWord(5)); 53 assertEquals(SuggestedWordInfo.KIND_CORRECTION, words.getInfo(5).mKind); 55 final SuggestedWords wordsWithoutTyped = words.getSuggestedWordsExcludingTypedWord(); 56 assertEquals(words.size() - 1, wordsWithoutTyped.size()) [all...] |
UserHistoryDictionaryTests.java | 71 private void addToDict(final UserHistoryDictionary dict, final List<String> words) { 73 for (String word : words) { 86 List<String> words = generateWords(numberOfWords, random); local 95 addToDict(dict, words);
|
/development/samples/training/multiscreen/newsreader/src/com/example/android/newsreader/ |
NonsenseGenerator.java | 77 List<String> words = new ArrayList<String>(); local 78 generateSentence(words, isHeadline); 79 words.set(0, String.valueOf(Character.toUpperCase(words.get(0).charAt(0))) + 80 words.get(0).substring(1)); 81 return joinWords(words); 102 * @param words the list of words to which the sentence will be appended. 105 private void generateSentence(List<String> words, boolean isHeadline) { 107 generateTimeClause(words, isHeadline) [all...] |
/bionic/libc/upstream-netbsd/libc/inet/ |
inet_ntop.c | 136 u_int words[NS_IN6ADDRSZ / NS_INT16SZ]; local 148 memset(words, '\0', sizeof words); 150 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3)); 156 if (words[i] == 0) { 198 (best.len == 7 && words[7] != 0x0001) || 199 (best.len == 5 && words[5] == 0xffff))) { 205 advance = snprintf(tp, (size_t)(ep - tp), "%x", words[i]);
|
/external/valgrind/main/memcheck/tests/ |
test-plo.c | 73 UWord* words = malloc(3 * sizeof(UWord)); local 74 free(words); 77 UWord w = words[1];
|
wrap6.c | 182 UInt* words = calloc(200, sizeof(UInt)); local 183 TRASH_IREGS(r, words); 184 free(words); 208 UInt* words = calloc(200, sizeof(UInt)); local 209 words[1-1] = a1; 210 TRASH_IREGS(r, words); 211 free(words); 235 UInt* words = calloc(200, sizeof(UInt)); local 236 words[1-1] = a1; 237 words[2-1] = a2 263 UInt* words = calloc(200, sizeof(UInt)); local 292 UInt* words = calloc(200, sizeof(UInt)); local 322 UInt* words = calloc(200, sizeof(UInt)); local 353 UInt* words = calloc(200, sizeof(UInt)); local 386 UInt* words = calloc(200, sizeof(UInt)); local 422 UInt* words = calloc(200, sizeof(UInt)); local 459 UInt* words = calloc(200, sizeof(UInt)); local 497 UInt* words = calloc(200, sizeof(UInt)); local 536 UInt* words = calloc(200, sizeof(UInt)); local 576 UInt* words = calloc(200, sizeof(UInt)); local [all...] |
/external/aac/libFDK/src/ |
FDK_crc.cpp | 431 int words = bits >> 3; /* processing bytes */ local 435 rBits -= (calcCrc_Bytes(&crc, hCrcInfo->pCrcLookup, &bsReader, words)<<3); 438 rBits -= calcCrc_Bits(&crc, hCrcInfo->crcMask, hCrcInfo->crcPoly, &bsReader, words<<3 );
|
/external/libvorbis/doc/ |
02-bitpacking.tex | 16 bitstream into an actual representation in fixed-width words. 19 \subsubsection{octets, bytes and words} 52 Words are native groupings of multiple bytes. Several byte orderings
|
/external/openssh/openbsd-compat/ |
inet_ntop.c | 120 u_int words[IN6ADDRSZ / INT16SZ]; local 129 memset(words, '\0', sizeof words); 131 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3)); 135 if (words[i] == 0) { 179 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) { 185 advance = snprintf(tp, ep - tp, "%x", words[i]);
|
/external/tcpdump/missing/ |
inet_ntop.c | 118 u_long words [IN6ADDRSZ / INT16SZ]; local 125 memset (words, 0, sizeof(words)); 127 words[i/2] |= (src[i] << ((1 - (i % 2)) << 3)); 133 if (words[i] == 0) 173 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) 183 tp += sprintf (tp, "%lX", words[i]);
|
/external/webkit/Source/JavaScriptCore/wtf/ |
Bitmap.h | 50 static const WordType words = (size + wordSize - 1) / wordSize; member in class:WTF::Bitmap 59 FixedArray<WordType, words> bits; 138 for (size_t i = start / wordSize; i < words; ++i) 146 for (size_t i = 0; i < words; ++i) 155 for (size_t i = 0; i < words; ++i)
|
/packages/apps/Mms/tests/src/com/android/mms/ |
RecyclerTest.java | 44 * NOTE: you first have to put the unix words file on the device: 45 * example: adb push ~/words /data/data/com.android.mms/files 52 * NOTE: you first have to put the unix words file on the device: 53 * example: adb push ~/words /data/data/com.android.mms/files 80 // Read in dictionary of words 81 mWords = new ArrayList<String>(98568); // count of words in words file 84 Log.v(TAG, "Loading dictionary of words"); 85 FileInputStream words = context.openFileInput("words"); local [all...] |
/packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/ |
BinaryDictIOTests.java | 162 final List<String> words, final Map<String, List<String>> shortcutMap) { 164 final String word = words.get(i); 177 final List<String> words, 182 dict.setBigram(words.get(w1), words.get(w2), BIGRAM_FREQ); 210 private void checkDictionary(final FusionDictionary dict, final List<String> words, 215 for (final String word : words) { 224 final CharGroup cg = FusionDictionary.findWordInTree(dict.mRoot, words.get(w1)); 225 assertNotNull(words.get(w1) + "," + words.get(w2), cg.getBigram(words.get(w2))) 288 addUnigrams(words.size(), dict, words, shortcuts); local [all...] |
/development/samples/SearchableDictionary/src/com/example/android/searchabledict/ |
SearchableDictionary.java | 110 SimpleCursorAdapter words = new SimpleCursorAdapter(this, local 112 mListView.setAdapter(words);
|
/external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/ |
SHA1ImplTest.java | 66 int[] words = new int[INDEX +6]; // working array to compute hash local 72 for (int i = 0; i < words.length; i++ ) { 73 words[i] = 0; 75 words[0] = 0x61626380; // constants from Secure Hash Standard 76 words[15] = 0x00000018; 78 alternateHash(words, hash1); 102 * if data supplied takes exactly fourteen words of sixteen word buffer.
|
/external/elfutils/lib/ |
md5.c | 297 const md5_uint32 *words = buffer; local 299 const md5_uint32 *endp = words + nwords; 314 while (words < endp) 324 unit is a 32-bit word and it is determined to work on words in 327 we store the swapped words in the array CORRECT_WORDS. */ 332 a += FF (b, c, d) + (*cwp++ = SWAP (*words)) + T; \ 333 ++words; \ 367 /* For the second to fourth round we have the possibly swapped words
|
sha1.c | 225 const sha1_uint32 *words = buffer; local 227 const sha1_uint32 *endp = words + nwords; 243 while (words < endp) 253 unit is a 32-bit word and it is determined to work on words in 260 W (i) = SWAP (*words); \ 262 ++words; \
|
/external/jpeg/ |
ansi2knr.c | 506 { static char *words[] = local 513 char **key = words;
|
/external/qemu/distrib/jpeg-6b/ |
ansi2knr.c | 506 { static char *words[] = local 513 char **key = words;
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/research/ |
MainLogBuffer.java | 33 * There are three forms of privacy protection: 1) only words in the main dictionary are allowed to 34 * be logged in enough detail to determine their contents, 2) only a subset of words are logged 38 * words, they are added here. But if the user backs up over their current word to edit a word 40 * the LogUnit, and it is pushed back in here when the user is done. Because words may be pulled 46 * up), the LogBuffer is considered "complete" when the user has entered enough words to form an 47 * n-gram, followed by enough additional non-detailed words (that are in the 90%, as per above). 49 * However, the additional non-detailed words are retained, in case the user backspaces to edit 50 * them. The MainLogBuffer then continues to add words, publishing individual non-detailed words 51 * as new words arrive. After enough non-detailed words have been pushed out to account for th 162 final String[] words = logUnit.getWordsAsStringArray(); local [all...] |
/external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/ |
JUnitCodeGen.java | 343 List<String> words = new ArrayList<String>(); local 349 words.add(word.toString()); 352 words.add(String.valueOf(t.charAt(i))); 359 words.add(word.toString()); 383 words.add(word.toString()); 391 words.add(word.toString()); 393 //System.out.println("words="+words); 395 for (int j=0; j<words.size(); j++) { 396 if ( j>0 && !words.get(j).equals(")") & [all...] |
/packages/apps/Mms/tests/src/com/android/mms/ui/ |
LongThreadTest.java | 45 * NOTE: you first have to put the unix words file on the device: 46 * example: adb push ~/words /data/data/com.android.mms/files 84 // Read in dictionary of words 85 mWords = new ArrayList<String>(98568); // count of words in words file 88 Log.v(TAG, "Loading dictionary of words"); 89 FileInputStream words = mActivity.openFileInput("words"); local 91 while ((c = words.read()) != -1) { 102 words.close() [all...] |
/build/tools/atree/ |
files.cpp | 257 vector<string> words; local 259 split_line(p, &words); 263 for (size_t k=0; k<words.size(); k++) { 264 printf("'%s' ", words[k].c_str()); 272 for (vector<string>::iterator it = words.begin(); it != words.end(); ++it) {
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/scripts_cvs/searchcvs/www/projectName/ |
searchcvs.php | 152 $hl = words($hl); 245 function words($str) function
|
/external/flac/libFLAC/ |
bitwriter.c | 79 static const unsigned FLAC__BITWRITER_DEFAULT_CAPACITY = 32768u / sizeof(bwword); /* size in words */ 81 static const unsigned FLAC__BITWRITER_DEFAULT_INCREMENT = 4096u / sizeof(bwword); /* size in words */ 83 #define FLAC__WORDS_TO_BITS(words) ((words) * FLAC__BITS_PER_WORD) 84 #define FLAC__TOTAL_BITS(bw) (FLAC__WORDS_TO_BITS((bw)->words) + (bw)->bits) 105 unsigned capacity; /* capacity of buffer in words */ 106 unsigned words; /* # of complete words in buffer */ member in struct:FLAC__BitWriter 128 /* calculate total words needed to store 'bits_to_add' additional bits */ 129 new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD) [all...] |