| /external/skia/include/core/ |
| SkChecksum.h | 52 const size_t words = bytes/4; local
55 for (size_t i = 0; i < words; i++) {
|
| /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);
100 * if data supplied takes exactly fourteen words of sixteen word buffer.
|
| /external/chromium_org/chrome/tools/convert_dict/ |
| convert_dict_unittest.cc | 99 // Verify this DicReader includes all the input words.
100 EXPECT_EQ(word_list.size(), dic_reader.words().size());
101 for (size_t i = 0; i < dic_reader.words().size(); ++i) {
102 SCOPED_TRACE(base::StringPrintf("dic_reader.words()[%" PRIuS "]: %s",
103 i, dic_reader.words()[i].first.c_str()));
104 base::string16 word(base::UTF8ToUTF16(dic_reader.words()[i].first));
115 writer.SetWords(dic_reader.words());
118 VerifyWords(dic_reader.words(), bdict_data);
139 // Tests whether or not our DicReader can read all the input English words
161 // Tests whether or not our DicReader can read all the input Russian words
[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/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/ |
| OpenWnnClauseConverterJAJP.java | 36 /** search cache for unique independent words (jiritsugo) */
38 /** search cache for all independent words (jiritsugo) */
40 /** search cache for ancillary words (fuzokugo) */
392 * Get all exact matched ancillary words(Fuzokugo) list.
395 * @return List of ancillary words
425 /* search ancillary words */
432 /* concatenate sequence of ancillary words */
454 * Get all exact matched independent words(Jiritsugo) list.
457 * @param all {@code true} if list all words; {@code false} if list words which has an unique part of speech tag
465 ArrayList<WnnWord> words = (all)? mAllIndepWordBag.get(input) : mIndepWordBag.get(input); local
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| nntplib.py | 348 words = resp.split()
350 n = len(words)
352 count = words[1]
354 first = words[2]
356 last = words[3]
358 name = words[4].lower()
372 words = resp.split()
375 n = len(words)
377 nr = words[1]
379 id = words[2
[all...] |
| mimetypes.py | 217 words = line.split()
218 for i in range(len(words)):
219 if words[i][0] == '#':
220 del words[i:]
222 if not words:
224 type, suffixes = words[0], words[1:]
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| nntplib.py | 348 words = resp.split()
350 n = len(words)
352 count = words[1]
354 first = words[2]
356 last = words[3]
358 name = words[4].lower()
372 words = resp.split()
375 n = len(words)
377 nr = words[1]
379 id = words[2
[all...] |
| mimetypes.py | 217 words = line.split()
218 for i in range(len(words)):
219 if words[i][0] == '#':
220 del words[i:]
222 if not words:
224 type, suffixes = words[0], words[1:]
|
| /external/chromium_org/third_party/icu/source/common/ |
| dictbe.cpp | 106 // List size, limited by the maximum number of words in the dictionary
195 // How many words in a row are "good enough"?
214 // Minimum number of characters for two words
252 return 0; // Not enough characters for two words
259 PossibleWord words[THAI_LOOKAHEAD]; local
267 // Look for candidate words at the current position
268 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
272 wordLength = words[wordsFound%THAI_LOOKAHEAD].acceptMarked(text);
276 // If there was more than one, see which one can take us forward the most words
284 if (words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| MultiCall.py | 262 words = string.split(sequence[1:-1], '-')
265 while words and words[0] in _modifier_names:
266 modifiers |= 1 << _modifier_names[words[0]]
267 del words[0]
269 if words and words[0] in _type_names:
270 type = _type_names[words[0]]
271 del words[0]
276 if modifiers or words
[all...] |
| FormatParagraph.py | 123 words = re.split("(\s+)", lines[i])
124 for j in range(0, len(words), 2):
125 word = words[j]
133 if j+1 < len(words) and words[j+1] != " ":
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| MultiCall.py | 262 words = string.split(sequence[1:-1], '-')
265 while words and words[0] in _modifier_names:
266 modifiers |= 1 << _modifier_names[words[0]]
267 del words[0]
269 if words and words[0] in _type_names:
270 type = _type_names[words[0]]
271 del words[0]
276 if modifiers or words
[all...] |
| FormatParagraph.py | 123 words = re.split("(\s+)", lines[i])
124 for j in range(0, len(words), 2):
125 word = words[j]
133 if j+1 < len(words) and words[j+1] != " ":
|
| /build/tools/ |
| java-layers.py | 132 for n,words in lines:
133 if len(words) == 1:
134 lower = words[0]
151 elif len(words) == 2:
152 lower = words[0]
153 upper = words[1]
165 sys.stderr.write("%s:%d: Too many words on line starting at \'%s\'\n" % (
166 filename, n, words[2]))
|
| /external/chromium_org/chrome/browser/spellchecker/ |
| spellcheck_custom_dictionary.cc | 46 // The change contained words to be added that are not valid.
49 // The change contained words to be added that are already in the dictionary.
52 // The change contained words to be removed that are not in the dictionary.
56 // Loads the file at |file_path| into the |words| container. If the file has a
58 // invalid checksum, then returns ChecksumStatus::INVALID and clears |words|.
59 ChecksumStatus LoadFile(const base::FilePath& file_path, WordList& words) {
61 words.clear();
72 base::SplitString(contents, '\n', &words);
76 // Returns true for invalid words and false for valid words
399 WordList words; local
[all...] |
| /external/chromium_org/content/common/android/ |
| address_parser_unittest.cc | 19 void TokenizeWords(const base::string16& content, WordList* words) const {
23 words->push_back(Word(tokenizer.token_begin(), tokenizer.token_end()));
50 WordList words; local
51 words.push_back(Word(tokenizer.token_begin(), tokenizer.token_end()));
52 return FindStateStartingInWord(&words, 0, &state_last_word, &tokenizer,
66 WordList words; local
67 TokenizeWords(zip_16, &words);
68 EXPECT_TRUE(words.size() == 1);
69 return ::IsZipValid(words.front(), state_index);
74 WordList words; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
| nouveau_mm.c | 117 int words, ret; local
120 words = ((size >> chunk_order) + 31) / 32;
121 assert(words);
123 slab = MALLOC(sizeof(struct mm_slab) + words * 4);
127 memset(&slab->bits[0], ~0, words * 4);
|
| /external/chromium_org/tools/deep_memory_profiler/lib/ |
| bucket.py | 146 words = line.split()
150 for index, word in enumerate(words):
161 stacktrace = [int(address, 16) for address in words[stacktrace_begin:]]
164 self._buckets[int(words[0])] = Bucket(
165 stacktrace, words[1], typeinfo, typeinfo_name)
|
| /external/chromium_org/ui/views/corewm/ |
| tooltip_aura.cc | 89 // We break the line at word boundaries, then stuff as many words as we can
90 // in the available width to the current line, and move the remaining words
92 std::vector<base::string16> words; local
93 base::SplitStringDontTrim(*l, ' ', &words);
96 for (std::vector<base::string16>::iterator w = words.begin();
97 w != words.end(); ++w) {
99 if (w + 1 != words.end())
|
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_mm.c | 117 int words, ret; local
120 words = ((size >> chunk_order) + 31) / 32;
121 assert(words);
123 slab = MALLOC(sizeof(struct mm_slab) + words * 4);
127 memset(&slab->bits[0], ~0, words * 4);
|
| /developers/build/prebuilts/androidtv/leanback/app/src/main/java/com/example/android/leanback/ |
| SearchFragment.java | 64 private void queryByWords(String words) {
66 if (!TextUtils.isEmpty(words)) {
67 mDelayedLoad.setSearchQuery(words);
|
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/ |
| bn_lib.c | 298 /* The caller MUST check that words > b->dmax before calling this */
299 static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
307 if (words > (INT_MAX/(4*BN_BITS2)))
317 a=A=(BN_ULONG *)OPENSSL_malloc(sizeof(BN_ULONG)*words);
356 memset(A,0,sizeof(BN_ULONG)*words);
375 BIGNUM *bn_dup_expand(const BIGNUM *b, int words)
382 * words <= b->dmax && top < words
387 if (words > b->dmax)
389 BN_ULONG *a = bn_expand_internal(b, words);
[all...] |
| /external/openssl/crypto/bn/ |
| bn_lib.c | 298 /* The caller MUST check that words > b->dmax before calling this */
299 static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
307 if (words > (INT_MAX/(4*BN_BITS2)))
317 a=A=(BN_ULONG *)OPENSSL_malloc(sizeof(BN_ULONG)*words);
356 memset(A,0,sizeof(BN_ULONG)*words);
375 BIGNUM *bn_dup_expand(const BIGNUM *b, int words)
382 * words <= b->dmax && top < words
387 if (words > b->dmax)
389 BN_ULONG *a = bn_expand_internal(b, words);
[all...] |
| /build/core/ |
| product_config.mk | 96 ifneq ($(words $(product_goals)),1)
102 ifneq ($(words $(product_goals)),2)
151 ifneq ($(words $(unbundled_goals)),1)
224 ifneq (1,$(words $(current_product_makefile)))
272 ifeq ($(words $(PRODUCT_RUNTIMES)),1)
362 ifneq (1,$(words $(PRODUCT_DEFAULT_DEV_CERTIFICATE)))
368 # A list of words like <source path>:<destination path>[:<owner>].
394 # An list of whitespace-separated words.
|
