| /external/eigen/test/ |
| corners.cpp | 16 template<typename MatrixType> void corners(const MatrixType& m) function
88 CALL_SUBTEST_1( corners(Matrix<float, 1, 1>()) );
89 CALL_SUBTEST_2( corners(Matrix4d()) );
90 CALL_SUBTEST_3( corners(Matrix<int,10,12>()) );
91 CALL_SUBTEST_4( corners(MatrixXcf(5, 7)) );
92 CALL_SUBTEST_5( corners(MatrixXf(21, 20)) );
|
| /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/Camera2/src/com/android/camera/crop/ |
| CropMath.java | 29 * corners.
30 * The order of the corners in the float array is:
36 * @param r the rectangle to get the corners of
37 * @return the float array of corners (8 floats)
41 float[] corners = { local
47 return corners;
65 * Takes an array of 2D coordinates representing corners and returns the
104 * Takes a point and the corners of a rectangle and returns the two corners
108 * @param corners the corners of the rectangl
[all...] |
| BoundedRect.java | 125 // find correction vectors for corners that have moved out of bounds
160 // update translated corners with correction vectors
203 // relies on corners being in same order as method
250 float[] corners = CropMath.getCornersFromRect(outer); local
252 m.mapPoints(corners);
284 float[] l2 = CropMath.closestSide(c, corners);
297 // relies on corners being in same order as method
|
| /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/chromium/chrome/browser/chromeos/frame/ |
| panel_controller.cc | 73 SkScalar corners[] = { local
79 path.addRoundRect(rect, corners);
|
| /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...] |
| /frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/impl/ |
| GcSnapshot.java | 784 // array with 4 corners
785 float[] corners = new float[] { local
793 matrix.transform(corners, 0, corners, 0, 4);
796 dst.left = Math.min(Math.min(corners[0], corners[2]), Math.min(corners[4], corners[6]));
797 dst.right = Math.max(Math.max(corners[0], corners[2]), Math.max(corners[4], corners[6]))
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkPath.cpp | 432 The direction takes advantage of the corners found since opposite sides
441 int corners = 0; local
473 if (0 == corners) {
477 corners = 1;
489 if (++corners > 4) {
497 // Possible values for corners are 2, 3, and 4.
498 // When corners == 3, nextDirection opposes firstDirection.
500 int turn = firstDirection ^ (corners - 1);
501 int directionCycle = 3 == corners ? 0 : nextDirection ^ turn;
522 // Success if 4 corners and first point equals las
[all...] |
| /external/skia/src/core/ |
| SkPath.cpp | 432 The direction takes advantage of the corners found since opposite sides
441 int corners = 0; local
473 if (0 == corners) {
477 corners = 1;
489 if (++corners > 4) {
497 // Possible values for corners are 2, 3, and 4.
498 // When corners == 3, nextDirection opposes firstDirection.
500 int turn = firstDirection ^ (corners - 1);
501 int directionCycle = 3 == corners ? 0 : nextDirection ^ turn;
522 // Success if 4 corners and first point equals las
[all...] |
| /external/zxing/core/ |
| core.jar | |
