HomeSort by relevance Sort by last modified time
    Searched refs:words (Results 76 - 100 of 1016) sorted by null

1 2 34 5 6 7 8 91011>>

  /frameworks/rs/rsov/compiler/spirit/
transformer.cpp 25 auto words = runAndSerialize(module, error); local
26 return Deserialize<Module>(words);
44 // the new words from function serialization.
word_stream_impl.h 30 WordStreamImpl(const std::vector<uint32_t> &words);
31 WordStreamImpl(std::vector<uint32_t> &&words);
  /prebuilts/go/darwin-x86/src/runtime/
memclr_mips64x.s 21 BEQ R3, words
26 words: label
  /prebuilts/go/linux-x86/src/runtime/
memclr_mips64x.s 21 BEQ R3, words
26 words: label
  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-mmix/
bspec802.s 2 TETRA 4 % Decent section length name (in 32-bit words). However...
bspec807.s 2 TETRA 2 % Decent section length name (in 32-bit words).
  /development/samples/ApiDemos/src/com/example/android/apis/view/
List4.java 118 public SpeechView(Context context, String title, String words) {
132 mDialogue.setText(words);
147 public void setDialogue(String words) {
148 mDialogue.setText(words);
  /external/v8/tools/
find-commit-for-patch.py 37 words = line.split()
38 assert words[2].startswith("a/") and len(words[2]) > 2
39 next_file = words[2][2:]
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/tic54x/
align.s 3 * .align [size] ; size is number of words (value must be a power of 2)
22 * TI .text section total size is 0x89 words; GAS fills to 0xc0
  /bionic/libm/upstream-freebsd/lib/msun/src/
s_nan.c 51 _scan_nan(uint32_t *words, int num_words, const char *s)
54 int bitpos; /* index into words (in bits) */
56 bzero(words, num_words * sizeof(uint32_t));
66 /* Scan backwards, filling in the bits in words[] as we go. */
74 words[bitpos / 32] |= digittoint(s[si]) << (bitpos % 32);
  /device/google/contexthub/firmware/os/platform/stm32/
crc.c 54 const uint32_t *words = (const uint32_t *)buf; local
69 mCrcRegs->DR = words[i];
73 memcpy(&word, words + numWords, leftoverBytes);
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/framer/framer/
struct.py 41 words = line.split()
42 name = words[-1]
43 type = " ".join(words[:-1])
structparse.py 35 words = line.split()
36 name = words[-1]
37 type = " ".join(words[:-1])
  /external/python/cpython2/Tools/framer/framer/
struct.py 41 words = line.split()
42 name = words[-1]
43 type = " ".join(words[:-1])
structparse.py 35 words = line.split()
36 name = words[-1]
37 type = " ".join(words[:-1])
  /prebuilts/ndk/r11/sources/android/support/src/msun/
s_nan.c 67 _scan_nan(uint32_t *words, int num_words, const char *s)
70 int bitpos; /* index into words (in bits) */
72 bzero(words, num_words * sizeof(uint32_t));
82 /* Scan backwards, filling in the bits in words[] as we go. */
90 words[bitpos / 32] |= digittoint(s[si]) << (bitpos % 32);
  /prebuilts/ndk/r13/sources/android/support/src/msun/
s_nan.c 67 _scan_nan(uint32_t *words, int num_words, const char *s)
70 int bitpos; /* index into words (in bits) */
72 bzero(words, num_words * sizeof(uint32_t));
82 /* Scan backwards, filling in the bits in words[] as we go. */
90 words[bitpos / 32] |= digittoint(s[si]) << (bitpos % 32);
  /external/icu/icu4c/source/common/
dictbe.cpp 114 // List size, limited by the maximum number of words in the dictionary
196 // How many words in a row are "good enough"?
215 // Minimum number of characters for two words
255 return 0; // Not enough characters for two words
265 PossibleWord words[THAI_LOOKAHEAD]; local
273 // Look for candidate words at the current position
274 int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
278 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
279 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength();
282 // If there was more than one, see which one can take us forward the most words
500 PossibleWord words[LAO_LOOKAHEAD]; local
693 PossibleWord words[BURMESE_LOOKAHEAD]; local
898 PossibleWord words[KHMER_LOOKAHEAD]; local
    [all...]
  /build/make/tools/
product_debug.py 28 words = line.split("=", 1)
29 if len(words) == 1:
30 return (words[0], "")
32 return (words[0], words[1])
  /external/python/cpython2/Lib/
rlcompleter.py 141 words = set(dir(thisobject))
142 words.discard("__builtins__")
145 words.add('__class__')
146 words.update(get_class_members(thisobject.__class__))
149 for word in words:
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/personalization/
UserHistoryDictionaryTestsHelper.java 45 * Characters for generating random words.
66 * Generates and writes random words to dictionary. Caller can be assured
70 * @param dict {@link UserHistoryDictionary} to which words should be added.
71 * @param numberOfWords number of words to be added.
72 * @param random helps generate random words.
73 * @param checkContents if true, checks whether written words are actually in the dictionary.
74 * @param currentTime timestamp that would be used for adding the words.
75 * @returns true if all words have been written to dictionary successfully.
80 final List<String> words = generateWords(numberOfWords, random); local
81 // Add random words to the user history dictionary
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.gldebugger/src/com/android/ide/eclipse/gltrace/format/
GLAPISpec.java 108 List<String> words = Arrays.asList(line.split(",")); local
110 String retType = words.get(0).trim();
111 String func = words.get(1).trim();
112 List<String> argDefinitions = words.subList(2, words.size());
  /bionic/libc/upstream-openbsd/lib/libc/net/
inet_ntop.c 106 u_int words[IN6ADDRSZ / INT16SZ]; local
115 memset(words, '\0', sizeof words);
117 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
121 if (words[i] == 0) {
169 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
175 advance = snprintf(tp, ep - tp, "%x", words[i]);
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/scripts/
markov.py 45 print '-w: words'
50 print 'in words by whitespace, then reconcatenated with'
51 print 'exactly one space separating words.'
83 words = para.split()
84 if words:
86 data = tuple(words)
88 data = ' '.join(words)
106 words = data
108 words = data.split()
111 for w in words:
    [all...]
  /external/autotest/client/tests/btreplay/
btreplay.py 93 words = self.results[n-2].split()
94 s = words[1].strip('sytem').split(':')
95 e = words[2].strip('elapsd').split(':')
109 words = line.split()
110 if len(words) < 3:
112 if words[0] == 'Q2C':
113 q2c = float(words[2])

Completed in 549 milliseconds

1 2 34 5 6 7 8 91011>>