/external/deqp/modules/gles3/scripts/ |
H A D | gen-conversions.py | 60 scalars = reduce(operator.add, [x[ndx].toFloat().getScalars() for x in comps]) 68 res.append(Vec.fromScalarList(reduce(operator.add, [x[ndx].toInt().getScalars() for x in comps]))) 77 res.append(Vec.fromScalarList(reduce(operator.add, [x[ndx].toBool().getScalars() for x in comps]))) 83 scalars = reduce(operator.add, [x[ndx].toFloat().getScalars() for x in comps]) 289 maxLen = reduce(max, [len(values) for values in comps])
|
H A D | gen-swizzles.py | 76 self.numCombinations = reduce(operator.mul, map(len, self.lists), 1)
|
/external/chromium_org/chrome/browser/resources/sync_internals/ |
H A D | sync_node_browser.js | 185 reduce(function(a, b) { return a.concat(b); });
|
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | digitlst.h | 301 void reduce();
|
H A D | digitlst.cpp | 181 DigitList::reduce() { function in class:DigitList 463 numToConvert.reduce(); // Removes any trailing zeros, so that digit count is good. 842 reduce(); // Remove any trailing zeros 871 * amount. Never reduce it. Available size is kept in fContext.digits.
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsQuadLineIntersectionThreadedTest.cpp | 86 int order = reducer.reduce(quad);
|
H A D | PathOpsQuadIntersectionTest.cpp | 22 int order1 = reduce1.reduce(quad1); 23 int order2 = reduce2.reduce(quad2);
|
/external/chromium_org/tools/telemetry/telemetry/core/ |
H A D | browser_finder.py | 37 return reduce(operator.add,
|
/external/chromium_org/v8/test/mozilla/ |
H A D | testcfg.py | 99 reduce(os.path.join, testfilepath[:i], ""),
|
/external/deqp/modules/gles2/scripts/ |
H A D | gen-swizzles.py | 76 self.numCombinations = reduce(operator.mul, map(len, self.lists), 1)
|
/external/icu/icu4c/source/i18n/ |
H A D | digitlst.h | 301 void reduce();
|
H A D | digitlst.cpp | 177 DigitList::reduce() { function in class:DigitList 459 numToConvert.reduce(); // Removes any trailing zeros, so that digit count is good. 838 reduce(); // Remove any trailing zeros 867 * amount. Never reduce it. Available size is kept in fContext.digits.
|
/external/skia/tests/ |
H A D | PathOpsQuadLineIntersectionThreadedTest.cpp | 86 int order = reducer.reduce(quad);
|
H A D | PathOpsQuadIntersectionTest.cpp | 22 int order1 = reduce1.reduce(quad1); 23 int order2 = reduce2.reduce(quad2);
|
/external/bison/doc/ |
H A D | Makefile.am | 104 FIGS_DOT = figs/example.dot figs/example-reduce.dot figs/example-shift.dot
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | RegAllocSolver.h | 156 S = backpropagate(G, reduce()); 275 std::vector<GraphBase::NodeId> reduce() { function in class:PBQP::RegAlloc::RegAllocSolverImpl 276 assert(!G.empty() && "Cannot reduce empty graph.");
|
/external/bison/ |
H A D | Android.mk | 177 src/reduce.c \
|
/external/chromium_org/v8/tools/ |
H A D | run_perf.py | 294 res = reduce(lambda r, t: r + t.GetResults(), self._children, Results()) 354 return reduce(lambda r, t: r + t, traces.itervalues(), Results())
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
H A D | v8-crypto.js | 512 function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); } 513 function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); } 517 Classic.prototype.reduce = cReduce; 529 // should reduce x and y(2-xy) by m^2 at each step to keep size bounded. 570 this.reduce(r); 595 function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); } 598 function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); } 602 Montgomery.prototype.reduce = montReduce; 1061 else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; } 1078 function barrettSqrTo(x,r) { x.squareTo(r); this.reduce( [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
H A D | v8-crypto.js | 512 function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); } 513 function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); } 517 Classic.prototype.reduce = cReduce; 529 // should reduce x and y(2-xy) by m^2 at each step to keep size bounded. 570 this.reduce(r); 595 function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); } 598 function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); } 602 Montgomery.prototype.reduce = montReduce; 1061 else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; } 1078 function barrettSqrTo(x,r) { x.squareTo(r); this.reduce( [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
H A D | v8-crypto.js | 512 function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); } 513 function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); } 517 Classic.prototype.reduce = cReduce; 529 // should reduce x and y(2-xy) by m^2 at each step to keep size bounded. 570 this.reduce(r); 595 function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); } 598 function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); } 602 Montgomery.prototype.reduce = montReduce; 1061 else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; } 1078 function barrettSqrTo(x,r) { x.squareTo(r); this.reduce( [all...] |
/external/chromium_org/v8/benchmarks/ |
H A D | crypto.js | 520 function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); } 521 function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); } 525 Classic.prototype.reduce = cReduce; 537 // should reduce x and y(2-xy) by m^2 at each step to keep size bounded. 578 this.reduce(r); 603 function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); } 606 function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); } 610 Montgomery.prototype.reduce = montReduce; 1069 else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; } 1086 function barrettSqrTo(x,r) { x.squareTo(r); this.reduce( [all...] |
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/host/chrome/ |
H A D | expanding_braille_translator.js | 127 var totalCells = chunks.reduce(
|
/external/chromium_org/chrome/browser/resources/print_preview/ |
H A D | cloud_print_interface.js | 408 url = params.reduce(function(partialUrl, param) { 413 body = params.reduce(function(partialBody, param) {
|
/external/chromium_org/chrome/browser/resources/print_preview/search/ |
H A D | destination_search.js | 386 return lists.reduce(function(sum, list, index) { 399 var maxListLength = lists.reduce(function(prevCount, list) {
|