| /external/v8/src/compiler/ |
| value-numbering-reducer.h | 19 virtual Reduction Reduce(Node* node) OVERRIDE;
|
| /external/v8/test/mjsunit/regress/ |
| regress-1436.js | 28 // Check that reduce and reduceRight call the callback function with
32 // Check receiver for reduce and reduceRight.
39 [2, 3].reduce(non_strict);
40 [2, 3].reduce(strict);
|
| /frameworks/compile/mclinker/ |
| mcld-device-build.mk | 3 # The three inline options together reduce libbcc.so almost 1MB.
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonIntrinsicsV3.td | 14 // Vector reduce complex multiply real or imaginary
19 // Vector reduce add unsigned halfwords
|
| HexagonIntrinsicsV4.td | 15 // Vector reduce multiply word by signed half (32x16)
69 // Vector reduce add unsigned halfwords
163 // Vector reduce maximum halfwords
167 // Vector reduce maximum words
171 // Vector reduce minimum halfwords
175 // Vector reduce minimum words
179 // Rotate and reduce bytes
184 // Rotate and reduce bytes with accumulation
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _abbrevs.h | 24 // ugliness is intentional - to reduce conflicts
43 // ugliness is intentional - to reduce conflicts probability
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _abbrevs.h | 24 // ugliness is intentional - to reduce conflicts
43 // ugliness is intentional - to reduce conflicts probability
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _abbrevs.h | 24 // ugliness is intentional - to reduce conflicts
43 // ugliness is intentional - to reduce conflicts probability
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _abbrevs.h | 24 // ugliness is intentional - to reduce conflicts
43 // ugliness is intentional - to reduce conflicts probability
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _abbrevs.h | 24 // ugliness is intentional - to reduce conflicts
43 // ugliness is intentional - to reduce conflicts probability
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _abbrevs.h | 24 // ugliness is intentional - to reduce conflicts
43 // ugliness is intentional - to reduce conflicts probability
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_functools.py | 339 reduce = functools.reduce
340 self.assertEqual(reduce(lambda x, y: x+y, ['a', 'b', 'c'], ''), 'abc')
342 reduce(lambda x, y: x+y, [['a', 'c'], [], ['d', 'w']], []),
345 self.assertEqual(reduce(lambda x, y: x*y, range(2,8), 1), 5040)
347 reduce(lambda x, y: x*y, range(2,21), 1L),
350 self.assertEqual(reduce(lambda x, y: x+y, Squares(10)), 285)
351 self.assertEqual(reduce(lambda x, y: x+y, Squares(10), 0), 285)
352 self.assertEqual(reduce(lambda x, y: x+y, Squares(0), 0), 0)
353 self.assertRaises(TypeError, reduce)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_functools.py | 339 reduce = functools.reduce
340 self.assertEqual(reduce(lambda x, y: x+y, ['a', 'b', 'c'], ''), 'abc')
342 reduce(lambda x, y: x+y, [['a', 'c'], [], ['d', 'w']], []),
345 self.assertEqual(reduce(lambda x, y: x*y, range(2,8), 1), 5040)
347 reduce(lambda x, y: x*y, range(2,21), 1L),
350 self.assertEqual(reduce(lambda x, y: x+y, Squares(10)), 285)
351 self.assertEqual(reduce(lambda x, y: x+y, Squares(10), 0), 285)
352 self.assertEqual(reduce(lambda x, y: x+y, Squares(0), 0), 0)
353 self.assertRaises(TypeError, reduce)
[all...] |
| /cts/tools/dasm/src/java_cup/ |
| reduce_action.java | 4 /** This class represents a reduce action within the parse table.
34 /** The production we reduce with. */
37 /** The production we reduce with. */
45 public int kind() {return REDUCE;}
79 return "REDUCE(" + reduce_with().index() + ")";
|
| lalr_state.java | 29 * of these states to parse. The parser has two operations, shift and reduce.
33 * the end of the transition). For a reduce operation, the parser is
430 * action table and a reduce-goto table. The rows in each table
434 * previous state saved on the stack (reduce entries). All entries in the
436 * reduce-goto table is indexed by non terminals and represents transitions
439 * action table (this cannot happen with the reduce-goto table). Conflicts
440 * are resolved by always shifting for shift/reduce conflicts and choosing
442 * the specification) in reduce/reduce conflicts. All conflicts are
447 * @param reduce_table the reduce-goto table to put entries in
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/custom/sec/ |
| SecP192K1Field.java | 77 reduce(tt, z); method
104 public static void reduce(int[] xx, int[] z) method in class:SecP192K1Field
130 reduce(tt, z); method
139 reduce(tt, z); method
144 reduce(tt, z); method
|
| SecP224K1Field.java | 78 reduce(tt, z); method
105 public static void reduce(int[] xx, int[] z) method in class:SecP224K1Field
131 reduce(tt, z); method
140 reduce(tt, z); method
145 reduce(tt, z); method
|
| SecP256K1Field.java | 79 reduce(tt, z); method
106 public static void reduce(int[] xx, int[] z) method in class:SecP256K1Field
132 reduce(tt, z); method
141 reduce(tt, z); method
146 reduce(tt, z); method
|
| SecP521R1Field.java | 58 reduce(tt, z); method
73 public static void reduce(int[] xx, int[] z) method in class:SecP521R1Field
105 reduce(tt, z); method
114 reduce(tt, z); method
119 reduce(tt, z); method
|
| /system/core/libutils/ |
| LinearTransform.cpp | 213 template <class T> void LinearTransform::reduce(T* N, T* D) { function in class:android::LinearTransform
250 template void LinearTransform::reduce<uint64_t>(uint64_t* N, uint64_t* D);
251 template void LinearTransform::reduce<uint32_t>(uint32_t* N, uint32_t* D);
253 void LinearTransform::reduce(int32_t* N, uint32_t* D) { function in class:android::LinearTransform
257 reduce(reinterpret_cast<uint32_t*>(N), D);
260 reduce(reinterpret_cast<uint32_t*>(N), D);
|
| /external/libopus/silk/ |
| control_SNR.c | 59 /* Reduce bitrate for 10 ms modes in these calculations */
74 /* Reduce coding quality whenever LBRR is enabled, to free up some bits */
|
| /external/llvm/test/CodeGen/AArch64/ |
| arm64-scaled_iv.ll | 1 ; RUN: opt -S -loop-reduce < %s | FileCheck %s
3 ; Make loop-reduce prefer unscaled accesses.
|
| /external/llvm/test/MC/AArch64/ |
| neon-scalar-reduce-pairwise.s | 4 // Scalar Reduce Add Pairwise (Integer)
11 // Scalar Reduce Add Pairwise (Floating Point)
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| var_stride_used_by_compare.ll | 2 ; RUN: opt < %s -loop-reduce -S | \
6 ; RUN: opt < %s -loop-reduce -S | \
|
| /external/skia/tests/ |
| PathOpsCubicQuadIntersectionTest.cpp | 62 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics);
63 int order2 = reduce2.reduce(quad);
|
