/external/eigen/Eigen/src/Eigen2Support/ |
H A D | Block.h | 16 /** \returns a dynamic-size expression of a corner of *this. 18 * \param type the type of corner. Can be \a Eigen::TopLeft, \a Eigen::TopRight, 20 * \param cRows the number of rows in the corner 21 * \param cCols the number of columns in the corner 34 ::corner(CornerType type, Index cRows, Index cCols) function in class:Eigen::DenseBase 39 eigen_assert(false && "Bad corner type."); 51 /** This is the const version of corner(CornerType, Index, Index).*/ 54 DenseBase<Derived>::corner(CornerType type, Index cRows, Index cCols) const function in class:Eigen::DenseBase 59 eigen_assert(false && "Bad corner type."); 71 /** \returns a fixed-size expression of a corner o 86 DenseBase<Derived>::corner(CornerType type) function in class:Eigen::DenseBase 107 DenseBase<Derived>::corner(CornerType type) const function in class:Eigen::DenseBase [all...] |
/external/skia/gm/ |
H A D | patheffects.cpp | 20 SkPathEffect* corner = SkCornerPathEffect::Create(25); local 23 compose = SkComposePathEffect::Create(pe, corner); 24 corner->unref(); 26 compose = corner;
|
/external/eigen/Eigen/src/Geometry/ |
H A D | AlignedBox.h | 100 /** \returns the minimal corner */ 102 /** \returns a non const reference to the minimal corner */ 104 /** \returns the maximal corner */ 106 /** \returns a non const reference to the maximal corner */ 133 /** \returns the vertex of the bounding box at the corner defined by 134 * the corner-id corner. It works only for a 1D, 2D or 3D bounding box. 142 inline VectorType corner(CornerType corner) const function in class:Eigen::AlignedBox 151 if( mult & corner ) re [all...] |
/external/skia/samplecode/ |
H A D | SampleSlides.cpp | 34 SkPathEffect* corner = SkCornerPathEffect::Create(25); local 37 compose = SkComposePathEffect::Create(pe, corner); 38 corner->unref(); 40 compose = corner;
|
/external/skia/tests/ |
H A D | PathOpsAngleIdeas.cpp | 261 SkDVector corner[4] = { local 268 for (unsigned index = 0; index < SK_ARRAY_COUNT(corner); ++index) { 269 max = SkTMax(max, corner[index].length());
|
/external/deqp/modules/gles2/functional/ |
H A D | es2fClippingTests.cpp | 1245 const tcu::Vec3 corner; member in struct:deqp::gles2::Functional::__anon3158::ClipPlaneVisit 1273 const tcu::Vec3 v1 = visit.entryPoint - visit.corner; 1274 const tcu::Vec3 v2 = visit.exitPoint - visit.corner; 1276 vertex0 = visit.corner + tcu::normalize(tcu::mix(v1, v2, tcu::Vec3(float(tri)/trianglesPerVisit))); 1285 const tcu::Vec3 v1 = visit.entryPoint - visit.corner; 1286 const tcu::Vec3 v2 = visit.exitPoint - visit.corner; 1288 vertex1 = visit.corner + tcu::normalize(tcu::mix(v1, v2, tcu::Vec3(float(tri+1)/trianglesPerVisit)));
|
/external/deqp/modules/gles3/functional/ |
H A D | es3fClippingTests.cpp | 1249 const tcu::Vec3 corner; member in struct:deqp::gles3::Functional::__anon3291::ClipPlaneVisit 1277 const tcu::Vec3 v1 = visit.entryPoint - visit.corner; 1278 const tcu::Vec3 v2 = visit.exitPoint - visit.corner; 1280 vertex0 = visit.corner + tcu::normalize(tcu::mix(v1, v2, tcu::Vec3(float(tri)/trianglesPerVisit))); 1289 const tcu::Vec3 v1 = visit.entryPoint - visit.corner; 1290 const tcu::Vec3 v2 = visit.exitPoint - visit.corner; 1292 vertex1 = visit.corner + tcu::normalize(tcu::mix(v1, v2, tcu::Vec3(float(tri+1)/trianglesPerVisit)));
|
/external/opencv/cv/src/ |
H A D | cvcalibinit.cpp | 43 This is improved variant of chessboard corner detection algorithm that 98 /** This structure stores information about the chessboard corner.*/ 101 CvPoint2D32f pt; // Coordinates of the corner 118 // neighbors and corners are synced, i.e., neighbor 0 shares corner 0 151 static void icvOrderQuad(CvCBQuad *quad, CvCBCorner *corner, int common); 488 // for each corner c lying between end points in the same row/column it checks that 535 // can add quads, so we need to have quad/corner arrays passed in 578 // 0,1,2,3) are in the at the same relative corner (e.g., lower right). 808 CvCBCorner* corner; local 813 corner 986 icvOrderQuad(CvCBQuad *quad, CvCBCorner *corner, int common) argument 1719 CvCBCorner* corner = &(*out_corners)[quad_count*4 + i]; local 1945 CvCBCorner* corner = &(*out_corners)[quad_count*4 + i]; local [all...] |
/external/skia/src/utils/ |
H A D | SkLua.cpp | 1603 int corner = SkToInt(lua_tointeger(L, 2)); local 1605 if (corner < 0 || corner > 3) { 1606 SkDebugf("bad corner index %d", corner); 1609 v = get_obj<SkRRect>(L, 1)->radii((SkRRect::Corner)corner);
|