HomeSort by relevance Sort by last modified time
    Searched full:matrix (Results 1276 - 1300 of 3296) sorted by null

<<51525354555657585960>>

  /frameworks/native/opengl/libagl/
Android.mk 20 matrix.cpp.arm \
  /frameworks/native/services/surfaceflinger/RenderEngine/
Texture.h 42 void setMatrix(float const* matrix);
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/category/
IconView.java 26 import android.graphics.Matrix;
203 Matrix m = new Matrix();
207 new RectF(mBitmapBounds), Matrix.ScaleToFit.CENTER);
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/
ImageGrad.java 21 import android.graphics.Matrix;
37 Matrix mToScr = new Matrix();
135 Matrix toImg = getScreenToImageMatrix(false);
  /packages/apps/Gallery2/src/com/android/photos/shims/
BitmapJobDrawable.java 22 import android.graphics.Matrix;
42 private Matrix mDrawMatrix = new Matrix();
114 // Calculates a matrix similar to ScaleType.CENTER_CROP
  /packages/wallpapers/Basic/src/com/android/wallpaper/galaxy/
galaxy.rs 214 rs_matrix4x4 matrix;
215 calcMatrix(&matrix, mix(-0.5f, 0.5f, gXOffset));
216 drawParticles(&matrix);
217 drawLights(&matrix);
  /external/ceres-solver/internal/ceres/
line_search_direction.cc 162 inverse_hessian_ = Matrix::Identity(num_parameters, num_parameters);
231 // This update involves matrix, matrix products which naively O(N^3),
257 Matrix A = delta_x * (delta_gradient.transpose() *
266 Matrix B = Matrix::Zero(num_parameters_, num_parameters_);
296 Matrix inverse_hessian_;
linear_solver.h 158 // Given a matrix A, an optional diagonal matrix D as a vector,
174 // Here A is a matrix of size m x n, with full column rank. If A
183 // depends on the condition number of the matrix A. For example
189 // simplest form a preconditioner is a matrix M such that instead
198 // A null preconditioner is equivalent to an identity matrix being
279 // other linear solvers that depend on the particular matrix layout of
triplet_sparse_matrix_test.cc 48 // Build a matrix
176 // Build one matrix.
187 // Build another matrix.
202 // Glue the second matrix to the bottom of the first.
229 // Build one matrix.
240 // Build another matrix.
255 // Glue the second matrix to the left of the first.
  /external/chromium_org/third_party/freetype/src/base/
ftglyph.c 217 const FT_Matrix* matrix,
223 if ( matrix )
224 FT_Outline_Transform( &glyph->outline, matrix );
422 FT_Matrix* matrix,
437 clazz->glyph_transform( glyph, matrix, delta );
440 if ( matrix )
441 FT_Vector_Transform( &glyph->advance, matrix );
  /external/chromium_org/third_party/mesa/src/src/glsl/
lower_mat_op_to_vec.cpp 27 * Breaks matrix operation expressions down to a series of vector operations.
29 * Generally this is how we have to codegen matrix operations for a
88 /* Pull out any matrix expression to a separate assignment to a
90 * operations on the matrix's vector components much easier.
351 /* OK, time to break down this matrix operation. */
373 /* For most operations, the matrix version is just going
420 printf("FINISHME: Handle matrix operation for %s\n",
  /external/chromium_org/third_party/mesa/src/src/mesa/x86/
sse_xform1.S 30 * data (trans-matrix, src_vert, dst_vert) needs to be 16byte aligned !
57 MOV_L( ARG_MATRIX, EDX ) /* ptr to matrix */
166 MOV_L( ARG_MATRIX, EDX ) /* ptr to matrix */
227 MOV_L( ARG_MATRIX, EDX ) /* ptr to matrix */
286 MOV_L( ARG_MATRIX, EDX ) /* ptr to matrix */
341 MOV_L( ARG_MATRIX, EDX ) /* ptr to matrix */
398 MOV_L( ARG_MATRIX, EDX ) /* ptr to matrix */
  /external/chromium_org/third_party/opus/src/silk/float/
main_FLP.h 211 silk_float *wXX, /* I/O Weighted correlation matrix, reg. out */
227 /* Calculates correlation matrix X'*X */
232 silk_float *XX /* O X'*X correlation matrix [order x order] */
244 /* Add noise to matrix diagonal */
252 /* Function to solve linear equation Ax = b, where A is an MxM symmetric matrix */
254 silk_float *A, /* I/O Symmetric square matrix, out: reg. */
255 const opus_int M, /* I Size of matrix */
  /external/eigen/Eigen/src/Core/
SolveTriangular.h 56 typedef Map<Matrix<RhsScalar,Dynamic,1>, Aligned> MappedRhs;
80 // the rhs is a matrix
194 * This function computes the inverse-matrix matrix product inverse(\c *this) * \a other if
198 * The matrix \c *this must be triangular and invertible (i.e., all the coefficients of the
200 * is an upper (resp. lower) triangular matrix.
206 * to the same matrix or vector \a other.
  /external/eigen/blas/
chpr2.f 19 * n by n hermitian matrix, supplied in packed form.
26 * triangular part of the matrix A is supplied in the packed
38 * On entry, N specifies the order of the matrix A.
71 * contain the upper triangular part of the hermitian matrix
76 * updated matrix.
78 * contain the lower triangular part of the hermitian matrix
83 * updated matrix.
zhpr2.f 19 * n by n hermitian matrix, supplied in packed form.
26 * triangular part of the matrix A is supplied in the packed
38 * On entry, N specifies the order of the matrix A.
71 * contain the upper triangular part of the hermitian matrix
76 * updated matrix.
78 * contain the lower triangular part of the hermitian matrix
83 * updated matrix.
  /external/eigen/test/
geo_quaternion.cpp 27 typedef Matrix<Scalar,3,1> VectorType;
51 typedef Matrix<Scalar,3,3> Matrix3;
52 typedef Matrix<Scalar,3,1> Vector3;
53 typedef Matrix<Scalar,4,1> Vector4;
94 // rotation matrix conversion
125 v3 = (v1.array()+eps).matrix();
136 v3 = (v1.array()+eps).matrix();
  /external/eigen/unsupported/Eigen/src/SparseExtra/
DynamicSparseMatrix.h 19 * \brief A sparse matrix class designed for matrix assembly purpose
25 * nonzero and outer_size is the number of columns if the matrix is column-major and the number of rows
195 /** Resize the matrix without preserving the data (the matrix is set to zero)
281 * Set the matrix to zero and reserve the memory for \a reserveSize nonzero coefficients. */
293 * \c i \c x \a col such that \c i >= \a row. Otherwise the matrix is invalid.
  /external/freetype/src/base/
ftglyph.c 219 const FT_Matrix* matrix,
225 if ( matrix )
226 FT_Outline_Transform( &glyph->outline, matrix );
424 FT_Matrix* matrix,
439 clazz->glyph_transform( glyph, matrix, delta );
442 if ( matrix )
443 FT_Vector_Transform( &glyph->advance, matrix );
  /external/mesa3d/src/glsl/
lower_mat_op_to_vec.cpp 27 * Breaks matrix operation expressions down to a series of vector operations.
29 * Generally this is how we have to codegen matrix operations for a
88 /* Pull out any matrix expression to a separate assignment to a
90 * operations on the matrix's vector components much easier.
351 /* OK, time to break down this matrix operation. */
373 /* For most operations, the matrix version is just going
420 printf("FINISHME: Handle matrix operation for %s\n",
  /external/mesa3d/src/mesa/x86/
sse_xform1.S 30 * data (trans-matrix, src_vert, dst_vert) needs to be 16byte aligned !
57 MOV_L( ARG_MATRIX, EDX ) /* ptr to matrix */
166 MOV_L( ARG_MATRIX, EDX ) /* ptr to matrix */
227 MOV_L( ARG_MATRIX, EDX ) /* ptr to matrix */
286 MOV_L( ARG_MATRIX, EDX ) /* ptr to matrix */
341 MOV_L( ARG_MATRIX, EDX ) /* ptr to matrix */
398 MOV_L( ARG_MATRIX, EDX ) /* ptr to matrix */
  /external/wpa_supplicant_8/wpa_supplicant/wpa_gui-qt4/icons/
wpa_gui.svg 155 gradientTransform="matrix(2.7837903e-8,-1,0.99999999,-2.1864248e-6,-32.000004,164.7061)" />
165 gradientTransform="matrix(3.1472435e-6,1.0227273,-0.87499999,-9.5061964e-8,94.067865,-4.7272712)" />
175 gradientTransform="matrix(0,0.83333324,-1.6666667,2.518705e-6,59.378243,-35.333302)" />
185 gradientTransform="matrix(1.1333333,5.1768857e-8,5.2556881e-6,1.1666667,-8.6091298,-10.332226)" />
242 transform="matrix(-0.16680323,0.53082142,-0.53082142,-0.16680323,103.31027,53.117897)"
247 transform="matrix(1.4851301,0,0,1.4851301,16.475837,-23.948973)"
252 transform="matrix(-0.35033273,1.1148712,-1.1148712,-0.35033273,146.5624,46.88078)"
  /frameworks/base/core/jni/
android_view_GLES20DisplayList.cpp 78 jobject clazz, DisplayList* displayList, SkMatrix* matrix) {
79 displayList->setStaticMatrix(matrix);
83 jobject clazz, DisplayList* displayList, SkMatrix* matrix) {
84 displayList->setAnimationMatrix(matrix);
203 jobject clazz, DisplayList* displayList, SkMatrix* matrix) {
206 matrix->setConcat(SkMatrix::I(), *source);
208 matrix->setIdentity();
  /external/chromium_org/cc/output/
software_renderer.cc 41 bool IsScaleAndIntegerTranslate(const SkMatrix& matrix) {
42 return IsScalarNearlyInteger(matrix[SkMatrix::kMTransX]) &&
43 IsScalarNearlyInteger(matrix[SkMatrix::kMTransY]) &&
44 SkScalarNearlyZero(matrix[SkMatrix::kMSkewX]) &&
45 SkScalarNearlyZero(matrix[SkMatrix::kMSkewY]) &&
46 SkScalarNearlyZero(matrix[SkMatrix::kMPersp0]) &&
47 SkScalarNearlyZero(matrix[SkMatrix::kMPersp1]) &&
48 SkScalarNearlyZero(matrix[SkMatrix::kMPersp2] - 1.0f);
166 // Skia applies the current matrix to clip rects so we reset it temporary.
288 // We need to apply the matrix manually to have pixel-sized stroke width
    [all...]
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteLUT.h 48 typedef Matrix<Scalar,Dynamic,1> Vector;
54 typedef Matrix<Scalar,Dynamic,Dynamic> MatrixType;
77 * \c NumericalIssue if the matrix.appears to be negative.
92 * Compute an incomplete LU factorization with dual threshold on the matrix mat
123 && "IncompleteLUT::solve(): invalid number of rows of the right hand side matrix b");
227 // FIXME for a matrix with nearly symmetric pattern, mat2+mat1 is the appropriate choice.
246 eigen_assert((amat.rows() == amat.cols()) && "The factorization should be done on a square matrix");
247 int n = amat.cols(); // Size of the matrix
273 // global loop over the rows of the sparse matrix
396 // 4 - partially sort and insert the elements in the m_lu matrix
    [all...]

Completed in 616 milliseconds

<<51525354555657585960>>