| /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........
|
| /toolchain/binutils/binutils-2.25/gas/config/ |
| atof-ieee.c | 139 make_invalid_floating_point_number (LITTLENUM_TYPE *words)
143 words[0] = (LITTLENUM_TYPE) ((unsigned) -1) >> 1;
144 words[1] = (LITTLENUM_TYPE) -1;
145 words[2] = (LITTLENUM_TYPE) -1;
146 words[3] = (LITTLENUM_TYPE) -1;
147 words[4] = (LITTLENUM_TYPE) -1;
148 words[5] = (LITTLENUM_TYPE) -1;
165 LITTLENUM_TYPE *words) /* Build the binary here. */
171 /* Number of 16-bit words in the format. */
227 make_invalid_floating_point_number (words);
719 LITTLENUM_TYPE words[MAX_LITTLENUMS]; local
[all...] |
| atof-vax.c | 142 make_invalid_floating_point_number (LITTLENUM_TYPE *words)
144 *words = 0x8000; /* Floating Reserved Operand Code. */
151 int *precisionP, /* Number of 16-bit words in the float. */
195 LITTLENUM_TYPE *words) /* Build the binary here. */
203 int precision; /* Number of 16-bit words in the format. */
216 make_invalid_floating_point_number (words);
230 make_invalid_floating_point_number (words);
233 else if (flonum_gen2vax (what_kind, &f, words))
247 LITTLENUM_TYPE *words) /* Deliver answer here. */
257 make_invalid_floating_point_number (words);
395 LITTLENUM_TYPE words[MAXIMUM_NUMBER_OF_LITTLENUMS]; local
[all...] |
| /external/e2fsprogs/ |
| wordwrap.pl | 12 @words = split;
13 while (defined($word = shift @words)) {
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/ |
| v32-err-2.s | 5 ; Tests that broken words don't crash, just give a message when
|
| /libcore/ojluni/src/main/java/java/util/ |
| BitSet.java | 67 * BitSets are packed into arrays of "words." Currently a word is
92 private long[] words; field in class:BitSet
95 * The number of words in the logical size of this BitSet.
100 * Whether the size of "words" is user-specified. If so, we assume
119 assert(wordsInUse == 0 || words[wordsInUse - 1] != 0);
120 assert(wordsInUse >= 0 && wordsInUse <= words.length);
121 assert(wordsInUse == words.length || words[wordsInUse] == 0);
125 * Sets the field wordsInUse to the logical size in words of the bit set.
126 * WARNING:This method assumes that the number of words actually in use i
222 long[] words = new long[n]; local
267 long[] words = new long[(n + 7) \/ 8]; local
[all...] |
| /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...] |
| /prebuilts/gdb/darwin-x86/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/gdb/linux-x86/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/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...] |
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/arm/ |
| group-reloc-ldc-encoding-bad.l | 98 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
99 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
100 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
101 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
102 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
103 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
104 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
105 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
106 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
107 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
[all...] |
| /external/vulkan-validation-layers/demos/smoke/ |
| glsl-to-spirv | 58 # read the temp file into a list of SPIR-V words
59 words = []
67 words.append(struct.unpack(fmt, data[i:(i + 4)])[0])
69 assert(words[0] == SPIRV_MAGIC)
75 return (words, output.rstrip())
78 words, comments = compile_glsl(in_filename, base + ".tmp")
81 for i in range(0, len(words), COLUMNS):
82 columns = ["0x%08x" % word for word in words[i:(i + COLUMNS)]]
94 """ % (comments, identifierize(base), len(words), "\n".join(literals))
|
| /device/google/contexthub/firmware/src/cpu/cortexm4f/ |
| atomicBitset.c | 26 memset(set->words, 0, sizeof(uint32_t) * ATOMIC_BITSET_NUM_WORDS(numBits));
28 set->words[numBits / 32] = ((uint32_t)((int32_t)-1LL)) << (numBits & 31);
41 return !!((set->words[num / 32]) & (1UL << (num & 31)));
47 uint32_t *wordPtr = set->words + idx;
67 uint32_t *wordPtr = set->words + idx;
88 uint32_t *wordPtr = set->words;
125 otherSet->words[idx] = atomicXchg32bits(&atomicallyAccessedSet->words[idx], otherSet->words[idx]);
138 dest[idx] = atomicRead32bits(&set->words[idx])
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| BurmeseBreakEngine.java | 20 // How many words in a row are "good enough"?
97 PossibleWord words[] = new PossibleWord[BURMESE_LOOKAHEAD]; local
99 words[i] = new PossibleWord();
107 //Look for candidate words at the current position
108 int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
112 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter);
116 // If there was more than one, see which one can take us forward the most words
123 if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
126 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent();
135 // See if any of the possible second words is followed by a third wor
[all...] |
| KhmerBreakEngine.java | 20 // How many words in a row are "good enough"?
29 // Minimum number of characters for two words
100 PossibleWord words[] = new PossibleWord[KHMER_LOOKAHEAD]; local
102 words[i] = new PossibleWord();
111 //Look for candidate words at the current position
112 int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
116 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(fIter);
120 // If there was more than one, see which one can take us forward the most words
127 if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
130 words[wordsFound%KHMER_LOOKAHEAD].markCurrent()
[all...] |
| LaoBreakEngine.java | 20 // How many words in a row are "good enough"?
100 PossibleWord words[] = new PossibleWord[LAO_LOOKAHEAD]; local
102 words[i] = new PossibleWord();
110 //Look for candidate words at the current position
111 int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
115 wordLength = words[wordsFound%LAO_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)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
129 words[wordsFound%LAO_LOOKAHEAD].markCurrent();
138 // See if any of the possible second words is followed by a third wor
[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...] |
| /external/autotest/client/tests/unixbench/ |
| unixbench.py | 57 def check_for_error(self, words):
58 l = len(words)
59 if l >= 3 and words[-3:l] == ['no', 'measured', 'results']:
61 key = '_'.join(words[:-3])
77 words = line.split()
79 if self.check_for_error(words):
84 if len(words) >= 6:
85 key = '_'.join(words[:-6])
87 value = words[-6]
|
| /device/google/contexthub/firmware/src/cpu/x86/ |
| atomicBitset.c | 27 memset(set->words, 0, (numBits + 31) / 8);
29 set->words[numBits / 32] = ((uint32_t)((int32_t)-1LL)) << (numBits & 31);
42 return !!((set->words[num / 32]) & (1UL << (num & 31)));
48 uint32_t *wordPtr = set->words + idx;
64 uint32_t *wordPtr = set->words;
71 if (!(old + 1)) /* no work for words with no clear bits */
|
