/external/skia/tools/lua/ |
classify_rrect_clips.lua | 38 local corners = "corners" 42 corners = "adjacent_" .. corners 44 corners = "opposite_" .. corners 47 corners = "corner" 50 return "circles_with_" .. numSquare .. "_square_" .. corners 52 return "ovals_with_" .. numSquare .. "_square_" .. corners
|
/external/opencv/cv/src/ |
cvcalibinit.cpp | 103 int count; // Number of neighbor corners 104 struct CvCBCorner* neighbors[4]; // Neighbor corners 116 bool ordered; // true if corners/neighbors are ordered counter-clockwise 118 // neighbors and corners are synced, i.e., neighbor 0 shares corner 0 119 CvCBCorner *corners[4]; // Coordinates of quad corners member in struct:CvCBQuad 128 static int icvGenerateQuads( CvCBQuad **quads, CvCBCorner **corners, 148 int *all_count, CvCBQuad **all_quads, CvCBCorner **corners, 158 CvCBQuad **all_quads, int all_count, CvCBCorner **corners); 162 static int icvCheckBoardMonotony( CvPoint2D32f* corners, CvSize pattern_size ) 218 CvCBCorner *corners = 0, **corner_group = 0; local 1194 CvCBCorner** corners = 0; local [all...] |
cvfeatureselect.cpp | 49 CvPoint2D32f* corners, int *corner_count, 69 CvPoint *ptr = (CvPoint *) corners; 133 if( !corners || !corner_count ) 137 CV_ERROR( CV_StsBadArg, "maximal corners number is non positive" ); 222 corners[i].x = (float)ptr[i].x; 223 corners[i].y = (float)ptr[i].y;
|
cvdominants.cpp | 56 CvSeq ** corners, int dmin2, int dmax2, int dneigh2, float amax ) 78 if( corners == NULL ) 314 *corners = cvEndWriteSeq( &writer ); 336 // Applies some algorithm to find dominant points ( corners ) of contour 362 CvSeq* corners = 0; local 394 IPPI_CALL( icvFindDominantPointsIPAN( contour, storage, &corners, 404 return corners;
|
cvcornersubpix.cpp | 44 cvFindCornerSubPix( const void* srcarr, CvPoint2D32f* corners, 77 if( !corners ) 182 CvPoint2D32f cT = corners[pt_i], cI = cT; 259 corners[pt_i] = cI; /* store result */
|
/packages/apps/Gallery2/src/com/android/gallery3d/filtershow/crop/ |
CropMath.java | 31 * corners. 32 * The order of the corners in the float array is: 38 * @param r the rectangle to get the corners of 39 * @return the float array of corners (8 floats) 43 float[] corners = { local 49 return corners; 67 * Takes an array of 2D coordinates representing corners and returns the 106 * Takes a point and the corners of a rectangle and returns the two corners 110 * @param corners the corners of the rectangl [all...] |
BoundedRect.java | 127 // find correction vectors for corners that have moved out of bounds 162 // update translated corners with correction vectors 205 // relies on corners being in same order as method 252 float[] corners = CropMath.getCornersFromRect(outer); local 254 m.mapPoints(corners); 286 float[] l2 = CropMath.closestSide(c, corners); 299 // relies on corners being in same order as method
|
/frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/impl/ |
GcSnapshot.java | 853 // array with 4 corners 854 float[] corners = new float[] { local 862 matrix.transform(corners, 0, corners, 0, 4); 865 dst.left = Math.min(Math.min(corners[0], corners[2]), Math.min(corners[4], corners[6])); 866 dst.right = Math.max(Math.max(corners[0], corners[2]), Math.max(corners[4], corners[6])) [all...] |
/external/deqp/modules/gles2/functional/ |
es2fMultisampleTests.cpp | 678 Vec2 corners[4] = local 696 renderTriangle(corners[(0+quadNdx) % 4] + center, 697 corners[(1+quadNdx) % 4] + center, 698 corners[(2+quadNdx) % 4] + center, 703 renderTriangle(corners[(3+quadNdx) % 4] + center, 704 corners[(2+quadNdx) % 4] + center, 705 corners[(0+quadNdx) % 4] + center, 710 renderTriangle(corners[(0+quadNdx) % 4] + center, 711 corners[(2+quadNdx) % 4] + center, 712 corners[(3+quadNdx) % 4] + center 754 Vec2 corners[4] = local 794 Vec2 corners[4] = local [all...] |
/external/deqp/modules/gles3/functional/ |
es3fMultisampleTests.cpp | 828 Vec2 corners[4] = local 846 renderTriangle(corners[(0+quadNdx) % 4] + center, 847 corners[(1+quadNdx) % 4] + center, 848 corners[(2+quadNdx) % 4] + center, 853 renderTriangle(corners[(3+quadNdx) % 4] + center, 854 corners[(2+quadNdx) % 4] + center, 855 corners[(0+quadNdx) % 4] + center, 860 renderTriangle(corners[(0+quadNdx) % 4] + center, 861 corners[(2+quadNdx) % 4] + center, 862 corners[(3+quadNdx) % 4] + center 904 Vec2 corners[4] = local 944 Vec2 corners[4] = local [all...] |
/external/eigen/test/ |
corners.cpp | 16 template<typename MatrixType> void corners(const MatrixType& m) function 108 CALL_SUBTEST_1( corners(Matrix<float, 1, 1>()) ); 109 CALL_SUBTEST_2( corners(Matrix4d()) ); 110 CALL_SUBTEST_3( corners(Matrix<int,10,12>()) ); 111 CALL_SUBTEST_4( corners(MatrixXcf(5, 7)) ); 112 CALL_SUBTEST_5( corners(MatrixXf(21, 20)) );
|
/frameworks/base/tools/layoutlib/bridge/src/android/graphics/ |
Matrix_Delegate.java | 138 // array with 4 corners 139 float[] corners = new float[] { local 147 mapPoints(corners); 150 dst.left = Math.min(Math.min(corners[0], corners[2]), Math.min(corners[4], corners[6])); 151 dst.right = Math.max(Math.max(corners[0], corners[2]), Math.max(corners[4], corners[6])) [all...] |
/external/skia/gm/ |
patch.cpp | 38 SkPoint corners[4] = { bottom[0], bottom[3], top[0], top[3] }; local 52 canvas->drawPoints(SkCanvas::kPoints_PointMode, 4, corners, paint);
|
patchgrid.cpp | 26 SkPoint corners[4] = { bottom[0], bottom[3], top[0], top[3] }; local 40 canvas->drawPoints(SkCanvas::kPoints_PointMode, 4, corners, paint); 118 //set corners
|
/external/deqp/framework/referencerenderer/ |
rrRasterizer.cpp | 321 } corners[] = local 329 // Corner cases at the corners 330 for (int ndx = 0; ndx < DE_LENGTH_OF_ARRAY(corners); ++ndx) 332 const tcu::Vector<deInt64,2> p = diamondCenter + corners[ndx].dp; 341 if (corners[ndx].lineBehavior == DiamondCorners::CORNER_EDGE_CASE_HIT) 345 if (corners[ndx].lineBehavior == DiamondCorners::CORNER_EDGE_CASE_HIT_FIRST_QUARTER && 350 if (corners[ndx].lineBehavior == DiamondCorners::CORNER_EDGE_CASE_HIT_SECOND_QUARTER && 356 if (lineInCornerAngleRange(line, corners[ndx].dp)) 358 const bool startIsInside = corners[ndx].pointInclusive || p != line.m_v0; 359 const bool endIsOutside = !corners[ndx].pointInclusive || p != line.m_v1 [all...] |
/frameworks/base/packages/SystemUI/src/com/android/systemui/egg/ |
MLand.java | [all...] |
/external/v8/test/mjsunit/ |
shifts.js | 30 // test a few corners cases with shifts
|
constant-folding.js | 195 // Some tests of shifts that get into the corners in terms of coverage.
|
/external/opencv/cvaux/src/ |
cv3dtracker.cpp | 60 static void DrawEtalon(IplImage *img, CvPoint2D32f *corners, 327 static void DrawEtalon(IplImage *img, CvPoint2D32f *corners, 356 pt.x = cvRound(corners[i].x); 357 pt.y = cvRound(corners[i].y);
|
/external/deqp/modules/glshared/ |
glsRasterizationTestUtil.cpp | 527 const tcu::Vec2 corners[4] = 538 weightEquation(pa, wa, pb, wb, corners[0]), 539 weightEquation(pa, wa, pb, wb, corners[1]), 540 weightEquation(pa, wa, pb, wb, corners[2]), 541 weightEquation(pa, wa, pb, wb, corners[3]), 578 const tcu::Vec2 corners[4] = 587 calcTriangleInterpolationWeights(scene.triangles[primitiveNdx].positions[0], scene.triangles[primitiveNdx].positions[1], scene.triangles[primitiveNdx].positions[2], corners[0]), 588 calcTriangleInterpolationWeights(scene.triangles[primitiveNdx].positions[0], scene.triangles[primitiveNdx].positions[1], scene.triangles[primitiveNdx].positions[2], corners[1]), 589 calcTriangleInterpolationWeights(scene.triangles[primitiveNdx].positions[0], scene.triangles[primitiveNdx].positions[1], scene.triangles[primitiveNdx].positions[2], corners[2]), 590 calcTriangleInterpolationWeights(scene.triangles[primitiveNdx].positions[0], scene.triangles[primitiveNdx].positions[1], scene.triangles[primitiveNdx].positions[2], corners[3]) [all...] |
/external/opencv/cv/include/ |
cv.h | [all...] |
cvcompat.h | 575 CvSize pattern_size, CvPoint2D32f * corners, 578 return cvFindChessboardCorners( arr, pattern_size, corners, [all...] |
/external/skia/src/core/ |
SkPath.cpp | 366 The direction takes advantage of the corners found since opposite sides 386 int corners = 0; local 420 if (0 == corners) { 424 corners = 1; 436 if (++corners > 4) { 444 // Possible values for corners are 2, 3, and 4. 445 // When corners == 3, nextDirection opposes firstDirection. 447 int turn = firstDirection ^ (corners - 1); 448 int directionCycle = 3 == corners ? 0 : nextDirection ^ turn; 476 // Success if 4 corners and first point equals las [all...] |
/external/skia/tests/ |
SerializationTest.cpp | 446 SkVector corners[4] = { {1, 2}, {2, 3}, {3,4}, {4,5} }; local 447 rrect.setRectRadii(rect, corners);
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/drawing/ |
nx_pylab.py | 609 corners = (minx-padx, miny-pady), (maxx+padx, maxy+pady) 610 ax.update_datalim( corners)
|