Searched defs:reduce (Results 1 - 12 of 12) sorted by relevance

/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/streams/
H A Drewrite.rb211 def reduce method in class:ANTLR3.RewriteProgram
265 | %s#reduce! should have left only one operation per index,
284 operations = reduce
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
H A DIntArray.java397 public void reduce(int m, int[] redPol) method in class:IntArray
/external/llvm/include/llvm/CodeGen/PBQP/
H A DHeuristicBase.h143 /// \brief Optimally reduce one of the nodes in the optimal reduce list.
144 /// @return True if a reduction takes place, false if the optimal reduce
147 /// Selects a node from the optimal reduce list and removes it, applying
172 void reduce() { function in class:PBQP::HeuristicBase
186 /// \brief Add a node to the heuristic reduce list.
187 /// @param nItr Node iterator to add to the heuristic reduce list.
192 /// \brief Heuristically reduce one of the nodes in the heuristic
193 /// reduce list.
194 /// @return True if a reduction takes place, false if the heuristic reduce
[all...]
/external/icu4c/i18n/
H A Ddigitlst.cpp181 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/webkit/Source/WebCore/rendering/
H A DAutoTableLayout.cpp646 // If we have overallocated, reduce every cell according to the difference between desired width and minwidth
649 // Need to reduce cells with the following prioritization:
667 int reduce = available * minMaxDiff / logicalWidthBeyondMin; local
668 m_layoutStruct[i].computedLogicalWidth += reduce;
669 available -= reduce;
689 int reduce = available * minMaxDiff / logicalWidthBeyondMin; local
690 m_layoutStruct[i].computedLogicalWidth += reduce;
691 available -= reduce;
711 int reduce = available * minMaxDiff / logicalWidthBeyondMin; local
712 m_layoutStruct[i].computedLogicalWidth += reduce;
733 int reduce = available * minMaxDiff / logicalWidthBeyondMin; local
[all...]
/external/v8/benchmarks/
H A Dcrypto.js520 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/webkit/PerformanceTests/SunSpider/tests/v8-v4/
H A Dv8-crypto.js512 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/webkit/PerformanceTests/SunSpider/tests/v8-v5/
H A Dv8-crypto.js512 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/webkit/PerformanceTests/SunSpider/tests/v8-v6/
H A Dv8-crypto.js512 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/genext2fs/
H A Dgenext2fs.c977 int extend = 0, reduce = 0; local
979 reduce = 1;
996 if(reduce) // free first block
1005 if(reduce) // free block
1016 if(reduce) // free indirect block
1022 if(reduce) // free first block
1033 if(reduce) // free block
1045 if(reduce) // free double indirect block
1050 if(reduce) // free firstindirect block
1056 if(reduce) // fre
[all...]
/external/elfutils/src/
H A Dldgeneric.c5765 size_t reduce = xelf_fsize (ld_state.outelf, ELF_T_SYM, nsym_local - 1); local
5776 symdata->d_buf = (char *) symdata->d_buf + reduce;
5777 symdata->d_size -= reduce;
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.sat4j.core_2.2.0.v20100429.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 675 milliseconds