| /external/skia/gm/ |
| D | shadertext2.cpp | 48 SkTDArray<LabeledMatrix> matrices; variable
49 matrices.append()->fMatrix.reset();
50 matrices.top().fLabel = "Identity";
51 matrices.append()->fMatrix.setScale(1.2f, 0.8f);
52 matrices.top().fLabel = "Scale";
53 matrices.append()->fMatrix.setRotate(10.f);
54 matrices.top().fLabel = "Rotate";
55 matrices.append()->fMatrix.reset();
56 matrices.top().fMatrix.setPerspX(-0.0015f);
57 matrices.top().fMatrix.setPerspY(+0.0015f);
[all …]
|
| D | bleed.cpp | 474 SkTDArray<SkMatrix> matrices; in onDraw() local
476 *matrices.append() = SkMatrix::I(); in onDraw()
484 *matrices.append() = m; in onDraw()
488 matrices[matrices.count()-1].mapPoints(corners, 4); in onDraw()
494 *matrices.append() = m; in onDraw()
500 for (int m = 0; m < matrices.count(); ++m) { in onDraw()
502 canvas->concat(matrices[m]); in onDraw()
548 matrices[m].mapPoints(corners, 4); in onDraw()
|
| D | localmatriximagefilter.cpp | 74 const SkMatrix matrices[] = { in onDraw() local
88 for (const auto& matrix : matrices) { in onDraw()
|
| /external/opencv/cvaux/src/ |
| D | cvtexture.cpp | 60 double*** matrices; member
140 newGLCM->matrices = 0; in cvCreateGLCM()
233 if( (flag == CV_GLCM_GLCM || flag == CV_GLCM_ALL) && (*GLCM)->matrices ) in cvReleaseGLCM()
237 if( (*GLCM)->matrices[ matrixLoop ] ) in cvReleaseGLCM()
239 cvFree( (*GLCM)->matrices[matrixLoop] ); in cvReleaseGLCM()
240 cvFree( (*GLCM)->matrices + matrixLoop ); in cvReleaseGLCM()
244 cvFree( &((*GLCM)->matrices) ); in cvReleaseGLCM()
283 double*** matrices = 0; in icvCreateGLCM_LookupTable_8u_C1R() local
286 CV_CALL( destGLCM->matrices = (double***)cvAlloc( sizeof(matrices[0])*numSteps )); in icvCreateGLCM_LookupTable_8u_C1R()
287 matrices = destGLCM->matrices; in icvCreateGLCM_LookupTable_8u_C1R()
[all …]
|
| /external/eigen/doc/ |
| D | TutorialArrayClass.dox | 59 …overloaded to provide write and read access to the coefficients of an array, just as with matrices.
76 Adding and subtracting two arrays is the same as for matrices.
94 … course you can multiply an array by a scalar, this works in the same way as matrices. Where arrays
95 are fundamentally different from matrices, is when you multiply two together. Matrices interpret
133 apply Matrix operations on arrays, or Array operations on matrices. Thus, if you need to do linear …
134 operations such as matrix multiplication, then you should use matrices; if you need to do coefficie…
137 access to all operations regardless of the choice of declaring objects as arrays or as matrices.
147 Mixing matrices and arrays in an expression is forbidden with Eigen. For instance, you cannot add a…
148 array directly; the operands of a \c + operator should either both be matrices or both be arrays. H…
156 <tt>result = m.array() * n.array()</tt> takes two matrices \c m and \c n, converts them both to an …
[all …]
|
| D | StorageOrders.dox | 5 There are two different storage orders for matrices and two-dimensional arrays: column-major and ro…
63 Matrices and arrays using one storage order can be assigned to matrices and arrays using the other …
65 the entries automatically. More generally, row-major and column-major matrices can be mixed in an e…
79 … matrices. It may be worthwhile to experiment a bit to find out what is faster for your particular
82 …is thus done with column-major matrices. This means that, even though we aim to support column-maj…
83 …ajor storage orders transparently, the Eigen library may well work best with column-major matrices.
|
| D | TutorialMatrixClass.dox | 7 In Eigen, all matrices and vectors are objects of the Matrix template class.
8 Vectors are just a special case of matrices, with either 1 row or 1 column.
40 matrices, with either 1 row or 1 column. The case where they have 1 column is the most common;
55 Of course, Eigen is not limited to matrices whose dimensions are known at compile time.
86 Constructors taking sizes are also available. For matrices, the number of rows is always passed fir…
97 In order to offer a uniform API across fixed-size and dynamic-size matrices, it is legal to use the…
98 constructors on fixed-size matrices, even if passing the sizes is useless in this case. So this is …
114 For matrices, the row index is always passed first. For vectors, just pass one index.
127 is not restricted to vectors, it is also available for general matrices, meaning index-based access
128 … of coefficients. This however depends on the matrix's storage order. All Eigen matrices default to
[all …]
|
| D | PreprocessorDirectives.dox | 25 …- \b EIGEN_DEFAULT_DENSE_INDEX_TYPE - the type for column and row indices in matrices, vectors and…
29 …- \b EIGEN_INITIALIZE_MATRICES_BY_ZERO - if defined, all entries of newly constructed matrices and…
30 …initialized to zero, as are new entries in matrices and arrays after resizing. Not defined by defa…
31 …- \b EIGEN_INITIALIZE_MATRICES_BY_NAN - if defined, all entries of newly constructed matrices and …
32 …initialized to NaN, as are new entries in matrices and arrays after resizing. This option is espec…
35 …- \b EIGEN_NO_AUTOMATIC_RESIZING - if defined, the matrices (or arrays) on both sides of an assign…
76 …temporary buffers, dynamic memory allocation is employed as a fall back. For fixed-size matrices o…
106 …- \b EIGEN_DEFAULT_TO_ROW_MAJOR - when defined, the default storage order for matrices becomes row…
|
| D | HiPerformance.dox | 8 for small fixed size matrices. For large matrices, however, it might be useful to
25 Let's start with the most common primitive: the matrix product of general dense matrices.
29 where A, B, and C are column and/or row major matrices (or sub-matrices),
124 …all these remarks hold for all other kind of products involving triangular or selfadjoint matrices.
|
| D | SparseQuickReference.dox | 2 /** \eigenManualPage SparseQuickRefPage Quick reference guide for sparse matrices
7 …matrices in the class SparseMatrix. First, it is recommended to read the introductory tutorial at…
8 …ajor. The default is column major. Most arithmetic operations on sparse matrices will assert that …
103 …perform arithmetic operations on sparse matrices provided that the dimensions are adequate and tha…
186 <td>Sub-matrices</td>
|
| D | TutorialAdvancedInitialization.dox | 5 This page discusses several advanced methods for initializing matrices. It gives more details on the
6 comma-initializer, which was introduced before. It also explains how to get special matrices such a…
27 Moreover, the elements of the initialization list may themselves be vectors or matrices. A common u…
28 to join vectors or matrices together. For example, here is how to join two row vectors together. Re…
40 We can use the same technique to initialize matrices with a block structure.
64 \section TutorialAdvancedInitializationSpecialMatrices Special matrices and arrays
|
| D | TutorialLinearAlgebra.dox | 15 Where \a A and \a b are matrices (\a b could be a vector, as a special case). You want to find a so…
36 works for all matrices while being quite fast. Here is a table of some other decompositions that yo…
133 SelfAdjointEigenSolver, it could easily be adapted to general matrices using EigenSolver or Complex…
153 However, for \em very \em small matrices, the above is not true, and inverse and determinant can be…
157 …orming a LU decomposition, and instead use formulas that are more efficient on such small matrices.
208 Finally, you can tell the decomposition constructor to preallocate storage for decomposing matrices…
209 so that when you subsequently decompose such matrices, no dynamic memory allocation is performed (o…
210 are using fixed-size matrices, no dynamic memory allocation happens at all). This is done by just
|
| D | QuickStartGuide.dox | 51 Here is another example, which combines matrices with vectors. Concentrate on the left-hand program…
84 …nts matrices of arbitrary size. The version in the right column is similar, except that the matrix…
86 …matrices and vectors has two advantages. The compiler emits better (faster) code because it knows …
|
| D | TopicLinearAlgebraDecompositions.dox | 118 <td>Slow (but fast for small matrices)</td>
229 …ces a pure diagonal D matrix, and therefore it cannot handle indefinite matrices, unlike Lapack's …
231 …o-sided, making for proven and optimal precision for square matrices. For non-square matrices, we …
248 … can work per block, whence guaranteeing a good scaling of the performance for large matrices.</dd>
254 …ans the algorithm is automatically and explicitly unrolled for very small fixed size matrices.</dd>
|
| D | FunctionsTakingEigenTypes.dox | 17 …rse and special matrix classes). Use it in functions that are meant to work only on dense matrices.
19 …e and \c ArrayBase. It can be used in functions that are meant to work on both matrices and arrays.
20 … be evaluated into dense matrices or arrays, for example special matrix classes such as diagonal m…
94 …s an example of a function computing the covariance matrix of two input matrices where each row is…
124 …fine unless you require a generic implementation that works with double matrices too and unless yo…
171 … with temporary expressions but it also allows to use the function with matrices of arbitrary floa…
177 \section TopicResizingInGenericImplementations How to resize matrices in generic implementations?
205 …s now working for parameters being expressions and for parameters being matrices and having the wr…
|
| D | TutorialGeometry.dox | 10 …NOT represented as matrices, but you can nevertheless mix them with matrices and vectors in expres…
11 …- Projective or affine transformation matrices: see the Transform class. These are really matrices.
13 \note If you are working with OpenGL 4x4 matrices then Affine3f and Affine3d are what you want. Sin…
70 representations are rotation matrices, while for other usages Quaternion is the
|
| /external/eigen/Eigen/ |
| D | IterativeLinearSolvers | 14 * - ConjugateGradient for selfadjoint (hermitian) matrices,
15 * - BiCGSTAB for general square matrices.
19 …alPreconditioner - also called JAcobi preconditioner, work very well on diagonal dominant matrices.
|
| /external/eigen/unsupported/Eigen/src/SVD/ |
| D | TODOBdcsvd.txt | 6 - support static matrices
7 …- return a error at compilation time when using integer matrices (int, long, std::complex<int>, ..…
27 … 6) multiply naiveU and naiveV to the right by the matrices found, only naiveU when CompV is set to
|
| D | doneInBDCSVD.txt | 14 The implemented has trouble with fixed size matrices.
16 In the actual implementation, it returns matrices of zero when ask to do a svd on an int matrix.
|
| /external/skia/src/gpu/glsl/ |
| D | GrGLSLProgramDataManager.h | 61 virtual void setMatrix3fv(UniformHandle, int arrayCount, const float matrices[]) const = 0;
62 virtual void setMatrix4fv(UniformHandle, int arrayCount, const float matrices[]) const = 0;
|
| /external/skia/src/gpu/vk/ |
| D | GrVkProgramDataManager.h | 38 void setMatrix3fv(UniformHandle, int arrayCount, const float matrices[]) const override;
39 void setMatrix4fv(UniformHandle, int arrayCount, const float matrices[]) const override;
|
| /external/skia/src/gpu/gl/ |
| D | GrGLProgramDataManager.cpp | 232 const float matrices[]) const { in setMatrix3fv()
240 UniformMatrix3fv(uni.fFSLocation, arrayCount, false, matrices)); in setMatrix3fv()
244 UniformMatrix3fv(uni.fVSLocation, arrayCount, false, matrices)); in setMatrix3fv()
250 const float matrices[]) const { in setMatrix4fv()
258 UniformMatrix4fv(uni.fFSLocation, arrayCount, false, matrices)); in setMatrix4fv()
262 UniformMatrix4fv(uni.fVSLocation, arrayCount, false, matrices)); in setMatrix4fv()
|
| D | GrGLProgramDataManager.h | 66 void setMatrix3fv(UniformHandle, int arrayCount, const float matrices[]) const override;
67 void setMatrix4fv(UniformHandle, int arrayCount, const float matrices[]) const override;
|
| /external/opencv3/doc/tutorials/core/how_to_use_ippa_conversion/ |
| D | how_to_use_ippa_conversion.markdown | 12 [hppiMatrix](http://software.intel.com/en-us/node/501660) and Mat matrices.
70 -# Create an array of virtual matrices using
114 -# Delete hpp matrices.
122 -# Delete virtual matrices and accelerator instance.
|
| /external/opencv/cv/src/ |
| D | cvlkpyramid.cpp | 659 float *matrices, int count, in cvCalcAffineFlowPyrLK() argument
721 if( !matrices ) in cvCalcAffineFlowPyrLK()
756 if( !featuresA || !featuresB || !matrices ) in cvCalcAffineFlowPyrLK()
790 matrices[i] = matrices[i + 3] = 1.f; in cvCalcAffineFlowPyrLK()
791 matrices[i + 1] = matrices[i + 2] = 0.f; in cvCalcAffineFlowPyrLK()
822 Av[0] = matrices[i*4]; in cvCalcAffineFlowPyrLK()
823 Av[1] = matrices[i*4+1]; in cvCalcAffineFlowPyrLK()
824 Av[3] = matrices[i*4+2]; in cvCalcAffineFlowPyrLK()
825 Av[4] = matrices[i*4+3]; in cvCalcAffineFlowPyrLK()
1001 matrices[i*4] = Av[0]; in cvCalcAffineFlowPyrLK()
[all …]
|