| /external/skia/src/core/ |
| SkTextMapStateProc.h | 16 SkTextMapStateProc(const SkMatrix& matrix, SkScalar y, int scalarsPerPosition)
17 : fMatrix(matrix)
18 , fProc(matrix.getMapXYProc())
|
| /frameworks/base/graphics/java/android/graphics/ |
| Camera.java | 21 * generate a matrix that can be applied, for instance, on a
25 private Matrix mMatrix;
136 * Computes the matrix corresponding to the current transformation
137 * and copies it to the supplied matrix object.
139 * @param matrix The matrix to copy the current transforms into
141 public void getMatrix(Matrix matrix) {
142 nativeGetMatrix(matrix.native_instance);
146 * Computes the matrix corresponding to the current transformatio
[all...] |
| /frameworks/base/tests/HwAccelerationTest/src/com/android/test/hwui/ |
| MatrixActivity.java | 46 Log.d("Matrix", "m1=" + canvas.getMatrix());
50 Log.d("Matrix", "m2=" + canvas.getMatrix());
52 Log.d("Matrix", "m3=" + canvas.getMatrix());
|
| /packages/apps/Camera/tests/src/com/android/camera/unittest/ |
| CameraUnitTest.java | 21 import android.graphics.Matrix;
73 Matrix matrix = new Matrix(); local
77 Util.prepareMatrix(matrix, false, 0, 800, 480);
80 matrix.mapPoints(points);
83 Util.prepareMatrix(matrix, false, 90, 800, 480);
86 matrix.mapPoints(points);
89 Util.prepareMatrix(matrix, false, 180, 800, 480);
92 matrix.mapPoints(points)
[all...] |
| /packages/apps/Camera2/tests/src/com/android/camera/unittest/ |
| CameraUnitTest.java | 21 import android.graphics.Matrix;
73 Matrix matrix = new Matrix(); local
77 CameraUtil.prepareMatrix(matrix, false, 0, 800, 480);
80 matrix.mapPoints(points);
83 CameraUtil.prepareMatrix(matrix, false, 90, 800, 480);
86 matrix.mapPoints(points);
89 CameraUtil.prepareMatrix(matrix, false, 180, 800, 480);
92 matrix.mapPoints(points)
[all...] |
| /packages/apps/Camera2/tests_camera/src/com/android/camera/unittest/ |
| CameraUnitTest.java | 21 import android.graphics.Matrix;
73 Matrix matrix = new Matrix(); local
77 CameraUtil.prepareMatrix(matrix, false, 0, 800, 480);
80 matrix.mapPoints(points);
83 CameraUtil.prepareMatrix(matrix, false, 90, 800, 480);
86 matrix.mapPoints(points);
89 CameraUtil.prepareMatrix(matrix, false, 180, 800, 480);
92 matrix.mapPoints(points)
[all...] |
| /packages/apps/Gallery2/jni/filters/ |
| hue.c | 19 void JNIFUNCF(ImageFilterHue, nativeApplyFilter, jobject bitmap, jint width, jint height, jfloatArray matrix)
26 jfloat* mat = (*env)->GetFloatArrayElements(env, matrix,0);
43 (*env)->ReleaseFloatArrayElements(env, matrix, mat, 0);
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/ |
| ImageVignette.java | 21 import android.graphics.Matrix;
50 Matrix mToScr;
51 Matrix mToImage;
62 public void setTransform(Matrix toScr, Matrix toImage, int imgWidth, int imgHeight) {
166 mElipse.setScrImageInfo(new Matrix(),
201 Matrix toImg = getScreenToImageMatrix(false);
202 Matrix toScr = new Matrix();
230 Matrix toImg = getScreenToImageMatrix(false)
[all...] |
| /packages/apps/LegacyCamera/tests/src/com/android/camera/unittest/ |
| CameraTest.java | 23 import android.graphics.Matrix;
77 Matrix matrix = new Matrix(); local
81 Util.prepareMatrix(matrix, false, 0, 800, 480);
84 matrix.mapPoints(points);
87 Util.prepareMatrix(matrix, false, 90, 800, 480);
90 matrix.mapPoints(points);
93 Util.prepareMatrix(matrix, false, 180, 800, 480);
96 matrix.mapPoints(points)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/gdiplus/ |
| gdipluspen.h | 192 Status GetTransform(Matrix *matrix) const
196 matrix ? matrix->nativeMatrix : NULL));
204 Status MultiplyTransform(const Matrix *matrix,
209 matrix ? matrix->nativeMatrix : NULL, order));
305 Status SetTransform(const Matrix *matrix)
[all...] |
| /external/eigen/test/ |
| array_for_matrix.cpp | 16 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> ColVectorType;
17 typedef Matrix<Scalar, 1, MatrixType::ColsAtCompileTime> RowVectorType;
34 VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1);
35 VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,s2) );
38 VERIFY_IS_APPROX(m3, (m1.array() + s2).matrix());
41 VERIFY_IS_APPROX(m3, (m1.array() - s1).matrix());
65 const Scalar& ref_m1 = m.matrix().array().coeffRef(0);
66 const Scalar& ref_m2 = m.matrix().array().coeffRef(0,0);
67 const Scalar& ref_a1 = m.array().matrix().coeffRef(0);
68 const Scalar& ref_a2 = m.array().matrix().coeffRef(0,0)
[all...] |
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 20 * \brief LU decomposition of a matrix with partial pivoting, and related features
22 * \param MatrixType the type of the matrix of which we are computing the LU decomposition
24 * This class represents a LU decomposition of a \b square \b invertible matrix, with partial pivoting: the matrix A
26 * is a permutation matrix.
29 * matrices. Thus LAPACK's dgesv and dgesvx require the matrix to be square and invertible. The present class
30 * does the same. It will assert that the matrix is square, but it won't (actually it can't) check that the
31 * matrix is invertible: it is your task to check that you only use this decomposition on invertible matrices.
41 * On the other hand, it is \b not suitable to determine whether a given matrix is invertible.
85 * \param matrix the matrix of which to compute the LU decomposition
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseSelfAdjointView.h | 18 * \brief Pseudo expression to manipulate a triangular sparse matrix as a selfadjoint matrix.
20 * \param MatrixType the type of the dense matrix storing the coefficients
23 * This class is an expression of a sefladjoint matrix from a triangular part of a matrix
56 typedef Matrix<Index,Dynamic,1> VectorI;
60 inline SparseSelfAdjointView(const MatrixType& matrix) : m_matrix(matrix)
68 /** \internal \returns a reference to the nested matrix */
69 const _MatrixTypeNested& matrix() const { return m_matrix; function in class:Eigen::SparseSelfAdjointView
70 _MatrixTypeNested& matrix() { return m_matrix.const_cast_derived(); } function in class:Eigen::SparseSelfAdjointView
[all...] |
| /external/eigen/debug/msvc/ |
| eigen.natvis | 5 <!-- Fixed x Fixed Matrix -->
6 <Type Name="Eigen::Matrix<*,*,*,*,*,*>">
8 <DisplayString>[{$T2}, {$T3}] (fixed matrix)</DisplayString>
24 <!-- 2 x 2 Matrix -->
25 <Type Name="Eigen::Matrix<*,2,2,*,*,*>">
27 <DisplayString>[2, 2] (fixed matrix)</DisplayString>
44 <!-- 3 x 3 Matrix -->
45 <Type Name="Eigen::Matrix<*,3,3,*,*,*>">
47 <DisplayString>[3, 3] (fixed matrix)</DisplayString>
70 <!-- 4 x 4 Matrix -->
[all...] |
| /external/chromium-trace/trace-viewer/third_party/gl-matrix/spec/gl-matrix/ |
| mat2-spec.js | 42 it("should return a 4 element array initialized to a 2x2 identity matrix", function() { expect(result).toBeEqualish(identity); });
63 describe("with a separate output matrix", function() {
71 describe("when matA is the output matrix", function() {
80 describe("with a separate output matrix", function() {
88 describe("when matA is the output matrix", function() {
97 describe("with a separate output matrix", function() {
105 describe("when matA is the output matrix", function() {
122 describe("with a separate output matrix", function() {
131 describe("when matA is the output matrix", function() {
139 describe("when matB is the output matrix", function()
[all...] |
| /external/chromium_org/third_party/skia/bench/ |
| ColorFilterBench.cpp | 32 SkScalar matrix[20] = { 1, 0, 0, 0, amount255, local
36 SkAutoTUnref<SkColorFilter> filter(SkColorMatrixFilter::Create(matrix));
41 SkScalar matrix[20]; local
42 memset(matrix, 0, 20 * sizeof(SkScalar));
43 matrix[0] = matrix[5] = matrix[10] = 0.2126f;
44 matrix[1] = matrix[6] = matrix[11] = 0.7152f
[all...] |
| /external/skia/bench/ |
| ColorFilterBench.cpp | 32 SkScalar matrix[20] = { 1, 0, 0, 0, amount255, local
36 SkAutoTUnref<SkColorFilter> filter(SkColorMatrixFilter::Create(matrix));
41 SkScalar matrix[20]; local
42 memset(matrix, 0, 20 * sizeof(SkScalar));
43 matrix[0] = matrix[5] = matrix[10] = 0.2126f;
44 matrix[1] = matrix[6] = matrix[11] = 0.7152f
[all...] |
| /external/eigen/Eigen/src/LU/arch/ |
| Inverse_SSE.h | 12 // The SSE code for the 4x4 float and double matrix inverse in this file
14 // http://software.intel.com/en-us/articles/optimized-matrix-library-for-use-with-the-intel-pentiumr-4-processors-sse2-instructions/
43 static void run(const MatrixType& matrix, ResultType& result)
47 // Load the full matrix into registers
48 __m128 _L1 = matrix.template packet<MatrixAlignment>( 0);
49 __m128 _L2 = matrix.template packet<MatrixAlignment>( 4);
50 __m128 _L3 = matrix.template packet<MatrixAlignment>( 8);
51 __m128 _L4 = matrix.template packet<MatrixAlignment>(12);
54 // original matrix is divide into four 2x2 sub-matrices. Since each
55 // register holds four matrix element, the smaller matrices ar
[all...] |
| /external/ceres-solver/internal/ceres/ |
| small_blas_test.cc | 43 Matrix A(kRowA, kColA);
48 Matrix B(kRowB, kColB);
53 Matrix C(row_stride_c, col_stride_c);
56 Matrix C_plus = C;
57 Matrix C_minus = C;
58 Matrix C_assign = C;
60 Matrix C_plus_ref = C;
61 Matrix C_minus_ref = C;
62 Matrix C_assign_ref = C;
126 Matrix A(kRowA, kColA)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/svg/ |
| SVGTextElement.cpp | 42 AffineTransform matrix; local
52 matrix = t.toAffineTransform();
54 transform()->currentValue()->concatenate(matrix);
59 return *transform * matrix;
60 return matrix;
|
| /external/chromium_org/third_party/skia/src/animator/ |
| SkDraw3D.cpp | 55 SkMatrix matrix; local
56 fCamera.patchToMatrix(patch->fPatch, &matrix);
57 matrix.preTranslate(hackWidth / 2, -hackHeight / 2);
58 matrix.postTranslate(hackWidth / 2, hackHeight / 2);
59 maker.fCanvas->concat(matrix);
|
| /external/eigen/Eigen/src/Core/ |
| DiagonalMatrix.h | 36 typedef Matrix<Scalar, RowsAtCompileTime, ColsAtCompileTime, 0, MaxRowsAtCompileTime, MaxColsAtCompileTime> DenseMatrixType;
59 /** \returns the diagonal matrix product of \c *this by the matrix \a matrix.
63 operator*(const MatrixBase<MatrixDerived> &matrix) const
65 return DiagonalProduct<MatrixDerived, Derived, OnTheLeft>(matrix.derived(), derived());
111 * \brief Represents a diagonal matrix with its storage
114 * \param SizeAtCompileTime the dimension of the matrix, or Dynamic
115 * \param MaxSizeAtCompileTime the dimension of the matrix, or Dynamic. This parameter is optional and defaults
124 : traits<Matrix<_Scalar,SizeAtCompileTime,SizeAtCompileTime,0,MaxSizeAtCompileTime,MaxSizeAtCompileTime>
[all...] |
| /external/eigen/Eigen/src/misc/ |
| Kernel.h | 24 typedef Matrix<
26 MatrixType::ColsAtCompileTime, // the number of rows in the "kernel matrix"
27 // is the number of cols of the original matrix
28 // so that the product "matrix * kernel = zero" makes sense
33 // whose dimension is the number of columns of the original matrix
|
| /external/eigen/doc/ |
| TutorialLinearAlgebra.dox | 7 \link TopicLinearAlgebraDecompositions catalogue \endlink of dense matrix decompositions.
13 \b The \b problem: You have a system of equations, that you have written as a single matrix equation
17 \b The \b solution: You can choose between various decompositions, depending on what your matrix \a A looks like,
29 matrix is of type Matrix3f, this line could have been replaced by:
37 depending on your matrix and the trade-off you want to make:
43 <th>Requirements on the matrix</th>
100 For example, if your matrix is positive definite, the above table says that a very good
102 matrix (not a vector) as right hand side is possible.
132 Make sure to check if your matrix is self-adjoint, as is often the case in these problems. Here's an example using
150 advantageously replaced by solve() operations, and the determinant is often \em not a good way of checking if a matrix
[all...] |
| /external/eigen/lapack/ |
| eigenvalues.cpp | 13 // computes an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges
59 if(UPLO(*uplo)==UP) mat = matrix(a,*n,*n,*lda).adjoint();
60 else mat = matrix(a,*n,*n,*lda);
69 matrix(a,*n,*n,*lda).setIdentity();
76 matrix(a,*n,*n,*lda) = eig.eigenvectors();
|
