| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineInplaceLU.h | 27 typedef typename MatrixType::Scalar Scalar;
30 typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar;
214 Scalar newCoeff = m_lu.coeffLower(row, col) - rowVal.dot(colVal);
220 Scalar newCoeff = m_lu.coeffLower(row, col);
223 const Scalar tmp = newCoeff;
249 Scalar newCoeff = m_lu.coeffUpper(rrow, col) - rowVal.dot(colVal);
255 Scalar newCoeff = m_lu.coeffUpper(rrow, col);
257 const Scalar tmp = newCoeff;
279 Scalar newCoeff = m_lu.coeffDiag(row) - rowVal.dot(colVal)
[all...] |
| SkylineProduct.h | 28 typedef typename _LhsNested::Scalar Scalar;
125 typedef typename traits<Lhs>::Scalar Scalar;
150 Scalar tmp = 0;
170 const Scalar rhsCoeff = rhs.coeff(lhscol, rhscol);
188 typedef typename traits<Lhs>::Scalar Scalar;
214 Scalar tmp = 0;
234 const Scalar rhsCoeff = rhs.coeff(lhscol, rhscol)
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrix.h | 32 * \tparam _Scalar the scalar type, i.e. the type of the coefficients
45 typedef _Scalar Scalar;
55 CoeffReadCost = NumTraits<Scalar>::ReadCost,
67 typedef _Scalar Scalar;
93 typedef MappedSparseMatrix<Scalar,Flags> Map;
95 typedef internal::CompressedStorage<Scalar,Index> Storage;
102 typedef SparseMatrix<Scalar,(Flags&~RowMajorBit)|(IsRowMajor?RowMajorBit:0)> TransposedSparseMatrix;
131 inline const Scalar* valuePtr() const { return &m_data.value(0); }
135 inline Scalar* valuePtr() { return &m_data.value(0); }
170 * This function returns Scalar(0) if the element is an explicit \em zero *
[all...] |
| SparseDiagonalProduct.h | 19 // => each inner vector <=> scalar * sparse vector product
34 typedef typename _Lhs::Scalar Scalar;
109 : public CwiseUnaryOp<scalar_multiple_op<typename Lhs::Scalar>,const Rhs>::InnerIterator
111 typedef typename CwiseUnaryOp<scalar_multiple_op<typename Lhs::Scalar>,const Rhs>::InnerIterator Base;
124 scalar_product_op<typename Lhs::Scalar>,
129 scalar_product_op<typename Lhs::Scalar>,
147 : public CwiseUnaryOp<scalar_multiple_op<typename Rhs::Scalar>,const Lhs>::InnerIterator
149 typedef typename CwiseUnaryOp<scalar_multiple_op<typename Rhs::Scalar>,const Lhs>::InnerIterator Base;
162 scalar_product_op<typename Rhs::Scalar>,
[all...] |
| SparseSparseProductWithPruning.h | 24 typedef typename remove_all<Lhs>::type::Scalar Scalar;
34 AmbiVector<Scalar,Index> tempVector(rows);
63 Scalar x = rhsIt.value();
70 for (typename AmbiVector<Scalar,Index>::Iterator it(tempVector,tolerance); it; ++it)
85 typedef typename traits<typename remove_all<Lhs>::type>::Scalar Scalar;
103 typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> SparseTemporaryType;
129 typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename Lhs::Index> ColMajorMatrixLhs;
130 typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename Lhs::Index> ColMajorMatrixRhs
[all...] |
| SparseDenseProduct.h | 47 typedef typename scalar_product_traits<typename traits<Lhs>::Scalar,
48 typename traits<Rhs>::Scalar>::ReturnType Scalar;
66 CoeffReadCost = LhsCoeffReadCost + RhsCoeffReadCost + NumTraits<Scalar>::MulCost
130 inline Scalar value() const { return Base::value() * m_factor; }
133 static Scalar get(const _RhsNested &rhs, Index outer, Dense = Dense())
138 static Scalar get(const _RhsNested &rhs, Index outer, Sparse = Sparse())
144 return Scalar(0);
148 Scalar m_factor;
173 static void run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const typename Res::Scalar& alpha
[all...] |
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU.h | 30 * scalar type of your input matrix.
47 * SparseLU<SparseMatrix<scalar, ColMajor>, COLAMDOrdering<Index> > solver;
73 class SparseLU : public internal::SparseLUImpl<typename _MatrixType::Scalar, typename _MatrixType::Index>
78 typedef typename MatrixType::Scalar Scalar;
81 typedef SparseMatrix<Scalar,ColMajor,Index> NCMatrix;
82 typedef internal::MappedSuperNodalMatrix<Scalar, Index> SCMatrix;
83 typedef Matrix<Scalar,Dynamic,1> ScalarVector;
86 typedef internal::SparseLUImpl<Scalar, Index> Base;
144 SparseLUMatrixUReturnType<SCMatrix,MappedSparseMatrix<Scalar,ColMajor,Index> > matrixU() cons
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 36 int IsComplex = NumTraits<typename internal::traits<MatrixType>::Scalar>::IsComplex>
73 typedef typename Traits::Scalar Scalar;
80 typedef std::complex<Scalar> ComplexScalar;
128 typedef typename MatrixType::Scalar Scalar;
133 typedef typename NumTraits<Scalar>::Real RealScalar;
134 typedef Matrix<Scalar, Traits::RowsAtCompileTime, 1> VectorType;
137 typedef std::list<Scalar> Cluster;
139 typedef Matrix<Scalar, Dynamic, Dynamic, Options, RowsAtCompileTime, ColsAtCompileTime> DynMatrixType
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Array.h | 158 Array(const Scalar& val0, const Scalar& val1);
162 EIGEN_STRONG_INLINE Array(const Scalar& val0, const Scalar& val1, const Scalar& val2)
171 EIGEN_STRONG_INLINE Array(const Scalar& val0, const Scalar& val1, const Scalar& val2, const Scalar& val3)
181 explicit Array(const Scalar *data)
[all...] |
| BandMatrix.h | 33 typedef typename internal::traits<Derived>::Scalar Scalar;
34 typedef Matrix<Scalar,RowsAtCompileTime,ColsAtCompileTime> DenseMatrixType;
94 Conjugate = ReturnOpposite && NumTraits<Scalar>::IsComplex,
104 CwiseUnaryOp<internal::scalar_conjugate_op<Scalar>,BuildType >,
180 typedef _Scalar Scalar;
184 CoeffReadCost = NumTraits<Scalar>::ReadCost,
195 typedef Matrix<Scalar,DataRowsAtCompileTime,ColsAtCompileTime,Options&RowMajor?RowMajor:ColMajor> CoefficientsType;
203 typedef typename internal::traits<BandMatrix>::Scalar Scalar;
[all...] |
| Map.h | 74 typedef typename PlainObjectType::Scalar Scalar;
91 && ((static_cast<int>(sizeof(Scalar))*OuterStrideAtCompileTime)%16)==0 ) ),
114 typedef const Scalar* PointerArgType;
178 ::Array(const Scalar *data)
185 ::Matrix(const Scalar *data)
|
| Select.h | 35 typedef typename traits<ThenMatrixType>::Scalar Scalar;
75 const Scalar coeff(Index i, Index j) const
83 const Scalar coeff(Index i) const
131 * the \em else expression being a scalar value.
139 const typename ThenDerived::Scalar& elseScalar) const
146 * the \em then expression being a scalar value.
153 DenseBase<Derived>::select(const typename ElseDerived::Scalar& thenScalar,
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| GeneralizedEigenSolver.h | 72 /** \brief Scalar type for matrices of type #MatrixType. */
73 typedef typename MatrixType::Scalar Scalar;
74 typedef typename NumTraits<Scalar>::Real RealScalar;
77 /** \brief Complex scalar type for #MatrixType.
79 * This is \c std::complex<Scalar> if #Scalar is real (e.g.,
80 * \c float or \c double) and just \c Scalar if #Scalar is
85 /** \brief Type for vector of real scalar values eigenvalues as returned by betas()
[all...] |
| HessenbergDecomposition.h | 72 /** \brief Scalar type for matrices of type #MatrixType. */
73 typedef typename MatrixType::Scalar Scalar;
78 * This is column vector with entries of type #Scalar. The length of the
82 typedef Matrix<Scalar, SizeMinusOne, 1, Options & ~RowMajor, MaxSizeMinusOne, 1> CoeffVectorType;
268 typedef Matrix<Scalar, 1, Size, Options | RowMajor, 1, MaxSize> VectorType;
269 typedef typename NumTraits<Scalar>::Real RealScalar;
302 Scalar h;
|
| /external/eigen/test/ |
| diagonalmatrices.cpp | 15 typedef typename MatrixType::Scalar Scalar;
17 typedef Matrix<Scalar, Rows, 1> VectorType;
18 typedef Matrix<Scalar, 1, Cols> RowVectorType;
19 typedef Matrix<Scalar, Rows, Rows> SquareMatrixType;
20 typedef DiagonalMatrix<Scalar, Rows> LeftDiagonalMatrix;
21 typedef DiagonalMatrix<Scalar, Cols> RightDiagonalMatrix;
22 typedef Matrix<Scalar, Rows==Dynamic?Dynamic:2*Rows, Cols==Dynamic?Dynamic:2*Cols> BigMatrix;
35 Scalar s1 = internal::random<Scalar>();
[all...] |
| permutationmatrices.cpp | 16 typedef typename MatrixType::Scalar Scalar;
42 Matrix<Scalar,Rows,Rows> lm(lp);
43 Matrix<Scalar,Cols,Cols> rm(rp);
58 Matrix<Scalar,Rows,Rows> lm2(lp2);
59 VERIFY_IS_APPROX((lp*lp2).toDenseMatrix().template cast<Scalar>(), lm*lm2);
60 VERIFY_IS_APPROX((lv.asPermutation()*lv2.asPermutation()).toDenseMatrix().template cast<Scalar>(), lm*lm2);
61 VERIFY_IS_APPROX((MapLeftPerm(lv.data(),lv.size())*MapLeftPerm(lv2.data(),lv2.size())).toDenseMatrix().template cast<Scalar>(), lm*lm2);
93 VERIFY_IS_APPROX(lm, lp2.toDenseMatrix().template cast<Scalar>());
101 VERIFY_IS_APPROX(rm, rp2.toDenseMatrix().template cast<Scalar>());
[all...] |
| sparse_basic.cpp | 21 typedef typename SparseMatrixType::Scalar Scalar;
25 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
26 typedef Matrix<Scalar,Dynamic,1> DenseVector;
27 Scalar eps = 1e-6;
29 Scalar s1 = internal::random<Scalar>();
37 initSparse<Scalar>(density, refMat, m, 0, &zeroCoords, &nonzeroCoords);
46 if(internal::is_same<SparseMatrixType,SparseMatrix<Scalar,Flags> >::value)
51 m.coeffRef(nonzeroCoords[0].x(), nonzeroCoords[0].y()) = Scalar(5)
[all...] |
| stable_norm.cpp | 38 typedef typename MatrixType::Scalar Scalar;
39 typedef typename NumTraits<Scalar>::Real RealScalar;
59 Scalar factor = internal::random<Scalar>();
61 factor = internal::random<Scalar>();
62 Scalar big = factor * ((std::numeric_limits<RealScalar>::max)() * RealScalar(1e-4));
64 factor = internal::random<Scalar>();
66 factor = internal::random<Scalar>();
67 Scalar small = factor * ((std::numeric_limits<RealScalar>::min)() * RealScalar(1e4))
[all...] |
| block.cpp | 13 template<typename MatrixType, typename Index, typename Scalar>
14 typename Eigen::internal::enable_if<!NumTraits<typename MatrixType::Scalar>::IsComplex,typename MatrixType::Scalar>::type
15 block_real_only(const MatrixType &m1, Index r1, Index r2, Index c1, Index c2, const Scalar& s1) {
23 return Scalar(0);
26 template<typename MatrixType, typename Index, typename Scalar>
27 typename Eigen::internal::enable_if<NumTraits<typename MatrixType::Scalar>::IsComplex,typename MatrixType::Scalar>::type
28 block_real_only(const MatrixType &, Index, Index, Index, Index, const Scalar&) {
29 return Scalar(0)
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_sparse_product.cpp | 16 typedef typename SparseMatrixType::Scalar Scalar;
20 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
21 typedef Matrix<Scalar,Dynamic,1> DenseVector;
32 initSparse<Scalar>(density, refMat2, m2);
33 initSparse<Scalar>(density, refMat3, m3);
34 initSparse<Scalar>(density, refMat4, m4);
63 initSparse<Scalar>(density, refM2, m2);
64 initSparse<Scalar>(density, refM3, m3);
83 initSparse<Scalar>(density, refUp, mUp, ForceRealDiag|/*ForceNonZeroDiag|*/MakeUpperTriangular)
[all...] |
| eigen2_cholesky.cpp | 27 typedef typename MatrixType::Scalar Scalar;
28 typedef typename NumTraits<Scalar>::Real RealScalar;
29 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;
30 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
43 typedef GslTraits<Scalar> Gsl;
|
| /external/eigen/Eigen/src/Geometry/ |
| Homogeneous.h | 78 inline Scalar coeff(Index row, Index col) const
102 template<typename Scalar, int Dim, int Mode, int Options> friend
103 inline const internal::homogeneous_left_product_impl<Homogeneous,Transform<Scalar,Dim,Mode,Options> >
104 operator* (const Transform<Scalar,Dim,Mode,Options>& lhs, const Homogeneous& rhs)
107 return internal::homogeneous_left_product_impl<Homogeneous,Transform<Scalar,Dim,Mode,Options> >(lhs,rhs.m_matrix);
202 template<typename Scalar, int Dim, int Mode,int Options>
203 struct take_matrix_for_product<Transform<Scalar, Dim, Mode, Options> >
205 typedef Transform<Scalar, Dim, Mode, Options> TransformType;
210 template<typename Scalar, int Dim, int Options>
211 struct take_matrix_for_product<Transform<Scalar, Dim, Projective, Options>
[all...] |
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteCholesky.h | 29 template <typename Scalar, int _UpLo = Lower, typename _OrderingType = NaturalOrdering<int> >
33 typedef SparseMatrix<Scalar,ColMajor> MatrixType;
38 typedef Matrix<Scalar,Dynamic,1> ScalarType;
68 void setShift( Scalar shift) { m_shift = shift; }
116 SparseMatrix<Scalar,ColMajor> m_L; // The lower part stored in CSC
118 Scalar m_shift; //The initial shift parameter
130 template<typename Scalar, int _UpLo, typename OrderingType>
132 void IncompleteCholesky<Scalar,_UpLo, OrderingType>::factorize(const _MatrixType& mat)
165 Scalar mindiag = vals[0];
172 if(mindiag < Scalar(0.)) m_shift = m_shift - mindiag
[all...] |
| /external/eigen/Eigen/src/SuperLUSupport/ |
| SuperLUSupport.h | 132 template<typename Scalar>
135 if (internal::is_same<Scalar,float>::value)
137 else if (internal::is_same<Scalar,double>::value)
139 else if (internal::is_same<Scalar,std::complex<float> >::value)
141 else if (internal::is_same<Scalar,std::complex<double> >::value)
145 eigen_assert(false && "Scalar type not supported by SuperLU");
156 res.setScalarType<typename MatrixType::Scalar>();
191 res.setScalarType<typename MatrixType::Scalar>();
205 template<typename Scalar, int Rows, int Cols, int Options, int MRows, int MCols>
206 struct SluMatrixMapHelper<Matrix<Scalar,Rows,Cols,Options,MRows,MCols>
[all...] |
| /external/deqp/modules/gles2/scripts/ |
| genutil.py | 91 # Helpers to convert a list of Scalar/Vec values into another type.
93 def toFloat(lst): return [Scalar(float(v.x)) for v in lst]
94 def toInt(lst): return [Scalar(int(v.x)) for v in lst]
95 def toBool(lst): return [Scalar(bool(v.x)) for v in lst]
130 # Math operating on Scalar/Vector types.
159 def isEqual(a, b): return Scalar(a.isEqual(b))
162 def isNotEqual(a, b): return Scalar(not a.isEqual(b))
193 class Scalar:
197 def applyUnary(self, func): return Scalar(func(self.x))
198 def applyBinary(self, func, other): return Scalar(func(self.x, other.x)
[all...] |
