/external/chromium_org/chrome/test/chromedriver/js/ |
H A D | get_element_region.js | 51 var minY = Number(coords[1]); 53 var maxY = minY; 58 minY = Math.min(minY, y); 64 'top': minY, 66 'height': maxY - minY
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | RenderRegion.cpp | 78 LayoutUnit minY = isFirstPortion ? flowThreadOverflow.y() : flowThreadPortionRect.y(); local 82 clipRect = LayoutRect(minX, minY, maxX - minX, maxY - minY); 86 LayoutUnit minY = std::min(flowThreadPortionRect.y(), (flowThreadOverflow.y())); local 88 clipRect = LayoutRect(minX, minY, maxX - minX, maxY - minY);
|
H A D | RenderOverflow.h | 85 LayoutUnit minY = std::min(rect.y(), m_layoutOverflow.y()); local 88 m_layoutOverflow.setHeight(maxY - minY);
|
/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; 72 if (quad[minY].fY > quad[index].fY) { 73 minY = index; 86 if (AlmostEqualUlps(quad[index].fY, quad[minY].fY)) { 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 = maxX = minY 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; 72 if (quad[minY].fY > quad[index].fY) { 73 minY = index; 86 if (AlmostEqualUlps(quad[index].fY, quad[minY].fY)) { 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 = maxX = minY 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; 28 if (cubic[minY].y > cubic[index].y) { 29 minY = index; 39 && approximately_equal(cubic[maxY].y, cubic[minY].y);
|
H A D | LineUtilities.h | 24 void x_at(const _Point& p1, const _Point& p2, double minY, double maxY,
|
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; 151 if (quad[minY].y > quad[index].y) { 152 minY = index; 165 if (AlmostEqualUlps(quad[index].y, quad[minY].y)) { 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; 207 if (cubic[minY].y > cubic[index].y) { 208 minY = index; 221 SkTMax(fabs(cubic[minX].x), fabs(cubic[minY].y)))); 231 if (approximately_equal_half(cy * inv, cubic[minY].y * 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 | 108 final float minY; 114 minY = Math.max(getMinY(), other.getMinY()); 119 minY = other.getMinY(); 122 final float verticalDelta = maxY - minY; 123 mBottomLeft.set(minX, minY);
|
H A D | CollisionVolume.java | 94 final float minY = getMinY(); 95 value = flip.parentHeight - minY;
|
H A D | SphereCollisionVolume.java | 134 final float minY; 140 minY = Math.min(getMinY(), other.getMinY()); 145 minY = other.getMinY(); 148 final float verticalDelta = maxY - minY; 152 final float newCenterY = minY + (verticalDelta / 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; 28 if (cubic[minY].y > cubic[index].y) { 29 minY = index; 39 && approximately_equal(cubic[maxY].y, cubic[minY].y);
|
H A D | LineUtilities.h | 24 void x_at(const _Point& p1, const _Point& p2, double minY, double maxY,
|
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; 151 if (quad[minY].y > quad[index].y) { 152 minY = index; 165 if (AlmostEqualUlps(quad[index].y, quad[minY].y)) { 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; 207 if (cubic[minY].y > cubic[index].y) { 208 minY = index; 221 SkTMax(fabs(cubic[minX].x), fabs(cubic[minY].y)))); 231 if (approximately_equal_half(cy * inv, cubic[minY].y * 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 | 365 VGfloat * minY, 378 if (!minX || !minY || !width || !height) { 383 if (!is_aligned(minX) || !is_aligned(minY) || 397 path_bounding_rect(p, minX, minY, width, height); 402 VGfloat * minY, 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 + *width, *minY, 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 | 365 VGfloat * minY, 378 if (!minX || !minY || !width || !height) { 383 if (!is_aligned(minX) || !is_aligned(minY) || 397 path_bounding_rect(p, minX, minY, width, height); 402 VGfloat * minY, 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 + *width, *minY, 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/WebKit/Source/core/rendering/shapes/ |
H A D | PolygonShape.h | 50 bool isWithinYRange(float y1, float y2) const { return y1 <= minY() && y2 >= maxY(); } 51 bool overlapsYRange(float y1, float y2) const { return y2 >= minY() && y1 <= maxY(); }
|
H A D | PolygonShape.cpp | 58 ASSERT(y >= minY() && y <= maxY()); 62 if (y == minY()) 72 if (!overlapsYRange(y1, y2) || (y1 == maxY() && minY() <= y1) || (y2 == minY() && maxY() >= y2)) 138 if (edge.maxY() == edge.minY())
|
/external/chromium_org/third_party/skia/src/effects/ |
H A D | SkDashPathEffect.cpp | 120 SkScalar minY = pts[0].fY; local 124 SkTSwap(minY, maxY); 127 SkASSERT(minY < maxY); 128 if (maxY < bounds.fTop || minY > bounds.fBottom) { 136 if (minY < bounds.fTop) { 137 minY = bounds.fTop - SkScalarMod(bounds.fTop - minY, intervalLength); 143 SkASSERT(maxY > minY); 145 SkTSwap(minY, maxY); 147 pts[0].fY = minY; [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
H A D | FloatBox.h | 108 float minY = std::min(m_y, low.y()); local 116 m_y = minY; 120 m_height = maxY - minY;
|
H A D | FloatPolygon.h | 63 bool overlappingEdges(float minY, float maxY, Vector<const FloatPolygonEdge*>& result) const; 79 EdgeIntervalTree m_edgeTree; // Each EdgeIntervalTree node stores minY, maxY, and a ("UserData") pointer to a FloatPolygonEdge. 91 float minY() const { return std::min(vertex1().y(), vertex2().y()); } function in class:blink::VertexPair
|
H A D | FloatPolygonTest.cpp | 66 static Vector<const FloatPolygonEdge*> sortedOverlappingEdges(const FloatPolygon& polygon, float minY, float maxY) argument 69 polygon.overlappingEdges(minY, maxY, result); 122 EXPECT_EQ(100, triangle.edgeAt(0).minY()); 124 EXPECT_EQ(200, triangle.edgeAt(1).minY()); 126 EXPECT_EQ(100, triangle.edgeAt(2).minY());
|
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/talking_alarm_clock/ |
H A D | popup.js | 81 var minY = -Math.cos(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);
|