| /external/valgrind/helgrind/ |
| hg_wordset.c | 3 /*--- Sets of words, with unique set identifiers. ---*/
137 UWord* words; member in struct:__anon20634
192 wv->words = NULL;
195 wv->words = wsu->alloc( wsu->cc, (SizeT)sz * sizeof(UWord) );
203 if (wv->words) {
204 dealloc(wv->words);
228 if (wv1->words[i] == wv2->words[i])
230 if (wv1->words[i] < wv2->words[i]
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| KhmerBreakEngine.java | 19 // How many words in a row are "good enough"?
28 // Minimum number of characters for two words
99 PossibleWord words[] = new PossibleWord[KHMER_LOOKAHEAD]; local
101 words[i] = new PossibleWord();
110 //Look for candidate words at the current position
111 int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
115 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(fIter);
119 // If there was more than one, see which one can take us forward the most words
126 if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
129 words[wordsFound%KHMER_LOOKAHEAD].markCurrent()
[all...] |
| BurmeseBreakEngine.java | 19 // How many words in a row are "good enough"?
96 PossibleWord words[] = new PossibleWord[BURMESE_LOOKAHEAD]; local
98 words[i] = new PossibleWord();
106 //Look for candidate words at the current position
107 int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
111 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter);
115 // If there was more than one, see which one can take us forward the most words
122 if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
125 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent();
134 // See if any of the possible second words is followed by a third wor
[all...] |
| LaoBreakEngine.java | 19 // How many words in a row are "good enough"?
99 PossibleWord words[] = new PossibleWord[LAO_LOOKAHEAD]; local
101 words[i] = new PossibleWord();
109 //Look for candidate words at the current position
110 int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
114 wordLength = words[wordsFound%LAO_LOOKAHEAD].acceptMarked(fIter);
118 // If there was more than one, see which one can take us forward the most words
125 if (words[(wordsFound+1)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
128 words[wordsFound%LAO_LOOKAHEAD].markCurrent();
137 // See if any of the possible second words is followed by a third wor
[all...] |
| /external/chromium-trace/trace-viewer/tracing/tracing/extras/chrome/cc/ |
| util.html | 27 var words = name.split('_');
28 if (words.length == 1) {
29 convertedNameCache[name] = words[0];
30 return words[0];
33 for (var i = 1; i < words.length; i++)
34 words[i] = words[i][0].toUpperCase() + words[i].substring(1);
36 convertedNameCache[name] = words.join('');
|
| /packages/apps/Launcher3/src/com/android/launcher3/allapps/ |
| DefaultAppSearchAlgorithm.java | 61 // Do an intersection of the words in the query and each title, and filter out all the
62 // apps that don't match all of the words in the query.
77 String[] words = SPLIT_PATTERN.split(title.toLowerCase()); local
80 for (int i = 0; i < words.length; i++) {
81 if (words[i].startsWith(queryWords[qi])) {
87 // If there is a word in the query that does not match any words in this
|
| /external/e2fsprogs/ |
| wordwrap.pl | 12 @words = split;
13 while (defined($word = shift @words)) {
|
| /external/markdown/tests/misc/ |
| br.html | 2 <pre><code><p>Some of these words <em>are emphasized</em>.
3 Some of these words <em>are emphasized also</em>.</p>
|
| /frameworks/base/core/res/res/xml/ |
| autotext.xml | 19 <words>
20 </words>
|
| /packages/apps/Settings/src/com/android/settings/ |
| UserDictionarySettings.java | 49 UserDictionary.Words._ID, UserDictionary.Words.WORD, UserDictionary.Words.SHORTCUT
58 UserDictionary.Words.LOCALE + "=?";
60 UserDictionary.Words.LOCALE + " is null";
62 private static final String DELETE_SELECTION_WITH_SHORTCUT = UserDictionary.Words.WORD
63 + "=? AND " + UserDictionary.Words.SHORTCUT + "=?";
64 private static final String DELETE_SELECTION_WITHOUT_SHORTCUT = UserDictionary.Words.WORD
65 + "=? AND " + UserDictionary.Words.SHORTCUT + " is null OR "
66 + UserDictionary.Words.SHORTCUT + "=''"
[all...] |
| /external/libunwind/src/hppa/ |
| offsets.h | 14 /* The signal frame contains 4 words of space for the sigreturn
|
| /external/icu/icu4c/source/common/ |
| dictbe.cpp | 112 // List size, limited by the maximum number of words in the dictionary
194 // How many words in a row are "good enough"?
213 // Minimum number of characters for two words
253 return 0; // Not enough characters for two words
263 PossibleWord words[THAI_LOOKAHEAD]; local
271 // Look for candidate words at the current position
272 int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
276 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
277 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength();
280 // If there was more than one, see which one can take us forward the most words
498 PossibleWord words[LAO_LOOKAHEAD]; local
691 PossibleWord words[BURMESE_LOOKAHEAD]; local
896 PossibleWord words[KHMER_LOOKAHEAD]; local
[all...] |
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| WnnEngine.java | 54 * Predict words/phrases.
79 * Search words from the dictionaries.
87 * Search words from the dictionaries.
109 * Retrieve the list of registered words.
111 * @return {@code null} if no word is registered; the array of {@link WnnWord} if some words is registered.
131 * @return Number of registered words in the user's dictionary after the operation; minus value if a error occurs.
144 * Delete all words from the user's dictionary.
152 * Delete all words from the user's dictionary of the specified language.
168 * Break the sequence of words.
171 * words to the converter. The converter will stop learnin
[all...] |
| /packages/providers/UserDictionaryProvider/src/com/android/providers/userdictionary/ |
| DictionaryBackupAgent.java | 41 import android.provider.UserDictionary.Words;
70 Words._ID,
71 Words.WORD,
72 Words.FREQUENCY,
73 Words.LOCALE,
74 Words.APP_ID,
75 Words.SHORTCUT
101 restoreDictionary(data, Words.CONTENT_URI);
152 Cursor cursor = getContentResolver().query(Words.CONTENT_URI, PROJECTION,
153 null, null, Words.WORD)
[all...] |
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/ |
| OpenWnnClauseConverterJAJP.java | 36 /** search cache for unique independent words (jiritsugo) */
38 /** search cache for all independent words (jiritsugo) */
40 /** search cache for ancillary words (fuzokugo) */
392 * Get all exact matched ancillary words(Fuzokugo) list.
395 * @return List of ancillary words
425 /* search ancillary words */
432 /* concatenate sequence of ancillary words */
454 * Get all exact matched independent words(Jiritsugo) list.
457 * @param all {@code true} if list all words; {@code false} if list words which has an unique part of speech tag
465 ArrayList<WnnWord> words = (all)? mAllIndepWordBag.get(input) : mIndepWordBag.get(input); local
[all...] |
| /external/flac/libFLAC/ |
| bitreader.c | 62 * This should be at least twice as large as the largest number of words
75 static const unsigned FLAC__BITREADER_DEFAULT_CAPACITY = 65536u / FLAC__BITS_PER_WORD; /* in words */
81 unsigned capacity; /* in words */
82 unsigned words; /* # of completed words in buffer */ member in struct:FLAC__BitReader
83 unsigned bytes; /* # of bytes in incomplete word at buffer[words] */
84 unsigned consumed_words; /* #words ... */
130 end = br->words + (br->bytes? 1:0);
133 br->words -= start;
140 bytes = (br->capacity - br->words) * FLAC__BYTES_PER_WORD - br->bytes
716 unsigned cwords, words, lsbs, msbs, x, y; local
[all...] |
| bitwriter.c | 66 static const unsigned FLAC__BITWRITER_DEFAULT_CAPACITY = 32768u / sizeof(uint32_t); /* size in words */
68 static const unsigned FLAC__BITWRITER_DEFAULT_INCREMENT = 4096u / sizeof(uint32_t); /* size in words */
70 #define FLAC__WORDS_TO_BITS(words) ((words) * FLAC__BITS_PER_WORD)
71 #define FLAC__TOTAL_BITS(bw) (FLAC__WORDS_TO_BITS((bw)->words) + (bw)->bits)
76 unsigned capacity; /* capacity of buffer in words */
77 unsigned words; /* # of complete words in buffer */ member in struct:FLAC__BitWriter
93 /* calculate total words needed to store 'bits_to_add' additional bits */
94 new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD)
[all...] |
| /external/valgrind/none/tests/s390x/ |
| stfle.c | 3 /* Number of double words needed to store all facility bits. */
18 printf("the value of cc is %d and #double words is %llu\n", cc, __nr + 1);
48 that need 2 do double words to store facility bits. */
|
| /art/runtime/arch/arm/ |
| memcmp16_arm.S | 47 /* make sure we have at least 12 words, this simplify things below
54 /* small blocks (less then 12 words) */
86 0: /* here the first pointer is aligned, and we have at least 3 words
95 /* congruent case, 16 half-words per iteration
96 * We need to make sure there are at least 16+2 words left
136 /* do we have at least 2 words left? */
140 /* finish off 2 words at a time */
159 2: /* the last 2 words are different, restart them */
173 /* process the last few words */
|
| /external/elfutils/src/libelf/ |
| gnuhash_xlate.h | 40 words. We must detangle them here. */
44 /* First four control words, 32 bits. */
55 /* Now the 64 bit words. */
66 /* The rest are 32 bit words again. */
|
| /external/strace/linux/m68k/ |
| arch_sigreturn.c | 14 /* Fetch remaining words of signal mask, located immediately before. */
|
| /external/valgrind/VEX/orig_amd64/ |
| SortedToOrig.hs | 15 = let ws = words s0
|
| /external/svox/pico/lib/ |
| picokdt.h | 235 tree input vector: 0-2 POS or POSgroup for each of the three previous words
238 the three following words
239 pre3 - pre1: POSgroup or POS for the previous three words
241 fol1 - fol3: POS or history for the following three words (the more
329 tree input vector: 0-1 POS for each of the two previous words
331 3-4 POS for each of the two following words
332 5 nr words left
333 6 nr words right
335 pre2 - pre1: POS for the previous two words
337 fol1 - fol2: POS for the following two words
[all...] |
| /dalvik/dx/tests/110-dex-preserve-this/ |
| run | 33 count = split($0, words, /,? */);
35 if (words[i] == thisReg) {
|
| /external/llvm/test/CodeGen/X86/GC/ |
| erlang-gc.ll | 12 ; CHECK64-NEXT: .short 1 # stack frame size (in words)
20 ; CHECK32-NEXT: .short 3 # stack frame size (in words)
|
