| /external/eigen/bench/ |
| benchEigenSolver.cpp | 43 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;
201 benchEigenSolver(Matrix<Scalar,Dynamic,Dynamic>(dynsizes[i],dynsizes[i]));
203 benchEigenSolver(Matrix<Scalar,2,2>());
204 benchEigenSolver(Matrix<Scalar,3,3>());
205 benchEigenSolver(Matrix<Scalar,4,4>());
206 benchEigenSolver(Matrix<Scalar,6,6>());
207 benchEigenSolver(Matrix<Scalar,8,8>());
208 benchEigenSolver(Matrix<Scalar,12,12>());
209 benchEigenSolver(Matrix<Scalar,16,16>());
|
| /external/eigen/blas/ |
| PackedSelfadjointProduct.h | 15 /* Optimized matrix += alpha * uv'
16 * The matrix is in packed form.
27 typedef Map<const Matrix<Scalar,Dynamic,1> > OtherMap;
33 Map<Matrix<Scalar,Dynamic,1> >(mat, UpLo==Lower ? size-i : (i+1)) += alpha * cj(vec[i]) * ConjRhsType(OtherMap(vec+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)));
|
| /external/eigen/doc/examples/ |
| Tutorial_ArrayClass_interop_matrix.cpp | 19 cout << "-- Matrix m*n: --" << endl << result << endl << endl;
|
| class_FixedBlock.cpp | 25 cout << "Now the matrix m is:" << endl << m << endl;
|
| class_FixedVectorBlock.cpp | 22 Matrix<int,1,6> v; v << 1,2,3,4,5,6;
|
| function_taking_ref.cpp | 15 cout << "matrix m:" << endl << m << endl << endl;
|
| tut_matrix_coefficient_accessors.cpp | 13 std::cout << "Here is the matrix m:\n" << m << std::endl;
|
| /external/eigen/doc/snippets/ |
| MatrixBase_eval.cpp | 4 cout << "Here is the matrix m:" << endl << m << endl;
|
| TopicAliasing_cwise.cpp | 3 cout << "Here is the matrix mat:\n" << mat << endl << endl;
|
| /external/eigen/test/ |
| array_replicate.cpp | 19 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
20 typedef Matrix<Scalar, Dynamic, Dynamic> MatrixX;
21 typedef Matrix<Scalar, Dynamic, 1> VectorX;
62 CALL_SUBTEST_1( replicate(Matrix<float, 1, 1>()) );
|
| qr_fullpivoting.cpp | 22 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> MatrixQType;
65 // let's build a matrix more stable to inverse
79 // now construct a matrix with prescribed determinant
133 CALL_SUBTEST_7((FullPivHouseholderQR<Matrix<float,10,20> >(10,20)));
134 CALL_SUBTEST_7((FullPivHouseholderQR<Matrix<float,10,20> >(Matrix<float,10,20>::Random())));
135 CALL_SUBTEST_7((FullPivHouseholderQR<Matrix<float,20,10> >(20,10)));
136 CALL_SUBTEST_7((FullPivHouseholderQR<Matrix<float,20,10> >(Matrix<float,20,10>::Random())));
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMcovar.h | 21 Matrix< Scalar, Dynamic, Dynamic > &r,
35 Matrix< Scalar, Dynamic, 1 > wa(n);
59 /* form the full lower triangle of the covariance matrix */
76 /* symmetrize the covariance matrix in r. */
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| covar.h | 7 Matrix< Scalar, Dynamic, Dynamic > &r,
22 Matrix< Scalar, Dynamic, 1 > wa(n);
46 /* form the full lower triangle of the covariance matrix */
63 /* symmetrize the covariance matrix in r. */
|
| /external/eigen/unsupported/doc/examples/ |
| MatrixSine.cpp | 17 // The matrix functions satisfy sin^2(A) + cos^2(A) = I,
|
| MatrixSinh.cpp | 17 // The matrix functions satisfy cosh^2(A) - sinh^2(A) = I,
|
| PolynomialUtils1.cpp | 11 Eigen::Matrix<double,5,1> polynomial;
|
| /external/eigen/unsupported/test/ |
| polynomialutils.cpp | 32 typedef Matrix<_Scalar,Dim::ret,1> PolynomialType;
33 typedef Matrix<_Scalar,_Deg,1> EvalRootsType;
70 typedef Matrix<_Scalar,Dim::ret,1> PolynomialType;
71 typedef Matrix<_Scalar,_Deg,1> EvalRootsType;
|
| /external/mesa3d/src/gallium/auxiliary/vl/ |
| vl_idct.h | 54 struct pipe_sampler_view *matrix; member in struct:vl_idct
72 struct pipe_sampler_view *source, *matrix; member in struct:vl_idct_buffer::__anon30971::__anon30972
78 /* upload the idct matrix, which can be shared by all idct instances of a pipe */
95 struct pipe_sampler_view *matrix,
|
| /external/mesa3d/src/gallium/state_trackers/vega/ |
| vgu.c | 30 #include "matrix.h"
364 VGfloat * matrix)
366 struct matrix mat;
368 if (!matrix || !is_aligned(matrix))
381 memcpy(matrix, mat.m, sizeof(VGfloat) * 9);
390 VGfloat * matrix)
392 struct matrix mat;
394 if (!matrix || !is_aligned(matrix))
[all...] |
| /external/opencv/cvaux/src/ |
| _cvvm.h | 56 /* Scanline section. Find coordinates by fundamental matrix */
122 /*============================== Fundamental Matrix Functions ==========================*/
143 CvStatus icvGetCoefficient( CvMatrix3* matrix,
149 CvStatus icvGetCoefficientDefault( CvMatrix3* matrix,
155 CvStatus icvGetCoefficientStereo( CvMatrix3* matrix,
164 CvStatus icvGetCoefficientOrto( CvMatrix3* matrix,
181 CvMatrix3* matrix,
191 CvMatrix3* matrix,
200 CvMatrix3* matrix,
206 CvMatrix3* matrix,
[all...] |
| /external/pixman/pixman/ |
| Android.mk | 13 pixman-matrix.c
|
| /external/skia/src/core/ |
| SkBitmapProcShader.cpp | 74 static bool only_scale_and_translate(const SkMatrix& matrix) {
76 return (matrix.getType() & ~mask) == 0;
106 // Do this first, so we know the matrix can be inverted.
319 // communicates between its matrix-proc and its sampler-proc. Until we can
388 SkMatrix matrix; local
389 matrix.setIDiv(fRawBitmap.width(), fRawBitmap.height());
402 matrix.preConcat(lmInverse);
410 // we check the matrix scale factors to determine how to interpret the filter quality setting.
423 SkMatrix matrix; local
424 matrix.setConcat(context->getMatrix(), this->getLocalMatrix())
434 SkMatrix matrix; local
[all...] |
| /external/skia/src/gpu/gl/ |
| GrGLUniformManager.cpp | 173 void GrGLUniformManager::setMatrix3f(UniformHandle u, const GrGLfloat matrix[]) const {
180 GR_GL_CALL(fGpu->glInterface(), UniformMatrix3fv(uni.fFSLocation, 1, false, matrix));
183 GR_GL_CALL(fGpu->glInterface(), UniformMatrix3fv(uni.fVSLocation, 1, false, matrix));
187 void GrGLUniformManager::setMatrix4f(UniformHandle u, const GrGLfloat matrix[]) const {
193 GR_GL_CALL(fGpu->glInterface(), UniformMatrix4fv(uni.fFSLocation, 1, false, matrix));
196 GR_GL_CALL(fGpu->glInterface(), UniformMatrix4fv(uni.fVSLocation, 1, false, matrix));
236 void GrGLUniformManager::setSkMatrix(UniformHandle u, const SkMatrix& matrix) const {
238 matrix.get(SkMatrix::kMScaleX),
239 matrix.get(SkMatrix::kMSkewY),
240 matrix.get(SkMatrix::kMPersp0)
[all...] |
| /external/srec/srec/include/ |
| pre_desc.h | 153 imeldata **matrix; /* linear transformation matrix */ member in struct:__anon34840
155 covdata **imelda; /* linear transformation matrix, PMC or RN */
156 imeldata **invmat; /* inverse transformation matrix */
158 covdata **inverse; /* inverse linear transformation matrix, PMC or RN */
183 imeldata **pmc_fixmat; /* ENC matrix */
184 imeldata **pmc_fixinv; /* inverse ENC matrix */
185 covdata **pmc_matrix; /* ENC matrix in float */
186 covdata **pmc_inverse; /* inverse ENC matrix in float */
|
| /external/valgrind/main/drd/tests/ |
| matinv.c | 1 /** Compute the matrix inverse via Gauss-Jordan elimination.
53 /** Allocate memory for a matrix with the specified number of rows and
63 /** Free the memory that was allocated for a matrix. */
69 /** Fill in some numbers in a matrix. */
82 /** Print all elements of a matrix. */
98 /** Copy a subset of the elements of a matrix into another matrix. */
134 /** Compute the matrix product of a1 and a2. */
162 /** Apply the Gauss-Jordan elimination algorithm on the matrix p->a starting
165 * initialized with. If the matrix p->a is nonsingular, and if matrix p->
[all...] |
