| /frameworks/base/services/java/com/android/server/wm/ |
| WindowStateAnimator.java | 20 import android.graphics.Matrix;
[all...] |
| /external/ceres-solver/internal/ceres/ |
| gradient_checking_cost_function.cc | 111 vector<Matrix> term_jacobians(block_sizes.size());
112 vector<Matrix> finite_difference_jacobians(block_sizes.size());
|
| incomplete_lq_factorization_test.cc | 58 CompressedRowSparseMatrix matrix(1, 1, 1);
59 matrix.mutable_rows()[0] = 0;
60 matrix.mutable_rows()[1] = 1;
61 matrix.mutable_cols()[0] = 0;
62 matrix.mutable_values()[0] = 2;
65 IncompleteLQFactorization(matrix, 1, 0.0, 1, 0.0));
66 ExpectMatricesAreEqual(matrix, *l, 1e-16);
83 CompressedRowSparseMatrix matrix(10, 10, 100);
84 int* rows = matrix.mutable_rows();
85 int* cols = matrix.mutable_cols()
[all...] |
| triplet_sparse_matrix.cc | 182 void TripletSparseMatrix::ToDenseMatrix(Matrix* dense_matrix) const {
185 Matrix& m = *dense_matrix;
|
| /external/eigen/Eigen/src/Core/ |
| Array.h | 20 * The %Array class is very similar to the Matrix class. It provides
22 * %Array and the %Matrix class is primarily in the API: the API for the
24 * API for the %Matrix class provides easy access to linear-algebra
34 struct traits<Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > : traits<Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> >
79 * *this might be resized to match the dimensions of \a other. If *this was a null matrix (not already initialized),
104 * For dynamic-size matrices, creates an empty matrix of size 0. Does not allocate any array. Such a matrix
105 * is called a null matrix. This constructor is the unique way to create null matrices: resizing
106 * a matrix to 0 is not supported.
131 * constructor Matrix() instead
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointProduct.h | 15 * half of the selfadjoint matrix C.
30 typedef Map<const Matrix<Scalar,Dynamic,1> > OtherMap;
34 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), (UpLo==Lower ? size-i : (i+1)))
|
| /external/eigen/Eigen/src/Eigen2Support/Geometry/ |
| Hyperplane.h | 40 typedef Matrix<Scalar,AmbientDimAtCompileTime,1> VectorType;
41 typedef Matrix<Scalar,int(AmbientDimAtCompileTime)==Dynamic
189 /** Applies the transformation matrix \a mat to \c *this and returns a reference to \c *this.
191 * \param mat the Dim x Dim transformation matrix
192 * \param traits specifies whether the matrix \a mat represents an Isometry
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| 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
42 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> ColVector;
43 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> RowVector;
45 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MinSize> MatrixUType;
46 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, MatrixType::ColsAtCompileTime> MatrixVType;
47 typedef Matrix<Scalar, MinSize, 1> SingularValuesType;
53 SVD(const MatrixType& matrix)
54 : m_matU(matrix.rows(), (std::min)(matrix.rows(), matrix.cols()))
[all...] |
| /external/eigen/Eigen/src/Geometry/ |
| AngleAxis.h | 35 * but rather to make easier the creation of other rotation (Quaternion, rotation Matrix)
60 typedef Matrix<Scalar,3,3> Matrix3;
61 typedef Matrix<Scalar,3,1> Vector3;
82 /** Constructs and initialize the angle-axis rotation from a 3x3 rotation matrix. */
178 /** Set \c *this from a 3x3 rotation matrix \a mat.
190 * \brief Sets \c *this from a 3x3 rotation matrix.
199 /** Constructs and \returns an equivalent 3x3 rotation matrix.
|
| Hyperplane.h | 45 typedef Matrix<Scalar,AmbientDimAtCompileTime,1> VectorType;
46 typedef Matrix<Scalar,Index(AmbientDimAtCompileTime)==Dynamic
200 /** Applies the transformation matrix \a mat to \c *this and returns a reference to \c *this.
202 * \param mat the Dim x Dim transformation matrix
203 * \param traits specifies whether the matrix \a mat represents an #Isometry
|
| Translation.h | 39 typedef Matrix<Scalar,Dim,1> VectorType;
40 /** corresponding linear transformation matrix type */
41 typedef Matrix<Scalar,Dim,Dim> LinearMatrixType;
115 res.matrix().setZero();
118 res.matrix().row(Dim).setZero();
183 res.matrix().setZero();
196 res.matrix().setZero();
199 res.matrix().row(Dim).setZero();
|
| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD.h | 24 *** Their role is to reduce the problem of computing the SVD to the case of a square matrix.
75 typedef Matrix<Scalar, 1, RowsAtCompileTime, RowMajor, 1, MaxRowsAtCompileTime> WorkspaceType;
86 bool run(JacobiSVD<MatrixType, FullPivHouseholderQRPreconditioner>& svd, const MatrixType& matrix)
88 if(matrix.rows() > matrix.cols())
90 m_qr.compute(matrix);
91 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>();
117 typedef Matrix<Scalar, ColsAtCompileTime, RowsAtCompileTime, Options, MaxColsAtCompileTime, MaxRowsAtCompileTime>
130 bool run(JacobiSVD<MatrixType, FullPivHouseholderQRPreconditioner>& svd, const MatrixType& matrix)
[all...] |
| /external/eigen/bench/ |
| BenchSparseUtil.h | 23 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
24 typedef Matrix<Scalar,Dynamic,1> DenseVector;
86 typedef mtl::compressed2D<Scalar, mtl::matrix::parameters<mtl::tag::col_major> > MtlSparse;
87 typedef mtl::compressed2D<Scalar, mtl::matrix::parameters<mtl::tag::row_major> > MtlSparseRowMajor;
90 mtl::matrix::inserter<MtlSparse> ins(dst);
118 #include <boost/numeric/ublas/matrix.hpp>
|
| sparse_dense_product.cpp | 124 Map<Matrix<Scalar,Dynamic,1> >(&gmmV1[0], cols) = v1;
125 Map<Matrix<Scalar,Dynamic,1> >(&gmmV2[0], cols) = v2;
146 // Map<Matrix<Scalar,Dynamic,1> >(&gmmV1[0], cols) = v1;
147 // Map<Matrix<Scalar,Dynamic,1> >(&gmmV2[0], cols) = v2;
|
| /external/eigen/bench/btl/libs/eigen2/ |
| eigen2_interface.hh | 43 typedef Eigen::Matrix<real,SIZE,SIZE> gene_matrix;
44 typedef Eigen::Matrix<real,SIZE,1> gene_vector;
|
| /external/eigen/test/eigen2/ |
| eigen2_sparse_product.cpp | 20 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
21 typedef Matrix<Scalar,Dynamic,1> DenseVector;
23 // test matrix-matrix product
55 // test matrix - diagonal product
|
| /external/eigen/test/ |
| geo_alignedbox.cpp | 26 typedef Matrix<Scalar, BoxType::AmbientDimAtCompileTime, 1> VectorType;
75 typedef Matrix<Scalar, BoxType::AmbientDimAtCompileTime, 1> VectorType;
|
| qr_fullpivoting.cpp | 22 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> MatrixQType;
23 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> VectorType;
64 // let's build a matrix more stable to inverse
78 // now construct a matrix with prescribed determinant
|
| /external/eigen/unsupported/Eigen/src/BVH/ |
| KdBVH.h | 22 typedef Matrix<Scalar, Dim, 1> VectorType;
172 typedef Matrix<Scalar, Dim, 1> VectorType;
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| ConstrainedConjGrad.h | 45 * Compute the pseudo inverse of the non-square matrix C such that
57 typedef Matrix<Scalar,Dynamic,1> TmpVec;
112 typedef Matrix<Scalar,Dynamic,1> TmpVec;
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialSolver.h | 37 typedef Matrix<RootType,_Deg,1> RootsType;
319 * Currently a QR algorithm is used to compute the eigenvalues of the companion matrix of
336 typedef Matrix<Scalar,_Deg,_Deg> CompanionMatrixType;
|
| /external/eigen/unsupported/test/ |
| kronecker_product.cpp | 87 // DM = dense matrix; SM = sparse matrix
88 Matrix<double, 2, 3> DM_a;
107 Matrix<double, 6, 6> DM_fix_ab;
|
| /frameworks/base/libs/hwui/ |
| Android.mk | 29 Matrix.cpp \
|
| /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/ |
| CropFilter.java | 21 import android.graphics.Matrix;
129 Matrix transform = Quad.getTransform(sourceQuad, targetQuad);
|
| /packages/apps/Camera2/src/com/android/camera/util/ |
| CameraUtil.java | 30 import android.graphics.Matrix;
186 Matrix m = new Matrix();
691 public static void prepareMatrix(Matrix matrix, boolean mirror, int displayOrientation,
694 matrix.setScale(mirror ? -1 : 1, 1);
696 matrix.postRotate(displayOrientation);
699 matrix.postScale(viewWidth / 2000f, viewHeight / 2000f);
700 matrix.postTranslate(viewWidth / 2f, viewHeight / 2f);
703 public static void prepareMatrix(Matrix matrix, boolean mirror, int displayOrientation
[all...] |
