| /external/eigen/test/ |
| corners.cpp | 13 VERIFY_IS_EQUAL(matrix.A, matrix.B); \
25 MatrixType matrix = MatrixType::Random(rows,cols); local
48 MatrixType matrix = MatrixType::Random(); local
60 VERIFY_IS_EQUAL((matrix.template topLeftCorner<r,c>()), (matrix.template block<r,c>(0,0)));
61 VERIFY_IS_EQUAL((matrix.template topRightCorner<r,c>()), (matrix.template block<r,c>(0,cols-c)));
62 VERIFY_IS_EQUAL((matrix.template bottomLeftCorner<r,c>()), (matrix.template block<r,c>(rows-r,0)))
[all...] |
| hessenberg.cpp | 16 typedef Matrix<Scalar,Size,Size> MatrixType;
|
| product_syrk.cpp | 16 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::ColsAtCompileTime, RowMajor> RMatrixType;
17 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, Dynamic> Rhs1;
18 typedef Matrix<Scalar, Dynamic, MatrixType::RowsAtCompileTime> Rhs2;
19 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, Dynamic,RowMajor> Rhs3;
|
| special_numbers.cpp | 14 typedef Matrix<Scalar, Dynamic,Dynamic> MatType;
|
| conservative_resize.cpp | 19 typedef Matrix<Scalar, Eigen::Dynamic, Eigen::Dynamic, Storage> MatrixType;
63 typedef Matrix<Scalar, 1, Eigen::Dynamic> VectorType;
107 m.conservativeResizeLike(Matrix<Scalar,Dynamic,Dynamic>::Zero(1,size));
|
| eigensolver_complex.cpp | 66 Matrix<RealScalar,Dynamic,Dynamic> diffs = (vec1.rowwise().replicate(n) - vec2.rowwise().replicate(n).transpose()).cwiseAbs2();
123 // Test matrix with NaN
163 CALL_SUBTEST_3( eigensolver(Matrix<std::complex<float>, 1, 1>()) );
170 CALL_SUBTEST_3( eigensolver_verify_assert(Matrix<std::complex<float>, 1, 1>()) );
|
| eigensolver_generic.cpp | 26 typedef Matrix<RealScalar, MatrixType::RowsAtCompileTime, 1> RealVectorType;
68 // Test matrix with NaN
116 CALL_SUBTEST_3( eigensolver(Matrix<double,1,1>()) );
123 CALL_SUBTEST_3( eigensolver_verify_assert(Matrix<double,1,1>()) );
|
| visitor.cpp | 20 // construct a random matrix where all coefficients are different
121 CALL_SUBTEST_1( matrixVisitor(Matrix<float, 1, 1>()) );
125 CALL_SUBTEST_5( matrixVisitor(Matrix<double,Dynamic,Dynamic,RowMajor>(20, 20)) );
130 CALL_SUBTEST_7( vectorVisitor(Matrix<int,12,1>()) );
|
| /external/eigen/unsupported/test/ |
| BVH.cpp | 17 template<typename Scalar, int Dim> AlignedBox<Scalar, Dim> bounding_box(const Matrix<Scalar, Dim, 1> &v) { return AlignedBox<Scalar, Dim>(v); }
27 typedef Matrix<double, Dim, 1> VectorType;
44 typedef Matrix<double, Dim, 1> VectorType;
95 typedef Matrix<double, Dim, 1> VectorType;
|
| cxx11_tensor_custom_index.cpp | 50 using CustomIndex = Matrix<unsigned int, 4, 1>;
|
| matrix_function.cpp | 24 // Returns a matrix with eigenvalues clustered around 0, 1 and 2.
44 // Returns a matrix with eigenvalues clustered around 0 and +/- i.
142 typedef Matrix<ComplexScalar, MatrixType::RowsAtCompileTime,
186 CALL_SUBTEST_1(testMatrixType(Matrix<float,1,1>()));
190 CALL_SUBTEST_5(testMatrixType(Matrix<double,5,5,RowMajor>()));
|
| /frameworks/base/graphics/java/android/graphics/ |
| PathMeasure.java | 99 * corresponding matrix. Returns false if there is no path, or a zero-length
100 * path was specified, in which case matrix is unchanged.
103 * @param matrix Allocated by the caller, this is set to the transformation
105 * @param flags Specified what aspects should be returned in the matrix.
107 public boolean getMatrix(float distance, Matrix matrix, int flags) {
108 return native_getMatrix(native_instance, distance, matrix.native_instance, flags);
|
| /external/deqp/external/vulkancts/modules/vulkan/shaderexecutor/ |
| vktShaderBuiltinPrecisionTests.cpp | 88 using tcu::Matrix;
149 //! This is used in vector and matrix constructors.
189 * scalar types, and a vector or matrix of intervals for container types.
462 struct Traits<Matrix<T, Rows, Cols> > :
463 ContainerTraits<Matrix<T, Rows, Cols>, Matrix<typename Traits<T>::IVal, Rows, Cols> >
891 class ExprP<Matrix<T, Rows, Cols> > : public ContainerExprPBase<Matrix<T, Rows, Cols> > {};
962 ExprP<Matrix<float, Left, Right> > operator* (const ExprP<Matrix<float, Left, Mid> >& left
[all...] |
| /external/deqp/modules/glshared/ |
| glsBuiltinPrecisionTests.cpp | 100 using tcu::Matrix;
101 namespace matrix = tcu::matrix;
170 //! This is used in vector and matrix constructors.
210 * scalar types, and a vector or matrix of intervals for container types.
483 struct Traits<Matrix<T, Rows, Cols> > :
484 ContainerTraits<Matrix<T, Rows, Cols>, Matrix<typename Traits<T>::IVal, Rows, Cols> >
912 class ExprP<Matrix<T, Rows, Cols> > : public ContainerExprPBase<Matrix<T, Rows, Cols> > {}
[all...] |
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/managedprovisioning/ |
| ByodPresentMediaDialog.java | 23 import android.graphics.Matrix;
163 Matrix matrix = new Matrix(); local
164 matrix.postRotate(orientationInDegree);
166 scaled.getHeight(), matrix, true);
|
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/sensors/ |
| CtsMediaTextureRender.java | 30 import android.opengl.Matrix;
94 Matrix.setIdentityM(mSTMatrix, 0);
128 Matrix.setIdentityM(mMVPMatrix, 0);
|
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/sensors/sixdof/Renderer/Renderable/ |
| CameraPreviewRenderable.java | 26 import android.opengl.Matrix;
67 // Reset the model matrix to the identity and move it so the OpenGL camera is looking at it.
68 Matrix.setIdentityM(getModelMatrix(), 0);
69 Matrix.translateM(getModelMatrix(), 0,
125 // Compose the model, view, and projection matrices into a single m-v-p matrix
149 // Pass in the modelview matrix.
152 // Pass in the combined matrix.
|
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/sensors/sixdof/Utils/ |
| MathsUtils.java | 18 import android.opengl.Matrix;
98 float rlf = 1.0f / Matrix.length(zAxisX, zAxisY, zAxisZ);
109 float rls = 1.0f / Matrix.length(xAxisX, xAxisY, xAxisZ);
141 * A function to convert a quaternion to quaternion Matrix. Please note that Opengl.Matrix is
142 * Column Major and so we construct the matrix in Column Major Format. - - - - | 0 4 8 12 | | 1
146 * @return Quaternion Matrix of float[16]
149 float[] matrix = new float[16]; local
167 matrix[0] = 1f - 2f * (y2 + z2);
168 matrix[4] = 2f * (xy - wz)
[all...] |
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| SweepGradientTest.java | 25 import android.graphics.Matrix;
153 Matrix m = new Matrix();
|
| /cts/tests/tests/media/src/android/media/cts/ |
| TextureRender.java | 30 import android.opengl.Matrix;
90 Matrix.setIdentityM(mSTMatrix, 0);
124 Matrix.setIdentityM(mMVPMatrix, 0);
|
| /development/samples/ApiDemos/src/com/example/android/apis/animation/ |
| PathAnimations.java | 24 import android.graphics.Matrix;
224 Matrix scale = new Matrix();
|
| /development/samples/ApiDemos/src/com/example/android/apis/graphics/ |
| Xfermodes.java | 24 import android.graphics.Matrix;
112 Matrix m = new Matrix();
|
| /development/samples/devbytes/animation/CardFlip/src/com/example/android/cardflip/ |
| CardView.java | 30 import android.graphics.Matrix;
71 private Matrix mHorizontalFlipMatrix;
87 mHorizontalFlipMatrix = new Matrix();
|
| /external/eigen/Eigen/src/SVD/ |
| SVDBase.h | 29 * SVD decomposition consists in decomposing any n-by-p matrix \a A as a product
31 * where \a U is a n-by-n unitary, \a V is a p-by-p unitary, and \a S is a n-by-p real positive matrix which is zero outside of its main diagonal;
38 * You can ask for only \em thin \a U or \a V to be computed, meaning the following. In case of a rectangular n-by-p matrix, letting \a m be the
40 * singular vectors. Asking for \em thin \a U or \a V means asking for only their \a m first columns to be formed. So \a U is then a n-by-m matrix,
41 * and \a V is then a p-by-m matrix. Notice that thin \a U and \a V are all you need for (least squares) solving.
43 * If the input matrix has inf or nan coefficients, the result of the computation is undefined, but the computation is guaranteed to
67 typedef Matrix<Scalar, RowsAtCompileTime, RowsAtCompileTime, MatrixOptions, MaxRowsAtCompileTime, MaxRowsAtCompileTime> MatrixUType;
68 typedef Matrix<Scalar, ColsAtCompileTime, ColsAtCompileTime, MatrixOptions, MaxColsAtCompileTime, MaxColsAtCompileTime> MatrixVType;
74 /** \returns the \a U matrix.
76 * For the SVD decomposition of a n-by-p matrix, letting \a m be the minimum of \a n and \a p
[all...] |
| /external/eigen/bench/ |
| dense_solvers.cpp | 32 typedef Matrix<Scalar,Dynamic,Size> Mat;
33 typedef Matrix<Scalar,Dynamic,Dynamic> MatDyn;
34 typedef Matrix<Scalar,Size,Size> MatSquare;
|
