| /external/eigen/doc/snippets/ |
| tut_arithmetic_transpose_aliasing.cpp | 2 cout << "Here is the matrix a:\n" << a << endl;
|
| tut_arithmetic_transpose_inplace.cpp | 2 cout << "Here is the initial matrix a:\n" << a << endl;
|
| ColPivHouseholderQR_solve.cpp | 3 cout << "Here is the matrix m:" << endl << m << endl;
4 cout << "Here is the matrix y:" << endl << y << endl;
|
| FullPivHouseholderQR_solve.cpp | 3 cout << "Here is the matrix m:" << endl << m << endl;
4 cout << "Here is the matrix y:" << endl << y << endl;
|
| FullPivLU_image.cpp | 5 cout << "Here is the matrix m:" << endl << m << endl;
8 cout << "Here is a matrix whose columns have the same span but are linearly independent:"
|
| HessenbergDecomposition_compute.cpp | 4 cout << "The matrix H in the decomposition of A is:" << endl << hd.matrixH() << endl;
6 cout << "The matrix H in the decomposition of 2A is:" << endl << hd.matrixH() << endl;
|
| MatrixBase_fixedBlock_int_int.cpp | 2 cout << "Here is the matrix m:" << endl << m << endl;
5 cout << "Now the matrix m is:" << endl << m << endl;
|
| MatrixBase_reverse.cpp | 2 cout << "Here is the matrix m:" << endl << m << endl;
8 cout << "Now the matrix m is:" << endl << m << endl;
|
| MatrixBase_transpose.cpp | 2 cout << "Here is the matrix m:" << endl << m << endl;
8 cout << "Now the matrix m is:" << endl << m << endl;
|
| PartialPivLU_solve.cpp | 3 cout << "Here is the invertible matrix A:" << endl << A << endl;
4 cout << "Here is the matrix B:" << endl << B << endl;
|
| Tridiagonalization_compute.cpp | 5 cout << "The matrix T in the tridiagonal decomposition of A is: " << endl;
8 cout << "The matrix T in the tridiagonal decomposition of 2A is: " << endl;
|
| Tutorial_solve_multiple_rhs.cpp | 3 Matrix<float,3,2> B;
5 Matrix<float,3,2> X;
|
| /external/skia/src/effects/ |
| SkMatrixImageFilter.cpp | 63 SkMatrix matrix; local
64 if (!ctx.ctm().invert(&matrix)) {
67 matrix.postConcat(fTransform);
68 matrix.postConcat(ctx.ctm());
69 matrix.mapRect(&dstRect, srcRect);
79 canvas.concat(matrix);
97 SkMatrix matrix; local
98 matrix.setTranslate(-bounds.x(), -bounds.y());
99 matrix.postConcat(fTransform);
100 matrix.postTranslate(bounds.x(), bounds.y())
110 SkMatrix matrix; local
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/effects/ |
| GrBicubicEffect.h | 55 * Create a Mitchell filter effect with specified texture matrix and x/y tile modes.
57 static GrEffectRef* Create(GrTexture* tex, const SkMatrix& matrix,
59 return Create(tex, gMitchellCoefficients, matrix, tileModes);
63 * Create a filter effect with custom bicubic coefficients, the texture matrix, and the x/y
67 const SkMatrix& matrix, const SkShader::TileMode tileModes[2]) {
68 AutoEffectUnref effect(SkNEW_ARGS(GrBicubicEffect, (tex, coefficients, matrix, tileModes)));
73 * Create a Mitchell filter effect with a texture matrix and a domain.
75 static GrEffectRef* Create(GrTexture* tex, const SkMatrix& matrix, const SkRect& domain) {
76 AutoEffectUnref effect(SkNEW_ARGS(GrBicubicEffect, (tex, gMitchellCoefficients, matrix,
93 const SkMatrix &matrix, const SkShader::TileMode tileModes[2])
[all...] |
| /external/eigen/bench/ |
| bench_reverse.cpp | 70 bench_reverse(Matrix<Scalar,Dynamic,Dynamic>(dynsizes[i],dynsizes[i]));
71 bench_reverse(Matrix<Scalar,Dynamic,1>(dynsizes[i]*dynsizes[i]));
73 // bench_reverse(Matrix<Scalar,2,2>());
74 // bench_reverse(Matrix<Scalar,3,3>());
75 // bench_reverse(Matrix<Scalar,4,4>());
76 // bench_reverse(Matrix<Scalar,5,5>());
77 // bench_reverse(Matrix<Scalar,6,6>());
78 // bench_reverse(Matrix<Scalar,7,7>());
79 // bench_reverse(Matrix<Scalar,8,8>());
80 // bench_reverse(Matrix<Scalar,12,12>())
[all...] |
| /external/skia/src/gpu/effects/ |
| GrBicubicEffect.h | 55 * Create a Mitchell filter effect with specified texture matrix and x/y tile modes.
57 static GrEffectRef* Create(GrTexture* tex, const SkMatrix& matrix,
59 return Create(tex, gMitchellCoefficients, matrix, tileModes);
63 * Create a filter effect with custom bicubic coefficients, the texture matrix, and the x/y
67 const SkMatrix& matrix, const SkShader::TileMode tileModes[2]) {
68 AutoEffectUnref effect(SkNEW_ARGS(GrBicubicEffect, (tex, coefficients, matrix, tileModes)));
73 * Create a Mitchell filter effect with a texture matrix and a domain.
75 static GrEffectRef* Create(GrTexture* tex, const SkMatrix& matrix, const SkRect& domain) {
76 AutoEffectUnref effect(SkNEW_ARGS(GrBicubicEffect, (tex, gMitchellCoefficients, matrix,
93 const SkMatrix &matrix, const SkShader::TileMode tileModes[2])
[all...] |
| /frameworks/base/graphics/java/android/graphics/ |
| Shader.java | 40 private Matrix mLocalMatrix;
65 * Return true if the shader has a non-identity local matrix.
66 * @param localM If not null, it is set to the shader's local matrix.
67 * @return true if the shader has a non-identity local matrix
69 public boolean getLocalMatrix(Matrix localM) {
78 * Set the shader's local matrix. Passing null will reset the shader's
79 * matrix to identity.
81 * @param localM The shader's new local matrix, or null to specify identity
83 public void setLocalMatrix(Matrix localM) {
110 final Matrix lm = new Matrix()
[all...] |
| /external/chromium_org/cc/quads/ |
| stream_video_draw_quad.cc | 24 const gfx::Transform& matrix) {
29 this->matrix = matrix;
38 const gfx::Transform& matrix) {
42 this->matrix = matrix;
58 value->Set("matrix", MathUtil::AsValue(matrix).release());
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrPathRenderer.cpp | 16 const SkMatrix& matrix,
23 matrix.mapRect(bounds);
|
| /external/eigen/Eigen/ |
| OrderingMethods | 15 * the sparse matrix decomposition (LLT, LU, QR).
16 * Precisely, in a preprocessing step, a permutation matrix P is computed using
17 * those ordering methods and applied to the columns of the matrix.
42 * //Fill the matrix ...
48 * of the input matrix to be symmetric. When the matrix is structurally unsymmetric,
50 * If your matrix is already symmetric (at leat in structure), you can avoid that
54 * // Call the ordering on the pattern of the lower triangular matrix A
|
| /external/eigen/doc/ |
| ClassHierarchy.dox | 17 the derived class (for instance, \c Matrix) inherits the base class with the derived class itself as a
18 template argument (in this case, \c Matrix inherits from \c MatrixBase<Matrix>). This allows Eigen to
31 - Matrix means plain dense matrix. If \c m is a \c %Matrix, then, for instance, \c m+m is no longer a
32 \c %Matrix, it is a "matrix expression".
33 - MatrixBase means dense matrix expression. This means that a \c %MatrixBase is something that can be
34 added, matrix-multiplied, LU-decomposed, QR-decomposed... All matrix expression classes, including
[all...] |
| /external/eigen/doc/examples/ |
| TutorialLinAlgSelfAdjointEigenSolver.cpp | 11 cout << "Here is the matrix A:\n" << A << endl;
15 cout << "Here's a matrix whose columns are eigenvectors of A \n"
|
| Tutorial_ArrayClass_interop.cpp | 18 result = (m.array() + 4).matrix() * m;
20 result = (m.array() * n.array()).matrix() * m;
|
| Tutorial_BlockOperations_colrow.cpp | 12 cout << "Here is the matrix m:" << endl << m << endl;
15 cout << "After adding 3 times the first column into the third column, the matrix m is:\n";
|
| /external/eigen/unsupported/doc/examples/ |
| MatrixExponential.cpp | 14 std::cout << "The matrix A is:\n" << A << "\n\n";
15 std::cout << "The matrix exponential of A is:\n" << A.exp() << "\n\n";
|
