HomeSort by relevance Sort by last modified time
    Searched refs:words (Results 26 - 50 of 529) sorted by null

12 3 4 5 6 7 8 91011>>

  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
rlcompleter.py 138 words = dir(thisobject)
139 if "__builtins__" in words:
140 words.remove("__builtins__")
143 words.append('__class__')
144 words.extend(get_class_members(thisobject.__class__))
147 for word in words:
  /external/tcpdump/
print-smb.c 173 print_trans2(const u_char *words, const u_char *dat, const u_char *buf, const u_char *maxbuf)
178 const u_char *w = words + 1;
182 TCHECK(words[0]);
191 if (words[0] == 0) {
206 if (words[0] == 8) {
207 smb_fdata(words + 1,
212 smb_fdata(words + 1,
214 words + 1 + 14 * 2, unicodestr);
219 smb_fdata(words + 1,
221 words + 1 + 10 * 2, unicodestr)
801 const u_char *words, *maxwords, *data; local
    [all...]
  /frameworks/ex/common/tools/
make-iana-tld-pattern.py 32 self.words=[]
36 if (len(self.words) == 0) and (len(self.letters) == 0):
39 self.words.sort()
52 if len(self.words) != 0:
59 for word in self.words:
68 if len(self.words) > 0 and len(self.letters) > 0:
81 if len(self.words) != 0:
99 self.words.append(line)
  /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/chromium_org/chrome/renderer/spellchecker/
custom_dictionary_engine.h 14 // Custom spellcheck dictionary. Words in this dictionary are always correctly
15 // spelled. Words that are not in this dictionary may or may not be correctly
23 void Init(const std::set<std::string>& words);
32 // Update custom dictionary words.
38 // Correctly spelled words.
  /external/chromium_org/chrome/tools/convert_dict/
dic_reader.h 37 // Returns the words read by Read(). These will be in order.
38 const WordList& words() const { return words_; } function in class:convert_dict::DicReader
44 // Contains all words and their corresponding affix index.
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/
TextUtils.js 110 var words = [];
115 words.push(text.substring(startWord, i));
121 words.push(text.substring(startWord));
122 return words;
  /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);
  /build/tools/
diff_package_overlays.py 55 words = line.split()
56 result[words[0]] = " ".join(words[1:])
product_debug.py 28 words = line.split("=", 1)
29 if len(words) == 1:
30 return (words[0], "")
32 return (words[0], words[1])
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/common/
CompletionDictionary.js 107 var words = [];
110 words.push(i);
112 return words;
  /ndk/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);
  /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]);
  /external/qemu/distrib/sdl-1.2.15/src/cdrom/macos/
SDL_syscdrom.c 170 cdpb.csParam.words[0] = kGetTrackRange;
191 cdpb.csParam.words[0] = kGetLeadOutArea;
208 cdpb.csParam.words[0] = kGetTrackEntries; /* Type of Query */
209 * ((long *) (cdpb.csParam.words+1)) = (long) tracks;
210 cdpb.csParam.words[3] = cdrom->numtracks * sizeof(tracks[0]);
211 * ((char *) (cdpb.csParam.words+4)) = 1; /* First track */
265 cdpb.csParam.words[0] = kGetTrackRange;
356 cdpb.csParam.words[0] = kBlockPosition; /* Position Mode */
357 *(long *) (cdpb.csParam.words + 1) = start+length-1; /* Search Address */
368 cdpb.csParam.words[0] = kBlockPosition; /* Position Mode *
    [all...]
  /external/tcpdump/missing/
inet_ntop.c 118 u_long words [IN6ADDRSZ / INT16SZ]; local
125 memset (words, 0, sizeof(words));
127 words[i/2] |= (src[i] << ((1 - (i % 2)) << 3));
133 if (words[i] == 0)
173 (best.len == 6 || (best.len == 5 && words[5] == 0xffff)))
183 tp += sprintf (tp, "%lX", words[i]);
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/
BinaryDictDecoderEncoderTests.java 142 final List<String> words, final HashMap<String, List<String>> shortcutMap) {
144 final String word = words.get(i);
157 final List<String> words,
162 dict.setBigram(words.get(w1), words.get(w2), new ProbabilityInfo(BIGRAM_FREQ));
198 private void checkDictionary(final FusionDictionary dict, final List<String> words,
204 for (final String word : words) {
214 words.get(w1));
215 assertNotNull(words.get(w1) + "," + words.get(w2), ptNode.getBigram(words.get(w2)))
277 addUnigrams(words.size(), dict, words, shortcuts); local
    [all...]
  /external/chromium_org/tools/deep_memory_profiler/subcommands/
cat.py 181 words = line.split()
182 bucket = bucket_set.get(int(words[BUCKET_ID]))
184 yield MallocUnit(int(words[BUCKET_ID]),
185 int(words[COMMITTED]),
186 int(words[ALLOC_COUNT]),
187 int(words[FREE_COUNT]),
191 yield MallocUnit(int(words[BUCKET_ID]),
192 int(words[COMMITTED]),
193 int(words[ALLOC_COUNT]),
194 int(words[FREE_COUNT])
    [all...]
  /external/icu/icu4c/source/common/
dictbe.cpp 100 // 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
251 return 0; // Not enough characters for two words
258 PossibleWord words[THAI_LOOKAHEAD]; local
266 // Look for candidate words at the current position
267 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
271 wordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
274 // If there was more than one, see which one can take us forward the most words
282 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0)
486 PossibleWord words[LAO_LOOKAHEAD]; local
687 PossibleWord words[KHMER_LOOKAHEAD]; local
    [all...]
  /ndk/sources/host-tools/sed-4.2.1/sed/
fmt.c 95 /* Size of paragraph buffer in words. Longer paragraphs are handled
182 /* The words of a paragraph -- longer paragraphs are handled neatly
184 static WORD words[MAXWORDS]; variable
259 word_limit = words;
299 after the prefix, and the following indent, and break it into words.
312 end_of_word = &words[MAXWORDS - 2];
389 hitting the limit on the number of words or characters. */
409 for (w = words->next_break; w != word_limit; w = w->next_break)
421 /* Copy words from split_point down to word -- we use memmove because
424 memmove ((char *) words, (char *) split_point
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/accessibility/
AXInlineTextBox.cpp 105 void AXInlineTextBox::wordBoundaries(Vector<PlainTextRange>& words) const
112 words.resize(wordBoundaries.size());
114 words[i] = PlainTextRange(wordBoundaries[i].startIndex, wordBoundaries[i].endIndex - wordBoundaries[i].startIndex);
AXInlineTextBox.h 54 virtual void wordBoundaries(Vector<PlainTextRange>& words) const OVERRIDE;
  /external/chromium_org/third_party/usrsctp/usrsctplib/netinet/
sctp_sha1.c 125 memset(ctx->words, 0, sizeof(ctx->words));
135 /* init the W0-W15 to the block of words being hashed. */
138 ctx->words[i] = ntohl(block[i]);
142 ctx->words[i] = CSHIFT(1, ((ctx->words[(i - 3)]) ^
143 (ctx->words[(i - 8)]) ^
144 (ctx->words[(i - 14)]) ^
145 (ctx->words[(i - 16)])));
160 ctx->words[i]
    [all...]
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/
coffeescript.js 8 function wordRegexp(words) {
9 return new RegExp("^((" + words.join(")|(") + "))\\b");
  /external/chromium_org/net/tools/tld_cleanup/
make_dafsa_unittest.py 62 words = [ 'apa1' ]
63 self.assertEqual(make_dafsa.parse_gperf(infile), words)
68 words = [ 'apa1', 'bepa.com2' ]
69 self.assertEqual(make_dafsa.parse_gperf(infile), words)
75 words = ()
76 self.assertRaises(make_dafsa.InputError, make_dafsa.to_dafsa, words)
94 words = [ 'a0' ]
98 self.assertEqual(make_dafsa.to_dafsa(words), source)
102 words = [ 'ab0' ]
107 self.assertEqual(make_dafsa.to_dafsa(words), source
    [all...]

Completed in 809 milliseconds

12 3 4 5 6 7 8 91011>>