| /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)) );
|
| /external/skia/gm/ |
| patch.cpp | 37 SkPoint corners[4] = { bottom[0], bottom[3], top[0], top[3] }; local
51 canvas->drawPoints(SkCanvas::kPoints_PointMode, 4, corners, paint);
|
| bleed.cpp | 333 SkPoint corners[] = {{0, 0}, { 0, kBottom }, { kWidth, kBottom }, {kWidth, 0} }; variable
334 matrices[matrices.count()-1].mapPoints(corners, 4);
335 SkScalar y = (corners[0].fY + corners[1].fY + corners[2].fY + corners[3].fY) / 4;
336 SkScalar x = SkTMax(SkTMax(corners[0].fX, corners[1].fX),
337 SkTMax(corners[2].fX, corners[3].fX))
393 SkPoint corners[] = { { 0, 0 },{ 0, kBottom },{ kWidth, kBottom },{ kWidth, 0 } }; variable
[all...] |
| /external/skia/samplecode/ |
| PerlinPatch.cpp | 29 SkPoint corners[4] = { bottom[0], bottom[3], top[0], top[3] }; local
43 canvas->drawPoints(SkCanvas::kPoints_PointMode, 4, corners, paint);
|
| /external/deqp/external/vulkancts/modules/vulkan/tessellation/ |
| vktTessellationCommonEdgeTests.cpp | 288 const deUint16 corners[4] = local
299 gridIndices.push_back(corners[(k+0 + i + (2-j%3)) % 3]);
301 gridIndices.push_back(corners[(k+2 + i + (2-j%3) + secondTriangleVertexIndexOffset) % 3 + 1]);
|
| vktTessellationUtil.cpp | 917 const tcu::Vec3 corners[3] = local
[all...] |
| /external/opencv/cv/src/ |
| 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;
|
| 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...] |
| /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
|
| /external/skia/tests/ |
| SerializationTest.cpp | 489 SkVector corners[4] = { {1, 2}, {2, 3}, {3,4}, {4,5} }; local
490 rrect.setRectRadii(rect, 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...] |
| /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...] |
| /frameworks/base/tools/layoutlib/bridge/src/android/graphics/ |
| Matrix_Delegate.java | 141 // array with 4 corners
142 float[] corners = new float[] { local
150 mapPoints(corners);
153 dst.left = Math.min(Math.min(corners[0], corners[2]), Math.min(corners[4], corners[6]));
154 dst.right = Math.max(Math.max(corners[0], corners[2]), Math.max(corners[4], corners[6]))
[all...] |
| /frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/impl/ |
| GcSnapshot.java | 837 // array with 4 corners
838 float[] corners = new float[] { local
846 matrix.transform(corners, 0, corners, 0, 4);
849 dst.left = Math.min(Math.min(corners[0], corners[2]), Math.min(corners[4], corners[6]));
850 dst.right = Math.max(Math.max(corners[0], corners[2]), Math.max(corners[4], corners[6]))
[all...] |
| /external/deqp/modules/gles3/functional/ |
| es3fMultisampleTests.cpp | 840 Vec2 corners[4] = local
858 renderTriangle(corners[(0+quadNdx) % 4] + center,
859 corners[(1+quadNdx) % 4] + center,
860 corners[(2+quadNdx) % 4] + center,
865 renderTriangle(corners[(3+quadNdx) % 4] + center,
866 corners[(2+quadNdx) % 4] + center,
867 corners[(0+quadNdx) % 4] + center,
872 renderTriangle(corners[(0+quadNdx) % 4] + center,
873 corners[(2+quadNdx) % 4] + center,
874 corners[(3+quadNdx) % 4] + center
916 Vec2 corners[4] = local
956 Vec2 corners[4] = local
[all...] |
| /external/deqp/external/vulkancts/modules/vulkan/shaderrender/ |
| vktShaderRenderTextureGatherTests.cpp | 765 GATHERCASE_DONT_SAMPLE_CUBE_CORNERS = (1<<0) //!< For cube map cases: do not sample cube corners
2118 const bool corners = (m_baseParams.flags & GATHERCASE_DONT_SAMPLE_CUBE_CORNERS) == 0; local
[all...] |
| /external/skia/src/core/ |
| SkPath.cpp | 417 The direction takes advantage of the corners found since opposite sides
437 int corners = 0; local
471 if (0 == corners) {
475 corners = 1;
487 if (++corners > 4) {
495 // Possible values for corners are 2, 3, and 4.
496 // When corners == 3, nextDirection opposes firstDirection.
498 int turn = firstDirection ^ (corners - 1);
499 int directionCycle = 3 == corners ? 0 : nextDirection ^ turn;
527 // Success if 4 corners and first point equals las
[all...] |
| /cts/apps/CtsVerifier/libs/ |
| opencv3-android.jar | |
| /prebuilts/tools/common/m2/repository/com/jayway/android/robotium/robotium-solo/5.5.3/ |
| robotium-solo-5.5.3.jar | |
| /external/zxing/core/ |
| core.jar | |
