| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| CandidatesViewManager.java | 36 * Attribute of a word (no attribute)
41 * Attribute of a word (a candidate in the history list)
46 * Attribute of a word (the best candidate)
51 * Attribute of a word (auto generated/not in the dictionary)
|
| TextCandidatesViewManager.java | 125 /** The word pressed */
201 WnnWord word = null;
202 word = mWnnWordArray.get(wordcount);
203 selectCandidate(word);
550 * @param isCategory {@code true}:caption of category, {@code false}:normal word
551 * @param word A candidate word
553 private void setCandidate(boolean isCategory, WnnWord word) {
554 int textLength = measureText(word.candidate, 0, word.candidate.length())
[all...] |
| /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/digests/ |
| SHA1Digest.java | 7 * is the "endienness" of the word processing!
69 int word,
73 out[outOff++] = (byte)(word >>> 24);
74 out[outOff++] = (byte)(word >>> 16);
75 out[outOff++] = (byte)(word >>> 8);
76 out[outOff++] = (byte)word;
163 // expand 16 word block into 80 word block.
|
| /dalvik/vm/compiler/template/armv5te/ |
| TEMPLATE_CMP_LONG.S | 6 * be resolved by only looking at the high word. This could be made
18 * 2 or 3 cycles + branch if the high word doesn't match, 6 + branch
|
| /dalvik/vm/mterp/armv5te/ |
| OP_MUL_LONG.S | 12 * The low word of the result holds ZX, the high word holds
|
| /development/samples/SearchableDictionary/src/com/example/android/searchabledict/ |
| DictionaryDatabase.java | 83 * Returns a Cursor positioned at the word specified by rowId
85 * @param rowId id of word to retrieve
87 * @return Cursor positioned to matching word, or null if not found.
115 * which is an FTS3 search for the query text (plus a wildcard) inside the word column.
215 Log.e(TAG, "unable to add word: " + strings[0].trim());
225 * Add a word to the dictionary.
228 public long addWord(String word, String definition) {
230 initialValues.put(KEY_WORD, word);
|
| /external/iproute2/lib/ |
| dnet_ntop.c | 11 u_int16_t word; member in union:__anon2626
14 u.word = addr;
|
| /external/kernel-headers/original/asm-arm/ |
| byteorder.h | 7 * and word accesses (data or instruction) appear as:
12 * and word accesses (data or instruction) appear as:
|
| /external/openssl/crypto/des/asm/ |
| readme | 59 from a word and do an array lookup. This involves getting the byte from
60 the 4 locations in the word and moving it to a new word and doing the lookup.
62 xor eax, eax # clear word
64 xor edi DWORD PTR 0x100+des_SP[eax] # xor in word
66 xor edi DWORD PTR 0x300+des_SP[eax] # xor in word
85 mov eax, ecx # copy word
89 mov eax, ecx # get word
|
| /external/webkit/WebKitTools/android/flex-2.5.4a/MISC/ |
| NeXT | 24 FMyIO: in cc, these files contain the word make_support:
30 FMyIO: in cc, these files contain the word REPORT_EVENT:
|
| /packages/providers/UserDictionaryProvider/src/com/android/providers/userdictionary/ |
| DictionaryBackupAgent.java | 67 Words.WORD,
148 null, null, Words.WORD);
210 String word; local
213 word = st.nextToken();
225 cv.put(Words.WORD, word);
230 getContentResolver().delete(contentUri, Words.WORD + "=?", new String[] {word});
|
| /development/samples/WiktionarySimple/src/com/example/android/simplewiktionary/ |
| WordWidget.java | 40 * Define a simple widget that shows the Wiktionary "Word of the day." To build
65 * "Word of the day." Will block until the online API returns.
76 // Build today's page title, like "Wiktionary:Word of the day/March 21"
83 // Try querying the Wiktionary API for today's word
92 // Use a regular expression to parse out the word and its definition
113 // Didn't find word of day, so show error message
|
| /external/opencore/codecs_v2/video/avc_h264/dec/src/ |
| avcdec_bitstream.h | 55 This function reads next aligned word and remove the emulation prevention code
58 \return "Next word."
68 is greater than the word-size, AVCDEC_PACKET_LOSS or
79 is greater than the word-size, AVCDEC_NO_DATA if it needs
90 is greater than the word-size It will not call back to get
101 is greater than the word-size, AVCDEC_PACKET_LOSS or
|
| /external/qemu/distrib/sdl-1.2.12/src/video/ |
| math_private.h | 27 n0 = ((*(int*)&one)>>29)^1; * index of high word *
28 ix0 = *(n0+(int*)&x); * high word of x *
29 ix1 = *((1-n0)+(int*)&x); * low word of x *
137 u_int32_t word; member in union:__anon4493
146 (i) = gf_u.word; \
154 sf_u.word = (i); \
|
| /external/srec/srec/crec/ |
| astar_pphash.c | 44 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;
|
| srec_debug.c | 35 bufp += sprintf(bufp, "%d,", awtoken->word);
55 printf("%sftoken %d rec %d@%d fsmnode %d cost %d word %d(%s) word_backtrace %d next_token_index %d ", msg, token_index, rec->id, rec->current_search_frame, ftoken->FSMnode_index, ftoken->cost, ftoken->word,
60 if (ftoken->word < rec->context->olabels->num_words)
61 p = rec->context->olabels->words[ftoken->word];
99 wordID* wordids = &stoken->word[0];
|
| word_lattice.c | 48 WT.word = MAXwordID; \
123 if (wtoken->word < rec->context->olabels->num_words)
124 p = rec->context->olabels->words[wtoken->word];
141 PLogMessage (" (%d W%d %s cost=%d/%d/%d time=%d%s node=%d)", wtoken_index, wtoken->word, p, wtoken->cost, cost, cost_for_word, wtoken->end_time, iwttime, wtoken->end_node);
160 if (wtoken->word < rec->context->olabels->num_words)
161 p = rec->context->olabels->words[wtoken->word];
194 wordIDs[currentLen] = wtoken->word;
254 printf("got token %d word %d\n", wtoken_index, wtoken->word);
258 if (wtoken->word < rec->context->olabels->num_words
[all...] |
| /frameworks/base/media/libstagefright/codecs/avc/dec/src/ |
| avcdec_bitstream.h | 55 This function reads next aligned word and remove the emulation prevention code
58 \return "Next word."
68 is greater than the word-size, AVCDEC_PACKET_LOSS or
79 is greater than the word-size, AVCDEC_NO_DATA if it needs
90 is greater than the word-size It will not call back to get
101 is greater than the word-size, AVCDEC_PACKET_LOSS or
|
| /external/libffi/src/pa/ |
| hpux32.S | 307 .word L$ECIE1-L$SCIE1 ;# Length of Common Information Entry
309 .word 0x0 ;# CIE Identifier Tag
321 .word L$EFDE1-L$ASFDE1 ;# FDE Length
323 .word L$ASFDE1-L$frame1 ;# FDE CIE offset
324 .word L$FB1 ;# FDE initial location
325 .word L$FE1-L$FB1 ;# FDE address range
328 .word L$CFI11-L$FB1
336 .word L$CFI12-L$CFI11
341 .word L$CFI13-L$CFI12
349 .word L$EFDE2-L$ASFDE2 ;# FDE Lengt
[all...] |
| linux.S | 296 .word .LECIE1-.LSCIE1 ;# Length of Common Information Entry
298 .word 0x0 ;# CIE Identifier Tag
310 .word .LEFDE1-.LASFDE1 ;# FDE Length
312 .word .LASFDE1-.Lframe1 ;# FDE CIE offset
313 .word .LFB1 ;# FDE initial location
314 .word .LFE1-.LFB1 ;# FDE address range
317 .word .LCFI11-.LFB1
325 .word .LCFI12-.LCFI11
330 .word .LCFI13-.LCFI12
338 .word .LEFDE2-.LASFDE2 ;# FDE Lengt
[all...] |
| /external/libffi/src/sh64/ |
| sysv.S | 379 .word .L_case_v - datalabel .L_table /* FFI_TYPE_VOID */
380 .word .L_case_i - datalabel .L_table /* FFI_TYPE_INT */
381 .word .L_case_f - datalabel .L_table /* FFI_TYPE_FLOAT */
382 .word .L_case_d - datalabel .L_table /* FFI_TYPE_DOUBLE */
383 .word .L_case_d - datalabel .L_table /* FFI_TYPE_LONGDOUBLE */
384 .word .L_case_uq - datalabel .L_table /* FFI_TYPE_UINT8 */
385 .word .L_case_q - datalabel .L_table /* FFI_TYPE_SINT8 */
386 .word .L_case_uh - datalabel .L_table /* FFI_TYPE_UINT16 */
387 .word .L_case_h - datalabel .L_table /* FFI_TYPE_SINT16 */
388 .word .L_case_i - datalabel .L_table /* FFI_TYPE_UINT32 *
[all...] |
| /external/bison/lib/ |
| vbitset.c | 28 length array of words. Any unused bits in the last word must be
180 of the word of interest. */
195 bitset_word word; local
197 word = srcp[windex] << (BITSET_WORD_BITS - 1 - bitcnt);
198 for (; word; bitcnt--)
200 if (word & BITSET_MSB)
209 word <<= 1;
237 bitset_word word; local
251 of the current word. */
265 /* Handle the case where we start within a word
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| read.c | 108 char *word, *next;
110 word = *buf;
111 if (*word == '\0')
114 word = skip_over_blank(word);
115 next = skip_over_word(word);
124 if (*word == '"' || *word == '\'')
125 word++;
126 return word;
[all...] |
| /external/srec/srec/Grammar/include/ |
| SR_Grammar.h | 52 * Two types of slots exist: word slots and nametag slots
83 * Two types of slots exist: word slots and nametag slots
118 * Adds word to rule slot.
122 * @param word Word to be added to the slot
123 * @param pronunciation Word pronunciation (optional). Pass NULL to omit.
124 * @param weight value to associate with word when adding to grammar; use to determine cost when parsing
125 * @param tag eScript semantic expression (tag) for the word
127 * if OSI logging fails; ESR_OUT_OF_MEMORY if word cannot be added to the grammar
130 ESR_ReturnCode(*addWordToSlot)(struct SR_Grammar_t* self, const LCHAR* slot, const LCHAR* word,
[all...] |
| /external/zlib/contrib/masmx86/ |
| gvmat32.asm | 70 scan_start equ word ptr [esp+NbStack-48]
190 mov dx,word ptr [esi]
192 mov bx,word ptr [esi+ebx-1]
247 cmp word ptr[edi+eax],bx
252 mov ax,word ptr[esi+eax*2]
263 cmp bp,word ptr[edx+eax]
272 mov ax,word ptr[esi+eax*2]
287 cmp word ptr[edi+eax],bx
292 mov ax,word ptr[esi+eax*2]
295 cmp word ptr[edi+eax],bx
[all...] |
