| /external/chromium-trace/catapult/tracing/third_party/gl-matrix/spec/gl-matrix/ |
| 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, matA, [2, 3, 4]);
75 result = mat3.normalFromMat4(out, matA);
123 beforeEach(function() { result = mat3.scale(out, matA, [2,2]); });
[all …]
|
| 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 …ement 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); });
86 expect(matA).toBeEqualish([
96 beforeEach(function() { result = mat4.transpose(matA, matA); });
99 expect(matA).toBeEqualish([
[all …]
|
| D | mat2-spec.js | 24 var out, matA, matB, identity, result;
27 matA = [1, 2,
46 beforeEach(function() { result = mat2.clone(matA); });
47 …ement 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).toBeEqualish([1, 2, 3, 4]); });
72 beforeEach(function() { result = mat2.transpose(matA, matA); });
74 … it("should place values into matA", function() { expect(matA).toBeEqualish([1, 3, 2, 4]); });
[all …]
|
| D | mat2d-spec.js | 24 var out, matA, matB, identity, result;
27 matA = [1, 2,
58 beforeEach(function() { result = mat2d.clone(matA); });
59 …ement 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).toBeEqualish(oldA); });
84 beforeEach(function() { result = mat2d.invert(matA, matA); });
86 …it("should place values into matA", function() { expect(matA).toBeEqualish([ -2, 1, 1.5, -0.5, 1, …
[all …]
|
| 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 = [1, 2, 3, 4, 5, 6]; });
431 beforeEach(function() { result = vec2.transformMat2d(out, vecA, matA); });
436 … it("should not modify matA", function() { expect(matA).toBeEqualish([1, 2, 3, 4, 5, 6]); });
[all …]
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| D | GeneralizedSelfAdjointEigenSolver.h | 107 GeneralizedSelfAdjointEigenSolver(const MatrixType& matA, const MatrixType& matB,
109 : Base(matA.cols())
111 compute(matA, matB, options);
154 GeneralizedSelfAdjointEigenSolver& compute(const MatrixType& matA, const MatrixType& matB,
164 compute(const MatrixType& matA, const MatrixType& matB, int options) in compute() argument
166 eigen_assert(matA.cols()==matA.rows() && matB.rows()==matA.rows() && matB.cols()==matB.rows()); in compute()
185 MatrixType matC = matA.template selfadjointView<Lower>(); in compute()
198 MatrixType matC = matA.template selfadjointView<Lower>(); in compute()
211 MatrixType matC = matA.template selfadjointView<Lower>(); in compute()
|
| D | HessenbergDecomposition.h | 270 static void _compute(MatrixType& matA, CoeffVectorType& hCoeffs, VectorType& temp);
292 void HessenbergDecomposition<MatrixType>::_compute(MatrixType& matA, CoeffVectorType& hCoeffs, Vect…
294 eigen_assert(matA.rows()==matA.cols());
295 Index n = matA.rows();
303 matA.col(i).tail(remainingSize).makeHouseholderInPlace(h, beta);
304 matA.col(i).coeffRef(i+1) = beta;
311 matA.bottomRightCorner(remainingSize, remainingSize)
312 .applyHouseholderOnTheLeft(matA.col(i).tail(remainingSize-1), h, &temp.coeffRef(0));
315 matA.rightCols(remainingSize)
316 ….applyHouseholderOnTheRight(matA.col(i).tail(remainingSize-1).conjugate(), numext::conj(h), &temp.…
|
| D | Tridiagonalization.h | 26 void tridiagonalization_inplace(MatrixType& matA, CoeffVectorType& hCoeffs);
346 void tridiagonalization_inplace(MatrixType& matA, CoeffVectorType& hCoeffs)
352 Index n = matA.rows();
353 eigen_assert(n==matA.cols());
361 matA.col(i).tail(remainingSize).makeHouseholderInPlace(h, beta);
365 matA.col(i).coeffRef(i+1) = 1;
367 …hCoeffs.tail(n-i-1).noalias() = (matA.bottomRightCorner(remainingSize,remainingSize).template self…
368 * (conj(h) * matA.col(i).tail(remainingSize)));
370 … (conj(h)*Scalar(-0.5)*(hCoeffs.tail(remainingSize).dot(matA.col(i).tail(remainingSize)))) * matA.…
372 matA.bottomRightCorner(remainingSize, remainingSize).template selfadjointView<Lower>()
[all …]
|
| D | SelfAdjointEigenSolver.h | 333 …SelfAdjointEigenSolver(const MatrixType& matA, const MatrixType& matB, bool computeEigenvectors = …
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, computeEige…
347 void compute(const MatrixType& matA, const MatrixType& matB, bool computeEigenvectors = true)
349 compute(matA, matB, computeEigenvectors ? ComputeEigenvectors : EigenvaluesOnly);
|
| /external/eigen/doc/snippets/ |
| D | TopicAliasing_mult1.cpp | 1 MatrixXf matA(2,2); variable
2 matA << 2, 0, 0, 2;
3 matA = matA * matA;
4 cout << matA;
|
| D | TopicAliasing_mult3.cpp | 1 MatrixXf matA(2,2); variable
2 matA << 2, 0, 0, 2;
3 matA.noalias() = matA * matA;
4 cout << matA;
|
| D | Tutorial_AdvancedInitialization_Block.cpp | 1 MatrixXf matA(2, 2); variable
2 matA << 1, 2, 3, 4;
4 matB << matA, matA/10, matA/10, matA;
|
| D | TopicAliasing_mult2.cpp | 1 MatrixXf matA(2,2), matB(2,2); variable
2 matA << 2, 0, 0, 2;
5 matB = matA * matA;
9 matB.noalias() = matA * matA;
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| D | SVD.h | 109 MatrixType matA(matrix); in compute()
124 m_sigma[k] = matA.col(k).end(m-k).norm(); in compute()
127 if (matA(k,k) < 0.0) in compute()
129 matA.col(k).end(m-k) /= m_sigma[k]; in compute()
130 matA(k,k) += 1.0; in compute()
140 …Scalar t = matA.col(k).end(m-k).eigen2_dot(matA.col(j).end(m-k)); // FIXME dot product or cwise pr… in compute()
141 t = -t/matA(k,k); in compute()
142 matA.col(j).end(m-k) += t * matA.col(k).end(m-k); in compute()
147 e[j] = matA(k,j); in compute()
152 m_matU.col(k).end(m-k) = matA.col(k).end(m-k); in compute()
[all …]
|
| /external/eigen/doc/ |
| D | TopicAliasing.dox | 156 …tiplication is the only operation in %Eigen that assumes aliasing by default. Thus, if \c matA is a
157 matrix, then the statement <tt>matA = matA * matA;</tt> is safe. All other operations in %Eigen ass…
170 However, this comes at a price. When executing the expression <tt>matA = matA * matA</tt>, %Eigen e…
171 product in a temporary matrix which is assigned to \c matA after the computation. This is fine. But…
172 the same when the product is assigned to a different matrix (e.g., <tt>matB = matA * matA</tt>). In…
177 aliasing, as follows: <tt>matB.noalias() = matA * matA</tt>. This allows %Eigen to evaluate the mat…
178 <tt>matA * matA</tt> directly into \c matB.
|
| /external/neven/Embedded/common/src/b_TensorEm/ |
| D | Int32Mat.h | 115 const int32* matA,
129 int32* matA,
|
| D | Int32Mat.c | 210 const int32* matA, in bts_Int32Mat_solve() argument
218 bbs_memcpy32( tmpMatA, matA, ( matWidthA * matWidthA ) * bbs_SIZEOF32( int32 ) ); in bts_Int32Mat_solve()
232 int32* matA, in bts_Int32Mat_solve2() argument
246 int32* matL = matA; in bts_Int32Mat_solve2()
|
| /external/opencv/cv/src/ |
| D | cvcornersubpix.cpp | 233 CvMat matA, matInvA; in cvFindCornerSubPix() local
239 cvInitMatHeader( &matA, 2, 2, CV_64F, A ); in cvFindCornerSubPix()
242 cvInvert( &matA, &matInvA, CV_SVD ); in cvFindCornerSubPix()
|
| /external/skia/src/effects/ |
| D | SkColorMatrix.cpp | 132 void SkColorMatrix::setConcat(const SkColorMatrix& matA, const SkColorMatrix& matB) { in setConcat() argument
133 SetConcat(fMat, matA.fMat, matB.fMat); in setConcat()
|
| /external/eigen/test/ |
| D | cholesky.cpp | 308 MatrixType matA; in cholesky_bug241() local
309 matA << 1, 1, 1, 1; in cholesky_bug241()
312 VectorType vecX = matA.ldlt().solve(vecB); in cholesky_bug241()
313 VERIFY_IS_APPROX(matA * vecX, vecB); in cholesky_bug241()
|
| /external/eigen/blas/ |
| D | level3_impl.h | 272 Matrix<Scalar,Dynamic,Dynamic,ColMajor> matA(size,size); in EIGEN_BLAS_FUNC()
275 matA.triangularView<Upper>() = matrix(a,size,size,*lda); in EIGEN_BLAS_FUNC()
276 matA.triangularView<Lower>() = matrix(a,size,size,*lda).transpose(); in EIGEN_BLAS_FUNC()
280 matA.triangularView<Lower>() = matrix(a,size,size,*lda); in EIGEN_BLAS_FUNC()
281 matA.triangularView<Upper>() = matrix(a,size,size,*lda).transpose(); in EIGEN_BLAS_FUNC()
284 matrix(c, *m, *n, *ldc) += alpha * matA * matrix(b, *m, *n, *ldb); in EIGEN_BLAS_FUNC()
286 matrix(c, *m, *n, *ldc) += alpha * matrix(b, *m, *n, *ldb) * matA; in EIGEN_BLAS_FUNC()
|
| /external/opencv/cvaux/src/ |
| D | cvepilines.cpp | 2425 CvMat matA = cvMat( 8, 8, CV_64F, A ); in icvComputePerspectiveCoeffs() local
2430 CV_CALL( cvPseudoInverse( &matA, &matInvA )); in icvComputePerspectiveCoeffs()
2565 CvMat matA = cvMat( 8, 8, CV_64F, A ); in cvInitPerspectiveTransform() local
2570 CV_CALL( cvPseudoInverse( &matA, &matInvA )); in cvInitPerspectiveTransform()
|