| /external/eigen/unsupported/test/ |
| autodiff.cpp | 39 typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;
40 typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;
41 typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;
52 void operator() (const Matrix<T,InputsAtCompileTime,1>& x, Matrix<T,ValuesAtCompileTime,1>* _v) const
54 Matrix<T,ValuesAtCompileTime,1>& v = *_v;
145 typedef Matrix<AD,2,1> VectorAD;
|
| NumericalDiff.cpp | 20 typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;
21 typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;
22 typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;
|
| /external/ceres-solver/internal/ceres/ |
| normal_prior_test.cc | 47 void RandomMatrix(Matrix* m) {
63 Matrix A(num_rows, num_cols);
100 Matrix A(num_rows, num_cols);
|
| block_sparse_matrix.h | 51 // initialize the matrix. For details on how the blocks structure of
52 // the matrix is stored please see the documentation
58 // Construct a block sparse matrix with a fully initialized
59 // CompressedRowBlockStructure objected. The matrix takes over
75 virtual void ToDenseMatrix(Matrix* dense_matrix) const;
84 void ToTripletSparseMatrix(TripletSparseMatrix* matrix) const;
|
| dense_sparse_matrix.h | 31 // A dense matrix implemented under the SparseMatrix interface.
49 // Build a matrix with the same content as the TripletSparseMatrix
65 virtual void ToDenseMatrix(Matrix* dense_matrix) const;
73 ConstColMajorMatrixRef matrix() const;
79 // Original matrix:
95 // diagonal to a matrix that already has an appended diagonal, and it is also
96 // a fatal error to remove a diagonal from a matrix that has none.
|
| normal_prior.cc | 42 NormalPrior::NormalPrior(const Matrix& A, const Vector& b)
|
| runtime_numeric_diff_cost_function.cc | 56 using Eigen::Matrix;
60 typedef Matrix<double, Dynamic, 1> ResidualVector;
61 typedef Matrix<double, Dynamic, 1> ParameterVector;
62 typedef Matrix<double, Dynamic, Dynamic, RowMajor> JacobianMatrix;
|
| /external/eigen/test/eigen2/ |
| eigen2_svd.cpp | 24 Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> b =
25 Matrix<Scalar, MatrixType::RowsAtCompileTime, 1>::Random(rows,1);
26 Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> x(cols,1), x2(cols,1);
|
| eigen2_adjoint.cpp | 20 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
21 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;
91 CALL_SUBTEST_1( adjoint(Matrix<float, 1, 1>()) );
98 // test a large matrix only once
99 CALL_SUBTEST_7( adjoint(Matrix<float, 100, 100>()) );
|
| /external/llvm/lib/CodeGen/ |
| RegAllocBase.cpp | 60 Matrix = &mat;
95 Matrix->invalidateVirtRegs();
127 Matrix->assign(*VirtReg, AvailablePhysReg);
|
| /frameworks/base/tests/HwAccelerationTest/src/com/android/test/hwui/ |
| Alpha8BitmapActivity.java | 25 import android.graphics.Matrix;
81 Matrix matrix = new Matrix(); local
82 matrix.setScale(2.0f, 2.0f);
83 matrix.postTranslate(0.0f, mBitmap1.getHeight());
84 canvas.drawBitmap(mBitmap1, matrix, mBitmapPaint);
|
| /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/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...] |
| /packages/apps/UnifiedEmail/src/com/android/mail/photomanager/ |
| BitmapUtil.java | 20 import android.graphics.Matrix;
143 final Matrix m = new Matrix();
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixSquareRoot.h | 16 * \brief Class for computing matrix square roots of upper quasi-triangular matrices.
17 * \tparam MatrixType type of the argument of the matrix square root,
18 * expected to be an instantiation of the Matrix class template.
21 * matrix stored in the upper Hessenberg part of the matrix passed to
33 * \param[in] A upper quasi-triangular matrix whose square root
45 /** \brief Compute the matrix square root
96 // pre: T is quasi-upper-triangular and sqrtT is a zero matrix of the same size
150 Matrix<Scalar,2,2> block = T.template block<2,2>(i,i);
151 EigenSolver<Matrix<Scalar,2,2> > es(block)
[all...] |
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| Matrix_ScaleToFitTest.java | 19 import android.graphics.Matrix.ScaleToFit;
|
| /external/ceres-solver/examples/ |
| nist.cc | 124 typedef Eigen::Matrix<double, Dynamic, 1> Vector;
125 typedef Eigen::Matrix<double, Dynamic, Dynamic, RowMajor> Matrix;
239 Matrix initial_parameters(int start) const { return initial_parameters_.row(start); }
240 Matrix final_parameters() const { return final_parameters_; }
241 Matrix predictor() const { return predictor_; }
242 Matrix response() const { return response_; }
251 Matrix predictor_;
252 Matrix response_;
253 Matrix initial_parameters_
[all...] |
| /external/ceres-solver/include/ceres/internal/ |
| numeric_diff.h | 96 using Eigen::Matrix;
100 typedef Matrix<double, kNumResiduals, 1> ResidualVector;
101 typedef Matrix<double, kParameterBlockSize, 1> ParameterVector;
102 typedef Matrix<double, kNumResiduals, kParameterBlockSize,
|
| /external/eigen/Eigen/src/SVD/ |
| UpperBidiagonalization.h | 32 typedef Matrix<Scalar, 1, ColsAtCompileTime> RowVectorType;
33 typedef Matrix<Scalar, RowsAtCompileTime, 1> ColVectorType;
35 typedef Matrix<Scalar, ColsAtCompileTime, 1> DiagVectorType;
36 typedef Matrix<Scalar, ColsAtCompileTimeMinusOne, 1> SuperDiagVectorType;
55 UpperBidiagonalization(const MatrixType& matrix)
56 : m_householder(matrix.rows(), matrix.cols()),
57 m_bidiagonal(matrix.cols(), matrix.cols()),
60 compute(matrix);
[all...] |
| /external/eigen/bench/ |
| basicbenchmark.cpp | 10 // this is the list of matrix type and size we want to bench:
11 // ((suffix) (matrix size) (number of iterations))
25 BOOST_PP_CAT(Matrix, BOOST_PP_SEQ_HEAD(EL)) (\
|
| vdw_new.cpp | 18 typedef Matrix<SCALAR, Eigen::Dynamic, 1> Vec;
|
| /external/eigen/blas/ |
| BandTriangularSolver.h | 16 * Solve Ax=b with A a band triangular matrix
25 typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,RowMajor>, 0, OuterStride<> > LhsMap;
26 typedef Map<Matrix<RhsScalar,Dynamic,1> > RhsMap;
61 typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > LhsMap;
62 typedef Map<Matrix<RhsScalar,Dynamic,1> > RhsMap;
|
| /external/eigen/doc/examples/ |
| class_VectorBlock.cpp | 22 Matrix<int,1,6> v; v << 1,2,3,4,5,6;
|
| /external/eigen/test/ |
| array_reverse.cpp | 20 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
112 CALL_SUBTEST_1( reverse(Matrix<float, 1, 1>()) );
119 CALL_SUBTEST_8( reverse(Matrix<float, 100, 100>()) );
120 CALL_SUBTEST_9( reverse(Matrix<float,Dynamic,Dynamic,RowMajor>(6,3)) );
|
