Searched refs:matrix (Results 276 - 300 of 545) sorted by relevance

<<11121314151617181920>>

/external/webkit/Source/WebCore/platform/graphics/android/layers/
H A DVideoLayerManager.h76 // At draw time, update the matrix for every video frame update.
77 void updateMatrix(const int layerId, const GLfloat* matrix);
83 // Return the matrix for surface texture corresponding to the layerId
/external/webkit/Source/WebCore/platform/graphics/qt/
H A DTextureMapperQt.h56 virtual void drawTexture(const BitmapTexture& texture, const IntRect& targetRect, const TransformationMatrix& matrix, float opacity, const BitmapTexture* maskTexture);
/external/webkit/Source/WebCore/svg/
H A DSVGTransform.h51 AffineTransform matrix() const { return m_matrix; } function in class:WebCore::SVGTransform
/external/webkit/Source/WebKit/android/plugins/
H A DANPCanvasInterface.cpp71 static void anp_concat(ANPCanvas* canvas, const ANPMatrix* matrix) { argument
72 canvas->skcanvas->concat(*matrix);
75 static void anp_getTotalMatrix(ANPCanvas* canvas, ANPMatrix* matrix) { argument
77 *matrix = *reinterpret_cast<const ANPMatrix*>(&src);
/external/eigen/Eigen/src/Eigenvalues/
H A DTridiagonalization.h34 * \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/freetype/src/base/
H A Dftglyph.c217 const FT_Matrix* matrix,
223 if ( matrix )
224 FT_Outline_Transform( &glyph->outline, matrix );
422 FT_Matrix* matrix,
437 clazz->glyph_transform( glyph, matrix, delta );
440 if ( matrix )
441 FT_Vector_Transform( &glyph->advance, matrix );
216 ft_outline_glyph_transform( FT_Glyph outline_glyph, const FT_Matrix* matrix, const FT_Vector* delta ) argument
/external/skia/legacy/src/core/
H A DSkDevice.cpp100 void SkDevice::setMatrixClip(const SkMatrix& matrix, const SkRegion& region, argument
303 const SkMatrix& matrix, const SkPaint& paint) {
313 draw.drawBitmap(*bitmapPtr, matrix, paint);
334 const SkMatrix* matrix,
336 draw.drawTextOnPath((const char*)text, len, path, matrix, paint);
342 const SkPath& path, const SkMatrix* matrix) {
343 draw.drawPosTextOnPath((const char*)text, len, pos, paint, path, matrix);
301 drawBitmap(const SkDraw& draw, const SkBitmap& bitmap, const SkIRect* srcRect, const SkMatrix& matrix, const SkPaint& paint) argument
332 drawTextOnPath(const SkDraw& draw, const void* text, size_t len, const SkPath& path, const SkMatrix* matrix, const SkPaint& paint) argument
340 drawPosTextOnPath(const SkDraw& draw, const void* text, size_t len, const SkPoint pos[], const SkPaint& paint, const SkPath& path, const SkMatrix* matrix) argument
H A DSkFlattenable.cpp14 void SkReadMatrix(SkReader32* reader, SkMatrix* matrix) { argument
15 size_t size = matrix->unflatten(reader->peek());
20 void SkWriteMatrix(SkWriter32* writer, const SkMatrix& matrix) { argument
21 size_t size = matrix.flatten(NULL);
23 matrix.flatten(writer->reserve(size));
/external/webkit/Source/WebCore/platform/graphics/skia/
H A DImageSkia.cpp212 // The matrix inverting, etc. could have introduced rounding error which
283 // is something interesting going on with the matrix (like a rotation).
290 // Transforms the given dimensions with the given matrix. Used to see how big
292 static void TransformDimensions(const SkMatrix& matrix, float srcWidth, float srcHeight, float* destWidth, float* destHeight) { argument
303 matrix.mapPoints(dest_points, src_points, 3);
366 // matrix to see how bit it will be.
386 SkMatrix matrix(patternTransform);
407 matrix.setScaleX(SkIntToScalar(1));
408 matrix.setScaleY(SkIntToScalar(1));
422 matrix
[all...]
/external/eigen/Eigen/src/Core/
H A DPermutationMatrix.h25 * This class is the base class for all expressions representing a permutation matrix,
27 * The convention followed here is that if \f$ \sigma \f$ is a permutation, the corresponding permutation matrix
36 * operator* to multiply any kind of permutation object with any kind of matrix expression (MatrixBase)
113 /** \returns the size of a side of the respective square matrix, i.e., the number of indices */
126 /** \returns a Matrix object initialized from this permutation matrix. Notice that it
147 /** Sets *this to be the identity permutation matrix */
154 /** Sets *this to be the identity permutation matrix of given size.
197 /** \returns the inverse permutation matrix.
203 /** \returns the tranpose permutation matrix.
230 /** \returns the product permutation matrix
510 operator *(const MatrixBase<Derived>& matrix, const PermutationBase<PermutationDerived> &permutation) argument
523 operator *(const PermutationBase<PermutationDerived> &permutation, const MatrixBase<Derived>& matrix) argument
545 permut_matrix_product_retval(const PermutationType& perm, const MatrixType& matrix) argument
659 operator *(const MatrixBase<OtherDerived>& matrix, const Transpose& trPerm) argument
[all...]
/external/skia/src/effects/
H A DSkBlurMaskFilter.cpp82 const SkMatrix& matrix,
88 radius = matrix.mapRadius(fRadius);
155 const SkMatrix& matrix,
180 if (!this->filterMask(&dstM, srcM, matrix, &margin)) {
244 if (!this->filterMask(&patch->fMask, srcM, matrix, &margin)) {
81 filterMask(SkMask* dst, const SkMask& src, const SkMatrix& matrix, SkIPoint* margin) const argument
154 filterRectsToNine(const SkRect rects[], int count, const SkMatrix& matrix, const SkIRect& clipBounds, NinePatch* patch) const argument
/external/skia/src/gpu/
H A DGrDrawTarget.h411 * @param matrix optional matrix applied to rect (before viewMatrix)
424 const SkMatrix* matrix,
431 void drawSimpleRect(const GrRect& rect, const SkMatrix* matrix = NULL) {
432 drawRect(rect, matrix, NULL, NULL);
434 void drawSimpleRect(const GrIRect& irect, const SkMatrix* matrix = NULL) {
436 this->drawRect(rect, matrix, NULL, NULL);
H A DGrContext.cpp572 // We attempt to map r by the inverse matrix and draw that. mapRect will
577 GrPrintf("Could not invert matrix\n");
583 GrPrintf("Could not invert matrix\n");
637 const SkMatrix* matrix,
673 if (NULL != matrix &&
674 !matrix->preservesAxisAlignment()) {
679 if (NULL != matrix) {
680 combinedMatrix->preConcat(*matrix);
697 const SkMatrix* matrix) {
708 bool doAA = needAA && apply_aa_to_rect(target, rect, width, matrix,
634 apply_aa_to_rect(GrDrawTarget* target, const GrRect& rect, SkScalar width, const SkMatrix* matrix, SkMatrix* combinedMatrix, GrRect* devRect, bool* useVertexCoverage) argument
694 drawRect(const GrPaint& paint, const GrRect& rect, SkScalar width, const SkMatrix* matrix) argument
1632 SkMatrix matrix; local
1818 createPMToUPMEffect(GrTexture* texture, bool swapRAndB, const SkMatrix& matrix) argument
1834 createUPMToPMEffect(GrTexture* texture, bool swapRAndB, const SkMatrix& matrix) argument
1896 SkMatrix matrix; local
1958 SkMatrix matrix; local
[all...]
/external/skia/src/gpu/effects/
H A DGrConfigConversionEffect.cpp104 const SkMatrix& matrix)
105 : GrSingleTextureEffect(texture, matrix)
267 const SkMatrix& matrix) {
272 return GrSimpleTextureEffect::Create(texture, matrix);
283 matrix)));
101 GrConfigConversionEffect(GrTexture* texture, bool swapRedAndBlue, PMConversion pmConversion, const SkMatrix& matrix) argument
264 Create(GrTexture* texture, bool swapRedAndBlue, PMConversion pmConversion, const SkMatrix& matrix) argument
/external/skia/src/pipe/
H A DSkGPipeWrite.cpp214 virtual bool concat(const SkMatrix& matrix) SK_OVERRIDE;
215 virtual void setMatrix(const SkMatrix& matrix) SK_OVERRIDE;
247 const SkPath& path, const SkMatrix* matrix,
604 bool SkGPipeCanvas::concat(const SkMatrix& matrix) { argument
605 if (!matrix.isIdentity()) {
607 if (this->needOpBytes(matrix.writeToMemory(NULL))) {
609 fWriter.writeMatrix(matrix);
612 return this->INHERITED::concat(matrix);
615 void SkGPipeCanvas::setMatrix(const SkMatrix& matrix) { argument
617 if (this->needOpBytes(matrix
792 drawBitmapMatrix(const SkBitmap& bm, const SkMatrix& matrix, const SkPaint* paint) argument
876 drawTextOnPath(const void* text, size_t byteLength, const SkPath& path, const SkMatrix* matrix, const SkPaint& paint) argument
[all...]
/external/skia/tests/
H A DDrawBitmapRectTest.cpp127 SkMatrix matrix; local
130 matrix.setAll(SkFloatToScalar(-119.34097f),
137 c.concat(matrix);
146 matrix.setAll(SkFloatToScalar(0.0078740157f),
153 s->setLocalMatrix(matrix);
165 * Original bug was asserting that the matrix-proc had generated a (Y) value
/external/webkit/Source/WebCore/platform/graphics/transforms/
H A DTransformationMatrix.cpp45 // inversion and decomposition of a 4x4 matrix. They are used throughout the code
58 // A clarification about the storage of matrix elements
60 // This class uses a 2 dimensional array internally to store the elements of the matrix. The first index into
63 // In other words, this is the layout of the matrix:
77 // calculate the inverse of a 4x4 matrix
85 // calculate the determinant of a 2x2 matrix.
94 // Calculate the determinant of a 3x3 matrix
108 // double = determinant4x4(matrix)
110 // calculate the determinant of a 4x4 matrix.
145 // calculate the adjoint of a 4x4 matrix
159 adjoint(const TransformationMatrix::Matrix4& matrix, TransformationMatrix::Matrix4& result) argument
206 inverse(const TransformationMatrix::Matrix4& matrix, TransformationMatrix::Matrix4& result) argument
[all...]
/external/ceres-solver/docs/
H A Dsolving.tex13 Here, the Jacobian $J(x)$ of $F(x)$ is an $m\times n$ matrix, where $J_{ij}(x) = \partial_j f_i(x)$ and the gradient vector $g(x) = \nabla \frac{1}{2}\|F(x)\|^2 = J(x)^\top F(x)$. Since the efficient global optimization of~\eqref{eq:nonlinsq} for general $F(x)$ is an intractable problem, we will have to settle for finding a local minimum.
47 Here, $\mu$ is the trust region radius, $D(x)$ is some matrix used to define a metric on the domain of $F(x)$ and $\rho$ measures the quality of the step $\Delta x$, i.e., how well did the linear model predict the decrease in the value of the non-linear objective. The idea is to increase or decrease the radius of the trust region depending on how well the linearization predicts the behavior of the non-linear objective, which in turn is reflected in the value of $\rho$.
70 The matrix $D(x)$ is a non-negative diagonal matrix, typically the square root of the diagonal of the matrix $J(x)^\top J(x)$.
72 Before going further, let us make some notational simplifications. We will assume that the matrix $\sqrt{\mu} D$ has been concatenated at the bottom of the matrix $J$ and similarly a vector of zeros has been added to the bottom of the vector $f$ and the rest of our discussion will be in terms of $J$ and $f$, \ie the linear least squares problem.
142 Similar structure can be found in the matrix factorization with
174 a_2)$, but decomposing the graph corresponding to the Hessian matrix's
231 For small problems (a couple of hundred parameters and a few thousand residuals) with relatively dense Jacobians, \texttt{DENSE\_QR} is the method of choice~\cite{bjorck1996numerical}. Let $J = QR$ be the QR-decomposition of $J$, where $Q$ is an orthonormal matrix an
[all...]
/external/skia/legacy/src/pipe/
H A DSkGPipeRead.cpp147 SkMatrix matrix;
148 SkReadMatrix(reader, &matrix);
149 canvas->setMatrix(matrix);
154 SkMatrix matrix;
155 SkReadMatrix(reader, &matrix);
156 canvas->concat(matrix);
316 const SkMatrix* matrix = NULL;
319 matrix = &matrixStorage;
322 canvas->drawTextOnPath(text, len, path, matrix, state->paint());
/external/skia/src/svg/
H A DSkSVGPaintState.cpp205 SkASSERT(strncmp(str, "matrix(", 7) == 0);
213 SkMatrix matrix;
214 matrix.reset();
215 matrix.setScaleX(values[0]);
216 matrix.setSkewY(values[1]);
217 matrix.setSkewX(values[2]);
218 matrix.setScaleY(values[3]);
219 matrix.setTranslateX(values[4]);
220 matrix.setTranslateY(values[5]);
221 sum.setConcat(matrix, su
[all...]
/external/eigen/Eigen/src/Eigen2Support/
H A DSVD.h20 * \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/jmonkeyengine/engine/src/core/com/jme3/math/
H A DQuaternion.java321 * matrix. This matrix is assumed to be a rotational matrix.
323 * @param matrix
324 * the matrix that defines the rotation.
326 public Quaternion fromRotationMatrix(Matrix3f matrix) { argument
327 return fromRotationMatrix(matrix.m00, matrix.m01, matrix.m02, matrix
856 apply(Matrix3f matrix) argument
[all...]
/external/skia/src/core/
H A DSkCanvas.cpp132 The clip/matrix/proc are fields that reflect the top of the save/restore
207 Since a level optionally copies the matrix and/or stack, we have pointers
984 const SkMatrix& matrix, const SkPaint* paint) {
993 this->commonDrawBitmap(bitmap, srcRect, matrix, *paint);
1089 bool SkCanvas::concat(const SkMatrix& matrix) { argument
1092 return fMCRec->fMatrix->preConcat(matrix);
1095 void SkCanvas::setMatrix(const SkMatrix& matrix) { argument
1098 *fMCRec->fMatrix = matrix;
1104 SkMatrix matrix; local
1106 matrix
983 internalDrawBitmap(const SkBitmap& bitmap, const SkIRect* srcRect, const SkMatrix& matrix, const SkPaint* paint) argument
1641 SkMatrix matrix; local
1686 drawBitmapMatrix(const SkBitmap& bitmap, const SkMatrix& matrix, const SkPaint* paint) argument
1692 commonDrawBitmap(const SkBitmap& bitmap, const SkIRect* srcRect, const SkMatrix& matrix, const SkPaint& paint) argument
1920 drawTextOnPath(const void* text, size_t byteLength, const SkPath& path, const SkMatrix* matrix, const SkPaint& paint) argument
1936 drawPosTextOnPath(const void* text, size_t byteLength, const SkPoint pos[], const SkPaint& paint, const SkPath& path, const SkMatrix* matrix) argument
2083 SkMatrix matrix; local
2119 const SkMatrix& SkCanvas::LayerIter::matrix() const { function in class:SkCanvas::LayerIter
[all...]
/external/eigen/Eigen/src/SuperLUSupport/
H A DSuperLUSupport.h199 eigen_assert(((MatrixType::Flags & SelfAdjoint)==0) && "SelfAdjoint matrix shape not supported by SuperLU");
258 eigen_assert(((MatrixType::Flags & SelfAdjoint)==0) && "SelfAdjoint matrix shape not supported by SuperLU");
270 /** View a Super LU matrix as an Eigen expression */
324 * \c NumericalIssue if the matrix.appears to be negative.
332 /** Computes the sparse Cholesky decomposition of \a matrix */
333 void compute(const MatrixType& matrix) argument
335 derived().analyzePattern(matrix);
336 derived().factorize(matrix);
348 && "SuperLU::solve(): invalid number of rows of the right hand side matrix b");
361 // && "SuperLU::solve(): invalid number of rows of the right hand side matrix
497 SuperLU(const MatrixType& matrix) argument
513 analyzePattern(const MatrixType& matrix) argument
833 SuperILU(const MatrixType& matrix) argument
849 analyzePattern(const MatrixType& matrix) argument
[all...]
/external/freetype/src/cff/
H A Dcffparse.c449 FT_Matrix* matrix = &dict->font_matrix; local
465 /* We expect a well-formed font matrix, this is, the matrix elements */
471 matrix->xx = cff_parse_fixed_dynamic( data++, &scaling );
477 /* Return default matrix in case of unlikely values. */
482 " using default matrix\n", scaling ));
484 matrix->xx = 0x10000L;
485 matrix->yx = 0;
486 matrix->xy = 0;
487 matrix
[all...]

Completed in 595 milliseconds

<<11121314151617181920>>