| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Math.h | 177 Matrix(unsigned Rows, unsigned Cols) :
178 Rows(Rows), Cols(Cols), Data(new PBQPNum[Rows * Cols]) {
183 Matrix(unsigned Rows, unsigned Cols, PBQPNum InitVal)
184 : Rows(Rows), Cols(Cols), Data(new PBQPNum[Rows * Cols]) {
185 std::fill(Data, Data + (Rows * Cols), InitVal);
190 : Rows(M.Rows), Cols(M.Cols), Data(new PBQPNum[Rows * Cols])
[all...] |
| /external/deqp/framework/common/ |
| tcuMatrix.hpp | 50 template <typename T, int Rows, int Cols>
59 SIZE = Cols,
61 COLS = Cols,
66 explicit Matrix (const T src[Rows*Cols]);
68 Matrix (const Matrix<T, Rows, Cols>& src);
71 Matrix<T, Rows, Cols>& operator= (const Matrix<T, Rows, Cols>& src);
72 Matrix<T, Rows, Cols>& operator*= (const Matrix<T, Rows, Cols>& src)
[all...] |
| /external/eigen/test/ |
| qr_colpivoting.cpp | 18 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols2 = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE); local
19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
24 createRandomPIMatrixOfRank(rank,rows,cols,m1);
27 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
39 MatrixType m2 = MatrixType::Random(cols,cols2);
41 m2 = MatrixType::Random(cols,cols2);
48 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
50 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1);
51 Matrix<Scalar,Rows,Cols> m1;
52 createRandomPIMatrixOfRank(rank,Rows,Cols,m1)
[all...] |
| qr.cpp | 18 Index cols = m.cols(); local
23 MatrixType a = MatrixType::Random(rows,cols);
35 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
37 Matrix<Scalar,Rows,Cols> m1 = Matrix<Scalar,Rows,Cols>::Random();
38 HouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
40 Matrix<Scalar,Rows,Cols> r = qr.matrixQR();
42 for(int i = 0; i < Rows; i++) for(int j = 0; j < Cols; j++) if(i>j) r(i,j) = Scalar(0);
46 Matrix<Scalar,Cols,Cols2> m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2)
[all...] |
| diagonalmatrices.cpp | 16 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
18 typedef Matrix<Scalar, 1, Cols> RowVectorType;
21 typedef DiagonalMatrix<Scalar, Cols> RightDiagonalMatrix;
22 typedef Matrix<Scalar, Rows==Dynamic?Dynamic:2*Rows, Cols==Dynamic?Dynamic:2*Cols> BigMatrix;
24 Index cols = m.cols(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols);
30 RowVectorType rv1 = RowVectorType::Random(cols),
[all...] |
| permutationmatrices.cpp | 17 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime,
22 typedef PermutationMatrix<Cols> RightPermutationType;
23 typedef Matrix<int, Cols, 1> RightPermutationVectorType;
27 Index cols = m.cols(); local
29 MatrixType m_original = MatrixType::Random(rows,cols);
34 randomPermutationVector(rv, cols);
39 for (int j=0; j<cols; j++)
43 Matrix<Scalar,Cols,Cols> rm(rp)
[all...] |
| product_trsolve.cpp | 30 template<typename Scalar,int Size, int Cols> void trsolve(int size=Size,int cols=Cols)
38 rowmajor = Cols==1 ? ColMajor : RowMajor };
39 Matrix<Scalar,Size,Cols,colmajor> cmRhs(size,cols);
40 Matrix<Scalar,Size,Cols,rowmajor> rmRhs(size,cols);
41 Matrix<Scalar,Dynamic,Dynamic,colmajor> ref(size,cols);
71 int c = internal::random<int>(0,cols-1)
[all...] |
| main.h | 327 void createRandomPIMatrixOfRank(typename MatrixType::Index desired_rank, typename MatrixType::Index rows, typename MatrixType::Index cols, MatrixType& m);
329 void createRandomPIMatrixOfRank(typename MatrixType::Index desired_rank, typename MatrixType::Index rows, typename MatrixType::Index cols, MatrixType& m)
333 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
337 typedef Matrix<Scalar, Cols, Cols> MatrixBType;
341 m.setZero(rows,cols);
348 m = VectorType::Random(rows).normalized() * VectorType::Random(cols).normalized().transpose();
353 MatrixType d = MatrixType::Identity(rows,cols);
354 MatrixBType b = MatrixBType::Random(cols,cols);
[all...] |
| /external/eigen/Eigen/src/Core/ |
| NumTraits.h | 124 template<typename Scalar, int Rows, int Cols, int Options, int MaxRows, int MaxCols>
125 struct NumTraits<Array<Scalar, Rows, Cols, Options, MaxRows, MaxCols> >
127 typedef Array<Scalar, Rows, Cols, Options, MaxRows, MaxCols> ArrayType;
129 typedef Array<RealScalar, Rows, Cols, Options, MaxRows, MaxCols> Real;
131 typedef Array<NonIntegerScalar, Rows, Cols, Options, MaxRows, MaxCols> NonInteger;
|
| BandMatrix.h | 51 using Base::cols;
85 { return Block<CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
89 { return Block<const CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
136 dst.resize(rows(),cols());
147 DenseMatrixType res(rows(),cols());
155 { return i<0 ? (std::min)(cols(),rows()+i) : (std::min)(rows(),cols()-i); }
166 * \param Cols Number of columns, or \b Dynamic
198 template<typename _Scalar, int Rows, int Cols, int Supers, int Subs, int Options>
199 class BandMatrix : public BandMatrixBase<BandMatrix<_Scalar,Rows,Cols,Supers,Subs,Options>
217 inline Index cols() const { return m_coeffs.cols(); } function in class:Eigen::internal::BandMatrix
281 inline Index cols() const { return m_coeffs.cols(); } function in class:Eigen::internal::BandMatrixWrapper
[all...] |
| GeneralProduct.h | 45 template<int Rows, int Cols, int Depth> struct product_type_selector;
65 Cols = _Rhs::ColsAtCompileTime,
78 cols_select = product_size_category<Cols,MaxCols>::value,
91 EIGEN_DEBUG_VAR(Cols);
233 const Index cols = dest.cols(); local
234 for (Index j=0; j<cols; ++j)
347 eigen_assert(m_lhs.rows() == dst.rows() && m_rhs.cols() == dst.cols());
463 actualLhs.rows(), actualLhs.cols(),
[all...] |
| /external/deqp/modules/gles2/functional/ |
| es2fShaderMatrixTests.cpp | 392 template <typename T, int Rows, int Cols>
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;
398 for (int c = 0; c < Cols; ++c)
406 template <typename T, int Rows, int Cols>
407 tcu::Matrix<T, Rows, Cols> negate (const tcu::Matrix<T, Rows, Cols>& mat)
409 tcu::Matrix<T, Rows, Cols> retVal
[all...] |
| /external/deqp/modules/glshared/ |
| glsBuiltinPrecisionTests.cpp | 471 template <typename T, int Rows, int Cols>
472 struct Traits<Matrix<T, Rows, Cols> > :
473 ContainerTraits<Matrix<T, Rows, Cols>, Matrix<typename Traits<T>::IVal, Rows, Cols> >
900 template <typename T, int Rows, int Cols>
901 class ExprP<Matrix<T, Rows, Cols> > : public ContainerExprPBase<Matrix<T, Rows, Cols> > {};
974 template<int Rows, int Cols>
975 ExprP<Vector<float, Rows> > operator* (const ExprP<Vector<float, Cols> >& left,
976 const ExprP<Matrix<float, Rows, Cols> >& right)
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseUtil.h | 95 template<typename T,int Rows,int Cols> struct sparse_eval;
101 template<typename T,int Cols> struct sparse_eval<T,1,Cols> {
115 template<typename T,int Rows,int Cols> struct sparse_eval {
|
| /external/deqp/modules/gles3/functional/ |
| es3fShaderMatrixTests.cpp | 623 template <typename T, int Rows, int Cols>
624 tcu::Matrix<T, Rows, Cols> matrixCompMult (const tcu::Matrix<T, Rows, Cols>& a, const tcu::Matrix<T, Rows, Cols>& b)
626 tcu::Matrix<T, Rows, Cols> retVal;
629 for (int c = 0; c < Cols; ++c)
637 template <typename T, int Rows, int Cols>
638 tcu::Matrix<T, Cols, Rows> transpose (const tcu::Matrix<T, Rows, Cols>& mat)
640 tcu::Matrix<T, Cols, Rows> retVal
[all...] |
| /external/chromium_org/third_party/skia/samplecode/ |
| SampleWarp.cpp | 144 const int Cols = 16;
145 SkPoint pts[Rows * Cols];
146 patch.evalPatch(pts, Rows, Cols);
157 SkMeshUtils::Draw(canvas, bm, Rows, Cols, pts, NULL, paint);
187 const int Cols = 16;
188 SkPoint pts[Rows * Cols];
189 patch.evalPatch(pts, Rows, Cols);
204 SkMeshUtils::Draw(canvas, bm, Rows, Cols, pts, NULL, paint);
216 void init(const SkRect& bounds, int rows, int cols,
222 int cols() const { return fCols; function in class:Mesh
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixPower.h | 32 Index cols() const { return m_pow.cols(); } function in class:Eigen::MatrixPowerRetval
74 { eigen_assert(T.rows() == T.cols()); }
100 res = (MatrixType::Identity(IminusT.rows(), IminusT.cols()) + res).template triangularView<Upper>()
103 res += MatrixType::Identity(IminusT.rows(), IminusT.cols());
116 for (Index i=1; i < m_A.cols(); ++i) {
155 for (Index i=0; i < m_A.cols(); ++i)
159 IminusT = MatrixType::Identity(m_A.rows(), m_A.cols()) - T;
298 { eigen_assert(A.rows() == A.cols()); }
321 Index cols() const { return m_A.cols(); function in class:Eigen::MatrixPower
483 Index cols() const { return m_A.cols(); } function in class:Eigen::MatrixPowerReturnValue
[all...] |
| MatrixFunction.h | 75 static const int Cols = Traits::ColsAtCompileTime;
81 typedef Matrix<ComplexScalar, Rows, Cols, Options, MaxRows, MaxCols> ComplexMatrix;
369 m_fT.resize(m_T.rows(), m_T.cols());
438 eigen_assert(A.rows() == A.cols());
440 eigen_assert(B.rows() == B.cols());
443 eigen_assert(C.cols() == B.rows());
529 Index cols() const { return m_A.cols(); } function in class:Eigen::MatrixFunctionReturnValue
553 eigen_assert(rows() == cols());
560 eigen_assert(rows() == cols());
[all...] |
| /external/skia/samplecode/ |
| SampleWarp.cpp | 144 const int Cols = 16;
145 SkPoint pts[Rows * Cols];
146 patch.evalPatch(pts, Rows, Cols);
157 SkMeshUtils::Draw(canvas, bm, Rows, Cols, pts, NULL, paint);
187 const int Cols = 16;
188 SkPoint pts[Rows * Cols];
189 patch.evalPatch(pts, Rows, Cols);
204 SkMeshUtils::Draw(canvas, bm, Rows, Cols, pts, NULL, paint);
216 void init(const SkRect& bounds, int rows, int cols,
222 int cols() const { return fCols; function in class:Mesh
[all...] |
| /external/eigen/Eigen/src/Core/util/ |
| XprHelper.h | 127 template<typename Scalar, int Rows, int Cols, int Options, int MaxRows, int MaxCols>
238 Cols = traits<T>::ColsAtCompileTime,
244 Cols,
256 Cols = traits<T>::ColsAtCompileTime,
262 Cols,
|
| ForwardDeclarations.h | 133 template<typename _Scalar, int Rows=Dynamic, int Cols=Dynamic, int Supers=Dynamic, int Subs=Dynamic, int Options=0> class BandMatrix;
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMqrsolv.h | 22 template <typename Scalar,int Rows, int Cols, typename Index>
24 Matrix<Scalar,Rows,Cols> &s,
35 Index n = s.cols();
115 Index n = s.cols();
|
| /external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
| KroneckerTensorProduct.h | 47 inline Index cols() const { return m_A.cols() * m_B.cols(); } function in class:Eigen::KroneckerProduct
51 return m_A.coeff(row / m_B.rows(), col / m_B.cols()) *
52 m_B.coeff(row % m_B.rows(), col % m_B.cols());
95 inline Index cols() const { return m_A.cols() * m_B.cols(); } function in class:Eigen::KroneckerProductSparse
117 Bc = m_B.cols();
119 for (Index j=0; j < m_A.cols(); ++j
[all...] |
| /external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/ |
| cmslut.c | 379 cmsStage* CMSEXPORT cmsStageAllocMatrix(cmsContext ContextID, cmsUInt32Number Rows, cmsUInt32Number Cols,
386 n = Rows * Cols;
390 if (n >= UINT_MAX / Cols) return NULL;
392 if (n < Rows || n < Cols) return NULL;
394 NewMPE = _cmsStageAllocPlaceholder(ContextID, cmsSigMatrixElemType, Cols, Rows,
417 NewElem ->Offset = (cmsFloat64Number*) _cmsCalloc(ContextID, Cols, sizeof(cmsFloat64Number));
423 for (i=0; i < Cols; i++) {
[all...] |
| /external/eigen/Eigen/src/SuperLUSupport/ |
| SuperLUSupport.h | 160 res.ncol = mat.cols();
174 res.nrow = mat.cols();
181 res.ncol = mat.cols();
205 template<typename Scalar, int Rows, int Cols, int Options, int MRows, int MCols>
206 struct SluMatrixMapHelper<Matrix<Scalar,Rows,Cols,Options,MRows,MCols> >
208 typedef Matrix<Scalar,Rows,Cols,Options,MRows,MCols> MatrixType;
217 res.ncol = mat.cols();
233 res.nrow = mat.cols();
240 res.ncol = mat.cols();
316 inline Index cols() const { return m_matrix.cols(); function in class:Eigen::SuperLUBase
[all...] |
