| /external/srec/srec/clib/ |
| imeld_rd.c | 46 void delete_matrix(covdata **matrix, int dimen);
47 void delete_fixed_matrix(imeldata **matrix, int dimen);
48 int scale_matrix_for_fixedpoint(imeldata **fixmat, covdata **matrix,int dimen);
58 prep->matrix = create_fixed_matrix(matdim);
71 ASSERT(prep->matrix);
72 delete_fixed_matrix(prep->matrix, prep->dim);
75 prep->matrix = NULL;
145 /* The imelda matrix
154 prep->imel_shift = scale_matrix_for_fixedpoint(prep->matrix,
157 /* The inverse imelda matrix
[all...] |
| /frameworks/support/v8/renderscript/java/src/android/support/v8/renderscript/ |
| ScriptIntrinsicColorMatrix.java | 22 * Intrinsic for applying a color matrix to allocations.
26 * result by the 4x4 color matrix as performed by
39 * Create an intrinsic for applying a color matrix to an
70 * Set the color matrix which will be applied to each cell of
73 * @param m The 4x4 matrix to set.
81 * Set the color matrix which will be applied to each cell of the image.
84 * @param m The 3x3 matrix to set.
92 * Set a color matrix to convert from RGB to luminance. The alpha channel
111 * Set the matrix to convert from YUV to RGB with a direct copy of the 4th
130 * Set the matrix to convert from RGB to YUV with a direct copy of the 4t
[all...] |
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| PathMeasureTest.java | 20 import android.graphics.Matrix;
119 Matrix matrix = new Matrix(); local
120 assertFalse(mPathMeasure.getMatrix(1f, matrix, PathMeasure.POSITION_MATRIX_FLAG));
121 matrix.setScale(1f, 2f);
124 assertTrue(mPathMeasure.getMatrix(0f, matrix, PathMeasure.TANGENT_MATRIX_FLAG));
|
| /external/ceres-solver/internal/ceres/ |
| block_random_access_diagonal_matrix_test.cc | 83 Matrix::Ones(blocks[row_block_id], blocks[col_block_id]);
87 const TripletSparseMatrix* tsm = m.matrix();
91 Matrix dense;
97 EXPECT_NEAR((dense.block(0, 0, 3, 3) - Matrix::Ones(3, 3)).norm(),
102 EXPECT_NEAR((dense.block(3, 3, 4, 4) - 2 * 2 * Matrix::Ones(4, 4)).norm(),
107 EXPECT_NEAR((dense.block(7, 7, 5, 5) - 3 * 3 * Matrix::Ones(5, 5)).norm(),
111 // There is nothing else in the matrix besides these four blocks.
|
| block_random_access_sparse_matrix.h | 52 // for doing the actual storage. This class augments this matrix with
58 // of this matrix.
63 // modifying any cells when the matrix is being destroyed.
78 // Since the matrix is square, num_rows() == num_cols().
82 // Access to the underlying matrix object.
83 const TripletSparseMatrix* matrix() const { return tsm_.get(); } function in class:ceres::internal::BlockRandomAccessSparseMatrix
100 // The underlying matrix object which actually stores the cells.
|
| dense_sparse_matrix.h | 31 // A dense matrix implemented under the SparseMatrix interface.
49 // Build a matrix with the same content as the TripletSparseMatrix
65 virtual void ToDenseMatrix(Matrix* dense_matrix) const;
73 ConstColMajorMatrixRef matrix() const;
79 // Original matrix:
95 // diagonal to a matrix that already has an appended diagonal, and it is also
96 // a fatal error to remove a diagonal from a matrix that has none.
|
| /external/chromium_org/pdf/ |
| draw_utils.h | 55 // Shadow Matrix contains matrix for shadow rendering. To reduce amount of
56 // calculations user may choose to cache matrix and reuse it if nothing changed.
59 // Matrix parameters.
60 // depth - how big matrix should be. Shadow will go smoothly across the
61 // entire matrix from black to background color.
90 const ShadowMatrix& matrix);
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| GeneralizedEigenSolver.h | 26 * eigen-decomposition; this is expected to be an instantiation of the Matrix
29 * The generalized eigenvalues and eigenvectors of a matrix pair \f$ A \f$ and \f$ B \f$ are scalars
31 * \f$ D \f$ is a diagonal matrix with the eigenvalues on the diagonal, and
32 * \f$ V \f$ is a matrix with the eigenvectors as its columns, then \f$ A V =
33 * B V D \f$. The matrix \f$ V \f$ is almost always invertible, in which case we
36 * The generalized eigenvalues and eigenvectors of a matrix pair may be complex, even when the
37 * matrices are real. Moreover, the generalized eigenvalue might be infinite if the matrix B is
45 * a given matrix pair. Alternatively, you can use the
90 typedef Matrix<Scalar, ColsAtCompileTime, 1, Options & ~RowMajor, MaxColsAtCompileTime, 1> VectorType;
97 typedef Matrix<ComplexScalar, ColsAtCompileTime, 1, Options & ~RowMajor, MaxColsAtCompileTime, 1> ComplexVectorTy (…)
[all...] |
| /external/eigen/bench/ |
| benchGeometry.cpp | 41 return a1.matrix() * a2;
51 return res(a1.matrix() * a2.matrix());
83 typedef Matrix<scalar, vsize, 1, option> Vec;\
112 cout << "vec = trans.matrix() * vec" << endl;
128 cout << "trans = trans1.matrix() * trans.matrix()" << endl;
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| qrsolv.h | 8 Matrix< Scalar, Dynamic, Dynamic > &s,
11 const Matrix< Scalar, Dynamic, 1 > &diag,
12 const Matrix< Scalar, Dynamic, 1 > &qtb,
13 Matrix< Scalar, Dynamic, 1 > &x,
14 Matrix< Scalar, Dynamic, 1 > &sdiag)
23 Matrix< Scalar, Dynamic, 1 > wa(n);
37 /* eliminate the diagonal matrix d using a givens rotation. */
|
| /frameworks/base/tests/HwAccelerationTest/src/com/android/test/hwui/ |
| AdvancedGradientsActivity.java | 22 import android.graphics.Matrix;
43 private final Matrix mMatrix;
44 private final Matrix mMatrix2;
45 private final Matrix mMatrix3;
54 mMatrix = new Matrix();
58 mMatrix2 = new Matrix();
62 mMatrix3 = new Matrix();
|
| Alpha8BitmapActivity.java | 25 import android.graphics.Matrix;
81 Matrix matrix = new Matrix(); local
82 matrix.setScale(2.0f, 2.0f);
83 matrix.postTranslate(0.0f, mBitmap1.getHeight());
84 canvas.drawBitmap(mBitmap1, matrix, mBitmapPaint);
|
| /frameworks/base/tests/RenderScriptTests/ModelViewer/src/com/android/modelviewer/ |
| simplemodel.rs | 159 rs_matrix4x4 matrix;
160 rsMatrixLoadIdentity(&matrix);
162 rsMatrixTranslate(&matrix, gLookAt.x, gLookAt.y, gLookAt.z - gZoom);
163 rsMatrixMultiply(&matrix, &gPostureMatrix);
164 rsMatrixRotate(&matrix, gRotateX, 1.0f, 0.0f, 0.0f);
165 rsMatrixRotate(&matrix, gRotateY, 0.0f, 1.0f, 0.0f);
167 rsgProgramVertexLoadModelMatrix(&matrix);
|
| /frameworks/base/tests/RenderScriptTests/PerfTest/src/com/android/perftest/ |
| fill_test.rs | 61 // Setup the projection matrix
69 rs_matrix4x4 matrix;
70 rsMatrixLoadIdentity(&matrix);
71 rsgProgramVertexLoadModelMatrix(&matrix);
107 rs_matrix4x4 matrix;
108 rsMatrixLoadIdentity(&matrix);
109 rsgProgramVertexLoadModelMatrix(&matrix);
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/ |
| ImageRedEye.java | 22 import android.graphics.Matrix;
74 Matrix originalNoRotateToScreen = getImageToScreenMatrix(false);
75 Matrix originalToScreen = getImageToScreenMatrix(true);
76 Matrix invert = new Matrix();
109 protected void drawPoint(FilterPoint point, Canvas canvas, Matrix originalToScreen,
110 Matrix originalRotateToScreen, Paint paint) {
|
| /external/eigen/Eigen/src/CholmodSupport/ |
| CholmodSupport.h | 48 /** Wraps the Eigen sparse matrix \a mat into a Cholmod sparse matrix object.
105 /** Returns a view of the Eigen sparse matrix \a mat as Cholmod sparse matrix.
110 cholmod_sparse res = viewAsCholmod(mat.matrix().const_cast_derived());
118 /** Returns a view of the Eigen \b dense matrix \a mat as Cholmod dense matrix.
139 /** Returns a view of the Cholmod sparse matrix \a cm as an Eigen sparse matrix.
179 CholmodBase(const MatrixType& matrix)
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/Geometry/ |
| Transform.h | 34 * The homography is internally represented and stored as a (Dim+1)^2 matrix which
35 * is available through the matrix() method.
40 * \sa class Matrix, class Quaternion
53 /** type of the matrix used to represent the transformation */
54 typedef Matrix<Scalar,HDim,HDim> MatrixType;
55 /** type of the matrix used to represent the linear part of the transformation */
56 typedef Matrix<Scalar,Dim,Dim> LinearMatrixType;
62 typedef Matrix<Scalar,Dim,1> VectorType;
99 transform->matrix() = other;
109 transform->matrix()(Dim,Dim) = Scalar(1)
143 inline const MatrixType& matrix() const { return m_matrix; } function in class:Eigen::Transform
145 inline MatrixType& matrix() { return m_matrix; } function in class:Eigen::Transform
[all...] |
| /external/chromium_org/ui/gfx/geometry/ |
| matrix3_f.cc | 60 Matrix3F matrix; local
61 matrix.set(0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f);
62 return matrix;
67 Matrix3F matrix; local
68 matrix.set(1.0f, 1.0f, 1.0f, 1.0f, 1.0f, 1.0f, 1.0f, 1.0f, 1.0f);
69 return matrix;
74 Matrix3F matrix; local
75 matrix.set(1.0f, 0.0f, 0.0f, 0.0f, 1.0f, 0.0f, 0.0f, 0.0f, 1.0f);
76 return matrix;
81 Matrix3F matrix; local
[all...] |
| /external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
| KroneckerTensorProduct.h | 26 * \tparam Lhs Type of the left-hand side, a matrix expression.
27 * \tparam Rhs Type of the rignt-hand side, a matrix expression.
69 * If at least one of the operands is a sparse matrix expression,
70 * then this class is returned and evaluates into a sparse matrix.
76 * \tparam Lhs Type of the left-hand side, a matrix expression.
77 * \tparam Rhs Type of the rignt-hand side, a matrix expression.
167 typedef Matrix<Scalar,Rows,Cols> ReturnType;
205 * \warning If you want to replace a matrix by its Kronecker product
206 * with some matrix, do \b NOT do this:
215 * \param a Dense matrix
[all...] |
| /external/neven/Embedded/common/src/b_TensorEm/ |
| Flt16Mat3D.h | 36 /** 3d matrix with floating point */
81 /** initializes matrix */
84 /** destroys matrix */
111 /** creates identity matrix */
114 /** creates scale matrix */
117 /** creates matrix from 16 bit values */
123 /** creates matrix from 32 bit values (automatic adjustment of bbp value) */
129 /** scales matrix by a factor */
132 /** multiplies matrix with vecA; returns resulting vector */
137 /** Multiplies matrix with float vecA; returns resulting vector.
[all...] |
| /frameworks/base/opengl/java/android/opengl/ |
| GLU.java | 77 Matrix.setLookAtM(scratch, 0, eyeX, eyeY, eyeZ, centerX, centerY, centerZ,
84 * Set up a 2D orthographic projection matrix
98 * Set up a perspective projection matrix
131 * @param model the current modelview matrix
134 * @param project the current projection matrix
136 * matrix data starts.
155 Matrix.multiplyMM(scratch, M_OFFSET, project, projectOffset,
163 Matrix.multiplyMV(scratch, V2_OFFSET,
197 * @param model the current modelview matrix
200 * @param project the current projection matrix
[all...] |
| /external/chromium_org/skia/ext/ |
| skia_utils_mac.mm | 89 CGAffineTransform SkMatrixToCGAffineTransform(const SkMatrix& matrix) {
92 DCHECK(matrix[SkMatrix::kMPersp0] == 0.0f);
93 DCHECK(matrix[SkMatrix::kMPersp1] == 0.0f);
94 DCHECK(matrix[SkMatrix::kMPersp2] == 1.0f);
96 return CGAffineTransformMake(matrix[SkMatrix::kMScaleX],
97 matrix[SkMatrix::kMSkewY],
98 matrix[SkMatrix::kMSkewX],
99 matrix[SkMatrix::kMScaleY],
100 matrix[SkMatrix::kMTransX],
101 matrix[SkMatrix::kMTransY])
[all...] |
| /external/eigen/Eigen/src/SPQRSupport/ |
| SuiteSparseQRSupport.h | 45 * Q is the orthogonal matrix represented as Householder reflectors.
52 * \tparam _MatrixType The type of the sparse matrix A, must be a column-major SparseMatrix<>
75 SPQR(const _MatrixType& matrix)
82 compute(matrix);
99 void compute(const _MatrixType& matrix)
103 MatrixType mat(matrix);
106 Index col = matrix.cols();
121 * Get the number of rows of the input matrix and the Q matrix
126 * Get the number of columns of the input matrix.
[all...] |
| /frameworks/base/core/java/android/view/ |
| GhostView.java | 19 import android.graphics.Matrix;
61 public void setMatrix(Matrix matrix) {
62 mRenderNode.setAnimationMatrix(matrix);
92 public static void calculateMatrix(View view, ViewGroup host, Matrix matrix) {
94 matrix.reset();
95 parent.transformMatrixToGlobal(matrix);
96 matrix.preTranslate(-parent.getScrollX(), -parent.getScrollY());
97 host.transformMatrixToLocal(matrix);
[all...] |
| /external/eigen/Eigen/src/UmfPackSupport/ |
| UmfPackSupport.h | 114 * using the UmfPack library. The sparse matrix A must be squared and full rank.
117 * \warning The input matrix A should be in a \b compressed and \b column-major form.
118 * Otherwise an expensive copy will be made. You can call the inexpensive makeCompressed() to get a compressed matrix.
119 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
131 typedef Matrix<Scalar,Dynamic,1> Vector;
132 typedef Matrix<int, 1, MatrixType::ColsAtCompileTime> IntRowVectorType;
133 typedef Matrix<int, MatrixType::RowsAtCompileTime, 1> IntColVectorType;
141 UmfPackLU(const MatrixType& matrix)
144 compute(matrix);
159 * \c NumericalIssue if the matrix.appears to be negative
[all...] |
