| /external/zxing/core/ |
| README.google | 12 QR Codes, Data Matrix, and the UPC family of 1D barcodes. It will provide
|
| /frameworks/base/core/java/android/view/inputmethod/ |
| CursorAnchorInfo.java | 19 import android.graphics.Matrix;
65 * transformed with the transformation matrix when rendered on the screen. This should be
72 * transformed with the transformation matrix when rendered on the screen. This should be
79 * transformed with the transformation matrix when rendered on the screen. This should be
86 * transformed with the transformation matrix when rendered on the screen. This should be
94 * Java chars, in the local coordinates that will be transformed with the transformation matrix
100 * Transformation matrix that is applied to any positional information of this class to
103 private final Matrix mMatrix;
134 mMatrix = new Matrix();
257 private final Matrix mMatrix = new Matrix(Matrix.IDENTITY_MATRIX)
[all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/ |
| BitmapHelper.java | 22 import android.graphics.Matrix;
48 final Matrix m = new Matrix();
49 m.setRectToRect(srcRect, dstRect, Matrix.ScaleToFit.CENTER);
|
| /frameworks/base/tests/HwAccelerationTest/src/com/android/test/hwui/ |
| MoreShadersActivity.java | 30 import android.graphics.Matrix;
60 private final Matrix mMtx1;
73 Matrix m2 = new Matrix();
79 Matrix m3 = new Matrix();
85 Matrix m4 = new Matrix();
94 mMtx1 = new Matrix();
|
| /frameworks/base/tests/RenderScriptTests/ShadersTest/src/com/android/shaderstest/ |
| shaderstest.rs | 151 rs_matrix4x4 matrix;
153 rsMatrixLoadIdentity(&matrix);
154 rsMatrixTranslate(&matrix, gLookAt.x, gLookAt.y, gLookAt.z - gZoom);
155 rsMatrixRotate(&matrix, gRotateX, 1.0f, 0.0f, 0.0f);
156 rsMatrixRotate(&matrix, gRotateY, 0.0f, 1.0f, 0.0f);
157 rsgProgramVertexLoadModelMatrix(&matrix);
164 rs_matrix4x4 proj, matrix;
167 rsMatrixLoadIdentity(&matrix);
168 rsgProgramVertexLoadModelMatrix(&matrix);
|
| /frameworks/ex/camera2/portability/src/com/android/ex/camera2/portability/ |
| CameraDeviceInfo.java | 19 import android.graphics.Matrix;
153 * The transform matrix that should be applied to the
157 public Matrix getPreviewTransform(int currentDisplayOrientation, RectF surfaceDimensions) {
177 * The transform matrix that should be applied to the
181 public Matrix getPreviewTransform(int currentDisplayOrientation, RectF surfaceDimensions,
185 return new Matrix();
188 Matrix transform = new Matrix();
189 transform.setRectToRect(surfaceDimensions, desiredBounds, Matrix.ScaleToFit.FILL);
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseBlock.h | 127 _NestedMatrixType& matrix = const_cast<_NestedMatrixType&>(m_matrix);; local
129 // and/or it is not at the end of the nonzeros of the underlying matrix.
136 Index start = m_outerStart==0 ? 0 : matrix.outerIndexPtr()[m_outerStart]; // starting position of the current block
142 ? Index(matrix.data().allocatedSize()) + block_size
156 std::memcpy(&newdata.value(start+nnz), &matrix.data().value(end), tail_size*sizeof(Scalar));
157 std::memcpy(&newdata.index(start+nnz), &matrix.data().index(end), tail_size*sizeof(Index));
161 matrix.data().swap(newdata);
166 matrix.data().resize(start + nnz + tail_size);
168 std::memmove(&matrix.data().value(start+nnz), &matrix.data().value(end), tail_size*sizeof(Scalar))
[all...] |
| /external/eigen/doc/ |
| A05_PortingFrom2To3.dox | 51 \section Corners Matrix Corners
56 matrix.corner(TopLeft,r,c)
57 matrix.corner(TopRight,r,c)
58 matrix.corner(BottomLeft,r,c)
59 matrix.corner(BottomRight,r,c)
60 matrix.corner<r,c>(TopLeft)
61 matrix.corner<r,c>(TopRight)
62 matrix.corner<r,c>(BottomLeft)
63 matrix.corner<r,c>(BottomRight)
65 matrix.topLeftCorner(r,c
[all...] |
| TutorialGeometry.dox | 13 \note If you are working with OpenGL 4x4 matrices then Affine3f and Affine3d are what you want. Since Eigen defaults to column-major storage, you can directly use the Transform::data() method to pass your transformation matrix to OpenGL.
64 Matrix<float,N> t = concatenation_of_rotations_and_scalings;
65 Matrix<float,2> t = Rotation2Df(a) * Scaling(s);
66 Matrix<float,3> t = AngleAxisf(a,axis) * Scaling(s);\endcode</td></tr>
75 designed to simplify the creation/initialization of linear (Matrix) and affine (Transform)
84 Rotation2Df r; r = Matrix2f(..); // assumes a pure rotation matrix
86 AngleAxisf aa; aa = Matrix3f(..); // assumes a pure rotation matrix
115 is a (Dim+1)^2 matrix. In Eigen we have chosen to not distinghish between points and
152 full read-write access to the internal matrix</td><td>\code
153 t.matrix() = matN1xN1; // N1 means N+
[all...] |
| /external/eigen/test/ |
| jacobisvd.cpp | 30 typedef Matrix<Scalar, RowsAtCompileTime, RowsAtCompileTime> MatrixUType;
31 typedef Matrix<Scalar, ColsAtCompileTime, ColsAtCompileTime> MatrixVType;
80 typedef Matrix<Scalar, RowsAtCompileTime, Dynamic> RhsType;
81 typedef Matrix<Scalar, ColsAtCompileTime, Dynamic> SolutionType;
124 typedef Matrix<Scalar, RankAtCompileTime2, ColsAtCompileTime> MatrixType2;
125 typedef Matrix<Scalar, RankAtCompileTime2, 1> RhsType2;
126 typedef Matrix<Scalar, ColsAtCompileTime, RankAtCompileTime2> MatrixType2T;
137 Matrix<Scalar,Dynamic,1> tmp = qr.matrixQR().topLeftCorner(rank,rank).template triangularView<Upper>().adjoint().solve(rhs2);
148 // Now check with a rank deficient matrix
149 typedef Matrix<Scalar, RowsAtCompileTime3, ColsAtCompileTime> MatrixType3
[all...] |
| /frameworks/base/core/java/android/view/ |
| Surface.java | 22 import android.graphics.Matrix;
86 // A matrix to scale the matrix set by application. This is set to null for
88 private Matrix mCompatibleMatrix;
306 mCompatibleMatrix = new Matrix();
486 * <li>Scales the matrix in setMatrix by the application scale, except if
487 * the matrix looks like obtained from getMatrix. This is a hack to handle
488 * the case that an application uses getMatrix to keep the original matrix,
489 * set matrix of its own, then set the original matrix back. There is n
[all...] |
| /external/chromium_org/third_party/skia/tests/ |
| MatrixClipCollapseTest.cpp | 15 // This test exercises the Matrix/Clip State collapsing system. It generates
23 // be completely removed by the matrix/clip collapse. Note: every save in
32 // The ModelClip methods output matrix and clip ops in various orders and
34 // expected matrix & clip ops. Note that, currently, the entire clip stack
47 // rendering before and after images. Additionally the matrix/clip collapse
50 // run the matrix/clip collapse system on the 10K skp set
51 // - this should give us warm fuzzies that the matrix clip collapse
53 // bench the recording times with/without matrix/clip collapsing
259 // expected is NULL if this matrix call will be fused into later ones
323 // matrix
[all...] |
| /external/skia/tests/ |
| MatrixClipCollapseTest.cpp | 15 // This test exercises the Matrix/Clip State collapsing system. It generates
23 // be completely removed by the matrix/clip collapse. Note: every save in
32 // The ModelClip methods output matrix and clip ops in various orders and
34 // expected matrix & clip ops. Note that, currently, the entire clip stack
47 // rendering before and after images. Additionally the matrix/clip collapse
50 // run the matrix/clip collapse system on the 10K skp set
51 // - this should give us warm fuzzies that the matrix clip collapse
53 // bench the recording times with/without matrix/clip collapsing
259 // expected is NULL if this matrix call will be fused into later ones
323 // matrix
[all...] |
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| CanvasTest.java | 26 import android.graphics.Matrix;
160 final Matrix m1 = new Matrix();
165 final Matrix m2 = new Matrix();
170 final Matrix m3 = mCanvas.getMatrix();
179 final Matrix m4 = mCanvas.getMatrix();
188 // test save current matrix only
189 Matrix m1 = new Matrix();
[all...] |
| /external/ceres-solver/internal/ceres/ |
| rotation_test.cc | 150 // double matrix[9];
151 // EXPECT_THAT(matrix, IsOrthonormal());
154 *result_listener << "Null matrix";
183 *result_listener << "Null matrix";
370 // Transforms a zero axis/angle to a rotation matrix.
373 double matrix[9]; local
375 AngleAxisToRotationMatrix(axis_angle, matrix);
376 EXPECT_THAT(matrix, IsOrthonormal());
377 EXPECT_THAT(matrix, IsNear3x3Matrix(expected));
382 double matrix[9] local
392 double matrix[9]; local
407 double matrix[9]; local
420 double matrix[9]; local
504 double matrix[9]; local
539 double matrix[9]; local
572 double matrix[9]; local
[all...] |
| /external/pdfium/core/src/fxge/Microsoft SDK/include/ |
| GdiPlusPath.h | 726 Status Transform(IN const Matrix* matrix)
728 if(matrix)
729 return SetStatus(DllExports::GdipTransformPath(nativePath, matrix->nativeMatrix));
741 IN const Matrix* matrix = NULL,
746 IN const Matrix* matrix = NULL,
753 * When matrix = NULL, the identity matrix is assumed.
[all...] |
| /external/ceres-solver/include/ceres/ |
| covariance.h | 84 // If J(x*) is rank deficient, then the covariance matrix C(x*) is
90 // matrix for y was identity. This is an important assumption. If this
95 // Where S is a positive semi-definite matrix denoting the covariance
105 // covariance matrix not equal to identity, then it is the user's
109 // is the inverse square root of the covariance matrix S.
116 // Since the computation of the covariance matrix requires computing
117 // the inverse of a potentially large matrix, this can involve a
120 // covariance matrix. Quite often just the block diagonal. This class
121 // allows the user to specify the parts of the covariance matrix that
123 // and store those parts of the covariance matrix
[all...] |
| /external/eigen/Eigen/src/SparseQR/ |
| SparseQR.h | 50 * Q is the orthogonal matrix represented as products of Householder reflectors.
54 * R is the sparse triangular or trapezoidal matrix. The later occurs when A is rank-deficient.
57 * \tparam _MatrixType The type of the sparse matrix A, must be a column-major SparseMatrix<>
61 * \warning The input sparse matrix A must be in compressed mode (see SparseMatrix::makeCompressed()).
74 typedef Matrix<Index, Dynamic, 1> IndexVector;
75 typedef Matrix<Scalar, Dynamic, 1> ScalarVector;
81 /** Construct a QR factorization of the matrix \a mat.
83 * \warning The matrix \a mat must be in compressed mode (see SparseMatrix::makeCompressed()).
92 /** Computes the QR factorization of the sparse matrix \a mat.
94 * \warning The matrix \a mat must be in compressed mode (see SparseMatrix::makeCompressed())
[all...] |
| /frameworks/base/tests/RenderScriptTests/MiscSamples/src/com/example/android/rs/miscsamples/ |
| rsrenderstates.rs | 154 // Setup the projectioni matrix
162 rs_matrix4x4 matrix;
163 rsMatrixLoadIdentity(&matrix);
164 rsgProgramVertexLoadModelMatrix(&matrix);
213 rs_matrix4x4 matrix;
214 rsMatrixLoadIdentity(&matrix);
215 rsgProgramVertexLoadModelMatrix(&matrix);
258 rs_matrix4x4 matrix;
259 rsMatrixLoadTranslate(&matrix, 128, 128, 0);
260 rsgProgramVertexLoadModelMatrix(&matrix);
[all...] |
| /external/chromium_org/third_party/qcms/src/ |
| chain.c | 30 #include "matrix.h"
32 static struct matrix build_lut_matrix(struct lutType *lut)
34 struct matrix result;
47 memset(&result, 0, sizeof(struct matrix));
53 static struct matrix build_mAB_matrix(struct lutmABType *lut)
55 struct matrix result;
68 memset(&result, 0, sizeof(struct matrix));
418 struct matrix mat;
422 mat.m[0][0] = transform->matrix.m[0][0];
423 mat.m[1][0] = transform->matrix.m[0][1]
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkMatrixClipStateMgr.h | 20 // The SkMatrixClipStateMgr collapses the matrix/clip state of an SkPicture into
21 // a series of save/restore blocks of consistent matrix clip state, e.g.:
48 // and matrix calls sent to SkCanvas in order to track the current matrix/clip
85 void preConcat(const SkMatrix& matrix) {
87 fMatrix.preConcat(matrix);
90 void setMatrix(const SkMatrix& matrix) {
92 fMatrix = matrix;
308 void concat(const SkMatrix& matrix) {
310 fCurMCState->fMatrixInfo->preConcat(matrix);
[all...] |
| /external/eigen/blas/ |
| chbmv.f | 14 * CHBMV performs the matrix-vector operation
19 * A is an n by n hermitian band matrix, with k super-diagonals.
26 * triangular part of the band matrix A is being supplied as
38 * On entry, N specifies the order of the matrix A.
44 * matrix A. K must satisfy 0 .le. K.
54 * band part of the hermitian matrix, supplied column by
55 * column, with the leading diagonal of the matrix in row
60 * triangular part of a hermitian band matrix from conventional
61 * full matrix storage to band storage:
66 * A( M + I, J ) = matrix( I, J
[all...] |
| dsbmv.f | 14 * DSBMV performs the matrix-vector operation
19 * A is an n by n symmetric band matrix, with k super-diagonals.
26 * triangular part of the band matrix A is being supplied as
38 * On entry, N specifies the order of the matrix A.
44 * matrix A. K must satisfy 0 .le. K.
54 * band part of the symmetric matrix, supplied column by
55 * column, with the leading diagonal of the matrix in row
60 * triangular part of a symmetric band matrix from conventional
61 * full matrix storage to band storage:
66 * A( M + I, J ) = matrix( I, J
[all...] |
| ssbmv.f | 14 * SSBMV performs the matrix-vector operation
19 * A is an n by n symmetric band matrix, with k super-diagonals.
26 * triangular part of the band matrix A is being supplied as
38 * On entry, N specifies the order of the matrix A.
44 * matrix A. K must satisfy 0 .le. K.
54 * band part of the symmetric matrix, supplied column by
55 * column, with the leading diagonal of the matrix in row
60 * triangular part of a symmetric band matrix from conventional
61 * full matrix storage to band storage:
66 * A( M + I, J ) = matrix( I, J
[all...] |
| zhbmv.f | 14 * ZHBMV performs the matrix-vector operation
19 * A is an n by n hermitian band matrix, with k super-diagonals.
26 * triangular part of the band matrix A is being supplied as
38 * On entry, N specifies the order of the matrix A.
44 * matrix A. K must satisfy 0 .le. K.
54 * band part of the hermitian matrix, supplied column by
55 * column, with the leading diagonal of the matrix in row
60 * triangular part of a hermitian band matrix from conventional
61 * full matrix storage to band storage:
66 * A( M + I, J ) = matrix( I, J
[all...] |
