Searched defs:minX (Results 1 - 25 of 31) sorted by relevance

12

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DTestUtilities.cpp22 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 DLineUtilities.cpp82 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 DQuadraticReduceOrder.cpp67 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 DCubicReduceOrder.cpp95 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/skia/experimental/Intersection/
H A DTestUtilities.cpp22 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 DLineUtilities.cpp82 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 DQuadraticReduceOrder.cpp67 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 DCubicReduceOrder.cpp95 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/WebKit/Source/core/rendering/
H A DRenderOverflow.h84 LayoutUnit minX = std::min(rect.x(), m_layoutOverflow.x()); local
87 m_layoutOverflow.setWidth(maxX - minX);
H A DRenderRegion.cpp88 LayoutUnit minX = min(flowThreadPortionRect.x(), flowThreadOverflow.x()); local
90 clipRect = LayoutRect(minX, minY, maxX - minX, maxY - minY);
92 LayoutUnit minX = isFirstPortion ? flowThreadOverflow.x() : flowThreadPortionRect.x(); local
96 clipRect = LayoutRect(minX, minY, maxX - minX, maxY - minY);
H A DRenderLayerScrollableArea.cpp241 static int cornerStart(const RenderStyle* style, int minX, int maxX, int thickness) argument
244 return minX + style->borderLeftWidth();
804 LayoutUnit RenderLayerScrollableArea::verticalScrollbarStart(int minX, int maxX) const argument
807 return minX + box().borderLeft();
811 LayoutUnit RenderLayerScrollableArea::horizontalScrollbarStart(int minX) const
813 int x = minX + box().borderLeft();
H A DInlineFlowBox.cpp1058 LayoutUnit minX = frameRect.x(); local
1067 LayoutUnit& top = isHorizontal() ? minY : minX;
1075 LayoutRect rect(minX, minY, width, height);
/external/chromium_org/third_party/WebKit/Source/platform/geometry/
H A DFloatBox.h107 float minX = std::min(m_x, low.x()); local
115 m_x = minX;
119 m_width = maxX - minX;
H A DFloatPolygon.h90 float minX() const { return std::min(vertex1().x(), vertex2().x()); } function in class:WebCore::VertexPair
H A DFloatRect.cpp119 float minX = std::min(x(), other.x()); local
124 setLocationAndSizeFromEdges(minX, minY, maxX, maxY);
142 float minX = std::min(x(), p.x()); local
147 setLocationAndSizeFromEdges(minX, minY, maxX, maxY);
H A DRoundedRect.cpp157 int minX = m_rect.x() + max(m_radii.topLeft().width(), m_radii.bottomLeft().width()); local
161 return IntRect(minX, minY, maxX - minX, maxY - minY);
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/
H A Dapi_path.c364 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/pathops/
H A DSkReduceOrder.cpp38 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/src/utils/
H A DSkDashPath.cpp115 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/mesa3d/src/gallium/state_trackers/vega/
H A Dapi_path.c364 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/skia/src/pathops/
H A DSkReduceOrder.cpp38 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/utils/
H A DSkDashPath.cpp115 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/opencv/cvaux/src/
H A Dcvcorrimages.cpp632 float minX,minY; local
635 minX = minY = FLT_MAX;
647 if( x < minX )
648 minX = x;
668 if( x < minX )
669 minX = x;
686 subdiv = cvCreateSubdivDelaunay2D( cvRect( cvRound(minX)-5, cvRound(minY)-5, cvRound(maxX-minX)+10, cvRound(maxY-minY)+10 ), storage );
/external/deqp/modules/glshared/
H A DglsTextureTestUtil.cpp3200 const int minX = deFloorFloatToInt32(float(x-0.5f) / dstW * srcW); local
3207 DE_ASSERT(minX < maxX && minY < maxY);
3211 for (int kx = minX; kx <= maxX; kx++)
3217 if (ky == minY && kx == minX)
/external/zxing/core/
H A Dcore.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ...

Completed in 662 milliseconds

12