| /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/inet/ |
| inet_ntop.c | 106 u_int words[IN6ADDRSZ / INT16SZ]; local
115 memset(words, '\0', sizeof words);
117 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
123 if (words[i] == 0) {
167 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
173 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...] |
| /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/jpeg/ |
| ansi2knr.c | 506 { static char *words[] = local
513 char **key = words;
|
| /external/valgrind/main/memcheck/tests/ |
| 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...] |
| /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/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...] |
| bitreader.c | 81 * This should be at least twice as large as the largest number of words
94 static const unsigned FLAC__BITREADER_DEFAULT_CAPACITY = 65536u / FLAC__BITS_PER_WORD; /* in words */
140 unsigned capacity; /* in words */
141 unsigned words; /* # of completed words in buffer */ member in struct:FLAC__BitReader
142 unsigned bytes; /* # of bytes in incomplete word at buffer[words] */
143 unsigned consumed_words; /* #words ... */
217 end = br->words + (br->bytes? 1:0);
220 br->words -= start;
227 bytes = (br->capacity - br->words) * FLAC__BYTES_PER_WORD - br->bytes
[all...] |
| /external/icu4c/common/ |
| dictbe.cpp | 103 // List size, limited by the maximum number of words in the dictionary
192 // How many words in a row are "good enough"?
211 // Minimum number of characters for two words
249 return 0; // Not enough characters for two words
256 PossibleWord words[THAI_LOOKAHEAD]; local
264 // Look for candidate words at the current position
265 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
269 wordLength = words[wordsFound%THAI_LOOKAHEAD].acceptMarked(text);
273 // If there was more than one, see which one can take us forward the most words
281 if (words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0)
[all...] |
| /external/libffi/src/x86/ |
| ffi64.c | 127 of the operand. The number of words is returned. In case the parameter
169 int words = (type->size + UNITS_PER_WORD - 1) / UNITS_PER_WORD; local
178 for (i = 0; i < words; i++)
202 for (i = 0; i < words; i++)
220 return words;
364 /* Allocate the space for the arguments, plus 4 words of temp space. */
|
| /external/llvm/lib/Support/ |
| APInt.cpp | 96 // Calculate the number of words to copy
97 unsigned words = std::min<unsigned>(bigVal.size(), getNumWords()); local
98 // Copy the words from bigVal to pVal
99 memcpy(pVal, bigVal.data(), words * APINT_WORD_SIZE);
134 // assume case where both are single words is already handled
207 /// In other words, if y > x then this function returns 1, otherwise 0.
297 // Split x into high and low words
551 // Otherwise, compare all words
989 // extract the high 52 bits from the correct words in pVal.
1023 // Copy full words
[all...] |
| /external/protobuf/src/google/protobuf/ |
| repeated_field_unittest.cc | 853 std::vector<string> words; member in class:google::protobuf::__anon9296::RepeatedFieldInsertionIteratorsTest
877 words.push_back("Able");
878 words.push_back("was");
879 words.push_back("I");
880 words.push_back("ere");
881 words.push_back("I");
882 words.push_back("saw");
883 words.push_back("Elba");
884 std::copy(words.begin(), words.end()
[all...] |
| /external/valgrind/main/coregrind/ |
| m_sparsewa.c | 3 /*--- An sparse array (of words) implementation. ---*/
57 UWord words[256]; member in struct:__anon12448
207 *valP = level0->words[curr_ix];
306 *valP = level0->words[ix];
362 level0->words[ix] = val;
407 *oldV = level0->words[ix];
|
| /external/webkit/Source/WebKit/qt/WebCoreSupport/ |
| InspectorServerQt.cpp | 208 QStringList words = m_path.split(QLatin1Char('/')); local
235 if ((words.size() == 4)
236 && (words[1] == QString::fromLatin1("devtools"))
237 && (words[2] == QString::fromLatin1("page"))) {
238 int pageNum = words[3].toInt();
|
| /frameworks/base/core/java/android/widget/ |
| SimpleAdapter.java | 354 String[] words = str.split(" "); local
355 int wordCount = words.length;
358 String word = words[k];
|
| /ndk/sources/host-tools/make-3.81/ |
| ansi2knr.c | 504 { static char *words[] = local
511 char **key = words;
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| SuggestedWords.java | 37 private SuggestedWords(List<CharSequence> words, boolean typedWordValid,
40 if (words != null) {
41 mWords = words;
96 public Builder addWords(List<CharSequence> words,
98 final int N = words.size();
107 addWord(words.get(i), suggestedWordInfo);
|
| /external/bison/lib/ |
| bitset.h | 56 bitset_word words[1]; /* The array of bits. */ member in struct:bitset_union::abitset_struct
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_utils.cc | 179 // Returns true if |text| contains each string in |words|. This is used when
182 const std::vector<string16>& words) {
183 for (size_t i = 0; i < words.size(); ++i) {
184 if (text.find(words[i]) == string16::npos)
190 // Returns true if |node|s title or url contains the strings in |words|.
193 const std::vector<string16>& words,
197 l10n_util::ToLower(node->GetTitle()), words) ||
199 l10n_util::ToLower(UTF8ToUTF16(node->GetURL().spec())), words) ||
202 UnescapeRule::NORMAL, NULL, NULL, NULL)), words);
520 std::vector<string16> words; local
522 parser.ExtractQueryWords(l10n_util::ToLower(text), &words); local
540 std::vector<string16> words; local
542 parser.ExtractQueryWords(l10n_util::ToLower(text), &words); local
[all...] |
| /external/iproute2/lib/ |
| utils.c | 455 int words = bits >> 0x05; local
459 if (words)
460 if (memcmp(a1, a2, words << 2))
467 w1 = a1[words];
468 w2 = a2[words];
|
