| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| TestUtilities.cpp | 22 int index, minX, maxX, minY, maxY;
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);
|
| 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;
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);
|
| 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;
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);
|
| /external/skia/experimental/Intersection/ |
| TestUtilities.cpp | 22 int index, minX, maxX, minY, maxY;
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);
|
| 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;
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);
|
| 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;
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);
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderRegion.cpp | 78 LayoutUnit minY = isFirstPortion ? flowThreadOverflow.y() : flowThreadPortionRect.y();
82 clipRect = LayoutRect(minX, minY, maxX - minX, maxY - minY);
86 LayoutUnit minY = std::min(flowThreadPortionRect.y(), (flowThreadOverflow.y()));
88 clipRect = LayoutRect(minX, minY, maxX - minX, maxY - minY);
|
| RenderOverflow.h | 85 LayoutUnit minY = std::min(rect.y(), m_layoutOverflow.y());
88 m_layoutOverflow.setHeight(maxY - minY);
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
| RasterShape.h | 72 int minY() const { return -m_offset; }
|
| /external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
| RoundedRect.cpp | 156 int minY = m_rect.y() + std::max(m_radii.topLeft().height(), m_radii.topRight().height());
159 return IntRect(minX, minY, maxX - minX, maxY - minY);
|
| FloatBox.h | 108 float minY = std::min(m_y, low.y());
116 m_y = minY;
120 m_height = maxY - minY;
|
| 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()); }
|
| FloatRect.cpp | 120 float minY = std::min(y(), other.y());
124 setLocationAndSizeFromEdges(minX, minY, maxX, maxY);
143 float minY = std::min(y(), p.y());
147 setLocationAndSizeFromEdges(minX, minY, maxX, maxY);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkTileGrid.cpp | 48 int minY = SkMax32(0, SkMin32(dilatedBounds.top() / fInfo.fTileInterval.height(), fYTiles - 1));
55 for (int y = minY; y <= maxY; y++) {
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| CollisionVolume.java | 94 final float minY = getMinY();
95 value = flip.parentHeight - minY;
|
| 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);
|
| 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);
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| DiscretePathEffectTest.java | 76 int minY = BITMAP_HEIGHT;
83 minY = Math.min(minY, y);
96 assertTrue(maxY - minY > 0);
98 assertTrue(maxY - minY <= 1 + 2 * DEVIATION);
|
| /development/samples/devbytes/animation/Bouncer/src/com/example/android/bouncer/ |
| Bouncer.java | 105 int minY = mShapeY;
108 minY = Math.min(mShapeY, minY);
110 invalidate(mShapeX, minY, mShapeX + mShapeW, maxY);
|
| Bouncer1.java | 75 int minY = mShapeY;
78 minY = Math.min(mShapeY, minY);
80 invalidate(mShapeX, minY, mShapeX + mShapeW, maxY);
|
| Bouncer2.java | 76 int minY = mShapeY;
79 minY = Math.min(mShapeY, minY);
81 invalidate(mShapeX, minY, mShapeX + mShapeW, maxY);
|
| Bouncer3.java | 76 int minY = mShapeY;
79 minY = Math.min(mShapeY, minY);
81 invalidate(mShapeX, minY, mShapeX + mShapeW, maxY);
|
| /external/chromium_org/third_party/skia/src/effects/ |
| SkDashPathEffect.cpp | 120 SkScalar minY = pts[0].fY;
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/skia/src/pathops/ |
| SkReduceOrder.cpp | 38 int minX, int maxX, int minY, int maxY, SkDQuad& reduction) {
64 int index, minX, maxX, minY, maxY;
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;
206 minX = maxX = minY = maxY = 0
[all...] |
| /external/skia/src/pathops/ |
| SkReduceOrder.cpp | 38 int minX, int maxX, int minY, int maxY, SkDQuad& reduction) {
64 int index, minX, maxX, minY, maxY;
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;
206 minX = maxX = minY = maxY = 0
[all...] |
