/frameworks/native/libs/ui/ |
Rect.cpp | 110 Rect Rect::reduce(const Rect& exclude) const { function in class:android::Rect
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
functools.py | 10 from _functools import partial, reduce namespace
|
csv.py | 7 from functools import reduce namespace 248 quotechar = reduce(lambda a, b, quotes = quotes: 252 delim = reduce(lambda a, b, delims = delims: 324 modes[char] = reduce(lambda a, b: a[1] > b[1] and a or b, 330 - reduce(lambda a, b: (0, a[1] + b[1]),
|
difflib.py | 37 from functools import reduce namespace 658 matches = reduce(lambda sum, triple: sum + triple[-1], [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
functools.py | 10 from _functools import partial, reduce namespace
|
csv.py | 7 from functools import reduce namespace 248 quotechar = reduce(lambda a, b, quotes = quotes: 252 delim = reduce(lambda a, b, delims = delims: 324 modes[char] = reduce(lambda a, b: a[1] > b[1] and a or b, 330 - reduce(lambda a, b: (0, a[1] + b[1]),
|
difflib.py | 37 from functools import reduce namespace 658 matches = reduce(lambda sum, triple: sum + triple[-1], [all...] |
/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/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/streams/ |
rewrite.rb | 211 def reduce method in class:ANTLR3.RewriteProgram 265 | %s#reduce! should have left only one operation per index, 284 operations = reduce
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
HeuristicBase.h | 143 /// \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/chromium_org/third_party/icu/source/i18n/ |
digitlst.cpp | 177 // Reduce - remove trailing zero digits. 179 DigitList::reduce() { function in class:DigitList 438 numToConvert.reduce(); // Removes any trailing zeros, so that digit count is good. 765 reduce(); // Remove any trailing zeros 794 * amount. Never reduce it. Available size is kept in fContext.digits.
|
/external/icu4c/i18n/ |
digitlst.cpp | 179 // Reduce - remove trailing zero digits. 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/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
ECFieldElement.java | [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
SkReduceOrder.cpp | 9 int SkReduceOrder::reduce(const SkDLine& line) { function in class:SkReduceOrder 134 // reduce to a quadratic or smaller 140 int SkReduceOrder::reduce(const SkDQuad& quad, Style reduceStyle) { function in class:SkReduceOrder 363 // reduce to a quadratic or smaller 369 int SkReduceOrder::reduce(const SkDCubic& cubic, Quadratics allowQuadratics, function in class:SkReduceOrder 432 int order = reducer.reduce(quad, kFill_Style); 445 int order = reducer.reduce(cubic, kAllow_Quadratics, kFill_Style);
|
/external/skia/src/pathops/ |
SkReduceOrder.cpp | 9 int SkReduceOrder::reduce(const SkDLine& line) { function in class:SkReduceOrder 134 // reduce to a quadratic or smaller 140 int SkReduceOrder::reduce(const SkDQuad& quad, Style reduceStyle) { function in class:SkReduceOrder 363 // reduce to a quadratic or smaller 369 int SkReduceOrder::reduce(const SkDCubic& cubic, Quadratics allowQuadratics, function in class:SkReduceOrder 432 int order = reducer.reduce(quad, kFill_Style); 445 int order = reducer.reduce(cubic, kAllow_Quadratics, kFill_Style);
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
test_random.py | 9 from functools import reduce namespace 88 return reduce(int.__mul__, xrange(1, n), 1)
|
test_itertools.py | 12 from functools import reduce namespace 49 return reduce(operator.mul, iterable, 1) [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
test_random.py | 9 from functools import reduce namespace 88 return reduce(int.__mul__, xrange(1, n), 1)
|
test_itertools.py | 12 from functools import reduce namespace 49 return reduce(operator.mul, iterable, 1) [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
AutoTableLayout.cpp | 629 // If we have overallocated, reduce every cell according to the difference between desired width and minwidth 632 // Need to reduce cells with the following prioritization: 651 int reduce = available * minMaxDiff / logicalWidthBeyondMin; local 652 m_layoutStruct[i].computedLogicalWidth += reduce; 653 available -= reduce; 675 int reduce = available * minMaxDiff / logicalWidthBeyondMin; local 676 m_layoutStruct[i].computedLogicalWidth += reduce 699 int reduce = available * minMaxDiff \/ logicalWidthBeyondMin; local [all...] |
/cts/suite/cts/deviceTests/browserbench/assets/octane/ |
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(r); [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
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(r); [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
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(r); [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
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(r); [all...] |
/external/chromium_org/v8/benchmarks/ |
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(r); [all...] |