Searched defs:words (Results 1 - 25 of 115) sorted by relevance

12345

/external/chromium_org/v8/test/mjsunit/
H A Dregexp-results-cache.js73 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/
H A Dtwo_client_dictionary_sync_test.cc32 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/
H A Ddic_reader.h37 // 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.
/external/qemu/util/
H A Dbitops.c133 unsigned long words; local
137 words = size / BITS_PER_LONG;
141 tmp = (addr[words] & (~0UL >> (BITS_PER_LONG
148 while (words) {
149 tmp = addr[--words];
152 return words * BITS_PER_LONG + BITS_PER_LONG - 1 - clzl(tmp);
/external/valgrind/main/memcheck/tests/
H A Dtest-plo.c73 UWord* words = malloc(3 * sizeof(UWord)); local
74 free(words);
77 UWord w = words[1];
H A Dwrap6.c182 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[
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...]
/external/libvorbis/doc/
H A D02-bitpacking.tex16 bitstream into an actual representation in fixed-width words.
19 \subsubsection{octets, bytes and words}
/external/aac/libFDK/src/
H A DFDK_crc.cpp431 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/
H A Dlanguage_dictionary_overlay_handler.cc95 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/chrome/renderer/safe_browsing/
H A Dphishing_term_feature_extractor_unittest.cc56 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
[all...]
/external/chromium_org/content/common/android/
H A Daddress_parser_unittest.cc19 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...]
H A Daddress_parser.cc13 // 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 afte
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/
H A Dmd5_utils.c28 byteSwap(UWORD32 *buf, unsigned words) { argument
43 } while (--words);
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_bitmask.c53 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[wor
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkChecksum.h71 const size_t words = bytes/4; local
75 for (size_t i = 0; i < words; i++) {
/external/libvpx/libvpx/
H A Dmd5_utils.c28 byteSwap(UWORD32 *buf, unsigned words) { argument
43 } while (--words);
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_bitmask.c53 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[wor
[all...]
/external/skia/include/core/
H A DSkChecksum.h52 const size_t words = bytes/4; local
55 for (size_t i = 0; i < words; i++) {
/external/tcpdump/missing/
H A Dinet_ntop.c118 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/chromium_org/chrome/browser/history/
H A Din_memory_url_index_types.cc96 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/elfutils/0.153/lib/
H A Dsha1.c227 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/flac/libFLAC/
H A Dmd5.c142 static void byteSwap(FLAC__uint32 *buf, unsigned words) argument
149 } while (--words);
173 #define byteSwap(buf, words)
/external/jpeg/
H A Dansi2knr.c506 { static char *words[] = local
513 char **key = words;
/external/qemu/distrib/jpeg-6b/
H A Dansi2knr.c506 { static char *words[] = local
513 char **key = words;
/external/chromium_org/chrome/browser/spellchecker/
H A Dspellcheck_custom_dictionary_unittest.cc43 // 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
425 const WordSet& words = dictionary->GetWords(); local
477 WordSet words = custom_dictionary->GetWords(); local
[all...]

Completed in 5444 milliseconds

12345