/external/eigen/doc/snippets/ |
H A D | TopicAliasing_mult1.cpp | 1 MatrixXf matA(2,2); 2 matA << 2, 0, 0, 2; 3 matA = matA * matA; 4 cout << matA; variable
|
H A D | TopicAliasing_mult3.cpp | 1 MatrixXf matA(2,2); 2 matA << 2, 0, 0, 2; 3 matA.noalias() = matA * matA; 4 cout << matA; variable
|
H A D | TopicAliasing_mult2.cpp | 1 MatrixXf matA(2,2), matB(2,2); 2 matA << 2, 0, 0, 2; 5 matB = matA * matA; 9 matB.noalias() = matA * matA;
|
H A D | Tutorial_AdvancedInitialization_Block.cpp | 1 MatrixXf matA(2, 2); 2 matA << 1, 2, 3, 4; 4 matB << matA, matA/10, matA/10, matA; variable
|
/external/chromium-trace/catapult/tracing/third_party/gl-matrix/spec/gl-matrix/ |
H A D | mat2-spec.js | 24 var out, matA, matB, identity, result; 27 matA = [1, 2, 46 beforeEach(function() { result = mat2.clone(matA); }); 47 it("should return a 4 element array initialized to the values in matA", function() { expect(result).toBeEqualish(matA); }); 51 beforeEach(function() { result = mat2.copy(out, matA); }); 52 it("should place values into out", function() { expect(out).toBeEqualish(matA); }); 64 beforeEach(function() { result = mat2.transpose(out, matA); }); 68 it("should not modify matA", function() { expect(matA) [all...] |
H A D | mat3-spec.js | 26 var out, matA, matB, identity, result; 29 matA = [1, 0, 0, 48 matA = [1, 0, 0, 0, 52 result = mat3.normalFromMat4(out, matA); 59 mat4.translate(matA, matA, [2, 4, 6]); 60 mat4.rotateX(matA, matA, Math.PI / 2); 62 result = mat3.normalFromMat4(out, matA); 73 mat4.scale(matA, mat [all...] |
H A D | mat2d-spec.js | 24 var out, matA, matB, identity, result; 27 matA = [1, 2, 58 beforeEach(function() { result = mat2d.clone(matA); }); 59 it("should return a 6 element array initialized to the values in matA", function() { expect(result).toBeEqualish(matA); }); 63 beforeEach(function() { result = mat2d.copy(out, matA); }); 64 it("should place values into out", function() { expect(out).toBeEqualish(matA); }); 76 beforeEach(function() { result = mat2d.invert(out, matA); }); 80 it("should not modify matA", function() { expect(matA) [all...] |
H A D | mat4-spec.js | 25 var out, matA, matB, identity, result; 29 matA = [1, 0, 0, 0, 56 beforeEach(function() { result = mat4.clone(matA); }); 57 it("should return a 16 element array initialized to the values in matA", function() { expect(result).toBeEqualish(matA); }); 61 beforeEach(function() { result = mat4.copy(out, matA); }); 62 it("should place values into out", function() { expect(out).toBeEqualish(matA); }); 74 beforeEach(function() { result = mat4.transpose(out, matA); }); 85 it("should not modify matA", function() { 86 expect(matA) [all...] |
H A D | vec2-spec.js | 405 var matA; 406 beforeEach(function() { matA = [1, 2, 3, 4]; }); 409 beforeEach(function() { result = vec2.transformMat2(out, vecA, matA); }); 414 it("should not modify matA", function() { expect(matA).toBeEqualish([1, 2, 3, 4]); }); 418 beforeEach(function() { result = vec2.transformMat2(vecA, vecA, matA); }); 422 it("should not modify matA", function() { expect(matA).toBeEqualish([1, 2, 3, 4]); }); 427 var matA; 428 beforeEach(function() { matA [all...] |
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | GeneralizedSelfAdjointEigenSolver.h | 83 * \param[in] matA Selfadjoint matrix in matrix pencil. 92 * generalized eigenproblem \f$ Ax = \lambda B x \f$ with \a matA the 107 GeneralizedSelfAdjointEigenSolver(const MatrixType& matA, const MatrixType& matB, argument 109 : Base(matA.cols()) 111 compute(matA, matB, options); 116 * \param[in] matA Selfadjoint matrix in matrix pencil. 130 * with \a matA the selfadjoint matrix \f$ A \f$ and \a matB the positive definite 154 GeneralizedSelfAdjointEigenSolver& compute(const MatrixType& matA, const MatrixType& matB, 164 compute(const MatrixType& matA, const MatrixType& matB, int options) argument 166 eigen_assert(matA [all...] |
H A D | HessenbergDecomposition.h | 270 static void _compute(MatrixType& matA, CoeffVectorType& hCoeffs, VectorType& temp); 280 * Performs a tridiagonal decomposition of \a matA in place. 282 * \param matA the input selfadjoint matrix 285 * The result is written in the lower triangular part of \a matA. 292 void HessenbergDecomposition<MatrixType>::_compute(MatrixType& matA, CoeffVectorType& hCoeffs, VectorType& temp) argument 294 eigen_assert(matA.rows()==matA.cols()); 295 Index n = matA.rows(); 303 matA.col(i).tail(remainingSize).makeHouseholderInPlace(h, beta); 304 matA [all...] |
H A D | Tridiagonalization.h | 26 void tridiagonalization_inplace(MatrixType& matA, CoeffVectorType& hCoeffs); 323 * Performs a tridiagonal decomposition of the selfadjoint matrix \a matA in-place. 325 * \param[in,out] matA On input the selfadjoint matrix. Only the \b lower triangular part is referenced. 331 * and lower sub-diagonal of the matrix \a matA. 339 * \f$ v_i = [ 0, \ldots, 0, 1, matA(i+2,i), \ldots, matA(N-1,i) ]^T \f$. 346 void tridiagonalization_inplace(MatrixType& matA, CoeffVectorType& hCoeffs) argument 352 Index n = matA.rows(); 353 eigen_assert(n==matA.cols()); 361 matA [all...] |
H A D | SelfAdjointEigenSolver.h | 333 SelfAdjointEigenSolver(const MatrixType& matA, const MatrixType& matB, bool computeEigenvectors = true) argument 334 : m_eivec(matA.cols(), matA.cols()), 335 m_eivalues(matA.cols()), 336 m_subdiag(matA.cols() > 1 ? matA.cols() - 1 : 1), 339 static_cast<GeneralizedSelfAdjointEigenSolver<MatrixType>*>(this)->compute(matA, matB, computeEigenvectors ? ComputeEigenvectors : EigenvaluesOnly); 347 void compute(const MatrixType& matA, const MatrixType& matB, bool computeEigenvectors = true) argument 349 compute(matA, matB, computeEigenvectors ? ComputeEigenvectors : EigenvaluesOnly); 374 * \param matA th [all...] |
/external/neven/Embedded/common/src/b_TensorEm/ |
H A D | Int32Mat.h | 106 * matA: the square matrix, array of size ( matWidthA * matWidthA ) 111 * tmpMatA: matrix of same size as matA 115 const int32* matA, 123 /** same as _solve(), but matA gets overwritten, and tmpMatA is not needed: 124 * saves memory when matA is large; 129 int32* matA,
|
H A D | Int32Mat.c | 210 const int32* matA, 218 bbs_memcpy32( tmpMatA, matA, ( matWidthA * matWidthA ) * bbs_SIZEOF32( int32 ) ); 232 int32* matA, 246 int32* matL = matA; 209 bts_Int32Mat_solve( struct bbs_Context* cpA, const int32* matA, int32 matWidthA, const int32* inVecA, int32* outVecA, int32 bbpA, int32* tmpMatA, int32* tmpVecA ) argument 231 bts_Int32Mat_solve2( struct bbs_Context* cpA, int32* matA, int32 matWidthA, const int32* inVecA, int32* outVecA, int32 bbpA, int32* tmpVecA ) argument
|
/external/eigen/Eigen/src/Eigen2Support/ |
H A D | SVD.h | 109 MatrixType matA(matrix); 124 m_sigma[k] = matA.col(k).end(m-k).norm(); 127 if (matA(k,k) < 0.0) 129 matA.col(k).end(m-k) /= m_sigma[k]; 130 matA(k,k) += 1.0; 140 Scalar t = matA.col(k).end(m-k).eigen2_dot(matA.col(j).end(m-k)); // FIXME dot product or cwise prod + .sum() ?? 141 t = -t/matA(k,k); 142 matA.col(j).end(m-k) += t * matA [all...] |
/external/opencv/cv/src/ |
H A D | cvcornersubpix.cpp | 233 CvMat matA, matInvA; local 239 cvInitMatHeader( &matA, 2, 2, CV_64F, A ); 242 cvInvert( &matA, &matInvA, CV_SVD );
|
/external/skia/src/effects/ |
H A D | SkColorMatrix.cpp | 132 void SkColorMatrix::setConcat(const SkColorMatrix& matA, const SkColorMatrix& matB) { argument 133 SetConcat(fMat, matA.fMat, matB.fMat);
|
/external/eigen/test/ |
H A D | cholesky.cpp | 308 MatrixType matA; local 309 matA << 1, 1, 1, 1; 312 VectorType vecX = matA.ldlt().solve(vecB); 313 VERIFY_IS_APPROX(matA * vecX, vecB);
|
/external/eigen/blas/ |
H A D | level3_impl.h | 272 Matrix<Scalar,Dynamic,Dynamic,ColMajor> matA(size,size); 275 matA.triangularView<Upper>() = matrix(a,size,size,*lda); 276 matA.triangularView<Lower>() = matrix(a,size,size,*lda).transpose(); 280 matA.triangularView<Lower>() = matrix(a,size,size,*lda); 281 matA.triangularView<Upper>() = matrix(a,size,size,*lda).transpose(); 284 matrix(c, *m, *n, *ldc) += alpha * matA * matrix(b, *m, *n, *ldb); 286 matrix(c, *m, *n, *ldc) += alpha * matrix(b, *m, *n, *ldb) * matA;
|
/external/opencv/cvaux/src/ |
H A D | cvepilines.cpp | 2425 CvMat matA = cvMat( 8, 8, CV_64F, A ); local 2430 CV_CALL( cvPseudoInverse( &matA, &matInvA )); 2565 CvMat matA = cvMat( 8, 8, CV_64F, A ); 2570 CV_CALL( cvPseudoInverse( &matA, &matInvA ));
|
/external/robolectric/v1/lib/main/ |
H A D | android.jar | META-INF/ META-INF/MANIFEST.MF com/ com/android/ com/android/internal/ com/android/internal/util/ ... |
/external/robolectric/v3/runtime/ |
H A D | android-all-4.1.2_r1-robolectric-0.jar | META-INF/ META-INF/MANIFEST.MF android/ android/accessibilityservice/ android/accessibilityservice/AccessibilityService$1.class ... |
H A D | android-all-4.2.2_r1.2-robolectric-0.jar | META-INF/ META-INF/MANIFEST.MF android/ android/accessibilityservice/ android/accessibilityservice/AccessibilityService$1.class ... |
H A D | android-all-4.3_r2-robolectric-0.jar | META-INF/ META-INF/MANIFEST.MF android/ android/accessibilityservice/ android/accessibilityservice/AccessibilityService$1.class ... |