| /cts/apps/CameraITS/tests/scene1/ |
| test_ev_compensation_basic.py | 48 reds = []
73 reds.append(rgb_means[0])
86 if reds[-1] == greens[-1] == blues[-1]:
88 reds.pop(-1)
|
| /external/bison/src/ |
| graphviz.c | 156 output_red (state const *s, reductions const *reds, FILE *fout)
173 for (j = 0; j < reds->num; ++j)
178 rule_number ruleno = reds->rules[j]->number;
186 if (default_reduction && default_reduction == reds->rules[j])
188 if (reds->lookahead_tokens)
192 if (bitset_test (reds->lookahead_tokens[j], i))
|
| graphviz.h | 54 * \param reds the set of reductions
57 void output_red (state const *s, reductions const *reds, FILE *fout);
|
| conflicts.c | 264 reductions *reds = s->reductions;
266 rule *redrule = reds->rules[ruleno];
268 bitset lookahead_tokens = reds->lookahead_tokens[ruleno];
333 reductions *reds = s->reductions;
347 for (i = 0; i < reds->num; ++i)
348 if (reds->rules[i]->prec && reds->rules[i]->prec->prec
349 && !bitset_disjoint_p (reds->lookahead_tokens[i], lookahead_set))
371 for (i = 0; i < reds->num; ++i)
373 if (!bitset_disjoint_p (reds->lookahead_tokens[i], lookahead_set)
263 reductions *reds = s->reductions; local
332 reductions *reds = s->reductions; local
432 reductions *reds = s->reductions; local
465 reductions *reds = s->reductions; local
[all...] |
| print-xml.c | 92 reductions *reds = s->reductions; local
95 if (reds->lookahead_tokens && red != -1)
243 reductions *reds = s->reductions; local
248 if (reds->num == 0)
267 if (reds->lookahead_tokens)
272 for (j = 0; j < reds->num; ++j)
273 if (bitset_test (reds->lookahead_tokens[j], i))
277 if (reds->rules[j] != default_reduction)
297 if (reds->lookahead_tokens)
303 for (j = 0; j < reds->num; ++j
[all...] |
| print.c | 244 reductions *reds = s->reductions;
250 if (reds->num == 0)
267 if (reds->lookahead_tokens)
272 for (j = 0; j < reds->num; ++j)
273 if (bitset_test (reds->lookahead_tokens[j], i))
277 if (reds->rules[j] != default_reduction)
296 if (reds->lookahead_tokens)
304 for (j = 0; j < reds->num; ++j)
305 if (bitset_test (reds->lookahead_tokens[j], i))
309 if (reds->rules[j] != default_reduction
243 reductions *reds = s->reductions; local
[all...] |
| state.c | 101 reductions_new (int num, rule **reds)
103 size_t rules_size = num * sizeof *reds;
107 memcpy (res->rules, reds, rules_size);
215 state_reductions_set (state *s, int num, rule **reds)
218 s->reductions = reductions_new (num, reds);
226 reductions *reds = s->reductions; local
227 for (i = 0; i < reds->num; ++i)
228 if (reds->rules[i] == r)
256 reductions *reds = s->reductions; local
260 if (reds->lookahead_tokens && red != -1
280 reductions *reds = s->reductions; local
[all...] |
| lalr.c | 420 reductions *reds = states[i]->reductions; local
424 if (reds->lookahead_tokens)
425 for (k = 0; k < reds->num; ++k)
426 if (reds->lookahead_tokens[k])
432 if (reds->lookahead_tokens)
433 for (j = 0; j < reds->num; ++j)
434 BITSET_FOR_EACH (iter, reds->lookahead_tokens[j], k, 0)
438 reds->rules[j]->number);
|
| tables.c | 186 reductions *reds = s->reductions; local
198 for (i = 0; i < reds->num; i += 1)
199 if (bitset_test (reds->lookahead_tokens[i], j)
201 != rule_number_as_item_number (reds->rules[i]->number)))
204 conflict_list[conflict_list_cnt] = reds->rules[i]->number + 1;
243 reductions *reds = s->reductions; local
253 if (reds->lookahead_tokens)
260 for (i = reds->num - 1; i >= 0; --i)
263 BITSET_FOR_EACH (biter, reds->lookahead_tokens[i], j, 0)
272 actrow[j] = rule_number_as_item_number (reds->rules[i]->number)
[all...] |
| print_graph.c | 110 reductions *reds = s->reductions; local
114 if (reds->lookahead_tokens && redno != -1)
120 BITSET_FOR_EACH (biter, reds->lookahead_tokens[redno], k, 0)
|
| AnnotationList.c | 166 reductions *reds)
174 for (i = 0; i < reds->num; ++i)
176 bitset_and (conflicted_tokens_rule, tokens, reds->lookahead_tokens[i]);
179 bitset_or (tokens, tokens, reds->lookahead_tokens[i]);
182 aver (i == 0 || reds->rules[i-1] < reds->rules[i]);
[all...] |
| state.h | 238 void state_reductions_set (state *s, int num, rule **reds);
|
| /prebuilts/go/darwin-x86/src/encoding/json/ |
| example_test.go | 25 Name: "Reds",
34 // {"ID":1,"Name":"Reds","Colors":["Crimson","Red","Ruby","Maroon"]}
|
| /prebuilts/go/linux-x86/src/encoding/json/ |
| example_test.go | 25 Name: "Reds",
34 // {"ID":1,"Name":"Reds","Colors":["Crimson","Red","Ruby","Maroon"]}
|
| /frameworks/base/docs/html/design/tv/ |
| style.jd | 69 large areas of the screen. For highly saturated colors (especially reds, greens and blues) you
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopRerollPass.cpp | 255 Reds.clear();
300 Reds.insert(Idx);
316 DenseSet<int> Reds;
[all...] |
| /external/libpng/contrib/gregbook/ |
| rpng-x.c | 158 ush reds[256], greens[256], blues[256];
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/xcb/ |
| xproto.h | 3483 uint16_t reds; \/**< *\/ member in struct:xcb_alloc_color_planes_request_t
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/xcb/ |
| xproto.h | 3484 uint16_t reds; \/**< *\/ member in struct:xcb_alloc_color_planes_request_t
[all...] |
| /external/blktrace/btt/doc/ |
| btt.tex | 589 out. And then one can make the broad generalization of higher reds,
[all...] |
| /prebuilts/misc/linux-x86/bison/ |
| bison | |
| /external/libvncserver/ |
| ChangeLog | 69 = 0x0 blueM = 0x0 redS = 0x0 greenS = 0x0 blueS = 0x0 padding =
73 greenM, blueM, redS, greenS, blueS) + padding + struct.pack(">I",
[all...] |
| /prebuilts/devtools/tools/lib/ |
| jfreechart-swt-1.0.9.jar | |
| /prebuilts/eclipse/mavenplugins/tycho/tycho-dependencies-m2repo/org/eclipse/tycho/tycho-packaging-plugin/0.20.0/ |
| tycho-packaging-plugin-0.20.0.jar | |
| /prebuilts/tools/common/jfreechart/ |
| jfreechart-1.0.9-swt.jar | |
