/external/eigen/doc/examples/ |
H A D | tut_arithmetic_redux_basic.cpp | 7 Eigen::Matrix2d mat; local 8 mat << 1, 2, 10 cout << "Here is mat.sum(): " << mat.sum() << endl; 11 cout << "Here is mat.prod(): " << mat.prod() << endl; 12 cout << "Here is mat.mean(): " << mat.mean() << endl; 13 cout << "Here is mat.minCoeff(): " << mat [all...] |
H A D | tut_arithmetic_matrix_mul.cpp | 7 Matrix2d mat; local 8 mat << 1, 2, 11 std::cout << "Here is mat*mat:\n" << mat*mat << std::endl; 12 std::cout << "Here is mat*u:\n" << mat*u << std::endl; 13 std::cout << "Here is u^T*mat:\n" << u.transpose()*mat << st [all...] |
H A D | make_circulant2.cpp | 48 Eigen::MatrixXd mat; local 49 mat = makeCirculant(vec); 50 std::cout << mat << std::endl;
|
/external/eigen/doc/snippets/ |
H A D | Tutorial_AdvancedInitialization_CommaTemporary.cpp | 1 MatrixXf mat = MatrixXf::Random(2, 3); variable 2 std::cout << mat << std::endl << std::endl; 3 mat = (MatrixXf(2,2) << 0, 1, 1, 0).finished() * mat; 4 std::cout << mat << std::endl;
|
/external/skia/gm/ |
H A D | tiledscaledbitmap.cpp | 61 SkMatrix mat; variable 62 mat.setScale(121.f/360.f, 93.f/288.f); 63 mat.postTranslate(-72, -72); 66 SkShader::kRepeat_TileMode, &mat));
|
H A D | filltypespersp.cpp | 95 SkMatrix mat; variable 96 mat.reset(); 97 mat.setPerspY(SK_Scalar1 / 1000); 98 canvas->concat(mat);
|
H A D | filterindiabox.cpp | 19 static SkSize computeSize(const SkBitmap& bm, const SkMatrix& mat) { argument 22 mat.mapRect(&bounds); 26 static void draw_cell(SkCanvas* canvas, const SkBitmap& bm, const SkMatrix& mat, SkScalar dx, argument 34 canvas->concat(mat); 38 static void draw_row(SkCanvas* canvas, const SkBitmap& bm, const SkMatrix& mat, SkScalar dx) { argument 39 draw_cell(canvas, bm, mat, 0 * dx, kNone_SkFilterQuality); 40 draw_cell(canvas, bm, mat, 1 * dx, kLow_SkFilterQuality); 41 draw_cell(canvas, bm, mat, 2 * dx, kMedium_SkFilterQuality); 42 draw_cell(canvas, bm, mat, 3 * dx, kHigh_SkFilterQuality);
|
/external/eigen/Eigen/src/Householder/ |
H A D | BlockHouseholder.h | 75 * if forward then perform mat = H0 * H1 * H2 * mat 76 * otherwise perform mat = H2 * H1 * H0 * mat 79 void apply_block_householder_on_the_left(MatrixType& mat, const VectorsType& vectors, const CoeffsType& hCoeffs, bool forward) argument 92 VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat; 96 mat.noalias() -= V * tmp;
|
/external/eigen/bench/ |
H A D | BenchUtil.h | 21 template<typename MatrixType> void initMatrix_random(MatrixType& mat) __attribute__((noinline)); 22 template<typename MatrixType> void initMatrix_random(MatrixType& mat) argument 24 mat.setRandom();// = MatrixType::random(mat.rows(), mat.cols()); 27 template<typename MatrixType> void initMatrix_identity(MatrixType& mat) __attribute__((noinline)); 28 template<typename MatrixType> void initMatrix_identity(MatrixType& mat) argument 30 mat.setIdentity();
|
H A D | basicbenchmark.h | 38 double benchBasic(const MatrixType& mat, int size, int tries) __attribute__((noinline)); 41 double benchBasic(const MatrixType& mat, int iterations, int tries) argument 43 const int rows = mat.rows(); 44 const int cols = mat.cols();
|
/external/eigen/blas/ |
H A D | GeneralRank1Update.h | 22 static void run(Index rows, Index cols, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha) argument 29 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i,rows) += alpha * cj(v[i]) * ConjRhsType(OtherMap(u,rows)); 36 static void run(Index rows, Index cols, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha) argument 38 general_rank1_update<Scalar,Index,ColMajor,ConjRhs,ConjRhs>::run(rows,cols,mat,stride,u,v,alpha);
|
H A D | PackedSelfadjointProduct.h | 25 static void run(Index size, Scalar* mat, const Scalar* vec, RealScalar alpha) argument 33 Map<Matrix<Scalar,Dynamic,1> >(mat, UpLo==Lower ? size-i : (i+1)) += alpha * cj(vec[i]) * ConjRhsType(OtherMap(vec+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1))); 35 mat[UpLo==Lower ? 0 : i] = numext::real(mat[UpLo==Lower ? 0 : i]); 36 mat += UpLo==Lower ? size-i : (i+1); 45 static void run(Index size, Scalar* mat, const Scalar* vec, RealScalar alpha) argument 47 selfadjoint_packed_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,vec,alpha);
|
H A D | Rank2Update.h | 21 static void run(Index size, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha) argument 26 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)) += 39 static void run(Index size, Scalar* mat, const Scalar* u, const Scalar* v, Scalar alpha) argument 45 Map<Matrix<Scalar,Dynamic,1> >(mat+offset, UpLo==Lower ? size-i : (i+1)) += 49 mat[offset+(UpLo==Lower ? 0 : i)] = numext::real(mat[offset+(UpLo==Lower ? 0 : i)]);
|
/external/mesa3d/src/gallium/state_trackers/nine/ |
H A D | nine_dump.h | 44 nine_dump_D3DMATERIAL9(unsigned ch, const D3DMATERIAL9 *mat) argument
|
/external/deqp/framework/common/ |
H A D | tcuMatrixUtil.hpp | 59 Matrix<float, 2, 2> mat; local 63 mat(0, 0) = c; 64 mat(0, 1) = -s; 65 mat(1, 0) = s; 66 mat(1, 1) = c; 68 return mat; 73 Matrix<float, 2, 2> mat; local 74 mat(0, 0) = 1.0f; 75 mat(0, 1) = shear.x(); 76 mat( [all...] |
/external/eigen/Eigen/src/Core/ |
H A D | BooleanRedux.h | 26 static inline bool run(const Derived &mat) argument 28 return all_unroller<Derived, UnrollCount-1>::run(mat) && mat.coeff(row, col); 35 static inline bool run(const Derived &/*mat*/) { return true; } 53 static inline bool run(const Derived &mat) argument 55 return any_unroller<Derived, UnrollCount-1>::run(mat) || mat.coeff(row, col); 62 static inline bool run(const Derived & /*mat*/) { return false; }
|
/external/eigen/Eigen/src/SparseCore/ |
H A D | MappedSparseMatrix.h | 60 explicit evaluator(const XprType &mat) : Base(mat) {} argument
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 33 IncompleteLU(const MatrixType& mat) argument 35 compute(mat); 42 IncompleteLU& compute(const MatrixType& mat) argument 44 m_lu = mat; 45 int size = mat.cols();
|
/external/llvm/lib/CodeGen/ |
H A D | RegAllocBase.cpp | 56 LiveRegMatrix &mat) { 61 Matrix = &mat; 54 init(VirtRegMap &vrm, LiveIntervals &lis, LiveRegMatrix &mat) argument
|
/external/skia/src/gpu/glsl/ |
H A D | GrGLSLGeometryProcessor.h | 63 const SkMatrix& mat, 66 static uint32_t ComputePosKey(const SkMatrix& mat) { argument 67 if (mat.isIdentity()) { 69 } else if (!mat.hasPerspective()) {
|
/external/eigen/Eigen/src/Core/products/ |
H A D | SelfadjointRank2Update.h | 27 static void run(Scalar* mat, Index stride, const UType& u, const VType& v, const Scalar& alpha) argument 32 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+i, size-i) += 42 static void run(Scalar* mat, Index stride, const UType& u, const VType& v, const Scalar& alpha) argument 46 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i, i+1) +=
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | BasicPreconditioners.h | 50 explicit DiagonalPreconditioner(const MatType& mat) : m_invdiag(mat.cols()) argument 52 compute(mat); 65 DiagonalPreconditioner& factorize(const MatType& mat) argument 67 m_invdiag.resize(mat.cols()); 68 for(int j=0; j<mat.outerSize(); ++j) 70 typename MatType::InnerIterator it(mat,j); 82 DiagonalPreconditioner& compute(const MatType& mat) argument 84 return factorize(mat); 139 explicit LeastSquareDiagonalPreconditioner(const MatType& mat) argument 151 factorize(const MatType& mat) argument 183 compute(const MatType& mat) argument [all...] |
/external/eigen/Eigen/src/OrderingMethods/ |
H A D | Ordering.h | 61 void operator()(const MatrixType& mat, PermutationType& perm) argument 65 internal::ordering_helper_at_plus_a(mat,symm); 74 void operator()(const SparseSelfAdjointView<SrcType, SrcUpLo>& mat, PermutationType& perm) argument 76 SparseMatrix<typename SrcType::Scalar, ColMajor, StorageIndex> C; C = mat; 102 void operator()(const MatrixType& /*mat*/, PermutationType& perm) 124 /** Compute the permutation vector \a perm form the sparse matrix \a mat 125 * \warning The input sparse matrix \a mat must be in compressed mode (see SparseMatrix::makeCompressed()). 128 void operator() (const MatrixType& mat, PermutationType& perm) argument 130 eigen_assert(mat.isCompressed() && "COLAMDOrdering requires a sparse matrix in compressed mode. Call .makeCompressed() before passing it to COLAMDOrdering"); 132 StorageIndex m = StorageIndex(mat [all...] |
/external/eigen/demos/opengl/ |
H A D | gpuhelper.h | 33 /** Multiply the OpenGL matrix \a matrixTarget by the matrix \a mat. 41 void multMatrix(const Matrix<Scalar,4,4, _Flags, 4,4>& mat, GLenum matrixTarget); 43 /** Load the matrix \a mat to the OpenGL matrix \a matrixTarget. 51 void loadMatrix(const Eigen::Matrix<Scalar,4,4, _Flags, 4,4>& mat, GLenum matrixTarget); 67 /** Push the OpenGL matrix \a matrixTarget and load \a mat. 70 inline void pushMatrix(const Matrix<Scalar,4,4, _Flags, 4,4>& mat, GLenum matrixTarget); 120 static void loadMatrix(const Matrix<float, 4,4, _Flags, 4,4>& mat) { glLoadMatrixf(mat.data()); } argument 121 static void loadMatrix(const Matrix<double,4,4, _Flags, 4,4>& mat) { glLoadMatrixd(mat argument 122 multMatrix(const Matrix<float, 4,4, _Flags, 4,4>& mat) argument 123 multMatrix(const Matrix<double,4,4, _Flags, 4,4>& mat) argument 128 loadMatrix(const Matrix<float, 4,4, _Flags, 4,4>& mat) argument 129 loadMatrix(const Matrix<double,4,4, _Flags, 4,4>& mat) argument 130 multMatrix(const Matrix<float, 4,4, _Flags, 4,4>& mat) argument 131 multMatrix(const Matrix<double,4,4, _Flags, 4,4>& mat) argument 141 multMatrix(const Matrix<Scalar,4,4, _Flags, 4,4>& mat, GLenum matrixTarget) argument 157 loadMatrix(const Eigen::Matrix<Scalar,4,4, _Flags, 4,4>& mat, GLenum matrixTarget) argument 170 pushMatrix(const Matrix<Scalar,4,4, _Flags, 4,4>& mat, GLenum matrixTarget) argument [all...] |
/external/skia/bench/ |
H A D | Matrix44Bench.cpp | 71 , mat(SkMatrix44::kIdentity_Constructor) 78 mat.setRowMajord(rowMajor); 83 mat.setIdentity(); 87 SkMatrix44 mat; member in class:SetIdentityMatrix44Bench
|