| /external/chromium_org/third_party/skia/src/pdf/ |
| SkPDFDeviceFlattener.cpp | 63 SkMatrix matrix = SkMatrix::I(); local
64 draw.fMatrix = &matrix;
109 SkMatrix matrix = SkMatrix::I(); local
110 draw.fMatrix = &matrix;
136 const SkPath& path, const SkMatrix* matrix,
138 if (mustPathText(d, paint) || (matrix && matrix->hasPerspective())) {
139 d.drawTextOnPath((const char*)text, len, path, matrix, paint);
142 INHERITED::drawTextOnPath(d, text, len, path, matrix, paint);
|
| /external/chromium_org/third_party/skia/src/sfnt/ |
| SkOTTable_glyf.h | 157 union Matrix {
181 SkOTTableGlyphData::Composite::Component::Transform::Matrix matrix; member in struct:SkOTTableGlyphData::Composite::Component::Transform::WordValue
187 SkOTTableGlyphData::Composite::Component::Transform::Matrix matrix; member in struct:SkOTTableGlyphData::Composite::Component::Transform::ByteValue
193 SkOTTableGlyphData::Composite::Component::Transform::Matrix matrix; member in struct:SkOTTableGlyphData::Composite::Component::Transform::WordIndex
199 SkOTTableGlyphData::Composite::Component::Transform::Matrix matrix; member in struct:SkOTTableGlyphData::Composite::Component::Transform::ByteIndex
|
| /external/eigen/bench/ |
| geometry.cpp | 19 typedef Matrix<RealScalar,Dynamic,Dynamic> A;
20 typedef Matrix</*Real*/Scalar,Dynamic,Dynamic> B;
21 typedef Matrix<Scalar,Dynamic,Dynamic> C;
22 typedef Matrix<RealScalar,Dynamic,Dynamic> M;
65 struct get_dim<Matrix<S,R,C,O,MR,MC> > { enum { Dim = R }; };
72 Matrix<typename Transformation::Scalar,get_dim<Transformation>::Dim,N> data;
99 Matrix<Scalar,3,4> mat34; mat34.setRandom();
106 Matrix<Scalar,3,3> mat33; mat33.setRandom();
118 bench("matrix 3x3", mat33);
|
| /external/eigen/test/ |
| geo_homogeneous.cpp | 19 typedef Matrix<Scalar,Size,Size> MatrixType;
20 typedef Matrix<Scalar,Size,1, ColMajor> VectorType;
22 typedef Matrix<Scalar,Size+1,Size> HMatrixType;
23 typedef Matrix<Scalar,Size+1,1> HVectorType;
25 typedef Matrix<Scalar,Size,Size+1> T1MatrixType;
26 typedef Matrix<Scalar,Size+1,Size+1> T2MatrixType;
27 typedef Matrix<Scalar,Size+1,Size> T3MatrixType;
74 Matrix<Scalar, Size, Dynamic> pts;
75 Matrix<Scalar, Size+1, Dynamic> pts1, pts2;
|
| permutationmatrices.cpp | 20 typedef Matrix<int, Rows, 1> LeftPermutationVectorType;
23 typedef Matrix<int, Cols, 1> RightPermutationVectorType;
42 Matrix<Scalar,Rows,Rows> lm(lp);
43 Matrix<Scalar,Cols,Cols> rm(rp);
58 Matrix<Scalar,Rows,Rows> lm2(lp2);
108 CALL_SUBTEST_1( permutationmatrices(Matrix<float, 1, 1>()) );
110 CALL_SUBTEST_3( permutationmatrices(Matrix<double,3,3,RowMajor>()) );
112 CALL_SUBTEST_5( permutationmatrices(Matrix<double,40,60>()) );
113 CALL_SUBTEST_6( permutationmatrices(Matrix<double,Dynamic,Dynamic,RowMajor>(20, 30)) );
|
| householder.cpp | 26 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
27 typedef Matrix<Scalar, internal::decrement_size<MatrixType::RowsAtCompileTime>::ret, 1> EssentialVectorType;
28 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;
29 typedef Matrix<Scalar, Dynamic, MatrixType::ColsAtCompileTime> HBlockMatrixType;
30 typedef Matrix<Scalar, Dynamic, 1> HCoeffsVectorType;
32 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, MatrixType::RowsAtCompileTime> TMatrixType;
34 Matrix<Scalar, EIGEN_SIZE_MAX(MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime), 1> _tmp((std::max)(rows,cols));
97 VERIFY_IS_APPROX(m3 * m5, m1); // test evaluating hseq to a dense matrix, then applying
123 VERIFY_IS_APPROX(m3 * m5, m1); // test evaluating rhseq to a dense matrix, then applying
129 CALL_SUBTEST_1( householder(Matrix<double,2,2>()) )
[all...] |
| qr_colpivoting.cpp | 22 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> MatrixQType;
51 Matrix<Scalar,Rows,Cols> m1;
53 ColPivHouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
60 Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>();
61 Matrix<Scalar,Rows,Cols> c = qr.householderQ() * r * qr.colsPermutation().inverse();
64 Matrix<Scalar,Cols,Cols2> m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2);
65 Matrix<Scalar,Rows,Cols2> m3 = m1*m2;
66 m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2);
85 // let's build a matrix more stable to invers
[all...] |
| sparse.h | 49 /* Initializes both a sparse and dense matrix with same random values,
52 * allowing to control the shape of the matrix.
58 Matrix<Scalar,Dynamic,Dynamic,Opt1>& refMat,
61 std::vector<Matrix<Index,2,1> >* zeroCoords = 0,
62 std::vector<Matrix<Index,2,1> >* nonzeroCoords = 0)
96 nonzeroCoords->push_back(Matrix<Index,2,1> (ai,aj));
100 zeroCoords->push_back(Matrix<Index,2,1> (ai,aj));
110 Matrix<Scalar,Dynamic,Dynamic, Opt1>& refMat,
113 std::vector<Matrix<Index,2,1> >* zeroCoords = 0,
114 std::vector<Matrix<Index,2,1> >* nonzeroCoords = 0
[all...] |
| /external/mesa3d/src/gallium/state_trackers/vega/ |
| api_transform.c | 31 #include "matrix.h"
37 struct matrix *mat = vg_state_matrix(&ctx->state.vg);
44 struct matrix *mat;
66 struct matrix *mat;
83 struct matrix *dst, src;
106 struct matrix *dst = vg_state_matrix(&ctx->state.vg);
113 struct matrix *dst = vg_state_matrix(&ctx->state.vg);
120 struct matrix *dst = vg_state_matrix(&ctx->state.vg);
127 struct matrix *dst = vg_state_matrix(&ctx->state.vg);
|
| /external/skia/samplecode/ |
| SampleTextOnPath.cpp | 54 SkMatrix matrix; local
77 matrix.setScale(-SK_Scalar1, SK_Scalar1);
78 matrix.postTranslate(pathLen, 0);
79 canvas->drawTextOnPath(text, len, path, &matrix, paint);
82 matrix.setScale(SK_Scalar1, -SK_Scalar1);
83 canvas->drawTextOnPath(text, len, path, &matrix, paint);
86 matrix.setScale(-SK_Scalar1, -SK_Scalar1);
87 matrix.postTranslate(pathLen, 0);
88 canvas->drawTextOnPath(text, len, path, &matrix, paint);
|
| /external/skia/src/pdf/ |
| SkPDFDeviceFlattener.cpp | 63 SkMatrix matrix = SkMatrix::I(); local
64 draw.fMatrix = &matrix;
109 SkMatrix matrix = SkMatrix::I(); local
110 draw.fMatrix = &matrix;
136 const SkPath& path, const SkMatrix* matrix,
138 if (mustPathText(d, paint) || (matrix && matrix->hasPerspective())) {
139 d.drawTextOnPath((const char*)text, len, path, matrix, paint);
142 INHERITED::drawTextOnPath(d, text, len, path, matrix, paint);
|
| /external/skia/src/sfnt/ |
| SkOTTable_glyf.h | 157 union Matrix {
181 SkOTTableGlyphData::Composite::Component::Transform::Matrix matrix; member in struct:SkOTTableGlyphData::Composite::Component::Transform::WordValue
187 SkOTTableGlyphData::Composite::Component::Transform::Matrix matrix; member in struct:SkOTTableGlyphData::Composite::Component::Transform::ByteValue
193 SkOTTableGlyphData::Composite::Component::Transform::Matrix matrix; member in struct:SkOTTableGlyphData::Composite::Component::Transform::WordIndex
199 SkOTTableGlyphData::Composite::Component::Transform::Matrix matrix; member in struct:SkOTTableGlyphData::Composite::Component::Transform::ByteIndex
|
| /frameworks/opt/chips/src/com/android/ex/chips/ |
| CircularImageView.java | 8 import android.graphics.Matrix;
25 private final Matrix matrix; field in class:CircularImageView
42 matrix = new Matrix();
100 matrix.reset();
103 matrix.setRectToRect(source, dest, Matrix.ScaleToFit.FILL);
105 shader.setLocalMatrix(matrix);
|
| /external/chromium_org/third_party/qcms/src/ |
| matrix.c | 26 #include "matrix.h"
28 struct vector matrix_eval(struct matrix mat, struct vector v)
39 float matrix_det(struct matrix mat)
55 struct matrix matrix_invert(struct matrix mat)
57 struct matrix dest_mat;
92 struct matrix matrix_identity(void)
94 struct matrix i;
108 struct matrix matrix_invalid(void)
110 struct matrix inv = matrix_identity()
[all...] |
| /external/chromium_org/third_party/skia/src/utils/ |
| SkLayer.cpp | 77 void SkLayer::setMatrix(const SkMatrix& matrix) {
78 fMatrix = matrix;
81 void SkLayer::setChildrenMatrix(const SkMatrix& matrix) {
82 fChildrenMatrix = matrix;
141 void SkLayer::getLocalTransform(SkMatrix* matrix) const {
142 matrix->setTranslate(m_position.fX, m_position.fY);
146 matrix->preTranslate(tx, ty);
147 matrix->preConcat(this->getMatrix());
148 matrix->preTranslate(-tx, -ty);
151 void SkLayer::localToGlobal(SkMatrix* matrix) const
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| MatrixBaseEigenvalues.h | 45 /** \brief Computes the eigenvalues of a matrix
54 * so there are as many eigenvalues as rows in the matrix.
73 /** \brief Computes the eigenvalues of a matrix
80 * the matrix.
99 * \returns Operator norm of the matrix.
102 * This function computes the L2 operator norm of a matrix, which is also
103 * known as the spectral norm. The norm of a matrix \f$ A \f$ is defined to be
108 * matrix \f$ A^*A \f$.
112 * matrix. The SelfAdjointView class provides a better algorithm for
137 * \returns Operator norm of the matrix
[all...] |
| /external/eigen/Eigen/src/OrderingMethods/ |
| Ordering.h | 22 * \returns the symmetric pattern A^T+A from the input matrix A.
46 * If the matrix is not structurally symmetric, an ordering of A^T+A is computed
47 * \tparam Index The type of indices of the matrix
56 /** Compute the permutation vector from a sparse matrix
57 * This routine is much faster if the input matrix is column-major
71 /** Compute the permutation with a selfadjoint matrix */
90 * \note Returns an empty permutation matrix
91 * \tparam Index The type of indices of the matrix
99 /** Compute the permutation vector from a column-major sparse matrix */
112 * The matrix should be in column-major and \b compressed format (see SparseMatrix::makeCompressed())
[all...] |
| /external/eigen/doc/ |
| StorageOrders.dox | 13 The entries of a matrix form a two-dimensional grid. However, when the matrix is stored in memory, the entries
16 We say that a matrix is stored in \b row-major order if it is stored row by row. The entire first row is
17 stored first, followed by the entire second row, and so on. Consider for example the matrix
27 If this matrix is stored in row-major order, then the entries are laid out in memory as follows:
31 On the other hand, a matrix is stored in \b column-major order if it is stored column by column, starting with
32 the entire first column, followed by the entire second column, and so on. If the above matrix is stored in
38 returns a pointer to the memory location of the first entry of the matrix.
52 The storage order of a matrix or a two-dimensional array can be set by specifying the \c Options template
53 parameter for Matrix or Array. As \ref TutorialMatrixClass explains, the %Matrix class template has si
[all...] |
| /external/skia/src/utils/ |
| SkLayer.cpp | 77 void SkLayer::setMatrix(const SkMatrix& matrix) {
78 fMatrix = matrix;
81 void SkLayer::setChildrenMatrix(const SkMatrix& matrix) {
82 fChildrenMatrix = matrix;
141 void SkLayer::getLocalTransform(SkMatrix* matrix) const {
142 matrix->setTranslate(m_position.fX, m_position.fY);
146 matrix->preTranslate(tx, ty);
147 matrix->preConcat(this->getMatrix());
148 matrix->preTranslate(-tx, -ty);
151 void SkLayer::localToGlobal(SkMatrix* matrix) const
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| EdgeView.java | 20 import android.opengl.Matrix;
35 // Each edge effect has a transform matrix, and each matrix has 16 elements.
37 // starting index of each matrix.
71 Matrix.setIdentityM(mMatrix, TOP_M);
72 Matrix.setIdentityM(mMatrix, LEFT_M);
73 Matrix.setIdentityM(mMatrix, BOTTOM_M);
74 Matrix.setIdentityM(mMatrix, RIGHT_M);
76 Matrix.rotateM(mMatrix, LEFT_M, 90, 0, 0, 1);
77 Matrix.scaleM(mMatrix, LEFT_M, 1, -1, 1)
[all...] |
| /external/chromium_org/third_party/opus/src/silk/fixed/ |
| solve_LS_FIX.c | 45 /* Factorize square matrix A into LDL form */
47 opus_int32 *A, /* I/O Pointer to Symetric Square Matrix */
48 opus_int M, /* I Size of Matrix */
49 opus_int32 *L_Q16, /* I/O Pointer to Square Upper triangular Matrix */
55 const opus_int32 *L_Q16, /* I Pointer to Lower Triangular Matrix */
56 opus_int M, /* I Dim of Matrix equation */
63 const opus_int32 *L_Q16, /* I Pointer to Lower Triangular Matrix */
64 const opus_int M, /* I Dim of Matrix equation */
77 opus_int32 *A, /* I Pointer to symetric square matrix A */
78 opus_int M, /* I Size of matrix */
[all...] |
| /external/libopus/silk/fixed/ |
| solve_LS_FIX.c | 45 /* Factorize square matrix A into LDL form */
47 opus_int32 *A, /* I/O Pointer to Symetric Square Matrix */
48 opus_int M, /* I Size of Matrix */
49 opus_int32 *L_Q16, /* I/O Pointer to Square Upper triangular Matrix */
55 const opus_int32 *L_Q16, /* I Pointer to Lower Triangular Matrix */
56 opus_int M, /* I Dim of Matrix equation */
63 const opus_int32 *L_Q16, /* I Pointer to Lower Triangular Matrix */
64 const opus_int M, /* I Dim of Matrix equation */
77 opus_int32 *A, /* I Pointer to symetric square matrix A */
78 opus_int M, /* I Size of matrix */
[all...] |
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 20 * \brief Householder rank-revealing QR decomposition of a matrix with column-pivoting
22 * \param MatrixType the type of the matrix of which we are computing the QR decomposition
24 * This class performs a rank-revealing QR decomposition of a matrix \b A into matrices \b P, \b Q and \b R
29 * by using Householder transformations. Here, \b P is a permutation matrix, \b Q a unitary matrix and \b R an
30 * upper triangular matrix.
52 typedef Matrix<Scalar, RowsAtCompileTime, RowsAtCompileTime, Options, MaxRowsAtCompileTime, MaxRowsAtCompileTime> MatrixQType;
98 /** \brief Constructs a QR factorization from a given matrix
100 * This constructor computes the QR factorization of the matrix \a matrix by callin
[all...] |
| FullPivHouseholderQR.h | 32 * \brief Householder rank-revealing QR decomposition of a matrix with full pivoting
34 * \param MatrixType the type of the matrix of which we are computing the QR decomposition
36 * This class performs a rank-revealing QR decomposition of a matrix \b A into matrices \b P, \b Q and \b R
41 * by using Householder transformations. Here, \b P is a permutation matrix, \b Q a unitary matrix and \b R an
42 * upper triangular matrix.
66 typedef Matrix<Index, 1,
104 /** \brief Constructs a QR factorization from a given matrix
106 * This constructor computes the QR factorization of the matrix \a matrix by callin
[all...] |
| /external/eigen/Eigen/src/Core/util/ |
| Constants.h | 19 * Changing the value of Dynamic breaks the ABI, as Dynamic is often used as a template parameter for Matrix.
36 * These are the possible bits which can be OR'ed to constitute the flags of a matrix or
48 * for a matrix, this means that the storage order is row-major.
51 * the matrix created by evaluation of that expression.
127 * \li Map-to-const expressions, for example Map<const Matrix>, have DirectAccessBit but not LvalueBit
166 /** View matrix as a lower triangular matrix. */
168 /** View matrix as an upper triangular matrix. */
170 /** %Matrix has ones on the diagonal; to be used in combination with #Lower or #Upper. *
[all...] |
