| /external/v8/test/mjsunit/ |
| keywords-and-reserved_words.js | 75 function testKeyword(word) {
76 // Classify word
77 assertEquals("keyword", classifyIdentifier(word));
80 assertThrows("var " + word + " = 1;", SyntaxError);
81 if (word != "this") {
82 assertThrows("typeof (" + word + ");", SyntaxError);
86 eval("var x = { " + word + " : 42 };");
87 eval("var x = { get " + word + " () {} };");
88 eval("var x = { set " + word + " (value) {} };");
91 eval("var x = { '" + word + "' : 42 };")
[all...] |
| /frameworks/base/services/java/com/android/server/ |
| NativeDaemonEvent.java | 203 // find the end of the word
216 // if we didn't find the end-o-word token, take the rest of the string
218 String word = rawEvent.substring(current, wordEnd); local
219 current += word.length();
221 word = word.trim();
225 // unescape stuff within the word
226 word = word.replace("\\\\", "\\");
227 word = word.replace("\\\"", "\"")
[all...] |
| /external/llvm/utils/ |
| wciia.py | 54 for word in line.split():
55 if word == "N:":
62 if word == "E:":
65 if word == "D:":
68 if word == "F:":
|
| /frameworks/base/core/java/android/provider/ |
| UserDictionary.java | 62 * The MIME type of a {@link #CONTENT_URI} sub-directory of a single word.
69 * The word column.
72 public static final String WORD = "word";
81 * The locale that this word belongs to. Null if it pertains to all
88 * The uid of the application that inserted the word.
94 * An optional shortcut for this word. When the shortcut is typed, supporting IMEs should
95 * suggest the word in this row as an alternate spelling too.
116 /** Adds a word to the dictionary, with the given frequency and the specified
123 * @param word the word to add to the dictionary. This should not be null o
[all...] |
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| Dictionary.java | 70 * previous word.
72 * @param prevWord the previous word, or null if none
78 // TODO: pass more context than just the previous word, to enable better suggestions (n-gram
95 * Checks if the given word occurs in the dictionary
96 * @param word the word to search for. The search should be case-insensitive.
97 * @return true if the word exists, false otherwise
99 abstract public boolean isValidWord(final String word);
101 public int getFrequency(final String word) {
106 * Compares the contents of the character array with the typed word and returns true if the
[all...] |
| ContactsBinaryDictionary.java | 126 for (String word : accountVocabulary) {
128 Log.d(TAG, "loadAccountVocabulary: " + word);
130 super.addWord(word, null /* shortcut */, FREQUENCY_FOR_CONTACTS, 0 /* shortcutFreq */,
206 String word = name.substring(i, end); local
210 final int wordLen = StringUtils.codePointCount(word);
213 Log.d(TAG, "addName " + name + ", " + word + ", " + prevWord);
215 super.addWord(word, null /* shortcut */, FREQUENCY_FOR_CONTACTS,
219 super.addBigram(prevWord, word, FREQUENCY_FOR_CONTACTS_BIGRAM,
223 prevWord = word;
230 * Returns the index of the last letter in the word, starting from position startIndex
315 String word = name.substring(i, end); local
[all...] |
| /external/libgsm/src/ |
| long_term.c | 53 register word * d, /* [0..39] IN */
54 register word * dp, /* [-120..-1] IN */
55 word * bc_out, /* OUT */
56 word * Nc_out /* OUT */
60 word Nc, bc;
61 word wt[40];
65 word R, S, dmax, scal, best_k;
66 word ltp_cut;
68 register word temp, wt_k;
157 register word * d, /* [0..39] IN *
[all...] |
| /external/flac/libFLAC/ |
| bitreader.c | 52 /* Things should be fastest when this matches the machine word size */
55 /* also, some sections currently only have fast versions for 4 or 8 bytes per word */
70 /* counts the # of zero MSBs in a word */
71 #define COUNT_ZERO_MSBS(word) ( \
72 (word) <= 0xffff ? \
73 ( (word) <= 0xff? byte_to_unary_table[word] + 24 : byte_to_unary_table[(word) >> 8] + 16 ) : \
74 ( (word) <= 0xffffff? byte_to_unary_table[word >> 16] + 8 : byte_to_unary_table[(word) >> 24] )
461 const brword word = br->buffer[br->consumed_words]; local
480 const brword word = br->buffer[br->consumed_words]; local
661 const brword word = br->buffer[br->consumed_words++]; local
926 const brword word = br->buffer[cwords]; local
[all...] |
| /packages/inputmethods/OpenWnn/libs/libwnnDictionary/include/ |
| nj_ext.h | 83 extern NJ_INT16 njd_get_word_data(NJ_CLASS *iwnn, NJ_DIC_SET *dicset, NJ_SEARCH_LOCATION_SET *loctset, NJ_UINT16 dic_idx, NJ_WORD *word);
89 extern NJ_INT16 njd_init_word(NJ_WORD* word);
93 extern NJ_INT16 njd_b_get_word(NJ_SEARCH_LOCATION_SET *loctset, NJ_WORD *word);
94 extern NJ_INT16 njd_b_get_candidate(NJ_WORD *word, NJ_CHAR *candidate,
96 extern NJ_INT16 njd_b_get_stroke(NJ_WORD *word, NJ_CHAR *stroke, NJ_UINT16 size);
100 extern NJ_INT16 njd_f_get_word(NJ_SEARCH_LOCATION_SET *loctset, NJ_WORD *word);
101 extern NJ_INT16 njd_f_get_stroke(NJ_WORD *word, NJ_CHAR *stroke,
103 extern NJ_INT16 njd_f_get_candidate(NJ_WORD *word, NJ_CHAR *candidate,
108 extern NJ_INT16 njd_l_add_word(NJ_CLASS *iwnn, NJ_LEARN_WORD_INFO *word,
113 extern NJ_INT16 njd_l_get_word(NJ_CLASS *iwnn, NJ_SEARCH_LOCATION_SET *loctset, NJ_WORD *word);
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/ |
| extension.py | 174 # line, and it must be the first word of the line. I have no idea
182 for word in words[1:]:
184 append_next_word.append(word)
188 suffix = os.path.splitext(word)[1]
189 switch = word[0:2] ; value = word[2:]
195 ext.sources.append(word)
208 ext.extra_compile_args.append(word)
215 elif word == "-rpath":
217 elif word == "-Xlinker"
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/ |
| extension.py | 174 # line, and it must be the first word of the line. I have no idea
182 for word in words[1:]:
184 append_next_word.append(word)
188 suffix = os.path.splitext(word)[1]
189 switch = word[0:2] ; value = word[2:]
195 ext.sources.append(word)
208 ext.extra_compile_args.append(word)
215 elif word == "-rpath":
217 elif word == "-Xlinker"
[all...] |
| /external/chromium_org/chrome/tools/convert_dict/ |
| dic_reader.cc | 19 // Maps each unique word to the unique affix group IDs associated with it.
37 std::string word = line.substr(0, slash_index); local
38 ReplaceSubstringsAfterOffset(&word, 0, "\\/", "/");
39 output->push_back(word);
47 // we read 'all' the words in the file, irrespective of the word count given
53 // does not, then the first line contains a word.
80 // The first part is the word, the second (optional) part is the affix. We
110 // token. (It is attached to the first token if a word doesn't have affix
157 // Add words from the dic file to the word set.
158 // Note that the first line is the word count in the file
[all...] |
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-2499.js | 30 function foo(word, nBits) {
31 return (word[1] >>> nBits) | (word[0] << (32 - nBits));
34 word = [0x1001, 0];
36 var expected = foo(word, 1);
37 foo(word, 1);
39 var optimized = foo(word, 1);
|
| /external/hyphenation/ |
| hyphen.c | 285 char word[MAX_CHARS]; local
386 word[j] = buf[i];
390 word[j] = '\0';
398 if (*word == '.') i++;
403 int pc = (*word == '.') ? 1: 0; /* 8-bit character position */
404 for (; pc < (strlen(word) + 1); pc++) {
406 if ((((unsigned char) word[pc]) >> 6) != 2) pu++;
416 if (*word == '.') replindex--;
421 printf ("word %s pattern %s, j = %d repl: %s\n", word, pattern + i, j, repl)
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/ |
| x86-mont.pl | 280 $word="edi";
285 &mov ($word,$_bp);
289 &sub ("edx",$word); # see if ap==bp
290 &lea ("eax",&DWP(4,$word,$num,4)); # &bp[num]
292 &mov ($word,&DWP(0,$word)); # bp[0]
300 &mul ($word); # ap[j]*bp[0]
310 &mul ($word); # ap[num-1]*bp[0]
311 &mov ($word,$_n0);
315 &imul ($word,&DWP($frame,"esp")); # n0*tp[0
[all...] |
| /external/openssl/crypto/bn/asm/ |
| x86-mont.pl | 280 $word="edi";
285 &mov ($word,$_bp);
289 &sub ("edx",$word); # see if ap==bp
290 &lea ("eax",&DWP(4,$word,$num,4)); # &bp[num]
292 &mov ($word,&DWP(0,$word)); # bp[0]
300 &mul ($word); # ap[j]*bp[0]
310 &mul ($word); # ap[num-1]*bp[0]
311 &mov ($word,$_n0);
315 &imul ($word,&DWP($frame,"esp")); # n0*tp[0
[all...] |
| /packages/inputmethods/LatinIME/tools/dicttool/src/com/android/inputmethod/latin/dicttool/ |
| CombinedInputOutput.java | 24 import com.android.inputmethod.latin.makedict.Word;
49 private static final String WORD_TAG = "word";
124 String word = null; local
133 if (null != word) {
134 dict.add(word, freq, shortcuts.isEmpty() ? null : shortcuts, isNotAWord);
136 dict.setBigram(word, s.mWord, s.mFrequency);
146 word = params[1];
191 if (null != word) {
192 dict.add(word, freq, shortcuts.isEmpty() ? null : shortcuts, isNotAWord);
194 dict.setBigram(word, s.mWord, s.mFrequency)
[all...] |
| /external/chromium_org/chrome/browser/history/ |
| query_parser.cc | 73 // or a single word (a QueryNodeWord).
75 // A QueryNodeWord is a single word in the query.
78 explicit QueryNodeWord(const base::string16& word);
81 const base::string16& word() const { return word_; } function in class:QueryNodeWord
88 virtual bool Matches(const base::string16& word, bool exact) const OVERRIDE;
103 QueryNodeWord::QueryNodeWord(const base::string16& word)
104 : word_(word),
122 bool QueryNodeWord::Matches(const base::string16& word, bool exact) const {
124 return word == word_;
125 return word.size() >= word_.size() &
465 base::string16 word = iter.GetString(); local
[all...] |
| /packages/inputmethods/LatinIME/tools/dicttool/tests/com/android/inputmethod/latin/makedict/ |
| FusionDictionaryTest.java | 23 import com.android.inputmethod.latin.makedict.Word;
46 * Generates a random word.
73 for (final String word : words) {
75 final PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray, word);
80 private String dumpWord(final String word) {
82 for (int i = 0; i < word.length(); i = word.offsetByCodePoints(i, 1)) {
83 sb.append(word.codePointAt(i));
90 for (Word w : dict) {
91 System.out.println("Word " + dumpWord(w.mWord))
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/aes/asm/ |
| aes-armv4.S | 8 .word 0xc66363a5, 0xf87c7c84, 0xee777799, 0xf67b7b8d
9 .word 0xfff2f20d, 0xd66b6bbd, 0xde6f6fb1, 0x91c5c554
10 .word 0x60303050, 0x02010103, 0xce6767a9, 0x562b2b7d
11 .word 0xe7fefe19, 0xb5d7d762, 0x4dababe6, 0xec76769a
12 .word 0x8fcaca45, 0x1f82829d, 0x89c9c940, 0xfa7d7d87
13 .word 0xeffafa15, 0xb25959eb, 0x8e4747c9, 0xfbf0f00b
14 .word 0x41adadec, 0xb3d4d467, 0x5fa2a2fd, 0x45afafea
15 .word 0x239c9cbf, 0x53a4a4f7, 0xe4727296, 0x9bc0c05b
16 .word 0x75b7b7c2, 0xe1fdfd1c, 0x3d9393ae, 0x4c26266a
17 .word 0x6c36365a, 0x7e3f3f41, 0xf5f7f702, 0x83cccc4
[all...] |
| /external/openssl/crypto/aes/asm/ |
| aes-armv4.S | 8 .word 0xc66363a5, 0xf87c7c84, 0xee777799, 0xf67b7b8d
9 .word 0xfff2f20d, 0xd66b6bbd, 0xde6f6fb1, 0x91c5c554
10 .word 0x60303050, 0x02010103, 0xce6767a9, 0x562b2b7d
11 .word 0xe7fefe19, 0xb5d7d762, 0x4dababe6, 0xec76769a
12 .word 0x8fcaca45, 0x1f82829d, 0x89c9c940, 0xfa7d7d87
13 .word 0xeffafa15, 0xb25959eb, 0x8e4747c9, 0xfbf0f00b
14 .word 0x41adadec, 0xb3d4d467, 0x5fa2a2fd, 0x45afafea
15 .word 0x239c9cbf, 0x53a4a4f7, 0xe4727296, 0x9bc0c05b
16 .word 0x75b7b7c2, 0xe1fdfd1c, 0x3d9393ae, 0x4c26266a
17 .word 0x6c36365a, 0x7e3f3f41, 0xf5f7f702, 0x83cccc4
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/sha/asm/ |
| sha256-armv4.pl | 133 .word 0x428a2f98,0x71374491,0xb5c0fbcf,0xe9b5dba5
134 .word 0x3956c25b,0x59f111f1,0x923f82a4,0xab1c5ed5
135 .word 0xd807aa98,0x12835b01,0x243185be,0x550c7dc3
136 .word 0x72be5d74,0x80deb1fe,0x9bdc06a7,0xc19bf174
137 .word 0xe49b69c1,0xefbe4786,0x0fc19dc6,0x240ca1cc
138 .word 0x2de92c6f,0x4a7484aa,0x5cb0a9dc,0x76f988da
139 .word 0x983e5152,0xa831c66d,0xb00327c8,0xbf597fc7
140 .word 0xc6e00bf3,0xd5a79147,0x06ca6351,0x14292967
141 .word 0x27b70a85,0x2e1b2138,0x4d2c6dfc,0x53380d13
142 .word 0x650a7354,0x766a0abb,0x81c2c92e,0x92722c8
[all...] |
| /external/openssl/crypto/sha/asm/ |
| sha256-armv4.pl | 133 .word 0x428a2f98,0x71374491,0xb5c0fbcf,0xe9b5dba5
134 .word 0x3956c25b,0x59f111f1,0x923f82a4,0xab1c5ed5
135 .word 0xd807aa98,0x12835b01,0x243185be,0x550c7dc3
136 .word 0x72be5d74,0x80deb1fe,0x9bdc06a7,0xc19bf174
137 .word 0xe49b69c1,0xefbe4786,0x0fc19dc6,0x240ca1cc
138 .word 0x2de92c6f,0x4a7484aa,0x5cb0a9dc,0x76f988da
139 .word 0x983e5152,0xa831c66d,0xb00327c8,0xbf597fc7
140 .word 0xc6e00bf3,0xd5a79147,0x06ca6351,0x14292967
141 .word 0x27b70a85,0x2e1b2138,0x4d2c6dfc,0x53380d13
142 .word 0x650a7354,0x766a0abb,0x81c2c92e,0x92722c8
[all...] |
| /dalvik/vm/ |
| BitVector.cpp | 70 unsigned int word, bit; local
73 for (word = 0; word < pBits->storageSize; word++) {
74 if (pBits->storage[word] != 0xffffffff) {
76 * There are unallocated bits in this word. Return the first.
78 bit = ffs(~(pBits->storage[word])) -1;
80 pBits->storage[word] |= 1 << bit;
81 return (word << 5) | bit;
111 /* Round up to word boundaries for "num+1" bits *
[all...] |
| /external/chromium_org/chrome/browser/spellchecker/ |
| spellcheck_custom_dictionary.cc | 77 bool IsInvalidWord(const std::string& word) {
79 return !IsStringUTF8(word) ||
80 word.length() >
82 word.empty() ||
83 TRIM_NONE != TrimWhitespaceASCII(word, TRIM_ALL, &tmp);
126 // Removes duplicate and invalid words from |to_add| word list and sorts it.
127 // Looks for duplicates in both |to_add| and |existing| word lists. Returns a
151 // Removes word from |to_remove| that are missing from |existing| word list and
189 void SpellcheckCustomDictionary::Change::AddWord(const std::string& word) {
348 std::string word; local
371 std::string word = it->sync_data().GetSpecifics().dictionary().word(); local
494 std::string word = *it; local
506 std::string word = *it; local
[all...] |
