HomeSort by relevance Sort by last modified time
    Searched full:matrix (Results 301 - 325 of 4077) sorted by null

<<11121314151617181920>>

  /external/chromium_org/third_party/skia/src/ports/
SkScalerContext_win_dw.h 40 /** The total matrix without the text height scale. */
42 /** The total matrix without the text height scale. */
44 /** The non-rotational part of total matrix without the text height scale.
48 /** The inverse of the rotational part of the total matrix.
  /external/chromium_org/third_party/skia/tools/lua/
bitmap_statistics.lua 30 matrix = canvas:getTotalMatrix()
31 matrixType = matrix:getType()
38 if matrix:getScaleX() > 1 or matrix:getScaleY() > 1 then
  /external/eigen/Eigen/src/SparseCore/
SparsePermutation.h 48 permut_sparsematrix_product_retval(const PermutationType& perm, const MatrixType& matrix)
49 : m_permutation(perm), m_matrix(matrix)
60 Matrix<Index,Dynamic,1> sizes(m_matrix.outerSize());
80 Matrix<Index,Dynamic,1> sizes(tmp.outerSize());
108 /** \returns the matrix with the permutation applied to the columns
112 operator*(const SparseMatrixBase<SparseDerived>& matrix, const PermutationBase<PermDerived>& perm)
114 return internal::permut_sparsematrix_product_retval<PermutationBase<PermDerived>, SparseDerived, OnTheRight, false>(perm, matrix.derived());
117 /** \returns the matrix with the permutation applied to the rows
121 operator*( const PermutationBase<PermDerived>& perm, const SparseMatrixBase<SparseDerived>& matrix)
123 return internal::permut_sparsematrix_product_retval<PermutationBase<PermDerived>, SparseDerived, OnTheLeft, false>(perm, matrix.derived())
    [all...]
  /external/eigen/doc/examples/
TutorialLinAlgInverseDeterminant.cpp 13 cout << "Here is the matrix A:\n" << A << endl;
function_taking_eigenbase.cpp 16 // v.asDiagonal() returns a 3x3 diagonal matrix pseudo-expression
  /external/eigen/doc/snippets/
MatrixBase_colwise.cpp 2 cout << "Here is the matrix m:" << endl << m << endl;
MatrixBase_computeInverseAndDetWithCheck.cpp 2 cout << "Here is the matrix m:" << endl << m << endl;
MatrixBase_computeInverseWithCheck.cpp 2 cout << "Here is the matrix m:" << endl << m << endl;
MatrixBase_cwiseEqual.cpp 4 cout << "Comparing m with identity matrix:" << endl;
MatrixBase_cwiseNotEqual.cpp 4 cout << "Comparing m with identity matrix:" << endl;
MatrixBase_diagonal_int.cpp 2 cout << "Here is the matrix m:" << endl << m << endl;
MatrixBase_diagonal_template_int.cpp 2 cout << "Here is the matrix m:" << endl << m << endl;
MatrixBase_isDiagonal.cpp 3 cout << "Here's the matrix m:" << endl << m << endl;
MatrixBase_isIdentity.cpp 3 cout << "Here's the matrix m:" << endl << m << endl;
MatrixBase_isOnes.cpp 3 cout << "Here's the matrix m:" << endl << m << endl;
MatrixBase_isUnitary.cpp 3 cout << "Here's the matrix m:" << endl << m << endl;
MatrixBase_isZero.cpp 3 cout << "Here's the matrix m:" << endl << m << endl;
MatrixBase_rowwise.cpp 2 cout << "Here is the matrix m:" << endl << m << endl;
PartialRedux_count.cpp 2 cout << "Here is the matrix m:" << endl << m << endl;
SelfAdjointEigenSolver_operatorSqrt.cpp 3 cout << "Here is a random positive-definite matrix, A:" << endl << A << endl << endl;
TopicAliasing_block.cpp 3 cout << "Here is the matrix mat:\n" << mat << endl;
TopicAliasing_block_correct.cpp 3 cout << "Here is the matrix mat:\n" << mat << endl;
Tridiagonalization_householderCoefficients.cpp 3 cout << "Here is a random symmetric 4x4 matrix:" << endl << A << endl;
Tutorial_solve_singular.cpp 5 cout << "Here is the matrix A:" << endl << A << endl;
Tutorial_solve_triangular.cpp 5 cout << "Here is the matrix A:" << endl << A << endl;

Completed in 507 milliseconds

<<11121314151617181920>>