HomeSort by relevance Sort by last modified time
    Searched full:words (Results 301 - 325 of 2986) sorted by null

<<11121314151617181920>>

  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/asm-generic/
shmbuf.h 16 * so they do not need the first two padding words.
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/i386-linux-gnu/asm/
swab.h 14 "rorl $16,%0\n\t" /* swap words */
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/
tiocl.h 6 #define TIOCL_SELWORD 1 /* select whole words */
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/x86_64-linux-gnu/asm/
swab.h 14 "rorl $16,%0\n\t" /* swap words */
  /system/core/include/utils/
JenkinsHash.h 29 /* The Jenkins hash of a sequence of 32 bit words A, B, C is:
  /external/v8/src/
liveedit.h 164 * An internal frame that has n padding words:
165 * - any number of words as needed by code -- upper part of frame
167 * - padding: n words filled with kPaddingValue in form of Smi
168 * - 3 context/type words of a regular InternalFrame
176 // A size of frame base including fp. Padding words starts right above
179 // A number of words that should be reserved on stack for the LiveEdit use.
182 // A value that padding words are filled with (in form of Smi). Going
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/userdictionary/
UserDictionaryAddWordContents.java 194 private static final String[] HAS_WORD_PROJECTION = { UserDictionary.Words.WORD };
195 private static final String HAS_WORD_SELECTION_ONE_LOCALE = UserDictionary.Words.WORD
196 + "=? AND " + UserDictionary.Words.LOCALE + "=?";
197 private static final String HAS_WORD_SELECTION_ALL_LOCALES = UserDictionary.Words.WORD
198 + "=? AND " + UserDictionary.Words.LOCALE + " is null";
204 cursor = context.getContentResolver().query(UserDictionary.Words.CONTENT_URI,
208 cursor = context.getContentResolver().query(UserDictionary.Words.CONTENT_URI,
  /packages/inputmethods/OpenWnn/res/values/
strings.xml 65 <string name="preference_prediction_summary">Display predicted words as conversion candidates.</string>
69 <string name="preference_correct_spell_summary">Display predicted words for correcting typing error.</string>
74 <string name="preference_input_learning_summary">Learn input words.</string>
86 <string name="preference_user_dictionary_edit_words_summary">List/add/edit/delete words in user dictionary.</string>
87 <string name="preference_user_dictionary_edit_words_summary_ja">List/add/edit/delete words in Japanese user dictionary.</string>
88 <string name="preference_user_dictionary_edit_words_summary_en">List/add/edit/delete words in English user dictionary.</string>
89 <string name="preference_user_dictionary_edit_words_summary_zhcn">List/add/edit/delete words in Chinese user dictionary.</string>
92 <string name="preference_user_dictionary_clear_learning_summary">Remove all words from learning dictionary.</string>
95 <string name="preference_user_dictionary_clear_user_summary">Remove all words from user dictionary.</string>
108 <string name="user_dictionary_list_words">Registered words</string
    [all...]
  /external/protobuf/src/google/protobuf/
repeated_field_unittest.cc 1298 std::vector<string> words; member in class:google::protobuf::__anon17846::RepeatedFieldInsertionIteratorsTest
    [all...]
  /ndk/sources/host-tools/make-3.81/
function.c 75 whitespace-delimited words. */
96 /* When matching by words, the empty string should match
114 /* If we're substituting only by fully matched words,
115 or only at the ends of words, check that this case qualifies. */
425 If the two arguments have a different number of words,
426 the excess words are just output separated by blanks. */
683 char *words = argv[0]; /* Use a temp variable for find_next_token */
684 char *p = find_next_token (&words, &i);
696 char *words = argv[0]; /* Use a temp variable for find_next_token */
700 while ((t = find_next_token (&words, &i))
676 char *words = argv[0]; \/* Use a temp variable for find_next_token *\/ local
689 char *words = argv[0]; \/* Use a temp variable for find_next_token *\/ local
934 int words = 0; local
1133 char **words = 0; local
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
stringold.py 103 # Split a string into a list of space/tab-separated words
107 Return a list of the words in the string s, using sep as the
109 maxsplit words If sep is not specified, any whitespace string
119 def join(words, sep = ' '):
122 Return a string composed of the words in list, with
129 return sep.join(words)
368 # Capitalize the words in a string, e.g. " aBc dEf " -> "Abc Def".
372 Split the argument into words using split, capitalize each
373 word using capitalize, and join the capitalized words using
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
stringold.py 103 # Split a string into a list of space/tab-separated words
107 Return a list of the words in the string s, using sep as the
109 maxsplit words If sep is not specified, any whitespace string
119 def join(words, sep = ' '):
122 Return a string composed of the words in list, with
129 return sep.join(words)
368 # Capitalize the words in a string, e.g. " aBc dEf " -> "Abc Def".
372 Split the argument into words using split, capitalize each
373 word using capitalize, and join the capitalized words using
  /external/libxml2/doc/
index.py 63 "words" : """CREATE TABLE words (
216 """INSERT INTO words (name, symbol, relevance) VALUES ('%s','%s', %d)""" %
221 """UPDATE words SET relevance = %d where name = '%s' and symbol = '%s'""" %
225 print "UPDATE words SET relevance = %d where name = '%s' and symbol = '%s'" % (relevance, name, symbol)
950 words = 0
953 words = words + addStringHTML(content, resource, id, section, 5)
956 return words
959 words =
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_collections.py 192 words = set(re.findall('[A-Za-z]+', template.getvalue()))
193 words -= set(keyword.kwlist)
194 T = namedtuple('T', words)
196 values = tuple(range(len(words)))
214 self.assertEqual(T._fields, tuple(words))
667 words = Counter('which witch had which witches wrist watch'.split())
669 update_test.update(words)
671 words.copy(),
672 copy.copy(words),
673 copy.deepcopy(words),
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_collections.py 192 words = set(re.findall('[A-Za-z]+', template.getvalue()))
193 words -= set(keyword.kwlist)
194 T = namedtuple('T', words)
196 values = tuple(range(len(words)))
214 self.assertEqual(T._fields, tuple(words))
667 words = Counter('which witch had which witches wrist watch'.split())
669 update_test.update(words)
671 words.copy(),
672 copy.copy(words),
673 copy.deepcopy(words),
    [all...]
  /external/icu/icu4c/source/common/unicode/
ubrk.h 46 * hyphenated words.
54 * select words with a double click. Word selection provides correct
56 * words. Characters that are not part of a word, such as symbols or
67 * typically starts of words, that should be set to Title Case
126 /** Tag value for "words" that do not fit into any of other categories.
129 /** Upper bound for tags for uncategorized words. */
131 /** Tag value for words that appear to be numbers, lower limit. */
133 /** Tag value for words that appear to be numbers, upper limit. */
135 /** Tag value for words that contain letters, excluding
138 /** Tag value for words containing letters, upper limit *
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/
MultiCall.py 262 words = string.split(sequence[1:-1], '-')
265 while words and words[0] in _modifier_names:
266 modifiers |= 1 << _modifier_names[words[0]]
267 del words[0]
269 if words and words[0] in _type_names:
270 type = _type_names[words[0]]
271 del words[0]
276 if modifiers or words
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/
MultiCall.py 262 words = string.split(sequence[1:-1], '-')
265 while words and words[0] in _modifier_names:
266 modifiers |= 1 << _modifier_names[words[0]]
267 del words[0]
269 if words and words[0] in _type_names:
270 type = _type_names[words[0]]
271 del words[0]
276 if modifiers or words
    [all...]
  /build/tools/atree/
files.cpp 257 vector<string> words; local
259 split_line(p, &words);
263 for (size_t k=0; k<words.size(); k++) {
264 printf("'%s' ", words[k].c_str());
272 for (vector<string>::iterator it = words.begin(); it != words.end(); ++it) {
  /external/llvm/lib/Target/Hexagon/
HexagonIntrinsicsV4.td 47 // Polynomial multiply words
141 // Complex add/sub halfwords/words
167 // Vector reduce maximum words
175 // Vector reduce minimum words
236 // Combine Words Into Doublewords.
286 // XTYPE / ALU / Logical-logical Words.
  /external/llvm/test/MC/Disassembler/Hexagon/
xtype_alu.txt 86 # Logical-logical words
118 # Maximum words
130 # Minimum words
172 # Subtract and accumulate words
212 # Vector absolute value words
222 # Vector absolute difference words
256 # Vector add words
286 # Vector average words
329 # Vector reduce maximum words
335 # Vector maximum words
    [all...]
  /system/core/debuggerd/
tombstone.cpp 239 Backtrace* backtrace, log_t* log, uintptr_t* sp, size_t words, int label) {
241 word_t stack_data[words];
242 size_t bytes_read = backtrace->Read(*sp, reinterpret_cast<uint8_t*>(&stack_data[0]), sizeof(word_t) * words);
243 words = bytes_read / sizeof(word_t);
245 for (size_t i = 0; i < words; i++) {
291 // Dump a few words before the first frame.
295 // Dump a few words from all successive frames.
309 size_t words = frame->stack_size / sizeof(word_t); local
310 if (words == 0) {
311 words = 1
    [all...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/distribution/
IntegerDistribution.java 29 * to this distribution, this method returns P(X = x). In other words, this
39 * to this distribution, this method returns P(X &le; x). In other words,
  /external/compiler-rt/make/
lib_util.mk 20 $(if $(call streq,1,$(words $(Tmp.SelectFunctionDir))),\
23 $(if $(call streq,0,$(words $(Tmp.SelectFunctionDir))),\
  /external/elfutils/src/lib/
md5.c 305 const md5_uint32 *words = buffer; local
307 const md5_uint32 *endp = words + nwords;
322 while (words < endp)
332 unit is a 32-bit word and it is determined to work on words in
335 we store the swapped words in the array CORRECT_WORDS. */
340 a += FF (b, c, d) + (*cwp++ = SWAP (*words)) + T; \
341 ++words; \
375 /* For the second to fourth round we have the possibly swapped words

Completed in 1969 milliseconds

<<11121314151617181920>>