| /external/chromium_org/webkit/renderer/compositor_bindings/ |
| web_layer_impl_fixed_bounds_unittest.cc | 112 fixed_bounds_layer->setTransform(transform.matrix());
113 fixed_bounds_layer->setSublayerTransform(sublayer_transform.matrix());
125 normal_layer->setTransform(transform.matrix());
126 normal_layer->setSublayerTransform(sublayer_transform.matrix());
|
| /external/eigen/Eigen/ |
| IterativeLinearSolvers | 12 * This module currently provides iterative methods to solve problems of the form \c A \c x = \c b, where \c A is a squared matrix, usually very large and sparse.
|
| /external/eigen/Eigen/src/Core/ |
| DenseBase.h | 21 * This class is the base that is inherited by all dense objects (matrix, vector, arrays,
24 * \tparam Derived is the derived type, e.g., a matrix type or an expression.
183 * \note For a vector, this returns just 1. For a matrix (non-vector), this is the major dimension
185 * column-major matrix, and the number of rows for a row-major matrix. */
194 * \note For a vector, this is just the size. For a matrix (non-vector), this is the minor dimension
196 * column-major matrix, and the number of columns for a row-major matrix. */
204 * Matrix::resize() and Array::resize(). The present method only asserts that the new size equals the old size, and does
214 * Matrix::resize() and Array::resize(). The present method only asserts that the new size equals the old si (…)
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| TriangularSolverMatrix_MKL.h | 29 * Triangular matrix * matrix product functionality based on ?TRMM.
71 typedef Matrix<EIGTYPE, Dynamic, Dynamic, TriStorageOrder> MatrixTri; \
126 typedef Matrix<EIGTYPE, Dynamic, Dynamic, TriStorageOrder> MatrixTri; \
|
| TriangularSolverVector.h | 38 typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,RowMajor>, 0, OuterStride<> > LhsMap;
74 rhs[i] -= (cjLhs.row(i).segment(s,k).transpose().cwiseProduct(Map<const Matrix<RhsScalar,Dynamic,1> >(rhs+s,k))).sum();
92 typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > LhsMap;
117 Map<Matrix<RhsScalar,Dynamic,1> >(rhs+s,r) -= rhs[i] * cjLhs.col(i).segment(s,r);
|
| /external/eigen/Eigen/src/Geometry/ |
| Scaling.h | 70 /** Concatenates a uniform scaling and a linear transformation matrix */
77 inline Matrix<Scalar,Dim,Dim> operator*(const RotationBase<Derived,Dim>& r) const
107 /** Concatenates a linear transformation matrix and a uniform scaling */
157 res.matrix().setZero();
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseDiagonalProduct.h | 15 // The product of a diagonal matrix with a sparse matrix can be easily
86 eigen_assert(lhs.cols() == rhs.rows() && "invalid sparse matrix * diagonal matrix product");
|
| /external/eigen/bench/ |
| bench_unrolling | 8 echo "Matrix size: $i x $i :"
|
| benchmarkSlice.cpp | 20 typedef Matrix<SCALAR, Eigen::Dynamic, Eigen::Dynamic> Mat;
|
| sparse_dense_product.cpp | 124 Map<Matrix<Scalar,Dynamic,1> >(&gmmV1[0], cols) = v1;
125 Map<Matrix<Scalar,Dynamic,1> >(&gmmV2[0], cols) = v2;
146 // Map<Matrix<Scalar,Dynamic,1> >(&gmmV1[0], cols) = v1;
147 // Map<Matrix<Scalar,Dynamic,1> >(&gmmV2[0], cols) = v2;
|
| spmv.cpp | 177 Map<Matrix<Scalar,Dynamic,1> >(&uv[0], cols) = dv;
178 Map<Matrix<Scalar,Dynamic,1> >(&ures[0], rows) = res;
195 Map<Matrix<Scalar,Dynamic,1> >(&gv[0], cols) = dv;
196 Map<Matrix<Scalar,Dynamic,1> >(&gres[0], rows) = res;
|
| vdw_new.cpp | 18 typedef Matrix<SCALAR, Eigen::Dynamic, 1> Vec;
|
| /external/eigen/doc/special_examples/ |
| Tutorial_sparse_example.cpp | 4 typedef Eigen::SparseMatrix<double> SpMat; // declares a column-major sparse matrix type of double
|
| /external/eigen/test/ |
| array_reverse.cpp | 20 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
112 CALL_SUBTEST_1( reverse(Matrix<float, 1, 1>()) );
119 CALL_SUBTEST_8( reverse(Matrix<float, 100, 100>()) );
120 CALL_SUBTEST_9( reverse(Matrix<float,Dynamic,Dynamic,RowMajor>(6,3)) );
|
| commainitializer.cpp | 24 Matrix3d ref = Map<Matrix<double,3,3,RowMajor> >(data);
|
| geo_hyperplane.cpp | 26 typedef Matrix<Scalar, HyperplaneType::AmbientDimAtCompileTime, 1> VectorType;
27 typedef Matrix<Scalar, HyperplaneType::AmbientDimAtCompileTime,
84 typedef Matrix<Scalar,2,1> Vector;
85 typedef Matrix<Scalar,3,1> CoeffsType;
|
| product_symm.cpp | 16 typedef Matrix<Scalar, Size, Size> MatrixType;
17 typedef Matrix<Scalar, Size, OtherSize> Rhs1;
18 typedef Matrix<Scalar, OtherSize, Size> Rhs2;
20 typedef Matrix<Scalar, Size, OtherSize,order> Rhs3;
|
| resize.cpp | 17 Matrix<double, rows, cols> C;
|
| /external/eigen/test/eigen2/ |
| eigen2_commainitializer.cpp | 24 Matrix3d ref = Map<Matrix<double,3,3,RowMajor> >(data);
|
| eigen2_hyperplane.cpp | 25 typedef Matrix<Scalar, HyperplaneType::AmbientDimAtCompileTime, 1> VectorType;
26 typedef Matrix<Scalar, HyperplaneType::AmbientDimAtCompileTime,
83 typedef Matrix<Scalar,2,1> Vector;
84 typedef Matrix<Scalar,3,1> CoeffsType;
|
| eigen2_map.cpp | 96 CALL_SUBTEST_1( map_class_vector(Matrix<float, 1, 1>()) );
102 CALL_SUBTEST_1( map_class_matrix(Matrix<float, 1, 1>()) );
104 CALL_SUBTEST_6( map_class_matrix(Matrix<float,3,5>()) );
108 CALL_SUBTEST_1( map_static_methods(Matrix<double, 1, 1>()) );
|
| eigen2_sparse_solvers.cpp | 14 Matrix<Scalar,Dynamic,Dynamic>& refMat,
17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols());
36 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
37 typedef Matrix<Scalar,Dynamic,1> DenseVector;
|
| /external/eigen/unsupported/test/ |
| kronecker_product.cpp | 87 // DM = dense matrix; SM = sparse matrix
88 Matrix<double, 2, 3> DM_a;
107 Matrix<double, 6, 6> DM_fix_ab;
|
| polynomialsolver.cpp | 37 typedef Matrix<Scalar,Deg,1> EvalRootsType;
111 typedef Matrix<Scalar,Deg,1> EvalRootsType;
171 typedef Matrix<_Scalar,Dim::ret,1> PolynomialType;
172 typedef Matrix<_Scalar,_Deg,1> EvalRootsType;
|
| /external/llvm/test/CodeGen/X86/ |
| stack-update-frame-opcode.ll | 10 ; There is a 2x2 variation matrix here:
|
