| /external/skia/src/pathops/ |
| D | SkReduceOrder.cpp | 38 int minX, int maxX, int minY, int maxY, SkDQuad& reduction) { in check_linear() argument
64 int index, minX, maxX, minY, maxY; in reduce() local
66 minX = maxX = minY = maxY = 0; in reduce()
69 if (quad[minX].fX > quad[index].fX) { in reduce()
70 minX = index; in reduce()
83 if (AlmostEqualUlps(quad[index].fX, quad[minX].fX)) { in reduce()
99 int result = check_linear(quad, minX, maxX, minY, maxY, fQuad); in reduce()
158 int minX, int maxX, int minY, int maxY, SkDCubic& reduction) { in check_linear() argument
204 int index, minX, maxX, minY, maxY; in reduce() local
206 minX = maxX = minY = maxY = 0; in reduce()
[all …]
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| D | SkReduceOrder.cpp | 38 int minX, int maxX, int minY, int maxY, SkDQuad& reduction) { in check_linear() argument
64 int index, minX, maxX, minY, maxY; in reduce() local
66 minX = maxX = minY = maxY = 0; in reduce()
69 if (quad[minX].fX > quad[index].fX) { in reduce()
70 minX = index; in reduce()
83 if (AlmostEqualUlps(quad[index].fX, quad[minX].fX)) { in reduce()
99 int result = check_linear(quad, minX, maxX, minY, maxY, fQuad); in reduce()
158 int minX, int maxX, int minY, int maxY, SkDCubic& reduction) { in check_linear() argument
204 int index, minX, maxX, minY, maxY; in reduce() local
206 minX = maxX = minY = maxY = 0; in reduce()
[all …]
|
| /external/chromium_org/chrome/test/chromedriver/js/ |
| D | get_element_region.js | 50 var minX = Number(coords[0]);
52 var maxX = minX;
57 minX = Math.min(minX, x);
63 'left': minX,
65 'width': maxX - minX,
|
| /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
| D | api_path.c | 364 VGfloat * minX, in vegaPathBounds() argument
378 if (!minX || !minY || !width || !height) { in vegaPathBounds()
383 if (!is_aligned(minX) || !is_aligned(minY) || in vegaPathBounds()
397 path_bounding_rect(p, minX, minY, width, height); in vegaPathBounds()
401 VGfloat * minX, in vegaPathTransformedBounds() argument
415 if (!minX || !minY || !width || !height) { in vegaPathTransformedBounds()
420 if (!is_aligned(minX) || !is_aligned(minY) || in vegaPathTransformedBounds()
436 path_bounding_rect(p, minX, minY, width, height); in vegaPathTransformedBounds()
438 VGfloat pts[] = {*minX, *minY, in vegaPathTransformedBounds()
439 *minX + *width, *minY, in vegaPathTransformedBounds()
[all …]
|
| /external/mesa3d/src/gallium/state_trackers/vega/ |
| D | api_path.c | 364 VGfloat * minX, in vegaPathBounds() argument
378 if (!minX || !minY || !width || !height) { in vegaPathBounds()
383 if (!is_aligned(minX) || !is_aligned(minY) || in vegaPathBounds()
397 path_bounding_rect(p, minX, minY, width, height); in vegaPathBounds()
401 VGfloat * minX, in vegaPathTransformedBounds() argument
415 if (!minX || !minY || !width || !height) { in vegaPathTransformedBounds()
420 if (!is_aligned(minX) || !is_aligned(minY) || in vegaPathTransformedBounds()
436 path_bounding_rect(p, minX, minY, width, height); in vegaPathTransformedBounds()
438 VGfloat pts[] = {*minX, *minY, in vegaPathTransformedBounds()
439 *minX + *width, *minY, in vegaPathTransformedBounds()
[all …]
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| D | RenderRegion.cpp | 80 LayoutUnit minX = std::min(flowThreadPortionRect.x(), flowThreadOverflow.x()); in overflowRectForFlowThreadPortion() local
82 clipRect = LayoutRect(minX, minY, maxX - minX, maxY - minY); in overflowRectForFlowThreadPortion()
84 LayoutUnit minX = isFirstPortion ? flowThreadOverflow.x() : flowThreadPortionRect.x(); in overflowRectForFlowThreadPortion() local
88 clipRect = LayoutRect(minX, minY, maxX - minX, maxY - minY); in overflowRectForFlowThreadPortion()
|
| /external/chromium_org/third_party/skia/src/utils/ |
| D | SkDashPath.cpp | 115 SkScalar minX = pts[0].fX; in cull_path() local
119 SkTSwap(minX, maxX); in cull_path()
122 SkASSERT(minX <= maxX); in cull_path()
123 if (maxX < bounds.fLeft || minX > bounds.fRight) { in cull_path()
131 if (minX < bounds.fLeft) { in cull_path()
132 minX = bounds.fLeft - SkScalarMod(bounds.fLeft - minX, in cull_path()
140 SkASSERT(maxX >= minX); in cull_path()
142 SkTSwap(minX, maxX); in cull_path()
144 pts[0].fX = minX; in cull_path()
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | QuadraticReduceOrder.cpp | 67 int minX, int maxX, int minY, int maxY, Quadratic& reduction) { in check_linear() argument
87 bool useX = quad[maxX].x - quad[minX].x >= quad[maxY].y - quad[minY].y; in check_linear()
143 int index, minX, maxX, minY, maxY; in reduceOrder() local
145 minX = maxX = minY = maxY = 0; in reduceOrder()
148 if (quad[minX].x > quad[index].x) { in reduceOrder()
149 minX = index; in reduceOrder()
162 if (AlmostEqualUlps(quad[index].x, quad[minX].x)) { in reduceOrder()
178 int result = check_linear(quad, reduceStyle, minX, maxX, minY, maxY, reduction); in reduceOrder()
|
| D | LineUtilities.cpp | 82 static void setMinMax(double x, int flags, double& minX, double& maxX) { in setMinMax() argument
83 if (minX > x && (flags & (kFindTopMin | kFindBottomMin))) { in setMinMax()
84 minX = x; in setMinMax()
92 int flags, double& minX, double& maxX) { in x_at() argument
109 setMinMax(x, topFlags, minX, maxX); in x_at()
115 setMinMax(x, bottomFlags, minX, maxX); in x_at()
|
| D | TestUtilities.cpp | 22 int index, minX, maxX, minY, maxY; in tiny() local
23 minX = maxX = minY = maxY = 0; in tiny()
25 if (cubic[minX].x > cubic[index].x) { in tiny()
26 minX = index; in tiny()
38 return approximately_equal(cubic[maxX].x, cubic[minX].x) in tiny()
|
| D | CubicReduceOrder.cpp | 95 int minX, int maxX, int minY, int maxY, Cubic& reduction) { in check_linear() argument
116 bool useX = cubic[maxX].x - cubic[minX].x >= cubic[maxY].y - cubic[minY].y; in check_linear()
199 int index, minX, maxX, minY, maxY; in reduceOrder() local
201 minX = maxX = minY = maxY = 0; in reduceOrder()
204 if (cubic[minX].x > cubic[index].x) { in reduceOrder()
205 minX = index; in reduceOrder()
221 SkTMax(fabs(cubic[minX].x), fabs(cubic[minY].y)))); in reduceOrder()
228 if (approximately_equal_half(cx * inv, cubic[minX].x * inv)) { in reduceOrder()
244 int result = check_linear(cubic, reduceStyle, minX, maxX, minY, maxY, reduction); in reduceOrder()
|
| /external/skia/experimental/Intersection/ |
| D | QuadraticReduceOrder.cpp | 67 int minX, int maxX, int minY, int maxY, Quadratic& reduction) { in check_linear() argument
87 bool useX = quad[maxX].x - quad[minX].x >= quad[maxY].y - quad[minY].y; in check_linear()
143 int index, minX, maxX, minY, maxY; in reduceOrder() local
145 minX = maxX = minY = maxY = 0; in reduceOrder()
148 if (quad[minX].x > quad[index].x) { in reduceOrder()
149 minX = index; in reduceOrder()
162 if (AlmostEqualUlps(quad[index].x, quad[minX].x)) { in reduceOrder()
178 int result = check_linear(quad, reduceStyle, minX, maxX, minY, maxY, reduction); in reduceOrder()
|
| D | LineUtilities.cpp | 82 static void setMinMax(double x, int flags, double& minX, double& maxX) { in setMinMax() argument
83 if (minX > x && (flags & (kFindTopMin | kFindBottomMin))) { in setMinMax()
84 minX = x; in setMinMax()
92 int flags, double& minX, double& maxX) { in x_at() argument
109 setMinMax(x, topFlags, minX, maxX); in x_at()
115 setMinMax(x, bottomFlags, minX, maxX); in x_at()
|
| D | TestUtilities.cpp | 22 int index, minX, maxX, minY, maxY; in tiny() local
23 minX = maxX = minY = maxY = 0; in tiny()
25 if (cubic[minX].x > cubic[index].x) { in tiny()
26 minX = index; in tiny()
38 return approximately_equal(cubic[maxX].x, cubic[minX].x) in tiny()
|
| D | CubicReduceOrder.cpp | 95 int minX, int maxX, int minY, int maxY, Cubic& reduction) { in check_linear() argument
116 bool useX = cubic[maxX].x - cubic[minX].x >= cubic[maxY].y - cubic[minY].y; in check_linear()
199 int index, minX, maxX, minY, maxY; in reduceOrder() local
201 minX = maxX = minY = maxY = 0; in reduceOrder()
204 if (cubic[minX].x > cubic[index].x) { in reduceOrder()
205 minX = index; in reduceOrder()
221 SkTMax(fabs(cubic[minX].x), fabs(cubic[minY].y)))); in reduceOrder()
228 if (approximately_equal_half(cx * inv, cubic[minX].x * inv)) { in reduceOrder()
244 int result = check_linear(cubic, reduceStyle, minX, maxX, minY, maxY, reduction); in reduceOrder()
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| D | AABoxCollisionVolume.java | 105 final float minX; in growBy() local
112 minX = Math.max(getMinX(), other.getMinX()); in growBy()
117 minX = other.getMinX(); in growBy()
121 final float horizontalDelta = maxX - minX; in growBy()
123 mBottomLeft.set(minX, minY); in growBy()
|
| D | SphereCollisionVolume.java | 131 final float minX; in growBy() local
138 minX = Math.min(getMinX(), other.getMinX()); in growBy()
143 minX = other.getMinX(); in growBy()
147 final float horizontalDelta = maxX - minX; in growBy()
151 final float newCenterX = minX + (horizontalDelta / 2.0f); in growBy()
|
| D | CollisionVolume.java | 72 final float minX = getMinX(); in getMaxXPosition() local
73 value = flip.parentWidth - minX; in getMaxXPosition()
|
| /external/skia/src/utils/ |
| D | SkDashPath.cpp | 115 SkScalar minX = pts[0].fX; in cull_path() local
118 if (maxX < bounds.fLeft || minX > bounds.fRight) { in cull_path()
123 SkTSwap(minX, maxX); in cull_path()
130 if (minX < bounds.fLeft) { in cull_path()
131 minX = bounds.fLeft - SkScalarMod(bounds.fLeft - minX, in cull_path()
139 SkASSERT(maxX >= minX); in cull_path()
141 SkTSwap(minX, maxX); in cull_path()
143 pts[0].fX = minX; in cull_path()
|
| /external/chromium_org/third_party/skia/src/effects/ |
| D | SkDashPathEffect.cpp | 89 SkScalar minX = pts[0].fX; in cull_line() local
93 SkTSwap(minX, maxX); in cull_line()
96 SkASSERT(minX < maxX); in cull_line()
97 if (maxX < bounds.fLeft || minX > bounds.fRight) { in cull_line()
105 if (minX < bounds.fLeft) { in cull_line()
106 minX = bounds.fLeft - SkScalarMod(bounds.fLeft - minX, intervalLength); in cull_line()
112 SkASSERT(maxX > minX); in cull_line()
114 SkTSwap(minX, maxX); in cull_line()
116 pts[0].fX = minX; in cull_line()
|
| /external/chromium_org/third_party/lcov/contrib/galaxy/ |
| D | posterize.pl | 291 ($Junk, $Junk, $minX, $minY, $maxX, $maxY) = split / /, $Bounds;
293 my $xRange = $maxX - $minX;
|
| /external/chromium_org/chrome/browser/resources/chromeos/ |
| D | keyboard_overlay.js | 500 var minX = window.innerWidth;
537 minX = Math.min(minX, x);
543 var width = maxX - minX + 1;
545 keyboard.style.width = (width + 2 * (minX + 1)) + 'px';
552 width / BASE_KEYBOARD.width + minX) + 'px';
|
| /external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
| D | FloatBox.h | 107 float minX = std::min(m_x, low.x()); in expandTo() local
115 m_x = minX; in expandTo()
119 m_width = maxX - minX; in expandTo()
|
| /external/skia/tests/ |
| D | PathOpsCubicReduceOrderTest.cpp | 24 int index, minX, maxX, minY, maxY;
25 minX = maxX = minY = maxY = 0;
27 if (cubic[minX].fX > cubic[index].fX) {
28 minX = index;
40 return approximately_equal(cubic[maxX].fX, cubic[minX].fX)
|
| /external/chromium_org/third_party/skia/tests/ |
| D | PathOpsCubicReduceOrderTest.cpp | 24 int index, minX, maxX, minY, maxY;
25 minX = maxX = minY = maxY = 0;
27 if (cubic[minX].fX > cubic[index].fX) {
28 minX = index;
40 return approximately_equal(cubic[maxX].fX, cubic[minX].fX)
|