Home
last modified time | relevance | path

Searched refs:reduce (Results 1 – 25 of 415) sorted by relevance

12345678910>>...17

/external/v8/test/webkit/
Darray-reduce-expected.txt24 This test checks the behavior of the reduce() method on a number of objects.
29 PASS [0,1,2,3].reduce(function(a,b){ return a + b; }) is 6
30 PASS [1,2,3].reduce(function(a,b){ return a + b; }) is 6
31 PASS [0,1,2,3].reduce(function(a,b){ return a + b; }, 4) is 10
32 PASS [1,2,3].reduce(function(a,b){ return a + b; }, 4) is 10
33 PASS toObject([0,1,2,3]).reduce(function(a,b){ return a + b; }) is 6
34 PASS toObject([1,2,3]).reduce(function(a,b){ return a + b; }) is 6
35 PASS toObject([0,1,2,3]).reduce(function(a,b){ return a + b; }, 4) is 10
36 PASS toObject([1,2,3]).reduce(function(a,b){ return a + b; }, 4) is 10
37 PASS toUnorderedObject([0,1,2,3]).reduce(function(a,b){ return a + b; }) is 6
[all …]
Darray-enumerators-functions-expected.txt141 …stIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnFalse, 0) is count=0;lastIndex=-1;Ar…
142 …astIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnFalse, 0) is count=0;lastIndex=-1;Ar…
143 …dex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], returnFalse, 0) is count=0;lastIndex=-1;Ar…
144 …ex=-1;copyArray(largeSparseArray).reduce(forwarders[f], returnFalse, 0) is count=0;lastIndex=-1;Ar…
145 …astIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnTrue, 0) is count=0;lastIndex=-1;Ar…
146 …lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnTrue, 0) is count=0;lastIndex=-1;Ar…
147 …ndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], returnTrue, 0) is count=0;lastIndex=-1;Ar…
148 …dex=-1;copyArray(largeSparseArray).reduce(forwarders[f], returnTrue, 0) is count=0;lastIndex=-1;Ar…
149 …astIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnElem, 0) is count=0;lastIndex=-1;Ar…
150 …lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnElem, 0) is count=0;lastIndex=-1;Ar…
[all …]
Darray-reduce.js33 o.reduce = Array.prototype.reduce;
44 o.reduce = Array.prototype.reduce;
/external/bison/tests/
Dconflicts.at371 start: error-reduce consistent-error 'a' { USE ($][3); } ;
373 error-reduce:
473 | 'c' reduce-nonassoc // Just makes reduce-nonassoc useful.
477 look reduce-nonassoc
496 reduce-nonassoc: %prec 'a';
513 [[input.y: conflicts: 2 shift/reduce
523 [[input.y: conflicts: 2 shift/reduce
533 [[input.y: conflicts: 2 shift/reduce
557 [input.y: conflicts: 1 shift/reduce
562 [[State 5 conflicts: 1 shift/reduce
[all …]
Dreduce.at582 [[$default]])[ reduce using rule 5 (A)
584 Conflict between rule 5 and token 'a' resolved as reduce (%left 'a').
612 [[$default]])[ reduce using rule 5 (A)
620 [[$default]])[ reduce using rule 7 (c)
628 [[$default]])[ reduce using rule 3 (S)
643 [[$default]])[ reduce using rule 4 (A)
651 [[$default]])[ reduce using rule 1 (S)
659 [[$default]])[ reduce using rule 2 (S)
667 [[$default]])[ reduce using rule 6 (c)]AT_COND_CASE([[LALR]],
680 [[$default]])[ reduce using rule 5 (A)]AT_COND_CASE([[canonical LR]], [[
[all …]
Dglr-regression.at91 [glr-regr1.y: conflicts: 1 shift/reduce
211 [glr-regr2a.y: conflicts: 2 shift/reduce
344 [glr-regr3.y: conflicts: 1 shift/reduce, 1 reduce/reduce
439 [glr-regr4.y: conflicts: 1 reduce/reduce
499 [glr-regr5.y: conflicts: 1 reduce/reduce
551 [glr-regr6.y: conflicts: 1 reduce/reduce
640 [glr-regr7.y: conflicts: 2 reduce/reduce
734 [glr-regr8.y: conflicts: 1 reduce/reduce
814 [glr-regr9.y: conflicts: 1 reduce/reduce
870 [glr-regr10.y: conflicts: 1 reduce/reduce
[all …]
Dexisting.at410 dnl GNU AWK 3.0.6, 3.1.0, and 3.1.1. They reduce the full getline expression
417 dnl That is, like the other versions of GNU AWK, they reduce the full getline
430 [[input.y: conflicts: 265 shift/reduce]],
431 [[input.y: conflicts: 65 shift/reduce]])[
446 dnl - 56 -> 326: reduce -> shift on '*', '/', and '%'
447 dnl - 58 -> 327: reduce -> shift on '*', '/', and '%'
448 dnl - 61 -> 328: reduce -> shift on '*', '/', and '%'
457 NAME [reduce using rule 152 (opt_variable)]
458 '$' [reduce using rule 152 (opt_variable)]
466 NAME [reduce using rule 152 (opt_variable)]
[all …]
/external/skia/tests/
DPathOpsCubicReduceOrderTest.cpp110 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
119 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
122 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
129 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
138 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
147 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
156 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
159 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
166 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
176 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); in DEF_TEST()
[all …]
DPathOpsQuadReduceOrderTest.cpp24 SkDEBUGCODE(int result = ) reducer.reduce(quad); in oneOffTest()
51 order = reducer.reduce(quad); in standardTestCases()
58 order = reducer.reduce(quad); in standardTestCases()
DPathOpsCubicLineIntersectionTest.cpp34 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); in testFail()
35 int order2 = reduce2.reduce(line); in testFail()
132 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); in testOne()
133 int order2 = reduce2.reduce(line); in testOne()
/external/v8/src/compiler/
Dgraph-reducer.cc27 bool reduce = true; in ReduceNode() local
29 if (!reduce) return; in ReduceNode()
30 reduce = false; // Assume we don't need to rerun any reducers. in ReduceNode()
43 reduce = true; in ReduceNode()
68 reduce = true; in ReduceNode()
/external/skia/src/pathops/
DSkReduceOrder.h20 int reduce(const SkDCubic& cubic, Quadratics);
21 int reduce(const SkDLine& line);
22 int reduce(const SkDQuad& quad);
DSkReduceOrder.cpp9 int SkReduceOrder::reduce(const SkDLine& line) { in reduce() function in SkReduceOrder
63 int SkReduceOrder::reduce(const SkDQuad& quad) { in reduce() function in SkReduceOrder
203 int SkReduceOrder::reduce(const SkDCubic& cubic, Quadratics allowQuadratics) { in reduce() function in SkReduceOrder
265 int order = reducer.reduce(quad); in Quad()
291 int order = reducer.reduce(cubic, kAllow_Quadratics); in Cubic()
/external/llvm/test/CodeGen/Generic/
Dstop-after.ll1 ; RUN: llc < %s -debug-pass=Structure -stop-after=loop-reduce -o /dev/null 2>&1 | FileCheck %s -che…
2 ; RUN: llc < %s -debug-pass=Structure -start-after=loop-reduce -o /dev/null 2>&1 | FileCheck %s -ch…
4 ; STOP: -loop-reduce -print-module
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/custom/sec/
DSecP521R1Field.java58 reduce(tt, z); in multiply()
73 public static void reduce(int[] xx, int[] z) in reduce() method in SecP521R1Field
105 reduce(tt, z); in square()
114 reduce(tt, z); in squareN()
119 reduce(tt, z); in squareN()
DSecP256K1Field.java79 reduce(tt, z); in multiply()
106 public static void reduce(int[] xx, int[] z) in reduce() method in SecP256K1Field
132 reduce(tt, z); in square()
141 reduce(tt, z); in squareN()
146 reduce(tt, z); in squareN()
DSecP224K1Field.java78 reduce(tt, z); in multiply()
105 public static void reduce(int[] xx, int[] z) in reduce() method in SecP224K1Field
131 reduce(tt, z); in square()
140 reduce(tt, z); in squareN()
145 reduce(tt, z); in squareN()
DSecP192K1Field.java77 reduce(tt, z); in multiply()
104 public static void reduce(int[] xx, int[] z) in reduce() method in SecP192K1Field
130 reduce(tt, z); in square()
139 reduce(tt, z); in squareN()
144 reduce(tt, z); in squareN()
DSecP192R1Field.java78 reduce(tt, z); in multiply()
105 public static void reduce(int[] xx, int[] z) in reduce() method in SecP192R1Field
199 reduce(tt, z); in square()
208 reduce(tt, z); in squareN()
213 reduce(tt, z); in squareN()
DSecP224R1Field.java78 reduce(tt, z); in multiply()
105 public static void reduce(int[] xx, int[] z) in reduce() method in SecP224R1Field
205 reduce(tt, z); in square()
214 reduce(tt, z); in squareN()
219 reduce(tt, z); in squareN()
DSecP256R1Field.java75 reduce(tt, z); in multiply()
99 public static void reduce(int[] xx, int[] z) in reduce() method in SecP256R1Field
200 reduce(tt, z); in square()
209 reduce(tt, z); in squareN()
214 reduce(tt, z); in squareN()
DSecP384R1Field.java81 reduce(tt, z); in multiply()
96 public static void reduce(int[] xx, int[] z) in reduce() method in SecP384R1Field
196 reduce(tt, z); in square()
205 reduce(tt, z); in squareN()
210 reduce(tt, z); in squareN()
/external/llvm/lib/Target/Hexagon/
DHexagonIntrinsicsV4.td15 // 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
/external/bison/po/
Dbison.pot41 msgid " Conflict between rule %d and token %s resolved as reduce"
51 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
56 msgid "conflicts: %d shift/reduce\n"
61 msgid "conflicts: %d reduce/reduce\n"
76 msgid "expected %d shift/reduce conflict"
77 msgid_plural "expected %d shift/reduce conflicts"
83 msgid "expected %d reduce/reduce conflict"
84 msgid_plural "expected %d reduce/reduce conflicts"
208 " `solved' describe shift/reduce conflicts solving\n"
380 msgid "reduce using rule %d (%s)"
[all …]
Dzh_CN.po41 msgid " Conflict between rule %d and token %s resolved as reduce"
51 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
56 msgid "conflicts: %d shift/reduce\n"
61 msgid "conflicts: %d reduce/reduce\n"
76 msgid "expected %d shift/reduce conflict"
77 msgid_plural "expected %d shift/reduce conflicts"
82 msgid "expected %d reduce/reduce conflict"
83 msgid_plural "expected %d reduce/reduce conflicts"
206 " `solved' describe shift/reduce conflicts solving\n"
384 msgid "reduce using rule %d (%s)"
[all …]

12345678910>>...17