| /external/v8/test/mjsunit/ |
| regexp-results-cache.js | 73 var words = string.split(" "); variable
74 assertEquals("Friends,", words[0]);
75 words[0] = "Enemies,";
76 words = string.split(" ");
77 assertEquals("Friends,", words[0]);
|
| /device/google/contexthub/firmware/inc/cpu/cortexm4f/ |
| atomicBitset.h | 26 uint32_t words[]; member in struct:AtomicBitset
|
| /device/google/contexthub/firmware/inc/cpu/x86/ |
| atomicBitset.h | 25 uint32_t words[]; member in struct:AtomicBitset
|
| /external/skia/src/core/ |
| SkChecksum.cpp | 18 const size_t words = bytes/4; local
20 for (size_t i = 0; i < words; i++) {
33 const aliased_uint8_t* safe_tail = (const uint8_t*)(safe_data + 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-openbsd/lib/libc/net/ |
| 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));
121 if (words[i] == 0) {
169 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
175 advance = snprintf(tp, ep - tp, "%x", words[i]);
|
| /device/google/contexthub/firmware/src/platform/stm32f4xx/ |
| crc.c | 54 const uint32_t *words = (const uint32_t *)buf; local
69 mCrcRegs->DR = words[i];
73 memcpy(&word, words + numWords, leftoverBytes);
|
| /external/c-ares/ |
| inet_ntop.c | 130 unsigned int words[NS_IN6ADDRSZ / NS_INT16SZ]; local
138 memset(words, '\0', sizeof(words));
140 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
146 if (words[i] == 0) {
183 (best.len == 7 && words[7] != 0x0001) ||
184 (best.len == 5 && words[5] == 0xffff))) {
190 tp += sprintf(tp, "%x", words[i]);
|
| inet_net_pton.c | 289 int words; local
356 words = (bits + 15) / 16;
357 if (words < 2)
358 words = 2;
360 words = 8;
361 endp = tmp + 2 * words;
|
| /external/curl/lib/ |
| inet_ntop.c | 93 unsigned long words[IN6ADDRSZ / INT16SZ]; local
100 memset(words, '\0', sizeof(words));
102 words[i/2] |= (src[i] << ((1 - (i % 2)) << 3));
110 if(words[i] == 0) {
144 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
152 tp += snprintf(tp, 5, "%lx", words[i]);
|
| /external/valgrind/memcheck/tests/ |
| test-plo.c | 73 UWord* words = malloc(3 * sizeof(UWord)); local
74 free(words);
77 UWord w = words[1];
|
| /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/tcpdump/missing/ |
| inet_ntop.c | 114 u_long words [IN6ADDRSZ / INT16SZ]; local
121 memset (words, 0, sizeof(words));
123 words[i/2] |= (src[i] << ((1 - (i % 2)) << 3));
131 if (words[i] == 0)
171 (best.len == 6 || (best.len == 5 && words[5] == 0xffff)))
181 tp += sprintf (tp, "%lx", words[i]);
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_bitmask.c | 53 util_bitmask_word *words; member in struct:util_bitmask
72 bm->words = (util_bitmask_word *)CALLOC(UTIL_BITMASK_INITIAL_WORDS, sizeof(util_bitmask_word));
73 if(!bm->words) {
114 new_words = (util_bitmask_word *)REALLOC((void *)bm->words,
125 bm->words = new_words;
174 if(!(bm->words[word] & mask))
190 assert(!(bm->words[word] & mask));
191 bm->words[word] |= mask;
215 bm->words[word] |= mask;
240 bm->words[word] &= ~mask
[all...] |
| /external/v8/tools/ |
| trace-maps-processor.py | 90 words = line.split(" ") variable
91 event = words[1]
93 assert words[2] == "map="
94 assert words[4] == "SFI="
95 new_map = AddMap(words[3], "SFI#%s" % words[5])
98 if words[2] == "from=" and words[4] == "to=":
99 from_map = words[3]
100 to_map = words[5
[all...] |
| /packages/apps/Launcher3/src/com/android/launcher3/allapps/ |
| DefaultAppSearchAlgorithm.java | 61 // Do an intersection of the words in the query and each title, and filter out all the
62 // apps that don't match all of the words in the query.
77 String[] words = SPLIT_PATTERN.split(title.toLowerCase()); local
80 for (int i = 0; i < words.length; i++) {
81 if (words[i].startsWith(queryWords[qi])) {
87 // If there is a word in the query that does not match any words in this
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/plat-mac/lib-scriptpackages/SystemEvents/ |
| Text_Suite.py | 85 """word - This subdivides the text into words. """
92 words = word variable
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/plat-mac/lib-scriptpackages/Terminal/ |
| Text_Suite.py | 85 """word - This subdivides the text into words. """
92 words = word variable
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/SystemEvents/ |
| Text_Suite.py | 85 """word - This subdivides the text into words. """
92 words = word variable
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/Terminal/ |
| Text_Suite.py | 85 """word - This subdivides the text into words. """
92 words = word variable
|
| /development/samples/SearchableDictionary/src/com/example/android/searchabledict/ |
| SearchableDictionary.java | 110 SimpleCursorAdapter words = new SimpleCursorAdapter(this, local
112 mListView.setAdapter(words);
|
| /external/elfutils/lib/ |
| md5.c | 289 const md5_uint32 *words = buffer; local
291 const md5_uint32 *endp = words + nwords;
306 while (words < endp)
316 unit is a 32-bit word and it is determined to work on words in
319 we store the swapped words in the array CORRECT_WORDS. */
324 a += FF (b, c, d) + (*cwp++ = SWAP (*words)) + T; \
325 ++words; \
359 /* For the second to fourth round we have the possibly swapped words
|
| sha1.c | 219 const sha1_uint32 *words = buffer; local
221 const sha1_uint32 *endp = words + nwords;
237 while (words < endp)
247 unit is a 32-bit word and it is determined to work on words in
254 W (i) = SWAP (*words); \
256 ++words; \
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/format/ |
| RbnfLenientScannerTest.java | 221 String words = testData[i][0]; local
223 String actualNumber = decFmt.format(formatter.parse(words));
227 + words + ", expected " + expectedNumber
|
