/external/skia/tools/lua/ |
H A D | 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/ |
H A D | 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, CvSiz 218 CvCBCorner *corners = 0, **corner_group = 0; local 497 icvCheckBoardMonotony( CvPoint2D32f* corners, CvSize pattern_size ) argument 539 icvOrderFoundConnectedQuads( int quad_count, CvCBQuad **quads, int *all_count, CvCBQuad **all_quads, CvCBCorner **corners, CvSize pattern_size, CvMemStorage* storage ) argument 1194 CvCBCorner** corners = 0; local 1980 cvDrawChessboardCorners( CvArr* _image, CvSize pattern_size, CvPoint2D32f* corners, int count, int found ) argument [all...] |
H A D | 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; 48 cvGoodFeaturesToTrack( const void* image, void* eigImage, void* tempImage, CvPoint2D32f* corners, int *corner_count, double quality_level, double min_distance, const void* maskImage, int block_size, int use_harris, double harris_k ) argument
|
H A D | 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; 54 icvFindDominantPointsIPAN( CvSeq * contour, CvMemStorage * storage, CvSeq ** corners, int dmin2, int dmax2, int dneigh2, float amax ) argument
|
H A D | cvcornersubpix.cpp | 44 cvFindCornerSubPix( const void* srcarr, CvPoint2D32f* corners, argument 77 if( !corners ) 182 CvPoint2D32f cT = corners[pt_i], cI = cT; 259 corners[pt_i] = cI; /* store result */
|
/external/deqp/modules/gles2/functional/ |
H A D | 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[( 754 Vec2 corners[4] = local 794 Vec2 corners[4] = local [all...] |
/external/deqp/modules/gles3/functional/ |
H A D | 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[( 904 Vec2 corners[4] = local 944 Vec2 corners[4] = local [all...] |
/external/eigen/test/ |
H A D | 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)) );
|
/external/skia/gm/ |
H A D | patch.cpp | 38 SkPoint corners[4] = { bottom[0], bottom[3], top[0], top[3] }; local 52 canvas->drawPoints(SkCanvas::kPoints_PointMode, 4, corners, paint);
|
H A D | 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/ |
H A D | 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[nd [all...] |
/external/opencv/cvaux/src/ |
H A D | cv3dtracker.cpp | 60 static void DrawEtalon(IplImage *img, CvPoint2D32f *corners, 327 static void DrawEtalon(IplImage *img, CvPoint2D32f *corners, argument 356 pt.x = cvRound(corners[i].x); 357 pt.y = cvRound(corners[i].y);
|
/external/deqp/modules/glshared/ |
H A D | 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[ [all...] |
/external/opencv/cv/include/ |
H A D | cv.h | 994 Applying threshold to the result gives coordinates of corners */ 995 CVAPI(void) cvPreCornerDetect( const CvArr* image, CvArr* corners, 1015 CVAPI(void) cvFindCornerSubPix( const CvArr* image, CvPoint2D32f* corners, 1022 CvArr* temp_image, CvPoint2D32f* corners, 1264 /* Detects corners on a chessboard calibration pattern */ 1266 CvPoint2D32f* corners, 1271 /* Draws individual chessboard corners or the whole chessboard detected */ 1273 CvPoint2D32f* corners,
|
H A D | cvcompat.h | 575 CvSize pattern_size, CvPoint2D32f * corners, 578 return cvFindChessboardCorners( arr, pattern_size, corners, 573 cvFindChessBoardCornerGuesses( const void* arr, void* CV_UNREFERENCED(thresharr), CvMemStorage * CV_UNREFERENCED(storage), CvSize pattern_size, CvPoint2D32f * corners, int *corner_count ) argument
|
/external/skia/src/core/ |
H A D | 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 an [all...] |
/external/skia/tests/ |
H A D | SerializationTest.cpp | 446 SkVector corners[4] = { {1, 2}, {2, 3}, {3,4}, {4,5} }; local 447 rrect.setRectRadii(rect, corners);
|
/external/deqp/modules/gles31/functional/ |
H A D | es31fTextureGatherTests.cpp | 757 GATHERCASE_DONT_SAMPLE_CUBE_CORNERS = (1<<1) //!< For cube map cases: do not sample cube corners 1886 const bool corners = (m_flags & GATHERCASE_DONT_SAMPLE_CUBE_CORNERS) == 0; 1887 const Vec2 minC = corners ? Vec2(-1.2f) : Vec2(-0.6f, -1.2f); 1888 const Vec2 maxC = corners ? Vec2( 1.2f) : Vec2( 0.6f, 1.2f); 2132 ? new TestCaseGroup(m_context, "no_corners", "Test case variants that don't sample around cube map corners")
|
H A D | es31fTessellationTests.cpp | 693 const Vec3 corners[3] = 704 tessCoords.push_back((1.0f - f)*corners[j] + f*corners[(j+1)%3]); 1739 const int corners[4] = 1753 gridIndices.push_back(corners[(k+0 + i + (2-j%3)) % 3]); 1755 gridIndices.push_back(corners[(k+2 + i + (2-j%3) + secondTriangleVertexIndexOffset) % 3 + 1]); 2068 log << TestLog::Message << "Note: in the following visualization(s), the u=1, v=1, w=1 corners are at the right, top, and left corners, respectively" << TestLog::EndMessage;
|
/external/chromium-trace/trace-viewer/third_party/Paste/paste/evalexception/media/ |
H A D | MochiKit.packed.js | 5866 this.options={corners:"all",color:"fromElement",bgColor:"fromParent",blend:true,border:false,compact:false,__unstable__wrapElement:false}; 5870 var _608=this.options.corners; 5887 var _60b=this.options.corners; 6003 return this._hasString(this.options.corners,"all","top","tl","tr"); 6005 return this._hasString(this.options.corners,"all","bottom","bl","br");
|
/external/zxing/core/ |
H A D | core.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/oned/ ... |
/external/bison/build-aux/ |
H A D | texinfo.tex | 255 % Dimensions to add cropmarks at corners. 6330 % @cartouche ... @end cartouche: draw rectangle w/rounded corners around
|