| /frameworks/base/core/java/android/widget/ |
| SimpleAdapter.java | 354 String[] words = str.split(" "); local
355 int wordCount = words.length;
358 String word = words[k];
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/x86/ |
| mfqe_sse2.asm | 34 pshuflw xmm0, xmm0, 0x0 ; replicate to all low words
35 punpcklqdq xmm0, xmm0 ; replicate to all hi words
111 pshuflw xmm0, xmm0, 0x0 ; replicate to all low words
112 punpcklqdq xmm0, xmm0 ; replicate to all hi words
209 ; and operate on words.
222 ; phaddd only operates on adjacent double words.
|
| /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/native/jni/src/ |
| defines.h | 112 #define DUMP_SUGGESTION(words, frequencies, index, score) \
113 do { dumpWordInfo(words, frequencies, index, score); } while (0)
167 #define DUMP_SUGGESTION(words, frequencies, index, score)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/ |
| extension.py | 169 words = split_quoted(line)
178 module = words[0]
182 for word in words[1:]:
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/ |
| extension.py | 169 words = split_quoted(line)
178 module = words[0]
182 for word in words[1:]:
|
| /ndk/sources/host-tools/make-3.81/ |
| function.c | 75 whitespace-delimited words. */
96 /* When matching by words, the empty string should match
114 /* If we're substituting only by fully matched words,
115 or only at the ends of words, check that this case qualifies. */
425 If the two arguments have a different number of words,
426 the excess words are just output separated by blanks. */
683 char *words = argv[0]; /* Use a temp variable for find_next_token */
684 char *p = find_next_token (&words, &i);
696 char *words = argv[0]; /* Use a temp variable for find_next_token */
700 while ((t = find_next_token (&words, &i))
676 char *words = argv[0]; \/* Use a temp variable for find_next_token *\/ local
689 char *words = argv[0]; \/* Use a temp variable for find_next_token *\/ local
934 int words = 0; local
1133 char **words = 0; local
[all...] |
| /external/chromium_org/ppapi/generators/ |
| idl_diff.py | 123 # Return True if this change is only different in the way 'words' are spaced
269 words = line[2:].split()
270 if len(words) == 2 and words[1][-1] == ';':
271 if words[0] == 'struct' or words[0] == 'union':
|
| /external/chromium_org/tools/deep_memory_profiler/subcommands/ |
| policies.py | 188 words = line.split()
189 bucket = bucket_set.get(int(words[BUCKET_ID]))
196 sizes[component_match] += int(words[COMMITTED])
200 sizes['tc-total-log'] += int(words[COMMITTED])
202 sizes['other-total-log'] += int(words[COMMITTED])
|
| /external/valgrind/main/coregrind/ |
| m_sparsewa.c | 3 /*--- An sparse array (of words) implementation. ---*/
57 UWord words[256]; member in struct:__anon36286
207 *valP = level0->words[curr_ix];
306 *valP = level0->words[ix];
362 level0->words[ix] = val;
407 *oldV = level0->words[ix];
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| OpenWnnDictionaryImpl.java | 96 /** The max words of user dictionary */
98 /** The max words of learning dictionary */
491 /* If the cursor is not exist or the type of query is changed, compile the query string and query words */
511 /* If the cursor is exist, bind new arguments and re-query words (DO NOT recompile the query string) */
521 /* If querying is succeed, count the number of words */
712 /* Count all words in the user dictionary */
721 /* Retrieve all words in the user dictionary */
722 WnnWord[] words = new WnnWord[ numOfWords ]; local
726 words[ i ] = new WnnWord();
727 words[ i ].stroke = cursor.getString( 0 )
931 WnnWord[] words = new WnnWord[1]; local
981 WnnWord[] words = new WnnWord[1]; local
[all...] |
| /prebuilts/gcc/darwin-x86/x86/x86_64-linux-android-4.9/lib/gcc/x86_64-linux-android/4.9/gcov-src/ |
| gcov-io.c | 48 unsigned overread; /* Number of words overread. */
303 gcov_write_words (unsigned words)
319 if (gcov_var.offset + words > gcov_var.alloc)
320 gcov_allocate (gcov_var.offset + words);
323 gcov_var.offset += words;
492 gcov_read_words (unsigned words)
498 if (excess < words)
516 if (gcov_var.length + words > gcov_var.alloc)
517 gcov_allocate (gcov_var.length + words);
523 if (gcov_var.length < words)
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/bench/ |
| numa.c | 700 long words = bytes/sizeof(u64); local
707 BUG_ON(!data && words);
708 BUG_ON(data && !words);
720 chunk_0 = words/nr_max;
721 chunk_1 = words/g->p.nr_loops;
724 while (off >= words)
725 off -= words;
731 for (i = 0; i < words/1024; i++) {
736 start = lfsr % words;
737 end = min(start + 1024, words-1)
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| keywords-and-reserved_words.js | 28 // Test proper handling of keywords, future reserved words and
29 // future reserved words in strict mode as specific by 7.6.1 and 7.6.2
67 // Check for strict mode future reserved words.
148 // 7.6.1.2 Future Reserved Words (without "const")
161 // 7.6.1.2 Future Reserved Words, in strict mode only.
|
| /external/netperf/ |
| netlib.c | 550 unsigned int words[2];
569 conv_rec.words[0] = htonl(conv_rec.words[0]);
570 conv_rec.words[1] = htonl(conv_rec.words[1]);
582 unsigned int scratch = conv_rec.words[0];
583 conv_rec.words[0] = conv_rec.words[1];
584 conv_rec.words[1] = scratch;
599 unsigned int words[2]
545 unsigned int words[2]; member in union:__anon31816
594 unsigned int words[2]; member in union:__anon31817
2453 long words[2]; member in union:overlay_u
2474 long words[2]; member in union:overlay_u
[all...] |
| /external/chromium_org/chrome/browser/history/ |
| url_index_private_data.cc | 167 // the index we need individual, lower-cased words, ignoring escapings. For
174 // Extract individual 'words' (as opposed to 'terms'; see below) from the
176 // four 'words': "colspec", "id", "mstone" and "release".
181 // Do nothing if we have indexed no words (probably because we've not been
182 // initialized yet) or the search string has no words.
229 // We call these 'terms' (as opposed to 'words'; see above) as in this case
237 // possible that the word break iterater that extracts words to search
238 // for in the database allows some whitespace "words" whereas Tokenize
241 // are no terms (i.e., all the words are some form of whitespace),
313 // changed. If so, then update the index with the changed words
754 String16Set words = base::STLSetUnion<String16Set>(url_words, title_words); local
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/fx/ |
| bg.js | 27 // Map of query parameter words to sounds.
293 var words = q.split(" ");
294 for (j in words) {
295 if (searchSounds[words[j]]) {
296 console.log("searchSound: " + words[j]);
297 playNavSound(words[j]);
|
| /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...] |
| /bionic/libc/kernel/uapi/drm/ |
| tegra_drm.h | 86 __u32 words; member in struct:drm_tegra_cmdbuf
|
| /build/core/ |
| node_fns.mk | 89 # with "|||" separating the words.
91 # breaking haystack back into multiple words, with spaces
93 # - Add needle between the first and second words of haystack.
95 # individual words.
99 $(if $(filter-out 0 1,$(words $(filter $(2),$(1)))), \
113 # and finds instances of words beginning with INHERIT_TAG. Scrape
115 # unique set of those words.
138 # get list of inherited words; if not empty:
|
| /external/chromium_org/chrome/browser/spellchecker/ |
| spellcheck_custom_dictionary.h | 18 // Defines a custom dictionary where users can add their own words. All words
44 // Prepares this change to be applied to |words| by removing duplicate and
45 // invalid words from words to be added, removing missing words from words
46 // to be removed, and sorting both lists of words. Assumes that |words| is
48 int Sanitize(const chrome::spellcheck_common::WordSet& words);
[all...] |
| /external/chromium_org/native_client_sdk/src/libraries/nacl_io/httpfs/ |
| http_fs.cc | 293 std::vector<std::string> words; local
294 sdk_util::SplitString(lines[i], ' ', &words);
296 // Remove empty words (due to multiple consecutive spaces).
298 for (std::vector<std::string>::const_iterator it = words.begin();
299 it != words.end();
|
| /external/chromium_org/third_party/icu/source/common/ |
| triedict.h | 80 * <p>Find dictionary words that match the text.</p>
85 * @param lengths An array that is filled with the lengths of words that matched.
87 * @param limit The size of the lengths array; this limits the number of words output.
88 * @param values An array that is filled with the values associated with the matched words.
99 * <p>Return a StringEnumeration for iterating all the words in the dictionary.</p>
114 * <p>MutableTrieDictionary is a TrieWordDictionary that allows words to be
176 * <p>Find dictionary words that match the text.</p>
181 * @param lengths An array that is filled with the lengths of words that matched.
183 * @param limit The size of the lengths array; this limits the number of words output.
184 * @param values An array that is filled with the values associated with the matched words
[all...] |
| /external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
| filters_neon.S | 54 @ lower 32-bit words. Note that we don't care about the value of the upper
67 vclz.s32 d5, d16 @ Leading zeros of the two 32 bit words.
|
| /external/fonttools/Lib/fontTools/ttLib/tables/ |
| ttProgram.py | 9 # first, the list of instructions that eat bytes or words from the instruction stream
327 # Will write bytes as words
331 # Write words
366 words = mnemonic[-1] == "W"
376 if words:
409 words = mnemonic[-1] == "W"
417 if not words:
|
