| /external/ImageMagick/MagickCore/ |
| D | segment.c | 247 static MagickBooleanType Classify(Image *image,short **extrema, in Classify() argument
313 while (DefineRegion(extrema[Red],&red) != 0) in Classify()
316 while (DefineRegion(extrema[Green],&green) != 0) in Classify()
319 while (DefineRegion(extrema[Blue],&blue) != 0) in Classify()
821 static ssize_t DefineRegion(const short *extrema,ExtentPacket *extents) in DefineRegion() argument
833 if (extrema[extents->index] > 0) in DefineRegion()
842 if (extrema[extents->index] < 0) in DefineRegion()
965 *extrema[MaxDimension]; in GetImageDynamicThreshold() local
983 extrema[i]=(short *) AcquireQuantumMemory(256UL,sizeof(**histogram)); in GetImageDynamicThreshold()
984 if ((histogram[i] == (ssize_t *) NULL) || (extrema[i] == (short *) NULL)) in GetImageDynamicThreshold()
[all …]
|
| /external/arm-optimized-routines/math/tools/ |
| D | remez.jl | 499 extrema = array1d(Tuple{BigFloat, BigFloat}, 0)
515 push!(extrema, goldensection(f, xp, xi, xn))
518 push!(extrema, (x, -y))
521 return extrema
544 function winnow_extrema(extrema::Array{Tuple{BigFloat,BigFloat}}, n)
550 for (x,y) = extrema
852 extrema = find_extrema(compute_error, grid)
853 @debug("minimax", "all extrema = ", format_xylist(extrema))
857 extrema = winnow_extrema(extrema, n+d+2)
858 @debug("minimax", "winnowed extrema = ", format_xylist(extrema))
[all …]
|
| /external/llvm-project/libc/AOR_v20.02/math/tools/ |
| D | remez.jl | 500 extrema = array1d(Tuple{BigFloat, BigFloat}, 0)
516 push!(extrema, goldensection(f, xp, xi, xn))
519 push!(extrema, (x, -y))
522 return extrema
545 function winnow_extrema(extrema::Array{Tuple{BigFloat,BigFloat}}, n)
551 for (x,y) = extrema
853 extrema = find_extrema(compute_error, grid)
854 @debug("minimax", "all extrema = ", format_xylist(extrema))
858 extrema = winnow_extrema(extrema, n+d+2)
859 @debug("minimax", "winnowed extrema = ", format_xylist(extrema))
[all …]
|
| /external/skia/src/pathops/ |
| D | SkDCubicLineIntersection.cpp | 140 int extrema = SkDCubic::FindExtrema(&c[0].fX, extremeTs); in intersectRay() local
141 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots); in intersectRay()
176 int extrema = SkDCubic::FindExtrema(&c[0].fY, extremeTs); in HorizontalIntersect() local
177 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); in HorizontalIntersect()
239 int extrema = SkDCubic::FindExtrema(&c[0].fX, extremeTs); in VerticalIntersect() local
240 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kXAxis, roots); in VerticalIntersect()
|
| D | SkPathOpsCubic.cpp | 342 int SkDCubic::searchRoots(double extremeTs[6], int extrema, double axisIntercept, in searchRoots() argument
344 extrema += findInflections(&extremeTs[extrema]); in searchRoots()
345 extremeTs[extrema++] = 0; in searchRoots()
346 extremeTs[extrema] = 1; in searchRoots()
347 SkASSERT(extrema < 6); in searchRoots()
348 SkTQSort(extremeTs, extremeTs + extrema + 1); in searchRoots()
350 for (int index = 0; index < extrema; ) { in searchRoots()
|
| D | SkPathOpsCubic.h | 94 int searchRoots(double extremes[6], int extrema, double axisIntercept,
|
| /external/skqp/src/pathops/ |
| D | SkDCubicLineIntersection.cpp | 140 int extrema = SkDCubic::FindExtrema(&c[0].fX, extremeTs); in intersectRay() local
141 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots); in intersectRay()
176 int extrema = SkDCubic::FindExtrema(&c[0].fY, extremeTs); in HorizontalIntersect() local
177 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); in HorizontalIntersect()
239 int extrema = SkDCubic::FindExtrema(&c[0].fX, extremeTs); in VerticalIntersect() local
240 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kXAxis, roots); in VerticalIntersect()
|
| D | SkPathOpsCubic.cpp | 340 int SkDCubic::searchRoots(double extremeTs[6], int extrema, double axisIntercept, in searchRoots() argument
342 extrema += findInflections(&extremeTs[extrema]); in searchRoots()
343 extremeTs[extrema++] = 0; in searchRoots()
344 extremeTs[extrema] = 1; in searchRoots()
345 SkASSERT(extrema < 6); in searchRoots()
346 SkTQSort(extremeTs, extremeTs + extrema); in searchRoots()
348 for (int index = 0; index < extrema; ) { in searchRoots()
|
| D | SkPathOpsCubic.h | 94 int searchRoots(double extremes[6], int extrema, double axisIntercept,
|
| /external/freetype/src/autofit/ |
| D | afblue.dat | 605 // up by the mean values of all flat extrema and all round extrema,
643 // Ignore round extrema and define the blue zone with flat values only.
648 // If not set, both round and flat extrema are taken into account.
|
| /external/freetype/docs/ |
| D | raster.txt | 350 we are obliged to compute all (local and global) y extrema of
355 two y-extrema, which are simply
367 Note that the extrema are expressed in pixel units, not in
377 which makes extrema computations easy, the ascent of an arc can
|
| D | CHANGES | 1195 and local extrema.
4279 - Fixed a bug in FT_Outline_Get_BBox when computing the extrema of
|
| /external/freetype/ |
| D | ChangeLog.20 | 2451 bug in the formula used to compute the conic Bézier extrema
|
| D | ChangeLog.25 | 1793 In particular, local extrema without horizontal or vertical segments
|
| D | ChangeLog.26 | 4168 [truetype] In GX, make intermediate tuplets work at extrema.
|
| D | ChangeLog.24 | 4003 To remove extrema of vertical strokes of CJK Ideographs at
|
| D | ChangeLog.21 | 7332 Improve support of local extrema and stem edge points.
|
| /external/kotlinx.coroutines/benchmarks/src/jmh/resources/ |
| D | ospd.txt.gz | |
| /external/one-true-awk/testdir/ |
| D | funstack.in | 25425 …Subroutines; decentralized; distributed processing; distributed systems; extrema; operating system…
25427 …xxtitle = "An improved algorithm for decentralized extrema-finding in circular configurations…
|