Home
last modified time | relevance | path

Searched full:matrix (Results 1 – 25 of 2777) sorted by relevance

12345678910>>...112

/external/autotest/client/deps/webgl_mpd/src/resources/
DJ3DIMath.js31 J3DIMatrix4 - A 4x4 Matrix
37 This class implements a 4x4 matrix. It has functions which duplicate the
38 functionality of the OpenGL matrix stack and glut functions. On browsers
44 … Constructor(in J3DIMatrix4 matrix), // copy passed matrix into new J3DIMatrix4
46 … Constructor() // create new J3DIMatrix4 with identity matrix
49 … void load(in J3DIMatrix4 matrix); // copy the values from the passed matrix
50 void load(in sequence<float> array); // copy 16 floats into the matrix
51 … sequence<float> getAsArray(); // return the matrix as an array of 16 floats
52 …Float32Array getAsFloat32Array(); // return the matrix as a Float32Array with 16 values
53 …void setUniform(in WebGLRenderingContext ctx, // Send the matrix to the passed uniform locat…
[all …]
/external/deqp/framework/common/
DtcuMatrix.hpp23 * \brief Templatized matrix class.
33 // Templated matrix class.
35 class Matrix class
48 Matrix (void);
49 explicit Matrix (const T& src);
50 explicit Matrix (const T src[Rows*Cols]);
51 Matrix (const Vector<T, Rows>& src);
52 Matrix (const Matrix<T, Rows, Cols>& src);
53 ~Matrix (void);
55 Matrix<T, Rows, Cols>& operator= (const Matrix<T, Rows, Cols>& src);
[all …]
/external/ceres-solver/internal/ceres/
Dincomplete_lq_factorization_test.cc58 CompressedRowSparseMatrix matrix(1, 1, 1); in TEST() local
59 matrix.mutable_rows()[0] = 0; in TEST()
60 matrix.mutable_rows()[1] = 1; in TEST()
61 matrix.mutable_cols()[0] = 0; in TEST()
62 matrix.mutable_values()[0] = 2; in TEST()
65 IncompleteLQFactorization(matrix, 1, 0.0, 1, 0.0)); in TEST()
66 ExpectMatricesAreEqual(matrix, *l, 1e-16); in TEST()
83 CompressedRowSparseMatrix matrix(10, 10, 100); in TEST() local
84 int* rows = matrix.mutable_rows(); in TEST()
85 int* cols = matrix.mutable_cols(); in TEST()
[all …]
/external/vulkan-validation-layers/libs/glm/gtc/
Dmatrix_integer.hpp60 /// High-precision signed integer 2x2 matrix.
64 /// High-precision signed integer 3x3 matrix.
68 /// High-precision signed integer 4x4 matrix.
72 /// High-precision signed integer 2x2 matrix.
76 /// High-precision signed integer 2x3 matrix.
80 /// High-precision signed integer 2x4 matrix.
84 /// High-precision signed integer 3x2 matrix.
88 /// High-precision signed integer 3x3 matrix.
92 /// High-precision signed integer 3x4 matrix.
96 /// High-precision signed integer 4x2 matrix.
[all …]
/external/opencv3/3rdparty/libjasper/
Djas_seq.c65 * Sequence/Matrix Library
88 jas_matrix_t *matrix; in jas_seq2d_create() local
90 if (!(matrix = jas_matrix_create(yend - ystart, xend - xstart))) { in jas_seq2d_create()
93 matrix->xstart_ = xstart; in jas_seq2d_create()
94 matrix->ystart_ = ystart; in jas_seq2d_create()
95 matrix->xend_ = xend; in jas_seq2d_create()
96 matrix->yend_ = yend; in jas_seq2d_create()
97 return matrix; in jas_seq2d_create()
102 jas_matrix_t *matrix; in jas_matrix_create() local
105 if (!(matrix = jas_malloc(sizeof(jas_matrix_t)))) { in jas_matrix_create()
[all …]
/external/opencv3/modules/cudaarithm/include/opencv2/
Dcudaarithm.hpp59 @defgroup cudaarithm_reduce Matrix Reductions
73 /** @brief Computes a matrix-matrix or matrix-scalar sum.
75 @param src1 First source matrix or scalar.
76 @param src2 Second source matrix or scalar. Matrix should have the same size and type as src1 .
77 @param dst Destination matrix that has the same size and number of channels as the input array(s).
88 /** @brief Computes a matrix-matrix or matrix-scalar difference.
90 @param src1 First source matrix or scalar.
91 @param src2 Second source matrix or scalar. Matrix should have the same size and type as src1 .
92 @param dst Destination matrix that has the same size and number of channels as the input array(s).
103 /** @brief Computes a matrix-matrix or matrix-scalar per-element product.
[all …]
/external/eigen/test/
Dgeo_transformations.cpp20 typedef Matrix<Scalar,3,1> Vector3; in non_projective_only()
39 VERIFY_IS_APPROX(t0.matrix(), Transform3::MatrixType::Identity()); in non_projective_only()
58 VERIFY((t0 * t1).matrix().isIdentity(test_precision<Scalar>())); in non_projective_only()
61 VERIFY_IS_APPROX(t1.matrix(), t0.matrix()); in non_projective_only()
82 typedef Matrix<Scalar,3,3> Matrix3; in transformations()
83 typedef Matrix<Scalar,4,4> Matrix4; in transformations()
84 typedef Matrix<Scalar,2,1> Vector2; in transformations()
85 typedef Matrix<Scalar,3,1> Vector3; in transformations()
86 typedef Matrix<Scalar,4,1> Vector4; in transformations()
122 // rotation matrix conversion in transformations()
[all …]
Dcorners.cpp13 VERIFY_IS_EQUAL(matrix.A, matrix.B); \
25 MatrixType matrix = MatrixType::Random(rows,cols); in corners() local
48 MatrixType matrix = MatrixType::Random(); in corners_fixedsize() local
60 VERIFY_IS_EQUAL((matrix.template topLeftCorner<r,c>()), (matrix.template block<r,c>(0,0))); in corners_fixedsize()
61 VERIFY_IS_EQUAL((matrix.template topRightCorner<r,c>()), (matrix.template block<r,c>(0,cols-c))); in corners_fixedsize()
62 …VERIFY_IS_EQUAL((matrix.template bottomLeftCorner<r,c>()), (matrix.template block<r,c>(rows-r,0))); in corners_fixedsize()
63 …VERIFY_IS_EQUAL((matrix.template bottomRightCorner<r,c>()), (matrix.template block<r,c>(rows-r,col… in corners_fixedsize()
65 …VERIFY_IS_EQUAL((matrix.template topLeftCorner<r,c>()), (matrix.template topLeftCorner<r,Dynamic>(… in corners_fixedsize()
66 …VERIFY_IS_EQUAL((matrix.template topRightCorner<r,c>()), (matrix.template topRightCorner<r,Dynamic… in corners_fixedsize()
67 …VERIFY_IS_EQUAL((matrix.template bottomLeftCorner<r,c>()), (matrix.template bottomLeftCorner<r,Dyn… in corners_fixedsize()
[all …]
/external/eigen/Eigen/src/LU/
DInverse.h24 static inline void run(const MatrixType& matrix, ResultType& result) in run()
26 result = matrix.partialPivLu().inverse(); in run()
40 static inline void run(const MatrixType& matrix, ResultType& result)
43 result.coeffRef(0,0) = Scalar(1) / matrix.coeff(0,0);
51 const MatrixType& matrix,
59 determinant = matrix.coeff(0,0);
71 const MatrixType& matrix, const typename ResultType::Scalar& invdet,
74 result.coeffRef(0,0) = matrix.coeff(1,1) * invdet;
75 result.coeffRef(1,0) = -matrix.coeff(1,0) * invdet;
76 result.coeffRef(0,1) = -matrix.coeff(0,1) * invdet;
[all …]
/external/pdfium/xfa/src/fxbarcode/qrcode/
DBC_QRCoderMatrixUtil.cpp79 void CBC_QRCoderMatrixUtil::ClearMatrix(CBC_CommonByteMatrix* matrix, in ClearMatrix() argument
81 if (matrix == NULL) { in ClearMatrix()
85 matrix->clear((uint8_t)-1); in ClearMatrix()
92 CBC_CommonByteMatrix* matrix, in BuildMatrix() argument
94 if (matrix == NULL) { in BuildMatrix()
98 ClearMatrix(matrix, e); in BuildMatrix()
100 EmbedBasicPatterns(version, matrix, e); in BuildMatrix()
102 EmbedTypeInfo(ecLevel, maskPattern, matrix, e); in BuildMatrix()
104 MaybeEmbedVersionInfo(version, matrix, e); in BuildMatrix()
106 EmbedDataBits(dataBits, maskPattern, matrix, e); in BuildMatrix()
[all …]
/external/webrtc/webrtc/modules/audio_processing/beamformer/
Dmatrix.h41 // Matrix is a class for doing standard matrix operations on 2 dimensional
42 // matrices of any size. Results of matrix operations are stored in the
49 // 'In-place' operations that inherently change the size of the matrix (eg.
57 // Memory for storage is allocated when a matrix is resized only if the new
62 // matrix. TODO(claguna): albeit tricky, allow for data to be referenced
65 class Matrix {
67 Matrix() : num_rows_(0), num_columns_(0) {} in Matrix() function
70 Matrix(size_t num_rows, size_t num_columns) in Matrix() function
77 // Copies |data| into the new Matrix.
78 Matrix(const T* data, size_t num_rows, size_t num_columns) in Matrix() function
[all …]
/external/eigen/unsupported/Eigen/
DMatrixFunctions24 * \defgroup MatrixFunctions_Module Matrix functions module
26 * matrix functions.
35 * - \ref matrixbase_cos "MatrixBase::cos()", for computing the matrix cosine
36 * - \ref matrixbase_cosh "MatrixBase::cosh()", for computing the matrix hyperbolic cosine
37 * - \ref matrixbase_exp "MatrixBase::exp()", for computing the matrix exponential
38 * - \ref matrixbase_log "MatrixBase::log()", for computing the matrix logarithm
39 * - \ref matrixbase_pow "MatrixBase::pow()", for computing the matrix power
40 …* - \ref matrixbase_matrixfunction "MatrixBase::matrixFunction()", for computing general matrix f…
41 * - \ref matrixbase_sin "MatrixBase::sin()", for computing the matrix sine
42 * - \ref matrixbase_sinh "MatrixBase::sinh()", for computing the matrix hyperbolic sine
[all …]
/external/opencv3/3rdparty/libjasper/jasper/
Djas_seq.h65 * Sequence/Matrix Library
90 /* This matrix is a reference to another matrix. */
100 /* An element in a matrix. */
103 /* Matrix. */
122 /* The number of rows in the matrix. */
125 /* The number of columns in the matrix. */
134 /* The matrix data buffer. */
146 * Functions/macros for matrix class.
150 #define jas_matrix_numrows(matrix) \ argument
151 ((matrix)->numrows_)
[all …]
/external/opencv/cxcore/include/
Dcxcore.hpp213 CvMatrix() : matrix(0) {} in CvMatrix()
215 { matrix = cvCreateMat( rows, cols, type ); } in CvMatrix()
219 { matrix = cvInitMatHeader( hdr, rows, cols, type, data, step ); } in CvMatrix()
224 { matrix = cvCreateMatHeader( rows, cols, type ); in CvMatrix()
225 cvSetData( matrix, data, step ); } in CvMatrix()
228 { matrix = m; } in CvMatrix()
232 matrix = m.matrix; in CvMatrix()
236 CvMatrix( const char* filename, const char* matname=0, int color=-1 ) : matrix(0) in CvMatrix()
239 CvMatrix( CvFileStorage* fs, const char* mapname, const char* matname ) : matrix(0) in CvMatrix()
242 CvMatrix( CvFileStorage* fs, const char* seqname, int idx ) : matrix(0) in CvMatrix()
[all …]
/external/eigen/Eigen/src/Eigenvalues/
DHessenbergDecomposition.h32 * \brief Reduces a square matrix to Hessenberg form by an orthogonal similarity transformation
34 …* \tparam _MatrixType the type of the matrix of which we are computing the Hessenberg decomposition
36 * This class performs an Hessenberg decomposition of a matrix \f$ A \f$. In
38 * matrix \f$ Q \f$ and a Hessenberg matrix \f$ H \f$ such that \f$ A = Q H
39 * Q^T \f$. An orthogonal matrix is a matrix whose inverse equals its
40 * transpose (\f$ Q^{-1} = Q^T \f$). A Hessenberg matrix has zeros below the
42 * of a complex matrix is \f$ A = Q H Q^* \f$ with \f$ Q \f$ unitary (that is,
46 * given matrix. Alternatively, you can use the
82 … typedef Matrix<Scalar, SizeMinusOne, 1, Options & ~RowMajor, MaxSizeMinusOne, 1> CoeffVectorType;
91 * \param [in] size The size of the matrix whose Hessenberg decomposition will be computed.
[all …]
DComplexSchur.h28 * \brief Performs a complex Schur decomposition of a real or complex square matrix
30 * \tparam _MatrixType the type of the matrix of which we are
32 * instantiation of the Matrix class template.
34 * Given a real or complex square matrix A, this class computes the
36 * complex matrix, and T is a complex upper triangular matrix. The
37 * diagonal of the matrix T corresponds to the eigenvalues of the
38 * matrix A.
41 * a given matrix. Alternatively, you can use the
78 * This is a square matrix with entries of type #ComplexScalar.
81 …typedef Matrix<ComplexScalar, RowsAtCompileTime, ColsAtCompileTime, Options, MaxRowsAtCompileTime,…
[all …]
DTridiagonalization.h34 * \brief Tridiagonal decomposition of a selfadjoint matrix
36 * \tparam _MatrixType the type of the matrix of which we are computing the
38 * Matrix class template.
40 * This class performs a tridiagonal decomposition of a selfadjoint matrix \f$ A \f$ such that:
41 …* \f$ A = Q T Q^* \f$ where \f$ Q \f$ is unitary and \f$ T \f$ a real symmetric tridiagonal matrix.
43 * A tridiagonal matrix is a matrix which has nonzero elements only on the
45 * decomposition of a selfadjoint matrix is in fact a tridiagonal
47 * eigenvalues and eigenvectors of a selfadjoint matrix.
50 * given matrix. Alternatively, you can use the Tridiagonalization(const MatrixType&)
80 … typedef Matrix<Scalar, SizeMinusOne, 1, Options & ~RowMajor, MaxSizeMinusOne, 1> CoeffVectorType;
[all …]
DComplexEigenSolver.h26 * \tparam _MatrixType the type of the matrix of which we are
28 * instantiation of the Matrix class template.
30 * The eigenvalues and eigenvectors of a matrix \f$ A \f$ are scalars
32 * \f$. If \f$ D \f$ is a diagonal matrix with the eigenvalues on
33 * the diagonal, and \f$ V \f$ is a matrix with the eigenvectors as
34 * its columns, then \f$ A V = V D \f$. The matrix \f$ V \f$ is
78 …typedef Matrix<ComplexScalar, ColsAtCompileTime, 1, Options&(~RowMajor), MaxColsAtCompileTime, 1> …
80 /** \brief Type for matrix of eigenvectors as returned by eigenvectors().
82 * This is a square matrix with entries of type #ComplexScalar.
85 …typedef Matrix<ComplexScalar, RowsAtCompileTime, ColsAtCompileTime, Options, MaxRowsAtCompileTime,…
[all …]
/external/llvm/include/llvm/CodeGen/PBQP/
DMath.h1 //===------ Math.h - PBQP Vector and Matrix classes -------------*- C++ -*-===//
162 /// \brief PBQP Matrix class
163 class Matrix {
165 friend hash_code hash_value(const Matrix &);
168 /// \brief Construct a PBQP Matrix with the given dimensions.
169 Matrix(unsigned Rows, unsigned Cols) : in Matrix() function
173 /// \brief Construct a PBQP Matrix with the given dimensions and initial
175 Matrix(unsigned Rows, unsigned Cols, PBQPNum InitVal) in Matrix() function
180 /// \brief Copy construct a PBQP matrix.
181 Matrix(const Matrix &M) in Matrix() function
[all …]
/external/eigen/unsupported/test/
Dbdcsvd.cpp107 // test of Dynamic defined Matrix (42, 42) of float in test_bdcsvd()
108 CALL_SUBTEST_11(( bdcsvd_verify_assert<Matrix<float,Dynamic,Dynamic> > in test_bdcsvd()
109 (Matrix<float,Dynamic,Dynamic>(42,42)) )); in test_bdcsvd()
110 CALL_SUBTEST_11(( compare_bdc_jacobi<Matrix<float,Dynamic,Dynamic> > in test_bdcsvd()
111 (Matrix<float,Dynamic,Dynamic>(42,42), 0) )); in test_bdcsvd()
112 CALL_SUBTEST_11(( bdcsvd<Matrix<float,Dynamic,Dynamic> > in test_bdcsvd()
113 (Matrix<float,Dynamic,Dynamic>(42,42)) )); in test_bdcsvd()
115 // test of Dynamic defined Matrix (50, 50) of double in test_bdcsvd()
116 CALL_SUBTEST_13(( bdcsvd_verify_assert<Matrix<double,Dynamic,Dynamic> > in test_bdcsvd()
117 (Matrix<double,Dynamic,Dynamic>(50,50)) )); in test_bdcsvd()
[all …]
/external/eigen/Eigen/src/Core/
DMatrix.h16 /** \class Matrix
19 * \brief The matrix class, also used for vectors and row-vectors
21 …* The %Matrix class is the work-horse for all \em dense (\ref dense "note") matrices and vectors w…
24 …* The %Matrix class encompasses \em both fixed-size and dynamic-size objects (\ref fixedsize "note…
42 * \li \c Matrix2d is a 2x2 square matrix of doubles (\c Matrix<double, 2, 2>)
43 * \li \c Vector4f is a vector of 4 floats (\c Matrix<float, 4, 1>)
44 * \li \c RowVector3i is a row-vector of 3 ints (\c Matrix<int, 1, 3>)
46 * \li \c MatrixXf is a dynamic-size matrix of floats (\c Matrix<float, Dynamic, Dynamic>)
47 * \li \c VectorXf is a dynamic-size vector of floats (\c Matrix<float, Dynamic, 1>)
49 …* \li \c Matrix2Xf is a partially fixed-size (dynamic-size) matrix of floats (\c Matrix<float, 2, …
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/correlation/
DCovariance.java27 * Computes covariances for pairs of arrays or columns of a matrix.
48 /** covariance matrix */
52 * Create an empty covariance matrix.
67 * Create a Covariance matrix from a rectangular array
86 * Create a Covariance matrix from a rectangular array
101 * Create a covariance matrix from a matrix whose columns
107 * <p>The matrix must have at least two columns and two rows</p>
109 * @param matrix matrix with columns representing covariates
111 * @throws IllegalArgumentException if the input matrix does not have
114 public Covariance(RealMatrix matrix, boolean biasCorrected) { in Covariance() argument
[all …]
/external/eigen/test/eigen2/
Deigen2_geometry.cpp21 typedef Matrix<Scalar,2,2> Matrix2; in geometry()
22 typedef Matrix<Scalar,3,3> Matrix3; in geometry()
23 typedef Matrix<Scalar,4,4> Matrix4; in geometry()
24 typedef Matrix<Scalar,2,1> Vector2; in geometry()
25 typedef Matrix<Scalar,3,1> Vector3; in geometry()
26 typedef Matrix<Scalar,4,1> Vector4; in geometry()
90 // rotation matrix conversion in geometry()
141 VERIFY_IS_APPROX(t0.matrix(), Transform3::MatrixType::Identity()); in geometry()
142 t0.matrix().setZero(); in geometry()
144 VERIFY_IS_APPROX(t0.matrix(), Transform3::MatrixType::Identity()); in geometry()
[all …]
Deigen2_geometry_with_eigen2_prefix.cpp23 typedef Matrix<Scalar,2,2> Matrix2; in geometry()
24 typedef Matrix<Scalar,3,3> Matrix3; in geometry()
25 typedef Matrix<Scalar,4,4> Matrix4; in geometry()
26 typedef Matrix<Scalar,2,1> Vector2; in geometry()
27 typedef Matrix<Scalar,3,1> Vector3; in geometry()
28 typedef Matrix<Scalar,4,1> Vector4; in geometry()
92 // rotation matrix conversion in geometry()
143 VERIFY_IS_APPROX(t0.matrix(), Transform3::MatrixType::Identity()); in geometry()
144 t0.matrix().setZero(); in geometry()
146 VERIFY_IS_APPROX(t0.matrix(), Transform3::MatrixType::Identity()); in geometry()
[all …]
/external/opencv3/modules/core/include/opencv2/core/
Dmat.hpp77 from a matrix expression.
91 a function you should use _InputArray::getMat() method to construct a matrix header for the
105 vector using the 2x3 matrix created inline as `Matx<float, 2, 3>` instance.
113 // unless _src and/or _m are matrix expressions.
432 /** @brief Comma-separated Matrix Initializer
435 Instead, they are created on "matrix << firstValue" operator.
437 The sample below initializes 2x2 rotation matrix:
447 //! the constructor, created by "matrix << firstValue" operator, where matrix is cv::Mat
449 //! the operator that takes the next value and put it to the matrix
461 // with the matrix data, not as a separate object.
[all …]

12345678910>>...112