Searched refs:word (Results 126 - 150 of 709) sorted by relevance

1234567891011>>

/external/chromium_org/components/query_parser/
H A Dquery_parser.h21 base::string16 word; member in struct:query_parser::QueryWord
23 // The starting position of the word in the original text.
43 // Returns true if this node matches |word|. If |exact| is true, the string
45 virtual bool Matches(const base::string16& word, bool exact) const = 0;
70 // false positives. Moreover, the current ICU word breaker gives us
71 // back every single Chinese character as a word so that there's no
75 static bool IsWordLongEnoughForPrefixSearch(const base::string16& word);
106 // Extracts the words from |text|, placing each word into |words|.
/external/chromium_org/ui/app_list/search/
H A Dterm_break_iterator.cc14 TermBreakIterator::TermBreakIterator(const base::string16& word) argument
15 : word_(word),
18 iter_(new base::i18n::UTF16CharIterator(&word)),
/external/llvm/test/MC/ARM/
H A Deh-directive-cantunwind.s7 @ in corresponding .ARM.exidx, and its second word should be EXIDX_CANTUNWIND.
41 @ The first word should be the offset to .text.
42 @ The second word should be EXIDX_CANTUNWIND (01000000).
/external/srec/srec/Vocabulary/include/
H A DSR_Vocabulary.h52 * Returns phonetic representation of word.
55 * @param word Word to check for
56 * @param pronunciation [out] Phonetic representation of word
60 ESR_ReturnCode(*getPronunciation)(struct SR_Vocabulary_t* self, const LCHAR* word, LCHAR* pronunciation, size_t* len);
121 * Adds word to vocabulary.
124 * @param word Word to be added
127 SREC_VOCABULARY_API ESR_ReturnCode SR_VocabularyAddWord(SR_Vocabulary* self, const LCHAR* word);
146 * Looks up a word to vocabulary.
149 * @param word Word to be added
154 SREC_VOCABULARY_API ESR_ReturnCode SR_VocabularyGetPronunciation(SR_Vocabulary* self, const LCHAR* word, LCHA
[all...]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
H A Dtraverse_util.js7 * next (or previous) character, word, sentence, line, or paragraph,
427 * Finds the next word, starting from endCursor. Upon exit, startCursor
428 * and endCursor will surround the next word. A word is defined to be
431 * word returned.
433 * word. On exit, will point to the end of the word returned.
436 * @return {?string} The next word, or null if the bottom of the
455 // character in our word. It's safe to decrement |index| because
461 // Keep building up our word unti
465 var word = c; variable
525 var word = c; variable
[all...]
/external/chromium_org/chrome/browser/spellchecker/
H A Dspellcheck_custom_dictionary.h38 // Adds |word| in this change.
39 void AddWord(const std::string& word);
41 // Removes |word| in this change.
42 void RemoveWord(const std::string& word);
83 // Adds |word| to the dictionary, schedules a write to disk, and notifies
84 // observers of the change. Returns true if |word| is valid and not a
86 bool AddWord(const std::string& word);
88 // Removes |word| from the dictionary, schedules a write to disk, and notifies
89 // observers of the change. Returns true if |word| was found. Otherwise
91 bool RemoveWord(const std::string& word);
[all...]
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/tests/
H A Dgenopcode.asm6 ;mov al, word 0
8 mov [0], word 0
14 ;mov eax, word 0
31 movzx ebx, word [eax]
37 push word cs
116 fild word [0]
143 fiadd word [10]
147 fstcw word [4]
150 fstsw word [0]
170 call far word [labe
[all...]
/external/ppp/pppd/
H A Dpppcrypt.c42 unsigned int word; local
44 word = (unsigned)input[startBit / 8] << 8;
45 word |= (unsigned)input[startBit / 8 + 1];
47 word >>= 15 - (startBit % 8 + 7);
49 return word & 0xFE;
/external/srec/srec/crec/
H A Dastar_pphash.c44 ie see whether the word history is the same */
58 diff = parp1->word - parp2->word;
83 hashval = (hashval << 10) + parp->word;
86 if (parp->word != MAXwordID)
87 hashval = hashval * 64 + parp->word + hashval % 65536;
/external/chromium_org/third_party/brotli/src/brotli/enc/
H A Dtransform.h201 const Transform& t, const uint8_t* word, int len) {
210 ret += std::string(word + skip, word + len);
213 ret += std::string(word, word + len);
236 const uint8_t* word = &kBrotliDictionary[offset]; local
237 return ApplyTransform(kTransforms[t], word, len_code);
200 ApplyTransform( const Transform& t, const uint8_t* word, int len) argument
/external/bison/lib/
H A Dabitset.c29 of words. Any unused bits in the last word must be zero. */
55 bitset_word word; local
57 word = ABITSET_WORDS (src)[0];
60 if (!word)
68 word >>= bitno;
71 of the word of interest. */
75 for (count = 0; word; bitno++)
77 if (word & 1)
79 word >>= 1;
84 for (count = 0; word; bitn
172 bitset_word word; local
211 bitset_word word; local
[all...]
H A Dlbitset.c579 bitset_word word; local
619 of the word of interest. */
629 word =
632 for (; word; bcount--)
634 if (word & BITSET_MSB)
643 word <<= 1;
672 bitset_word word; local
716 word = srcp[windex - elt->index] >> (bitno % BITSET_WORD_BITS);
718 for (; word; bitno++)
720 if (word
1390 bitset_word word; local
[all...]
H A Debitset.c600 of the word of interest. */
618 bitset_word word; local
620 word = srcp[woffset] << (BITSET_WORD_BITS - 1 - bcount);
622 for (; word; bcount--)
624 if (word & BITSET_MSB)
633 word <<= 1;
664 bitset_word word; local
692 word = srcp[windex - woffset] >> (bitno % BITSET_WORD_BITS);
694 for (; word; bitno++)
696 if (word
[all...]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/host/interface/
H A Dabstract_tts.js83 // dictionary on word boundaries, ignoring case.
85 for (var word in cvox.AbstractTts.PRONUNCIATION_DICTIONARY) {
86 words.push(word);
253 function(word) {
254 return cvox.AbstractTts.PRONUNCIATION_DICTIONARY[word.toLowerCase()];
274 text = text.replace(/[A-Z]+/g, function(word) {
275 // If a word contains vowels and is more than 3 letters long, it is
276 // probably a real word and not just an abbreviation. Convert it to lower
278 if ((word.length > 3) && word
[all...]
/external/chromium_org/net/tools/tld_cleanup/
H A Dmake_dafsa.py8 representation of an unordered word list (dictionary).
22 a label and each word is represented by the labels in one path from
202 """Generates a DAFSA from a word list and returns the source node.
204 Each word is split into characters so that each character is represented by
205 a unique node. It is assumed the word list is not empty.
209 def ToNodes(word):
211 if not 0x1F < ord(word[0]) < 0x80:
213 if len(word) == 1:
214 return chr(ord(word[0]) & 0x0F), [None]
215 return word[
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/
H A Dxml.js134 return "word";
222 if (type == "word") {
232 if (type == "word") {
264 if (type == "word") {
289 if (type == "word" && Kludges.allowUnquoted) {setStyle = "string"; return attrState;}
/external/chromium_org/third_party/icu/source/test/intltest/
H A Dthcoll.cpp91 // Loop through each word in the dictionary and compare it to the previous
92 // word. They should be in sorted order.
94 UnicodeString lastWord, word; local
97 while (names.readLineSkippingComments(word, ec, FALSE) && U_SUCCESS(ec)) {
103 logln((UnicodeString)"Word " + wordCount + ": " + IntlTest::prettify(word, str));
107 Collator::EComparisonResult result = coll->compare(lastWord, word);
108 doTest(coll, lastWord, word, result);
110 lastWord = word;
138 // Loop through each word in the dictionary and compare it to the previous
139 // word
141 UnicodeString lastWord, word; local
[all...]
/external/icu/icu4c/source/test/intltest/
H A Dthcoll.cpp92 // Loop through each word in the dictionary and compare it to the previous
93 // word. They should be in sorted order.
95 UnicodeString lastWord, word; local
98 while (names.readLineSkippingComments(word, ec, FALSE) && U_SUCCESS(ec)) {
104 logln((UnicodeString)"Word " + wordCount + ": " + IntlTest::prettify(word, str));
108 Collator::EComparisonResult result = coll->compare(lastWord, word);
109 doTest(coll, lastWord, word, result);
111 lastWord = word;
139 // Loop through each word in the dictionary and compare it to the previous
140 // word
142 UnicodeString lastWord, word; local
[all...]
/external/zlib/src/contrib/gcc_gvmat64/
H A Dgvmat64.S230 //;;; It is then shifted into the high word, to make room for the wmask
289 movzx r12d,word ptr [r9]
290 movzx ebx, word ptr [r9 + r11 - 1]
298 cmp bx,word ptr [rsi + r8 - 1]
306 movzx r8d, word ptr [rdi + r8*2]
318 cmp bx,word ptr [rsi + r8 - 1]
326 movzx r8d, word ptr [rdi + r8*2]
337 cmp bx,word ptr [rsi + r8 - 1]
345 movzx r8d, word ptr [rdi + r8*2]
357 cmp bx,word pt
[all...]
/external/chromium_org/third_party/libsrtp/srtp/crypto/math/
H A Ddatatypes.c339 /* copy each word from left size to right side */
346 /* set each word to the "or" of the two bit-shifted words */
426 v->word = NULL;
428 v->word = (uint32_t*)crypto_alloc(l);
429 if (v->word == NULL) {
430 v->word = NULL;
446 if (v->word != NULL)
447 crypto_free(v->word);
448 v->word = NULL;
456 memset(x->word,
[all...]
/external/srtp/crypto/math/
H A Ddatatypes.c339 /* copy each word from left size to right side */
346 /* set each word to the "or" of the two bit-shifted words */
426 v->word = NULL;
428 v->word = (uint32_t*)crypto_alloc(l);
429 if (v->word == NULL) {
430 v->word = NULL;
446 if (v->word != NULL)
447 crypto_free(v->word);
448 v->word = NULL;
456 memset(x->word,
[all...]
/external/chromium_org/native_client_sdk/src/tools/lib/tests/
H A Dquote_test.py102 usage='Usage: %prog [options] word...')
123 for word in args:
127 qq = quote.unquote(word, options.special_chars, options.quote)
129 % (word, ''.join(qq)))
134 q = quote.quote(word, options.special_chars, options.quote)
137 % (word, q, q, ''.join(qq)))
138 if word != ''.join(qq):
/external/chromium_org/net/websockets/
H A Dwebsocket_deflater_test.cc107 const std::string word = "Chromium"; local
108 std::string input = word + std::string(256, 'a') + word;
124 const std::string word = "Chromium"; local
125 std::string input = word + std::string(256, 'a') + word;
/external/chromium_org/ui/gfx/
H A Dtext_elider.cc339 // Add a word to the rectangular region at the current position,
341 void AddWord(const base::string16& word);
419 void RectangleString::AddWord(const base::string16& word) { argument
420 if (word.length() < max_cols_) {
422 if (current_col_ + word.length() >= max_cols_)
424 Append(word);
429 base::i18n::UTF16CharIterator chars(&word);
433 Append(word.substr(array_start, chars.array_pos() - array_start));
442 Append(word.substr(array_start, chars.array_pos() - array_start));
508 // Wrap the specified word acros
613 const base::string16& word = words.GetString(); local
637 WrapWord(const base::string16& word) argument
658 AddWordOverflow(const base::string16& word) argument
685 AddWord(const base::string16& word) argument
[all...]
/external/llvm/test/MC/AArch64/
H A Dinline-asm-modifiers.s170 .word 0 // 0x0
177 .word 0 // 0x0
185 .word 0 // 0x0
192 .word 0 // 0x0
199 .word 0 // 0x0
206 .word 0 // 0x0

Completed in 875 milliseconds

1234567891011>>