| /development/samples/training/multiscreen/newsreader/src/com/example/android/newsreader/ |
| NonsenseGenerator.java | 77 List<String> words = new ArrayList<String>(); local
78 generateSentence(words, isHeadline);
79 words.set(0, String.valueOf(Character.toUpperCase(words.get(0).charAt(0))) +
80 words.get(0).substring(1));
81 return joinWords(words);
102 * @param words the list of words to which the sentence will be appended.
105 private void generateSentence(List<String> words, boolean isHeadline) {
107 generateTimeClause(words, isHeadline)
[all...] |
| /external/mesa3d/src/glsl/glcpp/tests/ |
| 039-func-arg-obj-macro-with-comma.c | 2 #define bar two,words
|
| /external/valgrind/none/tests/x86/ |
| cpuid.stdout.exp | 1 cpuid words (0): 0x........ 0x........ 0x........ 0x........
2 cpuid words (1): 0x........ 0x........ 0x........ 0x........
|
| /external/e2fsprogs/ |
| wordwrap.pl | 12 @words = split;
13 while (defined($word = shift @words)) {
|
| /external/valgrind/memcheck/tests/ |
| wrap6.c | 182 UInt* words = calloc(200, sizeof(UInt)); local
183 TRASH_IREGS(r, words);
184 free(words);
208 UInt* words = calloc(200, sizeof(UInt)); local
209 words[1-1] = a1;
210 TRASH_IREGS(r, words);
211 free(words);
235 UInt* words = calloc(200, sizeof(UInt)); local
236 words[1-1] = a1;
237 words[2-1] = a2
263 UInt* words = calloc(200, sizeof(UInt)); local
292 UInt* words = calloc(200, sizeof(UInt)); local
322 UInt* words = calloc(200, sizeof(UInt)); local
353 UInt* words = calloc(200, sizeof(UInt)); local
386 UInt* words = calloc(200, sizeof(UInt)); local
422 UInt* words = calloc(200, sizeof(UInt)); local
459 UInt* words = calloc(200, sizeof(UInt)); local
497 UInt* words = calloc(200, sizeof(UInt)); local
536 UInt* words = calloc(200, sizeof(UInt)); local
576 UInt* words = calloc(200, sizeof(UInt)); local
[all...] |
| test-plo.c | 73 UWord* words = malloc(3 * sizeof(UWord)); local
74 free(words);
77 UWord w = words[1];
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| AutoExpand.py | 26 words = self.getwords()
29 words, index, insert, line = self.state
31 words = self.getwords()
33 if not words:
38 newword = words[index]
39 index = (index + 1) % len(words)
45 self.state = words, index, curinsert, curline
60 words = []
62 # search backwards through words before
67 words.append(w
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| AutoExpand.py | 26 words = self.getwords()
29 words, index, insert, line = self.state
31 words = self.getwords()
33 if not words:
38 newword = words[index]
39 index = (index + 1) % len(words)
45 self.state = words, index, curinsert, curline
60 words = []
62 # search backwards through words before
67 words.append(w
[all...] |
| /pdk/util/ |
| diff_products.py | 50 words = line.split()
51 if len(words) < 2:
53 if words[0] in PRODUCT_KEYWORDS:
55 if overrideProperty and words[1] == ":=":
56 if len(productData[words[0]]) != 0:
57 print "** Warning: overriding property " + words[0] + " that was:" + \
58 productData[words[0]]
59 productData[words[0]] = {}
60 d = productData[words[0]]
61 for word in words[2:]
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| 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...] |
| 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...] |
| 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...] |
| ThaiBreakEngine.java | 19 // How many words in a row are "good enough"?
32 // Minimum number of characters for two words
109 PossibleWord words[] = new PossibleWord[THAI_LOOKAHEAD]; local
111 words[i] = new PossibleWord();
120 //Look for candidate words at the current position
121 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
125 wordLength = words[wordsFound%THAI_LOOKAHEAD].acceptMarked(fIter);
129 // If there was more than one, see which one can take us forward the most words
136 if (words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
139 words[wordsFound%THAI_LOOKAHEAD].markCurrent()
[all...] |
| /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/mesa3d/src/gallium/auxiliary/util/ |
| u_bitmask.c | 53 util_bitmask_word *words; member in struct:util_bitmask
72 bm->words = (util_bitmask_word *)CALLOC(UTIL_BITMASK_INITIAL_WORDS, sizeof(util_bitmask_word));
73 if(!bm->words) {
114 new_words = (util_bitmask_word *)REALLOC((void *)bm->words,
125 bm->words = new_words;
174 if(!(bm->words[word] & mask))
190 assert(!(bm->words[word] & mask));
191 bm->words[word] |= mask;
215 bm->words[word] |= mask;
240 bm->words[word] &= ~mask
[all...] |
| /prebuilts/python/darwin-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:
|
| /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);
|
| /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])
|
| /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);
|
| /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...] |
