| /external/ceres-solver/include/ceres/ |
| crs_matrix.h | 40 // A compressed row sparse matrix used primarily for communicating the
41 // Jacobian matrix to the user.
48 // A compressed row matrix stores its contents in three arrays,
61 // the matrix.
63 // e.g, consider the 3x4 sparse matrix
|
| /external/chromium_org/third_party/skia/animations/ |
| images#1.xml | 5 <matrix id="initialMatrix" translate="[80,80]" />
14 <matrix>
16 </matrix>
19 <matrix id="polyMatrix">
36 </matrix>
|
| /external/chromium_org/third_party/skia/bench/ |
| PictureRecordBench.cpp | 81 // set a matrix on the canvas
82 SkMatrix matrix; variable
83 matrix.setRotate(SkIntToScalar(i % 360));
84 canvas->setMatrix(matrix);
96 canvas->drawBitmapMatrix(bitmap, matrix);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkPictureStateTree.h | 32 * A draw call, stores offset into command buffer, a pointer to the matrix, and a pointer to
54 * of offsets into the command buffer to carry out those calls with correct matrix/clip state.
55 * This handles saves/restores, and does all necessary matrix setup.
106 // The matrix of the canvas we're playing back into
109 // Cache of current matrix, so we can avoid redundantly setting it
|
| SkRecorder.cpp | 136 const SkMatrix& matrix,
138 APPEND(DrawBitmapMatrix, this->copy(paint), delay_copy(bitmap), matrix);
180 const SkMatrix* matrix, const SkPaint& paint) {
186 this->copy(matrix));
235 void SkRecorder::didConcat(const SkMatrix& matrix) {
236 APPEND(Concat, matrix);
237 INHERITED(didConcat, matrix);
240 void SkRecorder::didSetMatrix(const SkMatrix& matrix) {
241 APPEND(SetMatrix, matrix);
242 INHERITED(didSetMatrix, matrix);
[all...] |
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 23 * \brief Standard Cholesky decomposition (LL^T) of a matrix and associated features
25 * \param MatrixType the type of the matrix of which we are computing the LL^T Cholesky decomposition
30 * matrix A such that A = LL^* = U^*U, where L is lower triangular.
89 LLT(const MatrixType& matrix)
90 : m_matrix(matrix.rows(), matrix.cols()),
93 compute(matrix);
96 /** \returns a view of the upper triangular matrix U */
103 /** \returns a view of the lower triangular matrix L */
112 * Since this LLT class assumes anyway that the matrix A is invertible, the solutio
[all...] |
| LDLT.h | 29 * \brief Robust Cholesky decomposition of a matrix with pivoting
31 * \param MatrixType the type of the matrix of which to compute the LDL^T Cholesky decomposition
36 * matrix \f$ A \f$ such that \f$ A = P^TLDL^*P \f$, where P is a permutation matrix, L
37 * is lower triangular with a unit diagonal and D is a diagonal matrix.
55 Options = MatrixType::Options & ~RowMajorBit, // these are the options for the TmpMatrixType, we need a ColMajor matrix here!
63 typedef Matrix<Scalar, RowsAtCompileTime, 1, Options, MaxRowsAtCompileTime, 1> TmpMatrixType;
98 * This calculates the decomposition for the input \a matrix.
101 LDLT(const MatrixType& matrix)
102 : m_matrix(matrix.rows(), matrix.cols())
[all...] |
| /external/eigen/blas/ |
| BandTriangularSolver.h | 16 * Solve Ax=b with A a band triangular matrix
25 typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,RowMajor>, 0, OuterStride<> > LhsMap;
26 typedef Map<Matrix<RhsScalar,Dynamic,1> > RhsMap;
61 typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > LhsMap;
62 typedef Map<Matrix<RhsScalar,Dynamic,1> > RhsMap;
|
| ctbmv.f | 13 * CTBMV performs one of the matrix-vector operations
18 * upper or lower triangular band matrix, with ( k + 1 ) diagonals.
24 * On entry, UPLO specifies whether the matrix is an upper or
25 * lower triangular matrix as follows:
27 * UPLO = 'U' or 'u' A is an upper triangular matrix.
29 * UPLO = 'L' or 'l' A is a lower triangular matrix.
57 * On entry, N specifies the order of the matrix A.
63 * super-diagonals of the matrix A.
65 * sub-diagonals of the matrix A.
72 * band part of the matrix of coefficients, supplied column b
[all...] |
| dtbmv.f | 13 * DTBMV performs one of the matrix-vector operations
18 * upper or lower triangular band matrix, with ( k + 1 ) diagonals.
24 * On entry, UPLO specifies whether the matrix is an upper or
25 * lower triangular matrix as follows:
27 * UPLO = 'U' or 'u' A is an upper triangular matrix.
29 * UPLO = 'L' or 'l' A is a lower triangular matrix.
57 * On entry, N specifies the order of the matrix A.
63 * super-diagonals of the matrix A.
65 * sub-diagonals of the matrix A.
72 * band part of the matrix of coefficients, supplied column b
[all...] |
| stbmv.f | 13 * STBMV performs one of the matrix-vector operations
18 * upper or lower triangular band matrix, with ( k + 1 ) diagonals.
24 * On entry, UPLO specifies whether the matrix is an upper or
25 * lower triangular matrix as follows:
27 * UPLO = 'U' or 'u' A is an upper triangular matrix.
29 * UPLO = 'L' or 'l' A is a lower triangular matrix.
57 * On entry, N specifies the order of the matrix A.
63 * super-diagonals of the matrix A.
65 * sub-diagonals of the matrix A.
72 * band part of the matrix of coefficients, supplied column b
[all...] |
| ztbmv.f | 13 * ZTBMV performs one of the matrix-vector operations
18 * upper or lower triangular band matrix, with ( k + 1 ) diagonals.
24 * On entry, UPLO specifies whether the matrix is an upper or
25 * lower triangular matrix as follows:
27 * UPLO = 'U' or 'u' A is an upper triangular matrix.
29 * UPLO = 'L' or 'l' A is a lower triangular matrix.
57 * On entry, N specifies the order of the matrix A.
63 * super-diagonals of the matrix A.
65 * sub-diagonals of the matrix A.
72 * band part of the matrix of coefficients, supplied column b
[all...] |
| /external/eigen/test/ |
| cholesky.cpp | 33 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
48 // we are doing some downdates, so it might be the case that the matrix is not SPD anymore
72 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;
73 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
79 // let's make sure the matrix is not singular or near singular
140 symm = -symm; // test a negative matrix
204 Matrix<Scalar,Dynamic,Dynamic> a = Matrix<Scalar,Dynamic,Dynamic>::Random(rows,r);
220 Matrix<Scalar,Dynamic,Dynamic> a = Matrix<Scalar,Dynamic,Dynamic>::Random(rows,rows)
[all...] |
| product_trsolve.cpp | 34 Matrix<Scalar,Size,Size,ColMajor> cmLhs(size,size);
35 Matrix<Scalar,Size,Size,RowMajor> rmLhs(size,size);
39 Matrix<Scalar,Size,Cols,colmajor> cmRhs(size,cols);
40 Matrix<Scalar,Size,Cols,rowmajor> rmRhs(size,cols);
41 Matrix<Scalar,Dynamic,Dynamic,colmajor> ref(size,cols);
|
| /external/eigen/test/eigen2/ |
| eigen2_adjoint.cpp | 20 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
21 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;
91 CALL_SUBTEST_1( adjoint(Matrix<float, 1, 1>()) );
98 // test a large matrix only once
99 CALL_SUBTEST_7( adjoint(Matrix<float, 100, 100>()) );
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| dogleg.h | 7 const Matrix< Scalar, Dynamic, Dynamic > &qrfac,
8 const Matrix< Scalar, Dynamic, 1 > &diag,
9 const Matrix< Scalar, Dynamic, 1 > &qtb,
11 Matrix< Scalar, Dynamic, 1 > &x)
30 Matrix< Scalar, Dynamic, 1 > wa1(n), wa2(n);
|
| /external/skia/bench/ |
| PictureRecordBench.cpp | 81 // set a matrix on the canvas
82 SkMatrix matrix; variable
83 matrix.setRotate(SkIntToScalar(i % 360));
84 canvas->setMatrix(matrix);
96 canvas->drawBitmapMatrix(bitmap, matrix);
|
| /external/skia/src/core/ |
| SkPictureStateTree.h | 32 * A draw call, stores offset into command buffer, a pointer to the matrix, and a pointer to
54 * of offsets into the command buffer to carry out those calls with correct matrix/clip state.
55 * This handles saves/restores, and does all necessary matrix setup.
106 // The matrix of the canvas we're playing back into
109 // Cache of current matrix, so we can avoid redundantly setting it
|
| /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/geometry/ |
| Quad.java | 20 import android.graphics.Matrix;
119 * The transform is applied by multiplying each point (x, y, 1) by the matrix.
122 * @param matrix the transformation matrix
123 * @return the Quad representing the source rectangle transformed by the matrix
125 public static Quad fromTransformedRect(RectF rect, Matrix matrix) {
126 return Quad.fromRect(rect).transformed(matrix);
130 * Returns the transformation matrix to transform the source Quad to the target Quad.
134 * @return the transformation matrix to map source to target
[all...] |
| /frameworks/base/tests/HwAccelerationTest/src/com/android/test/hwui/ |
| AdvancedBlendActivity.java | 28 import android.graphics.Matrix;
71 Matrix m2 = new Matrix();
77 Matrix m3 = new Matrix();
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/ |
| GeometryMathUtils.java | 21 import android.graphics.Matrix;
217 private static void concatMirrorMatrix(Matrix m, GeometryHolder holder) {
317 Matrix m = getCropSelectionToScreenMatrix(null, holder, width, height, frame.width(),
331 public static Matrix getImageToScreenMatrix(Collection<FilterRepresentation> geometry,
338 public static Matrix getPartialToScreenMatrix(Collection<FilterRepresentation> geometry,
349 Matrix compensation = new Matrix();
372 public static Matrix getOriginalToScreen(GeometryHolder holder, boolean rotate,
380 Matrix m = getCropSelectionToScreenMatrix(null, holder, (int) originalWidth,
407 Matrix m = getCropSelectionToScreenMatrix(crop, holder, photo.getWidth(), photo.getHeight()
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/util/ |
| MotionEventHelper.java | 19 import android.graphics.Matrix;
29 public static MotionEvent transformEvent(MotionEvent e, Matrix m) {
40 private static MotionEvent transformEventNew(MotionEvent e, Matrix m) {
47 private static MotionEvent transformEventOld(MotionEvent e, Matrix m) {
102 private static float transformAngle(Matrix m, float angleRadians) {
|
| /packages/apps/LegacyCamera/src/com/android/camera/ui/ |
| FaceView.java | 24 import android.graphics.Matrix;
43 private Matrix mMatrix = new Matrix();
123 // Prepare the matrix.
126 // Focus indicator is directional. Rotate the matrix and the canvas
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| SVD.h | 20 * \brief Standard SVD decomposition of a matrix and associated features
22 * \param MatrixType the type of the matrix of which we are computing the SVD decomposition
24 * This class performs a standard SVD decomposition of a real matrix A of size \c M x \c N
42 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> ColVector;
43 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> RowVector;
45 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MinSize> MatrixUType;
46 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, MatrixType::ColsAtCompileTime> MatrixVType;
47 typedef Matrix<Scalar, MinSize, 1> SingularValuesType;
53 SVD(const MatrixType& matrix)
54 : m_matU(matrix.rows(), (std::min)(matrix.rows(), matrix.cols()))
[all...] |
| /external/ceres-solver/internal/ceres/ |
| visibility_based_preconditioner.h | 73 // structure of the preconditioner matrix is determined by analyzing
79 // entries in the Schur complement matrix corresponding to these
91 // the same cluster occur contiguously, the preconditioner matrix will
92 // be a block diagonal matrix with blocks corresponding to the
110 // preconditioner matrix is a block tridiagonal matrix, and thus the
131 // to determine the sparsity structure of the preconditioner matrix.
178 // Non-zero camera pairs from the schur complement matrix that are
188 // Preconditioner matrix.
192 // implemented using CHOLMOD's sparse triangular matrix solv
[all...] |
