| /external/eigen/blas/ |
| common.h | 96 typedef Matrix<Scalar,Dynamic,Dynamic,ColMajor> PlainMatrixType;
97 typedef Map<Matrix<Scalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > MatrixType;
98 typedef Map<Matrix<Scalar,Dynamic,1>, 0, InnerStride<Dynamic> > StridedVectorType;
99 typedef Map<Matrix<Scalar,Dynamic,1> > CompactVectorType;
102 Map<Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> >
103 matrix(T* data, int rows, int cols, int stride) function
105 return Map<Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> >(data, rows, cols, OuterStride<>(stride));
109 Map<Matrix<T,Dynamic,1>, 0, InnerStride<Dynamic> > vector(T* data, int size, int incr)
111 return Map<Matrix<T,Dynamic,1>, 0, InnerStride<Dynamic> >(data, size, InnerStride<Dynamic>(incr));
115 Map<Matrix<T,Dynamic,1> > vector(T* data, int size
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunctionAtomic.h | 17 * \brief Helper class for computing matrix functions of atomic matrices.
20 * Here, an atomic matrix is a triangular matrix whose diagonal
32 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
35 * \param[in] f matrix function to compute.
39 /** \brief Compute matrix function of atomic matrix
40 * \param[in] A argument of matrix function, should be upper triangular and atomic
41 * \returns f(A), the matrix function evaluated at the given matrix
[all...] |
| /cts/tests/tests/uirendering/src/android/uirendering/cts/testinfrastructure/ |
| ResourceModifier.java | 27 import android.graphics.Matrix;
67 Matrix matrix = new Matrix(); local
68 matrix.setTranslate(texWidth / 2.0f, texHeight / 2.0f);
69 matrix.postRotate(45, 0, 0);
70 translatedShader.setLocalMatrix(matrix);
74 matrix = new Matrix();
75 matrix.setScale(0.5f, 0.5f)
[all...] |
| /external/chromium_org/third_party/skia/src/views/animated/ |
| SkImageView.cpp | 72 bool SkImageView::getImageMatrix(SkMatrix* matrix) const
77 if (matrix)
78 *matrix = *fMatrix;
83 if (matrix)
84 matrix->reset();
89 void SkImageView::setImageMatrix(const SkMatrix* matrix)
93 if (matrix && !matrix->isIdentity())
97 *fMatrix = *matrix;
111 // only redraw if we changed our matrix and we're not in scaleToFit mod
152 SkMatrix matrix; local
[all...] |
| /external/eigen/test/ |
| integer_types.cpp | 59 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
71 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;
128 // check matrix product.
139 CALL_SUBTEST_1( integer_type_tests(Matrix<unsigned int, 1, 1>()) );
140 CALL_SUBTEST_1( integer_type_tests(Matrix<unsigned long, 3, 4>()) );
142 CALL_SUBTEST_2( integer_type_tests(Matrix<long, 2, 2>()) );
143 CALL_SUBTEST_2( signed_integer_type_tests(Matrix<long, 2, 2>()) );
145 CALL_SUBTEST_3( integer_type_tests(Matrix<char, 2, Dynamic>(2, 10)) );
146 CALL_SUBTEST_3( signed_integer_type_tests(Matrix<signed char, 2, Dynamic>(2, 10)) );
148 CALL_SUBTEST_4( integer_type_tests(Matrix<unsigned char, 3, 3>()) )
[all...] |
| /external/skia/src/views/animated/ |
| SkImageView.cpp | 72 bool SkImageView::getImageMatrix(SkMatrix* matrix) const
77 if (matrix)
78 *matrix = *fMatrix;
83 if (matrix)
84 matrix->reset();
89 void SkImageView::setImageMatrix(const SkMatrix* matrix)
93 if (matrix && !matrix->isIdentity())
97 *fMatrix = *matrix;
111 // only redraw if we changed our matrix and we're not in scaleToFit mod
152 SkMatrix matrix; local
[all...] |
| /external/eigen/unsupported/Eigen/src/SVD/ |
| SVDBase.h | 26 * \param MatrixType the type of the matrix of which we are computing the SVD decomposition
27 * SVD decomposition consists in decomposing any n-by-p matrix \a A as a product
29 * where \a U is a n-by-n unitary, \a V is a p-by-p unitary, and \a S is a n-by-p real positive matrix which is zero outside of its main diagonal;
36 * You can ask for only \em thin \a U or \a V to be computed, meaning the following. In case of a rectangular n-by-p matrix, letting \a m be the
38 * singular vectors. Asking for \em thin \a U or \a V means asking for only their \a m first columns to be formed. So \a U is then a n-by-m matrix,
39 * and \a V is then a p-by-m matrix. Notice that thin \a U and \a V are all you need for (least squares) solving.
41 * If the input matrix has inf or nan coefficients, the result of the computation is undefined, but the computation is guaranteed to
64 typedef Matrix<Scalar, RowsAtCompileTime, RowsAtCompileTime,
67 typedef Matrix<Scalar, ColsAtCompileTime, ColsAtCompileTime,
73 typedef Matrix<Scalar, DiagSizeAtCompileTime, DiagSizeAtCompileTime
[all...] |
| /external/glide/library/src/main/java/com/bumptech/glide/load/resource/bitmap/ |
| TransformationUtils.java | 8 import android.graphics.Matrix;
45 Matrix m = new Matrix();
97 Matrix matrix = new Matrix(); local
98 matrix.setScale(minPercentage, minPercentage);
100 canvas.drawBitmap(toFit, matrix, paint);
106 * Returns a matrix with rotation set based on Exif orientation tag.
157 Matrix matrix = new Matrix() local
214 final Matrix matrix = new Matrix(); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| CSSMatrix.h | 99 // The following math function return a new matrix with the
102 // Multiply this matrix by secondMatrix, on the right (result = this * secondMatrix)
105 // Return the inverse of this matrix. Throw an exception if the matrix is not invertible
108 // Return this matrix translated by the passed values.
110 // Operation is performed as though the this matrix is multiplied by a matrix with
114 // Returns this matrix scaled by the passed values.
117 // Operation is performed as though the this matrix is multiplied by a matrix wit
[all...] |
| /frameworks/base/tests/RenderScriptTests/PerfTest/src/com/android/perftest/ |
| torus_test.rs | 64 static void updateModelMatrix(rs_matrix4x4 *matrix, void *buffer) {
66 rsgProgramVertexLoadModelMatrix(matrix);
72 static void drawToruses(int numMeshes, rs_matrix4x4 *matrix, void *buffer) {
75 rsMatrixLoadTranslate(matrix, 0.0f, 0.0f, -7.5f);
76 rsMatrixRotate(matrix, gTorusRotation, 1.0f, 0.0f, 0.0f);
77 updateModelMatrix(matrix, buffer);
83 rsMatrixLoadTranslate(matrix, -1.6f, 0.0f, -7.5f);
84 rsMatrixRotate(matrix, gTorusRotation, 1.0f, 0.0f, 0.0f);
85 updateModelMatrix(matrix, buffer);
88 rsMatrixLoadTranslate(matrix, 1.6f, 0.0f, -7.5f)
[all...] |
| /external/chromium_org/ui/gfx/ |
| transform_unittest.cc | 29 EXPECT_FLOAT_EQ((a), (transform).matrix().get(0, 0)); \
30 EXPECT_FLOAT_EQ((b), (transform).matrix().get(0, 1)); \
31 EXPECT_FLOAT_EQ((c), (transform).matrix().get(0, 2)); \
32 EXPECT_FLOAT_EQ((d), (transform).matrix().get(0, 3));
35 EXPECT_FLOAT_EQ((a), (transform).matrix().get(1, 0)); \
36 EXPECT_FLOAT_EQ((b), (transform).matrix().get(1, 1)); \
37 EXPECT_FLOAT_EQ((c), (transform).matrix().get(1, 2)); \
38 EXPECT_FLOAT_EQ((d), (transform).matrix().get(1, 3));
41 EXPECT_FLOAT_EQ((a), (transform).matrix().get(2, 0)); \
42 EXPECT_FLOAT_EQ((b), (transform).matrix().get(2, 1));
93 SkMatrix44& matrix = transform->matrix(); local
119 SkMatrix44& matrix = transform->matrix(); local
149 SkMatrix44& matrix = transform->matrix(); local
2243 SkMatrix44& matrix = A.matrix(); local
[all...] |
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| MatrixTest.java | 18 import android.graphics.Matrix;
20 import android.graphics.Matrix.ScaleToFit;
24 private Matrix mMatrix;
30 mMatrix = new Matrix();
35 new Matrix();
36 new Matrix(mMatrix);
54 Matrix matrix = new Matrix(); local
55 matrix.set(mMatrix)
64 Matrix matrix = new Matrix(); local
203 Matrix matrix = new Matrix(); local
255 Matrix matrix = new Matrix(); local
300 Matrix matrix = new Matrix(); local
463 Matrix matrix = new Matrix(); local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| matrix.c | 28 * \file matrix.c
29 * Matrix operations.
34 * -# Transformation of a point p by a matrix M is: p' = M * p
44 #include "matrix.h"
50 * Apply a perspective projection matrix.
62 * the top matrix of the current matrix stack and sets
92 * Apply an orthographic projection matrix.
104 * the top matrix of the current matrix stack and set
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| RealSchur.h | 23 * \brief Performs a real Schur decomposition of a square matrix
25 * \tparam _MatrixType the type of the matrix of which we are computing the
27 * Matrix class template.
29 * Given a real square matrix A, this class computes the real Schur
30 * decomposition: \f$ A = U T U^T \f$ where U is a real orthogonal matrix and
31 * T is a real quasi-triangular matrix. An orthogonal matrix is a matrix whose
33 * matrix is a block-triangular matrix whose diagonal consists of 1-by-
[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/SparseLU/ |
| SparseLU.h | 30 * scalar type of your input matrix.
38 * (and eventually the rows) of the matrix to reduce the number of new elements that are created during
57 * \warning The input matrix A should be in a \b compressed and \b column-major form.
58 * Otherwise an expensive copy will be made. You can call the inexpensive makeCompressed() to get a compressed matrix.
60 * \note Unlike the initial SuperLU implementation, there is no step to equilibrate the matrix.
65 * \tparam _MatrixType The type of the sparse matrix. It must be a column-major SparseMatrix<>
83 typedef Matrix<Scalar,Dynamic,1> ScalarVector;
84 typedef Matrix<Index,Dynamic,1> IndexVector;
93 SparseLU(const MatrixType& matrix):m_isInitialized(true),m_lastError(""),m_Ustore(0,0,0,0,0,0),m_symmetricmode(false),m_diagpivotthresh(1.0),m_detPermR(1)
96 compute(matrix);
[all...] |
| /external/mesa3d/src/mesa/main/ |
| matrix.c | 28 * \file matrix.c
29 * Matrix operations.
34 * -# Transformation of a point p by a matrix M is: p' = M * p
44 #include "matrix.h"
50 * Apply a perspective projection matrix.
62 * the top matrix of the current matrix stack and sets
92 * Apply an orthographic projection matrix.
104 * the top matrix of the current matrix stack and set
[all...] |
| /external/ceres-solver/internal/ceres/ |
| partitioned_matrix_view.cc | 52 const BlockSparseMatrix& matrix) {
58 matrix, options.elimination_groups[0]);
64 matrix, options.elimination_groups[0]);
70 matrix, options.elimination_groups[0]);
76 matrix, options.elimination_groups[0]);
82 matrix, options.elimination_groups[0]);
88 matrix, options.elimination_groups[0]);
94 matrix, options.elimination_groups[0]);
100 matrix, options.elimination_groups[0]);
106 matrix, options.elimination_groups[0])
[all...] |
| /external/chromium_org/third_party/opus/src/silk/float/ |
| solve_LS_FLP.c | 36 * LDL Factorisation. Finds the upper triangular matrix L and the diagonal
37 * Matrix D (only the diagonal elements returned in a vector)such that
41 silk_float *A, /* I/O Pointer to Symetric Square Matrix */
42 opus_int M, /* I Size of Matrix */
43 silk_float *L, /* I/O Pointer to Square Upper triangular Matrix */
49 * triangular matrix, with ones on the diagonal.
52 const silk_float *L, /* I Pointer to Lower Triangular Matrix */
53 opus_int M, /* I Dim of Matrix equation */
63 const silk_float *L, /* I Pointer to Lower Triangular Matrix */
64 opus_int M, /* I Dim of Matrix equation *
[all...] |
| /external/libopus/silk/float/ |
| solve_LS_FLP.c | 36 * LDL Factorisation. Finds the upper triangular matrix L and the diagonal
37 * Matrix D (only the diagonal elements returned in a vector)such that
41 silk_float *A, /* I/O Pointer to Symetric Square Matrix */
42 opus_int M, /* I Size of Matrix */
43 silk_float *L, /* I/O Pointer to Square Upper triangular Matrix */
49 * triangular matrix, with ones on the diagonal.
52 const silk_float *L, /* I Pointer to Lower Triangular Matrix */
53 opus_int M, /* I Dim of Matrix equation */
63 const silk_float *L, /* I Pointer to Lower Triangular Matrix */
64 opus_int M, /* I Dim of Matrix equation *
[all...] |
| /cts/suite/cts/deviceTests/opengl/jni/primitive/fullpipeline/ |
| FullPipelineRenderer.h | 18 #include <graphics/Matrix.h>
33 Matrix* mModelMatrix;
34 Matrix* mViewMatrix;
35 Matrix* mProjectionMatrix;
|
| /external/chromium_org/cc/layers/ |
| heads_up_display_layer.cc | 30 gfx::Transform matrix; local
31 matrix.MakeIdentity();
43 matrix.Translate(device_viewport_in_layout_pixels.width() - size, 0.0);
47 SetTransform(matrix);
|
| /external/chromium_org/media/base/ |
| channel_mixer.h | 20 // matrix is built upon construction and used during each Transform() call. The
21 // algorithm works by generating a conversion matrix mapping each output channel
24 // input channels as defined in the matrix.
38 // 2D matrix of output channels to input channels.
|
| /external/chromium_org/third_party/skia/include/gpu/ |
| GrDrawEffect.h | 13 * the view matrix and local coordinate system since the effect was installed in its GrDrawState.
15 * in device coordinates (i.e. use an identity view-matrix). In such a case the GrDrawEffect's
16 * coord-change-matrix would be the inverse of the view matrix that was set when the effect was
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkPerspIter.h | 17 /** Iterate a line through the matrix [x,y] ... [x+count-1, y].
18 @param m The matrix we will be iterating a line through
19 @param x The initial X coordinate to be mapped through the matrix
20 @param y The initial Y coordinate to be mapped through the matrix
|
