/external/eigen/Eigen/src/IterativeLinearSolvers/ |
BasicPreconditioners.h | 18 * This class allows to approximately solve for A.x = b problems assuming A is a diagonal matrix. 36 typedef Matrix<Scalar,Dynamic,1> Vector; 41 typedef Matrix<Scalar,Dynamic,Dynamic> MatrixType; 94 && "DiagonalPreconditioner::solve(): invalid number of rows of the right hand side matrix b"); 121 * \brief A naive preconditioner which approximates any matrix as the identity matrix
|
/external/eigen/bench/spbench/ |
spbenchsolver.cpp | 6 cout<< " MATRIX FOLDER : \n"; 8 cout<< " The matrices are stored using the matrix market coordinate format \n"; 9 cout<< " The matrix and associated right-hand side (rhs) files are named respectively \n"; 11 cout<< " If a matrix is SPD, the matrix should be named as MatrixName_SPD.mtx \n"; 16 cout<< " -d matrixdir \n Use matrixdir as the matrix folder instead of the one specified in the environment variable EIGEN_MATRIXDIR\n\n";
|
/external/eigen/doc/ |
FunctionsTakingEigenTypes.dox | 5 %Eigen's use of expression templates results in potentially every expression being of a different type. If you pass such an expression to a function taking a parameter of type Matrix, your expression will implicitly be evaluated into a temporary Matrix, which will then be passed to the function. This means that you lose the benefit of expression templates. Concretely, this has two drawbacks: 17 \li MatrixBase: The common base class for all dense matrix expressions (as opposed to array expressions, as opposed to sparse and special matrix classes). Use it in functions that are meant to work only on dense matrices. 18 \li ArrayBase: The common base class for all dense array expressions (as opposed to matrix expressions, etc). Use it in functions that are meant to work only on arrays. 19 \li DenseBase: The common base class for all dense matrix expression, that is, the base class for both \c MatrixBase and \c ArrayBase. It can be used in functions that are meant to work on both matrices and arrays. 20 \li EigenBase: The base class unifying all types of objects that can be evaluated into dense matrices or arrays, for example special matrix classes such as diagonal matrices, permutation matrices, etc. It can be used in functions that are meant to work on any such general type. 23 Prints the dimensions of the most generic object present in %Eigen. It could be any matrix expressions, any dense or sparse matrix and any array. 33 Prints a sub-block of the dense expression. Accepts any dense matrix or array expression, but no sparse objects and no special matrix classes such as DiagonalMatrix [all...] |
/external/eigen/test/eigen2/ |
eigen2_cholesky.cpp | 29 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType; 30 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType; 36 // let's make sure the matrix is not singular or near singular 44 typename Gsl::Matrix gMatA=0, gSymm=0; 90 // test isPositiveDefinite on non definite matrix 105 CALL_SUBTEST_1( cholesky(Matrix<double,1,1>()) );
|
/external/eigen/test/ |
geo_eulerangles.cpp | 17 void verify_euler(const Matrix<Scalar,3,1>& ea, int i, int j, int k) 19 typedef Matrix<Scalar,3,3> Matrix3; 20 typedef Matrix<Scalar,3,1> Vector3; 41 template<typename Scalar> void check_all_var(const Matrix<Scalar,3,1>& ea) 61 typedef Matrix<Scalar,3,3> Matrix3; 62 typedef Matrix<Scalar,3,1> Vector3;
|
inverse.cpp | 45 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> VectorType; 48 //First: an invertible matrix 63 //Second: a rank one matrix (not invertible, except for 1x1 matrices) 91 CALL_SUBTEST_1( inverse(Matrix<double,1,1>()) ); 95 CALL_SUBTEST_4( inverse(Matrix<float,4,4,DontAlign>()) ); 101 CALL_SUBTEST_7( inverse(Matrix<double,4,4,DontAlign>()) );
|
product_selfadjoint.cpp | 16 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType; 17 typedef Matrix<Scalar, 1, MatrixType::RowsAtCompileTime> RowVectorType; 19 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, Dynamic, RowMajor> RhsMatrixType; 67 CALL_SUBTEST_1( product_selfadjoint(Matrix<float, 1, 1>()) ); 68 CALL_SUBTEST_2( product_selfadjoint(Matrix<float, 2, 2>()) ); 77 CALL_SUBTEST_7( product_selfadjoint(Matrix<float,Dynamic,Dynamic,RowMajor>(s,s)) );
|
miscmatrices.cpp | 19 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType; 29 Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> 41 CALL_SUBTEST_1( miscMatrices(Matrix<float, 1, 1>()) );
|
/external/eigen/unsupported/Eigen/src/SparseExtra/ |
BlockOfDynamicSparseMatrix.h | 47 inline SparseInnerVectorSet(const MatrixType& matrix, Index outerStart, Index outerSize) 48 : m_matrix(matrix), m_outerStart(outerStart), m_outerSize(outerSize) 50 eigen_assert( (outerStart>=0) && ((outerStart+outerSize)<=matrix.outerSize()) ); 53 inline SparseInnerVectorSet(const MatrixType& matrix, Index outer) 54 : m_matrix(matrix), m_outerStart(outer), m_outerSize(Size) 57 eigen_assert( (outer>=0) && (outer<matrix.outerSize()) );
|
/external/mesa3d/docs/ |
MESA_window_pos.spec | 32 coordinate with the RasterPos command, the modelview matrix, projection 33 matrix and viewport must be set very carefully. Furthermore, if the 39 current raster position, bypassing the modelview matrix, the 40 projection matrix and the viewport to window mapping. Furthermore, 94 matrix, projection matrix and viewport parameters are ignored and the
|
/external/skia/include/utils/ |
SkLayer.h | 88 /** Return, in matrix, the matix transfomations that are applied locally 89 when this layer draws (i.e. its position and matrix/anchorPoint). 93 void getLocalTransform(SkMatrix* matrix) const; 95 /** Return, in matrix, the concatenation of transforms that are applied 97 This is the matrix that is applied to the layer during drawing. 99 void localToGlobal(SkMatrix* matrix) const;
|
/external/skia/src/utils/ |
SkCanvasStack.cpp | 64 * We need to handle setMatrix specially as it overwrites the matrix in each 65 * canvas unlike all other matrix operations (i.e. translate, scale, etc) which 66 * just pre-concatenate with the existing matrix. 68 void SkCanvasStack::didSetMatrix(const SkMatrix& matrix) { 72 SkMatrix tempMatrix = matrix; 77 this->SkCanvas::didSetMatrix(matrix);
|
/frameworks/base/docs/html/training/graphics/opengl/ |
motion.jd | 49 transformation matrix (a rotation matrix) and then combine it with your projection and 61 Matrix.setRotateM(mRotationMatrix, 0, angle, 0, 0, -1.0f); 63 // Combine the rotation matrix with the projection and camera view 65 // for the matrix multiplication product to be correct. 66 Matrix.multiplyMM(scratch, 0, mMVPMatrix, 0, mRotationMatrix, 0);
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/gdiplus/ |
gdiplusbrush.h | 291 Status GetTransform(Matrix *matrix) const 295 matrix ? matrix->nativeMatrix : NULL)); 304 Status MultiplyTransform(const Matrix *matrix, 309 matrix ? matrix->nativeMatrix : NULL, order)); 378 Status SetTransform(const Matrix *matrix) [all...] |
/external/deqp/modules/gles2/functional/ |
es2fShaderMatrixTests.cpp | 21 * \brief Shader matrix arithmetic tests. 30 * + matrix source 393 tcu::Matrix<T, Rows, Cols> matrixCompMult (const tcu::Matrix<T, Rows, Cols>& a, const tcu::Matrix<T, Rows, Cols>& b) 395 tcu::Matrix<T, Rows, Cols> retVal; 407 tcu::Matrix<T, Rows, Cols> negate (const tcu::Matrix<T, Rows, Cols>& mat) 409 tcu::Matrix<T, Rows, Cols> retVal; 421 tcu::Matrix<T, Rows, Cols> increment (const tcu::Matrix<T, Rows, Cols>& mat [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
d3dx9effect.h | 139 STDMETHOD(SetMatrix)(THIS_ D3DXHANDLE parameter, CONST D3DXMATRIX* matrix) PURE; 140 STDMETHOD(GetMatrix)(THIS_ D3DXHANDLE parameter, D3DXMATRIX* matrix) PURE; 141 STDMETHOD(SetMatrixArray)(THIS_ D3DXHANDLE parameter, CONST D3DXMATRIX* matrix, UINT count) PURE; 142 STDMETHOD(GetMatrixArray)(THIS_ D3DXHANDLE parameter, D3DXMATRIX* matrix, UINT count) PURE; 143 STDMETHOD(SetMatrixPointerArray)(THIS_ D3DXHANDLE parameter, CONST D3DXMATRIX** matrix, UINT count) PURE; 144 STDMETHOD(GetMatrixPointerArray)(THIS_ D3DXHANDLE parameter, D3DXMATRIX** matrix, UINT count) PURE; 145 STDMETHOD(SetMatrixTranspose)(THIS_ D3DXHANDLE parameter, CONST D3DXMATRIX* matrix) PURE; 146 STDMETHOD(GetMatrixTranspose)(THIS_ D3DXHANDLE parameter, D3DXMATRIX* matrix) PURE; 147 STDMETHOD(SetMatrixTransposeArray)(THIS_ D3DXHANDLE parameter, CONST D3DXMATRIX* matrix, UINT count) PURE; 148 STDMETHOD(GetMatrixTransposeArray)(THIS_ D3DXHANDLE parameter, D3DXMATRIX* matrix, UINT count) PURE [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
shader.h | 36 struct matrix; 58 const struct matrix *mat); 59 void shader_set_paint_matrix(struct shader *shader, const struct matrix *mat);
|
/external/chromium_org/third_party/qcms/src/ |
transform_util.h | 51 struct matrix build_colorant_matrix(qcms_profile *p); 55 struct matrix matrix_invert(struct matrix mat);
|
/external/chromium_org/third_party/skia/dm/ |
DMQuiltTask.cpp | 42 SkMatrix matrix = tileCanvas.getTotalMatrix(); local 43 matrix.postTranslate(-xOffset, -yOffset); 44 tileCanvas.setMatrix(matrix);
|
/external/chromium_org/third_party/skia/experimental/PdfViewer/pdfparser/native/pdfapi/ |
SkPdfCalrgbColorSpaceDictionary_autogen.cpp | 47 SkPdfArray* SkPdfCalrgbColorSpaceDictionary::Matrix(SkPdfNativeDoc* doc) { 48 SkPdfNativeObject* ret = get("Matrix", ""); 56 return get("Matrix", "") != NULL;
|
/external/chromium_org/third_party/skia/samplecode/ |
SampleDash.cpp | 27 SkMatrix matrix; local 28 matrix.setScale(SkIntToScalar(width), SK_Scalar1); 31 SkShader::kClamp_TileMode, &matrix);
|
/external/chromium_org/third_party/skia/src/effects/ |
SkRectShaderImageFilter.cpp | 71 SkMatrix matrix(ctx.ctm()); 72 matrix.postTranslate(SkIntToScalar(-bounds.left()), SkIntToScalar(-bounds.top())); 73 paint.setShader(SkShader::CreateLocalMatrixShader(fShader, matrix))->unref();
|
/external/chromium_org/third_party/skia/src/pdf/ |
SkPDFShader.h | 37 * @param matrix The current transform. (PDF shaders are absolutely 39 * @param surfceBBox The bounding box of the drawing surface (with matrix 43 const SkMatrix& matrix,
|
/external/chromium_org/tools/perf/page_sets/tough_animation_cases/ |
keyframed_animations.html | 24 0% { -webkit-transform: matrix(1, 0, 0, 1, 0, 0); } 25 50% { -webkit-transform: matrix(-1, 0, 0, -1, 0, 0); } 26 100% { -webkit-transform: matrix(1, 0, 0, 1, 0, 0); } 48 0% { -webkit-transform: matrix(1, 0, 0, 1, 0, 0); opacity(1); } 49 50% { -webkit-transform: matrix(-.5, .5, -.5, -1.2, -150, 100); opacity(0); } 50 100% { -webkit-transform: matrix(1, 0, 0, 1, 0, 0); opacity(1); } 72 0% { -webkit-transform: matrix(1, 0, 0, 1, 0, 0) rotate3d(0, 1, 0, 0deg); } 73 50% { -webkit-transform: matrix(-1, .5, .2, -1, 100, 100) rotate3d(0, 1, 0, 45deg); } 74 100% { -webkit-transform: matrix(1, 0, 0, 1, 0, 0) rotate3d(0, 1, 0, 0deg); } 102 0% { -webkit-transform: matrix(10, 0, 0, 10, 0, 0) rotate3d(1, 1, 1, 0deg); opacity(1); [all...] |
/external/eigen/Eigen/src/SparseLU/ |
SparseLU_SupernodalMatrix.h | 22 * Only the lower triangular matrix has supernodes. 38 typedef Matrix<Index,Dynamic,1> IndexVector; 39 typedef Matrix<Scalar,Dynamic,1> ScalarVector; 56 * Set appropriate pointers for the lower triangular supernodal matrix 178 * \brief InnerIterator class to iterate over nonzero values of the current column in the supernodal matrix L 218 const MappedSuperNodalMatrix& m_matrix; // Supernodal lower triangular matrix 229 * \brief Solve with the supernode triangular matrix 239 Matrix<Scalar,Dynamic,Dynamic> work(n, nrhs); // working vector 270 Map<const Matrix<Scalar,Dynamic,Dynamic>, 0, OuterStride<> > A( &(Lval[luptr]), nsupc, nsupc, OuterStride<>(lda) ); 271 Map< Matrix<Scalar,Dynamic,Dynamic>, 0, OuterStride<> > U (&(X(fsupc,0)), nsupc, nrhs, OuterStride<>(n) ); [all...] |