| /external/eigen/Eigen/src/Core/ |
| ReturnByValue.h | 37 * So the only way that nesting it in an expression can work, is by evaluating it into a plain matrix.
38 * So internal::nested always gives the plain return matrix type.
|
| /external/eigen/Eigen/src/Householder/ |
| BlockHouseholder.h | 51 Matrix<typename MatrixType::Scalar, TFactorSize, TFactorSize> T(nbVecs,nbVecs);
57 Matrix<typename MatrixType::Scalar,VectorsType::ColsAtCompileTime,MatrixType::ColsAtCompileTime,0,
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrix.h | 19 * \brief A versatible sparse matrix representation
27 * A call to the function makeCompressed() turns the matrix into the standard \em compressed format
110 Eigen::Map<Matrix<Index,Dynamic,1> > innerNonZeros() { return Eigen::Map<Matrix<Index,Dynamic,1> >(m_innerNonZeros, m_innerNonZeros?m_outerSize:0); }
111 const Eigen::Map<const Matrix<Index,Dynamic,1> > innerNonZeros() const { return Eigen::Map<const Matrix<Index,Dynamic,1> >(m_innerNonZeros, m_innerNonZeros?m_outerSize:0); }
118 /** \returns the number of rows of the matrix */
120 /** \returns the number of columns of the matrix */
123 /** \returns the number of rows (resp. columns) of the matrix if the storage order column major (resp. row major) */
125 /** \returns the number of columns (resp. rows) of the matrix if the storage order column major (resp. row major) *
[all...] |
| /external/eigen/bench/btl/actions/ |
| action_rot.hh | 36 // STL matrix and vector initialization
41 // generic matrix and vector initialization
|
| /external/eigen/blas/ |
| ctpsv.f | 18 * non-unit, upper or lower triangular matrix, supplied in packed form.
27 * On entry, UPLO specifies whether the matrix is an upper or
28 * lower triangular matrix as follows:
30 * UPLO = 'U' or 'u' A is an upper triangular matrix.
32 * UPLO = 'L' or 'l' A is a lower triangular matrix.
60 * On entry, N specifies the order of the matrix A.
67 * contain the upper triangular matrix packed sequentially,
72 * contain the lower triangular matrix packed sequentially,
|
| dtpsv.f | 18 * non-unit, upper or lower triangular matrix, supplied in packed form.
27 * On entry, UPLO specifies whether the matrix is an upper or
28 * lower triangular matrix as follows:
30 * UPLO = 'U' or 'u' A is an upper triangular matrix.
32 * UPLO = 'L' or 'l' A is a lower triangular matrix.
60 * On entry, N specifies the order of the matrix A.
67 * contain the upper triangular matrix packed sequentially,
72 * contain the lower triangular matrix packed sequentially,
|
| stpsv.f | 18 * non-unit, upper or lower triangular matrix, supplied in packed form.
27 * On entry, UPLO specifies whether the matrix is an upper or
28 * lower triangular matrix as follows:
30 * UPLO = 'U' or 'u' A is an upper triangular matrix.
32 * UPLO = 'L' or 'l' A is a lower triangular matrix.
60 * On entry, N specifies the order of the matrix A.
67 * contain the upper triangular matrix packed sequentially,
72 * contain the lower triangular matrix packed sequentially,
|
| ztpsv.f | 18 * non-unit, upper or lower triangular matrix, supplied in packed form.
27 * On entry, UPLO specifies whether the matrix is an upper or
28 * lower triangular matrix as follows:
30 * UPLO = 'U' or 'u' A is an upper triangular matrix.
32 * UPLO = 'L' or 'l' A is a lower triangular matrix.
60 * On entry, N specifies the order of the matrix A.
67 * contain the upper triangular matrix packed sequentially,
72 * contain the lower triangular matrix packed sequentially,
|
| /external/eigen/doc/ |
| B01_Experimental.dox | 35 \li Matrix
42 \li Matrix : full API stability (except for experimental stuff inherited from MatrixBase)
|
| /external/eigen/lapack/ |
| cholesky.cpp | 13 // POTRF computes the Cholesky factorization of a real symmetric positive definite matrix A.
39 // positive definite matrix A using the Cholesky factorization
|
| /external/eigen/test/eigen2/ |
| eigen2_parametrizedline.cpp | 25 typedef Matrix<Scalar, LineType::AmbientDimAtCompileTime, 1> VectorType;
26 typedef Matrix<Scalar, LineType::AmbientDimAtCompileTime,
|
| eigen2_qr.cpp | 22 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, MatrixType::ColsAtCompileTime> SquareMatrixType;
23 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> VectorType;
|
| eigen2_sparse_vector.cpp | 16 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
17 typedef Matrix<Scalar,Dynamic,1> DenseVector;
|
| /external/eigen/test/ |
| prec_inverse_4x4.cpp | 63 CALL_SUBTEST_2((inverse_permutation_4x4<Matrix<double,4,4,RowMajor> >()));
64 CALL_SUBTEST_2(( inverse_general_4x4<Matrix<double,4,4,RowMajor> >(200000 * g_repeat) ));
|
| product_mmtr.cpp | 24 typedef Matrix<Scalar,Dynamic,Dynamic,ColMajor> MatrixColMaj;
25 typedef Matrix<Scalar,Dynamic,Dynamic,RowMajor> MatrixRowMaj;
|
| /external/eigen/unsupported/Eigen/ |
| OpenGLSupport | 144 template<typename Scalar> void glScale(const UniformScaling<Scalar>& s) { glScale(Matrix<Scalar,3,1>::Constant(s.factor())); }
164 template<typename Scalar> void glMultMatrix(const Transform<Scalar,3,Affine>& t) { glMultMatrix(t.matrix()); }
165 template<typename Scalar> void glMultMatrix(const Transform<Scalar,3,Projective>& t) { glMultMatrix(t.matrix()); }
166 template<typename Scalar> void glMultMatrix(const Transform<Scalar,3,AffineCompact>& t) { glMultMatrix(Transform<Scalar,3,Affine>(t).matrix()); }
172 template<typename Scalar> void glLoadMatrix(const Transform<Scalar,3,Affine>& t) { glLoadMatrix(t.matrix()); }
173 template<typename Scalar> void glLoadMatrix(const Transform<Scalar,3,Projective>& t) { glLoadMatrix(t.matrix()); }
174 template<typename Scalar> void glLoadMatrix(const Transform<Scalar,3,AffineCompact>& t) { glLoadMatrix(Transform<Scalar,3,Affine>(t).matrix()); }
188 glMultMatrix(tr.matrix());
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineProduct.h | 137 //Use matrix diagonal part <- Improvement : use inner iterator on dense matrix.
143 //Use matrix lower triangular part
163 //Use matrix upper triangular part
200 //Use matrix diagonal part <- Improvement : use inner iterator on dense matrix.
207 //Use matrix upper triangular part
228 //Use matrix lower triangular part
|
| /external/eigen/unsupported/test/ |
| alignedvector3.cpp | 18 typedef Matrix<Scalar,3,1> RefType;
19 typedef Matrix<Scalar,3,3> Mat33;
|
| /external/mesa3d/src/gallium/state_trackers/vega/ |
| bezier.h | 31 struct matrix;
61 struct matrix *mat);
|
| image.h | 82 void image_draw(struct vg_image *img, struct matrix *matrix);
|
| /external/opencv/cv/src/ |
| cvposit.cpp | 61 /* buffer for inverse matrix = N*3*float */
103 * Compute pseudoinverse matrix *
253 // Purpose: Pseudoinverse N x 3 matrix N >= 3
256 // a - input matrix
262 // Notes: Both matrix are stored by n-dimensional vectors.
280 /* compute matrix ata = transpose(a) * a */
295 /* inverse matrix ata */
312 /* compute resultant matrix */
|
| /external/opencv/otherlibs/highgui/ |
| loadsave.cpp | 392 CvMat hdr, *matrix = 0; local
442 CV_CALL( matrix = cvCreateMat( size.height, size.width, CV_MAKETYPE(type, cn) ));
452 matrix = cvGetMat( image, &hdr );
455 if( !reader->ReadData( matrix->data.ptr, matrix->step, iscolor ))
458 cvReleaseMat( &matrix );
471 cvReleaseMat( &matrix );
476 return load_as_matrix ? (void*)matrix : (void*)image;
|
| /external/skia/bench/ |
| BitmapRectBench.cpp | 80 // want enough to create a scale matrix, but not enough to scare
81 // off our sniffer which tries to see if the matrix is "effectively"
|
| DashBench.cpp | 159 SkMatrix matrix; local
160 matrix.setScale(SkIntToScalar(100), SkIntToScalar(100));
161 path->transform(matrix);
348 SkMatrix matrix; local
352 matrix.setIdentity();
355 matrix.setRotate(90, cx, cy);
358 matrix.setRotate(45, cx, cy);
369 matrix.mapPoints(fPts, pts, 2);
|
| /external/skia/gm/ |
| imagefiltersgraph.cpp | 70 SkScalar matrix[20] = { SK_Scalar1, 0, 0, 0, 0, local
75 SkAutoTUnref<SkColorFilter> matrixFilter(new SkColorMatrixFilter(matrix));
|
