Searched refs:largest (Results 1 - 25 of 27) sorted by relevance

12

/external/skia/src/pathops/
H A DSkPathOpsLine.cpp75 // find the ordinal in the original line with the largest unsigned exponent
77 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); local
78 largest = SkTMax(largest, -tiniest);
79 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
83 *unequal = (float) largest != (float) (largest + dist);
99 // find the ordinal in the original line with the largest unsigned exponent
101 double largest local
133 double largest = SkTMax(SkTMax(y, left), right); local
168 double largest = SkTMax(SkTMax(x, top), bottom); local
[all...]
H A DSkPathOpsPoint.h142 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); local
143 largest = SkTMax(largest, -tiniest);
144 return AlmostPequalUlps(largest, largest + dist); // is the dist within ULPS tolerance?
165 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); local
166 largest = SkTMax(largest, -tiniest);
167 return AlmostPequalUlps((double) largest, largest
203 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); local
217 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); local
[all...]
H A DSkPathOpsQuad.cpp152 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), local
154 largest = SkTMax(largest, -tiniest);
155 return approximately_zero_when_compared_to(distance, largest);
H A DSkPathOpsCubic.cpp221 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), local
223 largest = SkTMax(largest, -tiniest);
225 if (!approximately_zero_when_compared_to(distance, largest)) {
229 return approximately_zero_when_compared_to(distance, largest);
H A DSkPathOpsTSect.h905 // so that each quad sect has a pointer to the largest, and can update it as spans
910 SkTSpan<TCurve, OppCurve>* largest = fHead; local
911 bool lCollapsed = largest->fCollapsed;
915 largest->fBoundsMax < test->fBoundsMax)) {
916 largest = test;
920 return largest;
1925 // find the largest bounds
/external/openfst/src/include/fst/
H A Dheap.h165 int largest; local
168 largest = l;
170 largest = i;
172 if (r < size_ && Better(A_[r], A_[largest]) )
173 largest = r;
175 if (largest != i) {
176 Swap(i, largest);
177 Heapify(largest);
/external/llvm/test/MC/COFF/
H A Dlinkonce.s30 .linkonce largest
H A Dsection-comdat.s32 .section SecName, "dr", largest, "Symbol6"
/external/skia/src/core/
H A DSkChunkAlloc.cpp89 Block* largest = fBlock; local
91 if (largest) {
93 for (Block* cur = largest->fNext; cur; cur = next) {
95 if (cur->blockSize() > largest->blockSize()) {
96 sk_free(largest);
97 largest = cur;
103 largest->reset();
104 fTotalCapacity = largest->blockSize();
111 fBlock = largest;
H A DSkPath.cpp2131 SkScalar largest = SkTMax(fCurrPt.fX, SkTMax(fCurrPt.fY, SkTMax(fLastPt.fX, fLastPt.fY))); local
2132 largest = SkTMax(largest, -smallest);
2134 if (!almost_equal(largest, largest + cross)) {
2147 if (!approximately_zero_when_compared_to(dCross, SkScalarToDouble(largest))) {
/external/speex/libspeex/
H A Dstereo.c151 spx_word32_t largest, smallest; local
177 largest = e_left;
181 largest = e_right;
187 shift = spx_ilog2(largest)-15;
188 largest = VSHR32(largest, shift-4);
190 balance = DIV32(largest, ADD32(smallest, 1));
195 balance=(largest+1.)/(smallest+1.);
216 /*fprintf (stderr, "%d %d %d %d\n", largest, smallest, balance_id, e_ratio);*/
/external/skia/tests/
H A DPathOpsCubicLineIntersectionIdeas.cpp182 double largest = SkTMax(fabs(allRoots[0]), fabs(allRoots[1])); local
184 largest = SkTMax(largest, fabs(allRoots[2]));
187 if (largest <= 1) {
201 frexp(largest, &largeBits);
H A DMatrixTest.cpp454 SkScalar largest = (b > a) ? b : a; local
456 if (diff <= largest*tolerance) {
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
H A DLUDecompositionImpl.java117 double largest = Double.NEGATIVE_INFINITY;
127 if (FastMath.abs(sum) > largest) {
128 largest = FastMath.abs(sum);
H A DBigMatrixImpl.java1251 BigDecimal largest = ZERO;
1261 if (sum.abs().compareTo(largest) == 1) {
1262 largest = sum.abs();
/external/nanohttpd/
H A DREADME.md22 * Very low memory overhead when processing even the largest of requests.
/external/libvpx/libvpx/vpx_dsp/arm/
H A Dloopfilter_mb_neon.asm319 ; only compare the largest value to limit
341 ; only compare the largest value to thresh
375 ; only compare the largest value to thresh
H A Dloopfilter_8_neon.asm203 ; only compare the largest value to limit
227 ; only compare the largest value to thresh
H A Dloopfilter_4_neon.asm194 ; only compare the largest value to limit
/external/mesa3d/src/mesa/program/
H A Dprog_execute.c1372 const float largest = 1.884467e+19, smallest = 5.42101e-20; local
1388 if (r > largest) {
1389 r = largest;
1396 if (r < -largest) {
1397 r = -largest;
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Ddfa.rb72 The largest value of the next input symbol that has
/external/libvorbis/doc/
H A D07-floor1.tex122 5) [maximum_class] = largest integer scalar value in vector [floor1_partition_class_list]
/external/llvm/lib/AsmParser/
H A DLLLexer.cpp644 KEYWORD(largest);
/external/libvpx/libvpx/third_party/libyuv/source/
H A Dx86inc.asm32 ; to the largest audience possible. Of course, if you modify it for your own
/external/libvpx/libvpx/vp9/decoder/
H A Dvp9_decodeframe.c1665 // Rearrange the tile buffers such that per-tile group the largest, and
1672 const TileBuffer largest = tile_buffers[0][group_start]; local
1676 tile_buffers[0][group_end] = largest;

Completed in 496 milliseconds

12