| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _slist_base.h | 55 // moved here to reduce code bloat without templatizing _Slist_iterator_base
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _slist_base.h | 55 // moved here to reduce code bloat without templatizing _Slist_iterator_base
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _slist_base.h | 55 // moved here to reduce code bloat without templatizing _Slist_iterator_base
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _slist_base.h | 55 // moved here to reduce code bloat without templatizing _Slist_iterator_base
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _slist_base.h | 55 // moved here to reduce code bloat without templatizing _Slist_iterator_base
|
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_exp2f.c | 75 * Reduce x:
79 * Reduce y:
120 /* Reduce x, computing z, i0, and k. */
|
| /cts/tools/dasm/src/java_cup/ |
| parse_action.java | 5 * Full entries will either be SHIFT(state_num), REDUCE(production), or ERROR.
42 /** Constants for action type -- reduce action. */
43 public static final int REDUCE = 2;
|
| emit.java | 34 * (shift, reduce, or error) under each lookahead symbol.<br>
35 * <dt> reduce-goto table
36 * <dd> when a reduce on a given production is taken, the parse stack is
67 do_reduce_table - emit declaration and init for the reduce-goto table
91 not_reduced - count of number of productions that never reduce.
207 /** Time to produce the reduce-goto table. */
478 * @param compact_reduces do we use the most frequent reduce as default?
528 /* reduce actions get negated entries of production# + 1 */
529 else if (act.kind() == parse_action.REDUCE)
564 /** Emit the reduce-goto table
[all...] |
| /external/bison/data/xslt/ |
| bison.xsl | 76 name="reduce-count"
79 <xsl:if test="$shift-count > 0 and $reduce-count > 0">
82 <xsl:if test="$reduce-count > 1">
|
| /ndk/sources/host-tools/nawk-20071023/ |
| README | 40 conflicts: 43 shift/reduce, 85 reduce/reduce
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/math/tools/ |
| promotion.hpp | 14 // that help to reduce the risk of creating multiple instantiations.
73 // These full specialisations reduce mpl::if_ usage and speed up
99 // These full specialisations reduce mpl::if_ usage and speed up
|
| /external/bison/po/ |
| es.po | 74 msgid " Conflict between rule %d and token %s resolved as reduce"
88 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
105 msgid "conflicts: %d shift/reduce\n"
122 msgid "conflicts: %d reduce/reduce\n"
137 msgid "expected %d shift/reduce conflict"
138 msgid_plural "expected %d shift/reduce conflicts"
144 msgid "expected %d reduce/reduce conflict
[all...] |
| hr.po | 44 msgid " Conflict between rule %d and token %s resolved as reduce"
54 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
59 msgid "conflicts: %d shift/reduce\n"
64 msgid "conflicts: %d reduce/reduce\n"
79 msgid "expected %d shift/reduce conflict"
80 msgid_plural "expected %d shift/reduce conflicts"
87 msgid "expected %d reduce/reduce conflict
[all...] |
| tr.po | 42 msgid " Conflict between rule %d and token %s resolved as reduce"
52 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
57 msgid "conflicts: %d shift/reduce\n"
62 msgid "conflicts: %d reduce/reduce\n"
77 msgid "expected %d shift/reduce conflict"
78 msgid_plural "expected %d shift/reduce conflicts"
83 msgid "expected %d reduce/reduce conflict
[all...] |
| vi.po | 45 msgid " Conflict between rule %d and token %s resolved as reduce"
48 "(reduce)."
58 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
63 msgid "conflicts: %d shift/reduce\n"
68 msgid "conflicts: %d reduce/reduce\n"
83 msgid "expected %d shift/reduce conflict"
84 msgid_plural "expected %d shift/reduce conflicts
[all...] |
| /cts/tools/dasm/src/java_cup/runtime/ |
| lr_parser.java | 7 * LR parsers are a form of bottom up shift-reduce parsers. Shift-reduce
10 * stack. Once this occurs, a reduce is performed. This involves removing
15 * To control the decision of whether to shift or reduce at any given point,
21 * determine whether to shift or to reduce. When the parser shifts, it
25 * it was in before any of those symbols were matched. Next the reduce-goto
55 * <dd> Provides a reference to the reduce-goto table.
66 * the point of a reduce in the parse, so this code also allocates and
68 * pushed onto the stack for the reduce.
146 * the negative-encoded values (reduce actions) in the action_table.
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/custom/sec/ |
| SecP256R1Field.java | 75 reduce(tt, z); method
99 public static void reduce(int[] xx, int[] z) method in class:SecP256R1Field
200 reduce(tt, z); method
209 reduce(tt, z); method
214 reduce(tt, z); method
|
| SecP384R1Field.java | 81 reduce(tt, z); method
96 public static void reduce(int[] xx, int[] z) method in class:SecP384R1Field
196 reduce(tt, z); method
205 reduce(tt, z); method
210 reduce(tt, z); method
|
| /frameworks/base/docs/html/training/wearables/watch-faces/ |
| performance.jd | 9 <li><a href="#ReduceSize">Reduce the Size of Your Bitmap Assets</a></li>
32 <h2 id="ReduceSize">Reduce the Size of Your Bitmap Assets</h2>
145 practices in this section to reduce the power consumption of your watch face.</p>
147 <h3>Reduce the frame rate of animations</h3>
158 Letting the CPU sleep often, even briefly, can significantly reduce power consumption.</p>
|
| /external/v8/test/cctest/compiler/ |
| test-graph-reducer.cc | 38 virtual Reduction Reduce(Node* node) {
62 virtual Reduction Reduce(Node* node) {
84 virtual Reduction Reduce(Node* node) {
108 virtual Reduction Reduce(Node* node) OVERRIDE {
124 virtual Reduction Reduce(Node* node) OVERRIDE {
138 virtual Reduction Reduce(Node* node) {
151 virtual Reduction Reduce(Node* node) {
164 virtual Reduction Reduce(Node* node) {
187 virtual Reduction Reduce(Node* node) {
632 virtual Reduction Reduce(Node* node)
[all...] |
| test-machine-operator-reducer.cc | 101 Reduction reduction = reducer.Reduce(n);
113 Reduction reduction = reducer.Reduce(n);
125 Reduction reduction = reducer.Reduce(n);
140 Reduction r = reducer.Reduce(n);
155 Reduction r = reducer.Reduce(n);
172 Reduction reduction = reducer.Reduce(n);
180 Reduction reduction = reducer.Reduce(n);
196 Reduction reduction = reducer.Reduce(n);
666 Reduction reduction = reducer.Reduce(load);
675 Reduction reduction = reducer.Reduce(store)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| pickle.py | 116 REDUCE = 'R' # apply callable to argtuple, both on stack
290 reduce = dispatch_table.get(t)
291 if reduce:
292 rv = reduce(obj)
304 reduce = getattr(obj, "__reduce_ex__", None)
305 if reduce:
306 rv = reduce(self.proto)
308 reduce = getattr(obj, "__reduce__", None) variable in class:Pickler.save.
309 if reduce:
310 rv = reduce()
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| pickle.py | 116 REDUCE = 'R' # apply callable to argtuple, both on stack
290 reduce = dispatch_table.get(t)
291 if reduce:
292 rv = reduce(obj)
304 reduce = getattr(obj, "__reduce_ex__", None)
305 if reduce:
306 rv = reduce(self.proto)
308 reduce = getattr(obj, "__reduce__", None) variable in class:Pickler.save.
309 if reduce:
310 rv = reduce()
[all...] |
| /external/llvm/tools/bugpoint/ |
| CrashDebugger.cpp | 246 /// the CFG really fast which can reduce large functions quickly.
430 /// on a program, try to destructively reduce the program while still keeping
439 // Now try to reduce the number of global variable initializers in the
473 outs() << "\n*** Attempting to reduce the number of global "
488 // Now try to reduce the number of functions in the module to something small.
496 outs() << "\n*** Attempting to reduce the number of functions "
545 outs() << "\n*** Attempting to reduce testcase by deleting instruc"
584 // to reduce the testcase...
631 // Reduce the list of passes which causes the optimizer to crash...
659 /// crashes on an input. It attempts to reduce the input as much as possibl
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.c | 367 // We are trying to reduce number of buckets, we have to validate it:
398 // We only try to reduce the hashtable if the theorical load factor
410 /* We are only going to reduce number of buckets if moving to yet the previous number
425 // Can we reduce further:
429 // We cannot reduce further.
446 // We can try to reduce size:
|
