/external/chromium_org/chrome/test/chromedriver/js/ |
H A 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/WebKit/Source/core/rendering/ |
H A D | RenderRegion.cpp | 80 LayoutUnit minX = std::min(flowThreadPortionRect.x(), flowThreadOverflow.x()); local 82 clipRect = LayoutRect(minX, minY, maxX - minX, maxY - minY); 84 LayoutUnit minX = isFirstPortion ? flowThreadOverflow.x() : flowThreadPortionRect.x(); local 88 clipRect = LayoutRect(minX, minY, maxX - minX, maxY - minY);
|
H A D | RenderOverflow.h | 84 LayoutUnit minX = std::min(rect.x(), m_layoutOverflow.x()); local 87 m_layoutOverflow.setWidth(maxX - minX);
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkReduceOrder.cpp | 38 int minX, int maxX, int minY, int maxY, SkDQuad& reduction) { 64 int index, minX, maxX, minY, maxY; local 66 minX = maxX = minY = maxY = 0; 69 if (quad[minX].fX > quad[index].fX) { 70 minX = index; 83 if (AlmostEqualUlps(quad[index].fX, quad[minX].fX)) { 99 int result = check_linear(quad, minX, maxX, minY, maxY, fQuad); 158 int minX, int maxX, int minY, int maxY, SkDCubic& reduction) { 204 int index, minX, maxX, minY, maxY; local 206 minX 37 check_linear(const SkDQuad& quad, int minX, int maxX, int minY, int maxY, SkDQuad& reduction) argument 157 check_linear(const SkDCubic& cubic, int minX, int maxX, int minY, int maxY, SkDCubic& reduction) argument [all...] |
/external/skia/src/pathops/ |
H A D | SkReduceOrder.cpp | 38 int minX, int maxX, int minY, int maxY, SkDQuad& reduction) { 64 int index, minX, maxX, minY, maxY; local 66 minX = maxX = minY = maxY = 0; 69 if (quad[minX].fX > quad[index].fX) { 70 minX = index; 83 if (AlmostEqualUlps(quad[index].fX, quad[minX].fX)) { 99 int result = check_linear(quad, minX, maxX, minY, maxY, fQuad); 158 int minX, int maxX, int minY, int maxY, SkDCubic& reduction) { 204 int index, minX, maxX, minY, maxY; local 206 minX 37 check_linear(const SkDQuad& quad, int minX, int maxX, int minY, int maxY, SkDQuad& reduction) argument 157 check_linear(const SkDCubic& cubic, int minX, int maxX, int minY, int maxY, SkDCubic& reduction) argument [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | TestUtilities.cpp | 22 int index, minX, maxX, minY, maxY; local 23 minX = maxX = minY = maxY = 0; 25 if (cubic[minX].x > cubic[index].x) { 26 minX = index; 38 return approximately_equal(cubic[maxX].x, cubic[minX].x)
|
H A D | LineUtilities.cpp | 82 static void setMinMax(double x, int flags, double& minX, double& maxX) { argument 83 if (minX > x && (flags & (kFindTopMin | kFindBottomMin))) { 84 minX = x; 92 int flags, double& minX, double& maxX) { 102 // if p1.y < p2.y, minX can be affected 109 setMinMax(x, topFlags, minX, maxX); 115 setMinMax(x, bottomFlags, minX, maxX); 91 x_at(const _Point& p1, const _Point& p2, double top, double bottom, int flags, double& minX, double& maxX) argument
|
H A D | QuadraticReduceOrder.cpp | 67 int minX, int maxX, int minY, int maxY, Quadratic& reduction) { 87 bool useX = quad[maxX].x - quad[minX].x >= quad[maxY].y - quad[minY].y; 143 int index, minX, maxX, minY, maxY; local 145 minX = maxX = minY = maxY = 0; 148 if (quad[minX].x > quad[index].x) { 149 minX = index; 162 if (AlmostEqualUlps(quad[index].x, quad[minX].x)) { 178 int result = check_linear(quad, reduceStyle, minX, maxX, minY, maxY, reduction); 66 check_linear(const Quadratic& quad, ReduceOrder_Styles reduceStyle, int minX, int maxX, int minY, int maxY, Quadratic& reduction) argument
|
H A D | CubicReduceOrder.cpp | 95 int minX, int maxX, int minY, int maxY, Cubic& reduction) { 116 bool useX = cubic[maxX].x - cubic[minX].x >= cubic[maxY].y - cubic[minY].y; 199 int index, minX, maxX, minY, maxY; local 201 minX = maxX = minY = maxY = 0; 204 if (cubic[minX].x > cubic[index].x) { 205 minX = index; 221 SkTMax(fabs(cubic[minX].x), fabs(cubic[minY].y)))); 228 if (approximately_equal_half(cx * inv, cubic[minX].x * inv)) { 244 int result = check_linear(cubic, reduceStyle, minX, maxX, minY, maxY, reduction); 94 check_linear(const Cubic& cubic, ReduceOrder_Styles reduceStyle, int minX, int maxX, int minY, int maxY, Cubic& reduction) argument
|
/external/replicaisland/src/com/replica/replicaisland/ |
H A D | AABoxCollisionVolume.java | 105 final float minX; 112 minX = Math.max(getMinX(), other.getMinX()); 117 minX = other.getMinX(); 121 final float horizontalDelta = maxX - minX; 123 mBottomLeft.set(minX, minY);
|
H A D | CollisionVolume.java | 72 final float minX = getMinX(); 73 value = flip.parentWidth - minX;
|
H A D | SphereCollisionVolume.java | 131 final float minX; 138 minX = Math.min(getMinX(), other.getMinX()); 143 minX = other.getMinX(); 147 final float horizontalDelta = maxX - minX; 151 final float newCenterX = minX + (horizontalDelta / 2.0f);
|
/external/skia/experimental/Intersection/ |
H A D | TestUtilities.cpp | 22 int index, minX, maxX, minY, maxY; local 23 minX = maxX = minY = maxY = 0; 25 if (cubic[minX].x > cubic[index].x) { 26 minX = index; 38 return approximately_equal(cubic[maxX].x, cubic[minX].x)
|
H A D | LineUtilities.cpp | 82 static void setMinMax(double x, int flags, double& minX, double& maxX) { argument 83 if (minX > x && (flags & (kFindTopMin | kFindBottomMin))) { 84 minX = x; 92 int flags, double& minX, double& maxX) { 102 // if p1.y < p2.y, minX can be affected 109 setMinMax(x, topFlags, minX, maxX); 115 setMinMax(x, bottomFlags, minX, maxX); 91 x_at(const _Point& p1, const _Point& p2, double top, double bottom, int flags, double& minX, double& maxX) argument
|
H A D | QuadraticReduceOrder.cpp | 67 int minX, int maxX, int minY, int maxY, Quadratic& reduction) { 87 bool useX = quad[maxX].x - quad[minX].x >= quad[maxY].y - quad[minY].y; 143 int index, minX, maxX, minY, maxY; local 145 minX = maxX = minY = maxY = 0; 148 if (quad[minX].x > quad[index].x) { 149 minX = index; 162 if (AlmostEqualUlps(quad[index].x, quad[minX].x)) { 178 int result = check_linear(quad, reduceStyle, minX, maxX, minY, maxY, reduction); 66 check_linear(const Quadratic& quad, ReduceOrder_Styles reduceStyle, int minX, int maxX, int minY, int maxY, Quadratic& reduction) argument
|
H A D | CubicReduceOrder.cpp | 95 int minX, int maxX, int minY, int maxY, Cubic& reduction) { 116 bool useX = cubic[maxX].x - cubic[minX].x >= cubic[maxY].y - cubic[minY].y; 199 int index, minX, maxX, minY, maxY; local 201 minX = maxX = minY = maxY = 0; 204 if (cubic[minX].x > cubic[index].x) { 205 minX = index; 221 SkTMax(fabs(cubic[minX].x), fabs(cubic[minY].y)))); 228 if (approximately_equal_half(cx * inv, cubic[minX].x * inv)) { 244 int result = check_linear(cubic, reduceStyle, minX, maxX, minY, maxY, reduction); 94 check_linear(const Cubic& cubic, ReduceOrder_Styles reduceStyle, int minX, int maxX, int minY, int maxY, Cubic& reduction) argument
|
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
H A D | api_path.c | 364 VGfloat * minX, 378 if (!minX || !minY || !width || !height) { 383 if (!is_aligned(minX) || !is_aligned(minY) || 397 path_bounding_rect(p, minX, minY, width, height); 401 VGfloat * minX, 415 if (!minX || !minY || !width || !height) { 420 if (!is_aligned(minX) || !is_aligned(minY) || 436 path_bounding_rect(p, minX, minY, width, height); 438 VGfloat pts[] = {*minX, *minY, 439 *minX 363 vegaPathBounds(VGPath path, VGfloat * minX, VGfloat * minY, VGfloat * width, VGfloat * height) argument 400 vegaPathTransformedBounds(VGPath path, VGfloat * minX, VGfloat * minY, VGfloat * width, VGfloat * height) argument [all...] |
/external/mesa3d/src/gallium/state_trackers/vega/ |
H A D | api_path.c | 364 VGfloat * minX, 378 if (!minX || !minY || !width || !height) { 383 if (!is_aligned(minX) || !is_aligned(minY) || 397 path_bounding_rect(p, minX, minY, width, height); 401 VGfloat * minX, 415 if (!minX || !minY || !width || !height) { 420 if (!is_aligned(minX) || !is_aligned(minY) || 436 path_bounding_rect(p, minX, minY, width, height); 438 VGfloat pts[] = {*minX, *minY, 439 *minX 363 vegaPathBounds(VGPath path, VGfloat * minX, VGfloat * minY, VGfloat * width, VGfloat * height) argument 400 vegaPathTransformedBounds(VGPath path, VGfloat * minX, VGfloat * minY, VGfloat * width, VGfloat * height) argument [all...] |
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkDashPath.cpp | 115 SkScalar minX = pts[0].fX; local 119 SkTSwap(minX, maxX); 122 SkASSERT(minX <= maxX); 123 if (maxX < bounds.fLeft || minX > bounds.fRight) { 131 if (minX < bounds.fLeft) { 132 minX = bounds.fLeft - SkScalarMod(bounds.fLeft - minX, 140 SkASSERT(maxX >= minX); 142 SkTSwap(minX, maxX); 144 pts[0].fX = minX; [all...] |
/external/skia/src/utils/ |
H A D | SkDashPath.cpp | 115 SkScalar minX = pts[0].fX; local 118 if (maxX < bounds.fLeft || minX > bounds.fRight) { 123 SkTSwap(minX, maxX); 130 if (minX < bounds.fLeft) { 131 minX = bounds.fLeft - SkScalarMod(bounds.fLeft - minX, 139 SkASSERT(maxX >= minX); 141 SkTSwap(minX, maxX); 143 pts[0].fX = minX;
|
/external/chromium_org/third_party/skia/src/effects/ |
H A D | SkDashPathEffect.cpp | 89 SkScalar minX = pts[0].fX; local 93 SkTSwap(minX, maxX); 96 SkASSERT(minX < maxX); 97 if (maxX < bounds.fLeft || minX > bounds.fRight) { 105 if (minX < bounds.fLeft) { 106 minX = bounds.fLeft - SkScalarMod(bounds.fLeft - minX, intervalLength); 112 SkASSERT(maxX > minX); 114 SkTSwap(minX, maxX); 116 pts[0].fX = minX; [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
H A D | FloatBox.h | 107 float minX = std::min(m_x, low.x()); local 115 m_x = minX; 119 m_width = maxX - minX;
|
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/talking_alarm_clock/ |
H A D | popup.js | 80 var minX = Math.sin(minAngle); 97 ctx.moveTo(cx - 8 * minX, cy - 8 * minY); 98 ctx.lineTo(cx + 35 * minX, cy + 33 * minY); 109 ctx.moveTo(cx - 8 * minX, cy - 8 * minY); 110 ctx.lineTo(cx + 35 * minX, cy + 33 * minY);
|
/external/chromium_org/third_party/skia/tests/ |
H A 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/skia/tests/ |
H A 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)
|