| /external/pdfium/core/src/fpdfdoc/ |
| doc_annot.cpp | 81 CFX_Matrix matrix = *pMatrix; local
83 annot_rect_f.Transform(&matrix);
91 pAnnot->DrawInContext(pPage, pContext, &matrix, CPDF_Annot::Normal);
92 } else if (!pAnnot->DrawAppearance(pPage, pDevice, &matrix,
94 pAnnot->DrawBorder(pDevice, &matrix, pOptions);
204 CFX_Matrix& matrix) {
210 CFX_Matrix form_matrix = pForm->m_pFormDict->GetMatrix("Matrix");
214 matrix.MatchRect(arect, form_bbox);
215 matrix.Concat(*pUser2Device);
223 CFX_Matrix matrix; local
237 CFX_Matrix matrix; local
[all...] |
| /external/skia/gm/ |
| image_pict.cpp | 62 SkMatrix matrix; variable
63 matrix.setTranslate(-100, -100);
64 fImage0.reset(SkImage::NewFromPicture(fPicture, size, &matrix, nullptr));
65 matrix.postTranslate(-50, -50);
66 matrix.postRotate(45);
67 matrix.postTranslate(50, 50);
68 fImage1.reset(SkImage::NewFromPicture(fPicture, size, &matrix, nullptr));
72 SkMatrix matrix = SkMatrix::MakeTrans(-100, -100); local
73 canvas->drawPicture(fPicture, &matrix, nullptr);
104 SkMatrix matrix; local
335 SkMatrix matrix = SkMatrix::MakeTrans(-100, -100); local
[all...] |
| /external/skia/src/core/ |
| SkRecorder.cpp | 160 void SkRecorder::onDrawDrawable(SkDrawable* drawable, const SkMatrix* matrix) {
166 APPEND(DrawDrawable, this->copy(matrix), drawable->getBounds(), fDrawableList->count() - 1);
169 drawable->draw(this, matrix);
271 const SkMatrix* matrix, const SkPaint& paint) {
277 matrix ? *matrix : SkMatrix::I());
286 void SkRecorder::onDrawPicture(const SkPicture* pic, const SkMatrix* matrix, const SkPaint* paint) {
289 APPEND(DrawPicture, this->copy(paint), pic, matrix ? *matrix : SkMatrix::I());
292 SkAutoCanvasMatrixPaint acmp(this, matrix, paint, pic->cullRect())
[all...] |
| SkFindAndPlaceGlyph.h | 49 SkPoint offset, const SkMatrix& matrix, SkPaint::Align textAlignment,
60 // * Matrix type (3) - special cases for translation and X-coordinate scaling.
70 SkPoint offset, const SkMatrix& matrix, const SkScalar pos[], int scalarsPerPosition,
284 // MapperInterface given a point map it through the matrix. There are several shortcut
286 // * TranslationMapper - assumes a translation only matrix.
298 TranslationMapper(const SkMatrix& matrix, const SkPoint origin)
299 : fTranslate(matrix.mapXY(origin.fX, origin.fY)) { }
311 XScaleMapper(const SkMatrix& matrix, const SkPoint origin)
312 : fTranslate(matrix.mapXY(origin.fX, origin.fY)), fXScale(matrix.getScaleX()) {
[all...] |
| SkMultiPictureDraw.cpp | 29 const SkMatrix* matrix, const SkPaint* paint) {
32 if (matrix) {
33 fMatrix = *matrix;
69 const SkMatrix* matrix,
77 array.append()->init(canvas, picture, matrix, paint);
|
| /external/eigen/Eigen/src/Eigen2Support/Geometry/ |
| Translation.h | 38 typedef Matrix<Scalar,Dim,1> VectorType;
39 /** corresponding linear transformation matrix type */
40 typedef Matrix<Scalar,Dim,Dim> LinearMatrixType;
94 res.matrix().setZero();
97 res.matrix().row(Dim).setZero();
155 res.matrix().setZero();
167 res.matrix().setZero();
170 res.matrix().row(Dim).setZero();
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 28 * such that the factorized matrix is P A P^-1.
30 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
46 typedef Matrix<Scalar,Dynamic,1> VectorType;
55 SimplicialCholeskyBase(const MatrixType& matrix)
58 derived().compute(matrix);
74 * \c NumericalIssue if the matrix.appears to be negative.
92 && "SimplicialCholeskyBase::solve(): invalid number of rows of the right hand side matrix b");
106 && "SimplicialCholesky::solve(): invalid number of rows of the right hand side matrix b");
183 /** Computes the sparse Cholesky decomposition of \a matrix */
185 void compute(const MatrixType& matrix)
[all...] |
| /external/freetype/src/base/ |
| ftcalc.c | 682 FT_Matrix_Invert( FT_Matrix* matrix )
687 if ( !matrix )
691 delta = FT_MulFix( matrix->xx, matrix->yy ) -
692 FT_MulFix( matrix->xy, matrix->yx );
695 return FT_THROW( Invalid_Argument ); /* matrix can't be inverted */
697 matrix->xy = - FT_DivFix( matrix->xy, delta );
698 matrix->yx = - FT_DivFix( matrix->yx, delta )
[all...] |
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/base/ |
| ftcalc.c | 682 FT_Matrix_Invert( FT_Matrix* matrix )
687 if ( !matrix )
691 delta = FT_MulFix( matrix->xx, matrix->yy ) -
692 FT_MulFix( matrix->xy, matrix->yx );
695 return FT_THROW( Invalid_Argument ); /* matrix can't be inverted */
697 matrix->xy = - FT_DivFix( matrix->xy, delta );
698 matrix->yx = - FT_DivFix( matrix->yx, delta )
[all...] |
| /external/pdfium/third_party/freetype/src/base/ |
| ftcalc.c | 682 FT_Matrix_Invert( FT_Matrix* matrix )
687 if ( !matrix )
691 delta = FT_MulFix( matrix->xx, matrix->yy ) -
692 FT_MulFix( matrix->xy, matrix->yx );
695 return FT_THROW( Invalid_Argument ); /* matrix can't be inverted */
697 matrix->xy = - FT_DivFix( matrix->xy, delta );
698 matrix->yx = - FT_DivFix( matrix->yx, delta )
[all...] |
| /external/skia/src/gpu/ |
| GrPathRenderer.h | 175 * fViewMatrix Matrix applied to the path.
212 static bool IsStrokeHairlineOrEquivalent(const GrStrokeInfo& stroke, const SkMatrix& matrix,
224 SkDrawTreatAAStrokeAsHairline(stroke.getWidth(), matrix, outCoverage);
233 const SkMatrix& matrix,
239 const SkMatrix& matrix,
241 GetPathDevBounds(path, device->width(), device->height(), matrix, bounds);
|
| /frameworks/base/core/java/android/app/ |
| SharedElementCallback.java | 21 import android.graphics.Matrix;
45 private Matrix mTempMatrix;
160 * @param viewToGlobalMatrix A matrix containing a transform from the view to the screen
169 public Parcelable onCaptureSharedElementSnapshot(View sharedElement, Matrix viewToGlobalMatrix,
182 if (imageView.getScaleType() == ScaleType.MATRIX) {
183 Matrix matrix = imageView.getImageMatrix(); local
185 matrix.getValues(values);
193 mTempMatrix = new Matrix(viewToGlobalMatrix);
202 * {@link #onCaptureSharedElementSnapshot(android.view.View, android.graphics.Matrix,
232 Matrix matrix = new Matrix(); local
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Transpositions.h | 25 * Each transposition \f$ T_{i} \f$ applied on the left of a matrix (\f$ T_{i} M\f$) interchanges
26 * the rows \c i and \c indices[i] of the matrix \c M.
32 * To apply a sequence of transpositions to a matrix, simply use the operator * as in the following example:
38 * In this example, we detect that the matrix appears on both side, and so the transpositions
115 // might be usefull when the target matrix expression is complex, e.g.:
116 // object.matrix().block(..,..,..,..) = trans * object.matrix().block(..,..,..,..);
151 typedef Matrix<Index, SizeAtCompileTime, 1, 0, MaxSizeAtCompileTime, 1> IndicesType;
201 /** Constructs an uninitialized permutation matrix of given size.
222 typedef Map<const Matrix<Index,SizeAtCompileTime,1,0,MaxSizeAtCompileTime,1>, _PacketAccess> IndicesType
[all...] |
| /external/gmock/src/ |
| gmock-matchers.cc | 328 GTEST_API_ bool FindPairing(const MatchMatrix& matrix,
330 ElementMatcherPairs matches = FindMaxBipartiteMatching(matrix);
333 bool result = (max_flow == matrix.RhsSize());
339 << max_flow << " of " << matrix.RhsSize()
446 const MatchMatrix& matrix,
449 ::std::vector<char> element_matched(matrix.LhsSize(), 0);
450 ::std::vector<char> matcher_matched(matrix.RhsSize(), 0);
452 for (size_t ilhs = 0; ilhs < matrix.LhsSize(); ilhs++) {
453 for (size_t irhs = 0; irhs < matrix.RhsSize(); irhs++) {
454 char matched = matrix.HasEdge(ilhs, irhs)
[all...] |
| /external/opencv3/3rdparty/libtiff/ |
| tif_color.c | 83 float *matrix = &cielab->display.d_mat[0][0]; local
85 /* Multiply through the matrix to get luminosity values. */
86 Yr = matrix[0] * X + matrix[1] * Y + matrix[2] * Z;
87 Yg = matrix[3] * X + matrix[4] * Y + matrix[5] * Z;
88 Yb = matrix[6] * X + matrix[7] * Y + matrix[8] * Z
[all...] |
| /external/pdfium/core/src/fxge/apple/ |
| fx_quartz_device.cpp | 59 void CQuartz2D::setGraphicsTextMatrix(void* graphics, CFX_Matrix* matrix) {
60 if (!graphics || !matrix) {
64 CGFloat ty = CGBitmapContextGetHeight(context) - matrix->f;
66 context, CGAffineTransformMake(matrix->a, matrix->b, matrix->c, matrix->d,
67 matrix->e, ty));
76 CFX_Matrix* matrix) {
83 if (matrix) {
[all...] |
| /external/pdfium/third_party/libtiff/ |
| tif_color.c | 83 float *matrix = &cielab->display.d_mat[0][0]; local
85 /* Multiply through the matrix to get luminosity values. */
86 Yr = matrix[0] * X + matrix[1] * Y + matrix[2] * Z;
87 Yg = matrix[3] * X + matrix[4] * Y + matrix[5] * Z;
88 Yb = matrix[6] * X + matrix[7] * Y + matrix[8] * Z
[all...] |
| /external/skia/src/utils/ |
| SkNWayCanvas.cpp | 88 void SkNWayCanvas::didConcat(const SkMatrix& matrix) {
91 iter->concat(matrix);
93 this->INHERITED::didConcat(matrix);
96 void SkNWayCanvas::didSetMatrix(const SkMatrix& matrix) {
99 iter->setMatrix(matrix);
101 this->INHERITED::didSetMatrix(matrix);
251 const SkMatrix* matrix, const SkPaint& paint) {
254 iter->drawTextOnPath(text, byteLength, path, matrix, paint);
266 void SkNWayCanvas::onDrawPicture(const SkPicture* picture, const SkMatrix* matrix,
270 iter->drawPicture(picture, matrix, paint)
[all...] |
| /external/eigen/blas/fortran/ |
| 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...] |
| /external/libgdx/gdx/jni/ |
| com.badlogic.gdx.utils.BufferUtils.cpp | 271 float* matrix = (float*)env->GetPrimitiveArrayCritical(obj_matrix, 0); local
276 transform<4, 4>((float*)data, strideInBytes / 4, count, (float*)matrix, offsetInBytes / 4);
278 env->ReleasePrimitiveArrayCritical(obj_matrix, matrix, 0);
284 float* matrix = (float*)env->GetPrimitiveArrayCritical(obj_matrix, 0); local
289 transform<4, 4>((float*)data, strideInBytes / 4, count, (float*)matrix, offsetInBytes / 4);
292 env->ReleasePrimitiveArrayCritical(obj_matrix, matrix, 0);
298 float* matrix = (float*)env->GetPrimitiveArrayCritical(obj_matrix, 0); local
303 transform<3, 4>((float*)data, strideInBytes / 4, count, (float*)matrix, offsetInBytes / 4);
305 env->ReleasePrimitiveArrayCritical(obj_matrix, matrix, 0);
311 float* matrix = (float*)env->GetPrimitiveArrayCritical(obj_matrix, 0) local
325 float* matrix = (float*)env->GetPrimitiveArrayCritical(obj_matrix, 0); local
338 float* matrix = (float*)env->GetPrimitiveArrayCritical(obj_matrix, 0); local
352 float* matrix = (float*)env->GetPrimitiveArrayCritical(obj_matrix, 0); local
365 float* matrix = (float*)env->GetPrimitiveArrayCritical(obj_matrix, 0); local
379 float* matrix = (float*)env->GetPrimitiveArrayCritical(obj_matrix, 0); local
392 float* matrix = (float*)env->GetPrimitiveArrayCritical(obj_matrix, 0); local
[all...] |
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 19 * \brief LU decomposition of a matrix with complete pivoting, and related features
21 * \param MatrixType the type of the matrix of which we are computing the LU decomposition
23 * This class represents a LU decomposition of any matrix, with complete pivoting: the matrix A is
33 * decomposition is inherently more stable and/or flexible. For example, when computing the kernel of a matrix,
34 * working with the SVD allows to select the smallest singular values of the matrix, something that
40 * As an exemple, here is how the original matrix can be retrieved:
84 * \param matrix the matrix of which to compute the LU decomposition.
87 FullPivLU(const MatrixType& matrix);
[all...] |
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 108 typedef Matrix<Scalar,Dynamic,1> VectorType;
109 typedef Matrix<Index, 1, MatrixType::ColsAtCompileTime> IntRowVectorType;
110 typedef Matrix<Index, MatrixType::RowsAtCompileTime, 1> IntColVectorType;
135 * \c NumericalIssue if the matrix appears to be negative.
151 /** Performs a symbolic decomposition on the sparcity of \a matrix.
157 Derived& analyzePattern(const MatrixType& matrix);
159 /** Performs a numeric decomposition of \a matrix
161 * The given matrix must has the same sparcity than the matrix on which the symbolic decomposition has been performed.
165 Derived& factorize(const MatrixType& matrix);
[all...] |
