/external/chromium_org/third_party/skia/src/effects/gradients/ |
H A D | SkTwoPointRadialGradient.cpp | 73 fDstToIndex matrix in the constructor). 184 SkMatrix* matrix, 190 if (matrix) { 194 if (matrix) { 197 matrix->setSinCos(-SkScalarMul(invDiffL, fDiff.fY), 200 matrix->reset(); 202 matrix->preConcat(fPtsToUnit); 439 const SkMatrix& matrix, 441 AutoEffectUnref effect(SkNEW_ARGS(GrRadial2Gradient, (ctx, shader, matrix, tm))); 471 const SkMatrix& matrix, 182 asABitmap( SkBitmap* bitmap, SkMatrix* matrix, SkShader::TileMode* xy) const argument [all...] |
/external/chromium_org/third_party/skia/src/gpu/effects/ |
H A D | GrBicubicEffect.cpp | 130 const SkMatrix &matrix, 132 : INHERITED(texture, matrix, GrTextureParams(tileModes, GrTextureParams::kNone_FilterMode)) 139 const SkMatrix &matrix, 141 : INHERITED(texture, matrix, GrTextureParams(SkShader::kClamp_TileMode, 183 bool GrBicubicEffect::ShouldUseBicubic(const SkMatrix& matrix, argument 185 if (matrix.isIdentity()) { 191 if (!matrix.getMinMaxScales(scales) || scales[0] < SK_Scalar1) { 197 // At this point if scales[1] == SK_Scalar1 then the matrix doesn't do any scaling. 199 if (matrix.rectStaysRect() && SkScalarIsInt(matrix 128 GrBicubicEffect(GrTexture* texture, const SkScalar coefficients[16], const SkMatrix &matrix, const SkShader::TileMode tileModes[2]) argument 137 GrBicubicEffect(GrTexture* texture, const SkScalar coefficients[16], const SkMatrix &matrix, const SkRect& domain) argument [all...] |
H A D | GrConfigConversionEffect.cpp | 91 const SkMatrix& matrix) 92 : GrSingleTextureEffect(texture, matrix) 258 const SkMatrix& matrix) { 263 return GrSimpleTextureEffect::Create(texture, matrix); 274 matrix))); 88 GrConfigConversionEffect(GrTexture* texture, bool swapRedAndBlue, PMConversion pmConversion, const SkMatrix& matrix) argument 255 Create(GrTexture* texture, bool swapRedAndBlue, PMConversion pmConversion, const SkMatrix& matrix) argument
|
H A D | GrTextureDomain.cpp | 200 const SkMatrix& matrix, 208 return GrSimpleTextureEffect::Create(texture, matrix, filterMode); 212 matrix, 223 const SkMatrix& matrix, 228 : GrSingleTextureEffect(texture, matrix, filterMode, coordSet) 271 const SkMatrix& matrix = GrEffectUnitTest::TestMatrix(random); local 275 matrix, 199 Create(GrTexture* texture, const SkMatrix& matrix, const SkRect& domain, GrTextureDomain::Mode mode, GrTextureParams::FilterMode filterMode, GrCoordSet coordSet) argument 222 GrTextureDomainEffect(GrTexture* texture, const SkMatrix& matrix, const SkRect& domain, GrTextureDomain::Mode mode, GrTextureParams::FilterMode filterMode, GrCoordSet coordSet) argument
|
/external/chromium_org/third_party/skia/src/pdf/ |
H A D | 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); 135 drawTextOnPath(const SkDraw& d, const void* text, size_t len, const SkPath& path, const SkMatrix* matrix, const SkPaint& paint) argument
|
H A D | SkPDFUtils.cpp | 32 SkPDFArray* SkPDFUtils::MatrixToArray(const SkMatrix& matrix) { argument 34 if (!matrix.asAffine(values)) { 47 void SkPDFUtils::AppendTransform(const SkMatrix& matrix, SkWStream* content) { argument 49 if (!matrix.asAffine(values)) {
|
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkCanvasStateUtils.cpp | 44 float matrix[9]; member in struct:SkMCState 155 static void setup_MC_state(SkMCState* state, const SkMatrix& matrix, const SkRegion& clip) { argument 159 // capture the matrix 161 state->matrix[i] = matrix.get(i); 206 // decompose the total matrix and clip 248 setup_MC_state(&layerState->mcState, layer.matrix(), layer.clip()); 269 // reconstruct the matrix 270 SkMatrix matrix; local 272 matrix [all...] |
H A D | SkCullPoints.cpp | 180 SkMatrix matrix; local 181 matrix.setRectToRect(bounds, limit, SkMatrix::kFill_ScaleToFit); 183 path.transform(matrix, &devPath); 184 matrix.mapRect(&devTarget, target);
|
/external/chromium_org/third_party/skia/src/utils/debugger/ |
H A D | SkDebugCanvas.h | 64 Returns the most recently calculated transformation matrix 153 void setUserMatrix(SkMatrix matrix) { argument 154 fUserMatrix = matrix; 249 const SkMatrix* matrix, const SkPaint&) SK_OVERRIDE;
|
H A D | SkObjectParser.cpp | 95 SkString* SkObjectParser::MatrixToString(const SkMatrix& matrix) { argument 98 matrix.toString(str);
|
/external/chromium_org/third_party/skia/src/views/ |
H A D | SkWindow.cpp | 39 void SkWindow::setMatrix(const SkMatrix& matrix) { argument 40 if (fMatrix != matrix) { 41 fMatrix = matrix; 46 void SkWindow::preConcat(const SkMatrix& matrix) { argument 48 m.setConcat(fMatrix, matrix); 52 void SkWindow::postConcat(const SkMatrix& matrix) { argument 54 m.setConcat(matrix, fMatrix);
|
/external/chromium_org/third_party/skia/tests/ |
H A D | DrawBitmapRectTest.cpp | 180 SkMatrix matrix; local 183 matrix.setAll(-119.34097f, 190 c.concat(matrix); 196 matrix.setAll(0.0078740157f, 204 SkShader::kRepeat_TileMode, &matrix); 216 * Original bug was asserting that the matrix-proc had generated a (Y) value
|
H A D | SerializationTest.cpp | 43 static void Write(SkWriteBuffer& writer, const SkMatrix* matrix) { argument 44 writer.writeMatrix(*matrix); 46 static void Read(SkValidatingReadBuffer& reader, SkMatrix* matrix) { argument 47 reader.readMatrix(matrix); 321 // Test matrix serialization 323 SkMatrix matrix = SkMatrix::I(); local 324 TestObjectSerialization(&matrix, reporter);
|
/external/chromium_org/ui/gfx/ |
H A D | nine_image_painter.cc | 109 SkMatrix matrix = canvas->sk_canvas()->getTotalMatrix(); local 111 matrix.mapRect(&scaled_rect, RectToSkRect(bounds));
|
/external/eigen/Eigen/src/Core/ |
H A D | IO.h | 42 * - \b matPrefix string printed at the beginning of the matrix 43 * - \b matSuffix string printed at the end of the matrix 77 * \brief Pseudo expression providing matrix output with given format 94 WithFormat(const ExpressionType& matrix, const IOFormat& format) argument 95 : m_matrix(matrix), m_format(format) 108 /** \returns a WithFormat proxy object allowing to print a matrix the with given 151 * print the matrix \a _m to the output stream \a s using the output format \a fmt */ 231 * Outputs the matrix, to the given stream. 233 * If you wish to print the matrix with a format different than the default, use DenseBase::format().
|
H A D | MatrixBase.h | 21 * This class is the base that is inherited by all matrix, vector, and related expression 26 * for all functions related to matrix inversions. 28 * \tparam Derived is the derived type, e.g. a matrix type, or an expression, etc. 31 * to take as argument any matrix, vector, or expression, just let it take a 33 * a matrix, vector, or expression \a x, prints the first row of \a x. 94 /** type of the equivalent square matrix */ 103 /** \brief The plain matrix type corresponding to this expression. 106 * the return type of eval() is a const reference to a matrix, not a matrix! It is however guaranteed 118 /** \internal Represents a matrix wit 317 MatrixBase<Derived>& matrix() { return *this; } function in class:Eigen::MatrixBase 318 const MatrixBase<Derived>& matrix() const { return *this; } function in class:Eigen::MatrixBase [all...] |
H A D | Reverse.h | 20 * \brief Expression of the reverse of a vector or matrix 98 inline Reverse(const MatrixType& matrix) : m_matrix(matrix) { } argument 207 * of a matrix. However, when reversing the matrix data itself is really needed,
|
H A D | SelfAdjointView.h | 19 * \brief Expression of a selfadjoint matrix from a triangular part of a dense matrix 21 * \param MatrixType the type of the dense matrix storing the coefficients 24 * This class is an expression of a sefladjoint matrix from a triangular part of a matrix 62 /** \brief The type of coefficients in this matrix */ 72 inline SelfAdjointView(MatrixType& matrix) : m_matrix(matrix) argument 104 /** Efficient self-adjoint matrix times vector/matrix produc [all...] |
H A D | 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(..,..,..,..); 201 /** Constructs an uninitialized permutation matrix of given size. 327 /** \returns the \a matrix with the \a transpositions applied to the columns. 331 operator*(const MatrixBase<Derived>& matrix, argument 344 operator *(const TranspositionsBase<TranspositionDerived> &transpositions, const MatrixBase<Derived>& matrix) argument 367 transposition_matrix_product_retval(const TranspositionType& tr, const MatrixType& matrix) argument 416 operator *(const MatrixBase<Derived>& matrix, const Transpose& trt) argument [all...] |
/external/eigen/Eigen/src/Eigen2Support/ |
H A D | 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 53 SVD(const MatrixType& matrix) argument 54 : m_matU(matrix.rows(), (std::min)(matrix.rows(), matrix.cols())), 55 m_matV(matrix.cols(),matrix.cols()), 56 m_sigma((std::min)(matrix 94 compute(const MatrixType& matrix) argument [all...] |
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | ComplexSchur.h | 28 * \brief Performs a complex Schur decomposition of a real or complex square matrix 30 * \tparam _MatrixType the type of the matrix of which we are 34 * Given a real or complex square matrix A, this class computes the 36 * complex matrix, and T is a complex upper triangular matrix. The 37 * diagonal of the matrix T corresponds to the eigenvalues of the 38 * matrix A. 41 * a given matrix. Alternatively, you can use the 78 * This is a square matrix with entries of type #ComplexScalar. 85 * \param [in] size Positive integer, size of the matrix whos 112 ComplexSchur(const MatrixType& matrix, bool computeU = true) argument 316 compute(const MatrixType& matrix, bool computeU) argument 353 run(ComplexSchur<MatrixType>& _this, const MatrixType& matrix, bool computeU) argument 364 run(ComplexSchur<MatrixType>& _this, const MatrixType& matrix, bool computeU) argument [all...] |
H A D | EigenSolver.h | 25 * \tparam _MatrixType the type of the matrix of which we are computing the 29 * The eigenvalues and eigenvectors of a matrix \f$ A \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 * V D \f$. The matrix \f$ V \f$ is almost always invertible, in which case we 36 * The eigenvalues and eigenvectors of a matrix may be complex, even when the 37 * matrix is real. However, we can choose real matrices \f$ V \f$ and \f$ D 39 * matrix \f$ D \f$ is not required to be diagonal, but if it is allowed to 47 * a given matrix. Alternatively, you can use the 99 /** \brief Type for matrix o 146 EigenSolver(const MatrixType& matrix, bool computeEigenvectors = true) argument 365 compute(const MatrixType& matrix, bool computeEigenvectors) argument [all...] |
H A D | HessenbergDecomposition.h | 32 * \brief Reduces a square matrix to Hessenberg form by an orthogonal similarity transformation 34 * \tparam _MatrixType the type of the matrix of which we are computing the Hessenberg decomposition 36 * This class performs an Hessenberg decomposition of a matrix \f$ A \f$. In 38 * matrix \f$ Q \f$ and a Hessenberg matrix \f$ H \f$ such that \f$ A = Q H 39 * Q^T \f$. An orthogonal matrix is a matrix whose inverse equals its 40 * transpose (\f$ Q^{-1} = Q^T \f$). A Hessenberg matrix has zeros below the 42 * of a complex matrix is \f$ A = Q H Q^* \f$ with \f$ Q \f$ unitary (that is, 46 * given matrix 118 HessenbergDecomposition(const MatrixType& matrix) argument 150 compute(const MatrixType& matrix) argument [all...] |
H A D | Tridiagonalization.h | 34 * \brief Tridiagonal decomposition of a selfadjoint matrix 36 * \tparam _MatrixType the type of the matrix of which we are computing the 40 * This class performs a tridiagonal decomposition of a selfadjoint matrix \f$ A \f$ such that: 41 * \f$ A = Q T Q^* \f$ where \f$ Q \f$ is unitary and \f$ T \f$ a real symmetric tridiagonal matrix. 43 * A tridiagonal matrix is a matrix which has nonzero elements only on the 45 * decomposition of a selfadjoint matrix is in fact a tridiagonal 47 * eigenvalues and eigenvectors of a selfadjoint matrix. 50 * given matrix. Alternatively, you can use the Tridiagonalization(const MatrixType&) 103 * \param [in] size Positive integer, size of the matrix whos 129 Tridiagonalization(const MatrixType& matrix) argument 155 compute(const MatrixType& matrix) argument [all...] |
/external/eigen/Eigen/src/Geometry/ |
H A D | Homogeneous.h | 71 inline Homogeneous(const MatrixType& matrix) argument 72 : m_matrix(matrix) 135 * \returns a matrix expression of homogeneous column (or row) vectors 215 static const type& run (const TransformType& x) { return x.matrix(); }
|