| /external/chromium_org/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]);
|
| /external/chromium_org/chrome/browser/sync/test/integration/ |
| two_client_dictionary_sync_test.cc | 32 std::vector<std::string> words; local
33 words.push_back("foo");
34 words.push_back("bar");
35 ASSERT_EQ(num_clients(), static_cast<int>(words.size()));
38 ASSERT_TRUE(dictionary_helper::AddWord(i, words[i]));
41 ASSERT_EQ(words.size(), dictionary_helper::GetDictionarySize(0));
44 ASSERT_TRUE(dictionary_helper::RemoveWord(i, words[i]));
51 ASSERT_TRUE(dictionary_helper::AddWord(i, words[i]));
53 ASSERT_EQ(words.size(), dictionary_helper::GetDictionarySize(0));
|
| /external/chromium_org/chrome/tools/convert_dict/ |
| dic_reader.h | 37 // Returns the words read by Read(). These will be in order.
38 const WordList& words() const { return words_; } function in class:convert_dict::DicReader
44 // Contains all words and their corresponding affix index.
|
| /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]);
|
| /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/chromium_org/chrome/browser/ui/webui/options/ |
| language_dictionary_overlay_handler.cc | 95 const chrome::spellcheck_common::WordSet& words = dictionary_->GetWords(); local
96 for (chrome::spellcheck_common::WordSet::const_iterator it = words.begin();
97 it != words.end(); ++it) {
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkChecksum.h | 71 const size_t words = bytes/4; local
75 for (size_t i = 0; i < words; i++) {
|
| /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/chromium_org/chrome/renderer/safe_browsing/ |
| phishing_term_feature_extractor_unittest.cc | 56 base::hash_set<std::string> words; local
57 words.insert("one");
58 words.insert("two");
59 words.insert("multi");
60 words.insert("word");
61 words.insert("test");
62 words.insert("capitalization");
63 words.insert("space");
64 words.insert("separator");
65 words.insert("punctuation")
[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...] |
| address_parser.cc | 13 // Minimum number of words in an address after the house number
18 // Maximum number of words allowed in an address between the house number
30 // Maximum number of words after the house number in which the location name
68 // detected. Start tokenizing the following words to find a valid
83 WordList words; local
84 words.push_back(house_number);
97 if (next_word == words.size()) {
112 words.push_back(Word(tokenizer.token_begin(), tokenizer.token_end()));
117 const Word& current_word = words[next_word];
148 // Look for location names in the words after the house number
[all...] |
| /external/chromium_org/third_party/mesa/src/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/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...] |
| /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);
100 * if data supplied takes exactly fourteen words of sixteen word buffer.
|
| /external/chromium_org/chrome/browser/history/ |
| in_memory_url_index_types.cc | 96 String16Vector words = local
99 for (String16Vector::const_iterator iter = words.begin(); iter != words.end();
114 String16Vector words; local
116 return words;
129 words.push_back(word);
137 return words;
|
| /external/chromium_org/ui/views/corewm/ |
| tooltip_aura.cc | 87 // We break the line at word boundaries, then stuff as many words as we can
88 // in the available width to the current line, and move the remaining words
90 std::vector<base::string16> words; local
91 base::SplitStringDontTrim(*l, ' ', &words);
94 for (std::vector<base::string16>::iterator w = words.begin();
95 w != words.end(); ++w) {
97 if (w + 1 != words.end())
|
| /external/elfutils/0.153/lib/ |
| md5.c | 302 const md5_uint32 *words = buffer; local
304 const md5_uint32 *endp = words + nwords;
319 while (words < endp)
329 unit is a 32-bit word and it is determined to work on words in
332 we store the swapped words in the array CORRECT_WORDS. */
337 a += FF (b, c, d) + (*cwp++ = SWAP (*words)) + T; \
338 ++words; \
372 /* For the second to fourth round we have the possibly swapped words
|
| sha1.c | 227 const sha1_uint32 *words = buffer; local
229 const sha1_uint32 *endp = words + nwords;
245 while (words < endp)
255 unit is a 32-bit word and it is determined to work on words in
262 W (i) = SWAP (*words); \
264 ++words; \
|
| /external/jpeg/ |
| ansi2knr.c | 506 { static char *words[] = local
513 char **key = words;
|
| /external/ltrace/sysdeps/linux-gnu/arm/ |
| fetch.c | 222 /* If the size in words of the argument is not more than r4
229 const size_t words = (sz + 3) / 4; local
231 unsigned char *data = value_reserve(valuep, words * 4);
235 for (i = 0; i < words && ctx->ncrn < 4; ++i) {
239 const size_t rest = (words - i) * 4;
|
| /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...] |
| /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/chromium_org/chrome/browser/spellchecker/ |
| spellcheck_custom_dictionary_unittest.cc | 43 // number of syncable words.
48 const WordSet& words = dictionary->GetWords(); local
49 for (WordSet::const_iterator it = words.begin(); it != words.end(); ++it) {
176 // The custom word list should include written words.
233 // Legacy dictionary with two words should be converted to new format dictionary
234 // with two words.
249 // Illegal words should be removed. Leading and trailing whitespace should be
308 std::vector<std::string> words; local
309 words.push_back("bar")
425 const WordSet& words = dictionary->GetWords(); local
477 WordSet words = custom_dictionary->GetWords(); local
[all...] |
