| /external/eigen/test/ |
| eigensolver_complex.cpp | 21 typedef typename NumTraits<typename VectorType::Scalar>::Real RealScalar;
42 typedef typename MatrixType::Scalar Scalar;
43 typedef typename NumTraits<Scalar>::Real RealScalar;
|
| eigensolver_generic.cpp | 24 typedef typename MatrixType::Scalar Scalar;
25 typedef typename NumTraits<Scalar>::Real RealScalar;
27 typedef typename std::complex<typename NumTraits<typename MatrixType::Scalar>::Real> Complex;
|
| main.h | 268 return a.isApprox(b, test_precision<typename Type1::Scalar>());
272 // the scalar ref is a hint about the expected order of magnitude of a and b.
273 // WARNING: the scalar a and b must be positive
278 template<typename Scalar,typename ScalarRef>
279 inline bool test_isApproxWithRef(const Scalar& a, const Scalar& b, const ScalarRef& ref)
288 return m1.isMuchSmallerThan(m2, test_precision<typename internal::traits<Derived1>::Scalar>());
293 const typename NumTraits<typename internal::traits<Derived>::Scalar>::Real& s)
295 return m.isMuchSmallerThan(s, test_precision<typename internal::traits<Derived>::Scalar>());
301 return m.isUnitary(test_precision<typename internal::traits<Derived>::Scalar>());
[all...] |
| sparse_product.cpp | 45 typedef typename SparseMatrixType::Scalar Scalar;
49 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
50 typedef Matrix<Scalar,Dynamic,1> DenseVector;
51 typedef Matrix<Scalar,1,Dynamic> RowDenseVector;
52 typedef SparseVector<Scalar,0,Index> ColSpVector;
53 typedef SparseVector<Scalar,RowMajor,Index> RowSpVector;
55 Scalar s1 = internal::random<Scalar>();
56 Scalar s2 = internal::random<Scalar>()
[all...] |
| nomalloc.cpp | 38 typedef typename MatrixType::Scalar Scalar;
47 Scalar s1 = internal::random<Scalar>();
101 template<typename Scalar>
107 typedef Eigen::Matrix<Scalar,
112 typedef Eigen::Matrix<Scalar,
117 typedef Eigen::Matrix<std::complex<Scalar>,
|
| product_syrk.cpp | 15 typedef typename MatrixType::Scalar Scalar;
16 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::ColsAtCompileTime, RowMajor> RMatrixType;
17 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, Dynamic> Rhs1;
18 typedef Matrix<Scalar, Dynamic, MatrixType::RowsAtCompileTime> Rhs2;
19 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, Dynamic,RowMajor> Rhs3;
33 Scalar s1 = internal::random<Scalar>();
|
| product_trmv.cpp | 15 typedef typename MatrixType::Scalar Scalar;
16 typedef typename NumTraits<Scalar>::Real RealScalar;
17 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
28 Scalar s1 = internal::random<Scalar>();
42 // check conjugated and scalar multiple expressions (col-major)
58 // check conjugated and scalar multiple expressions (row-major)
|
| triangular.cpp | 16 typedef typename MatrixType::Scalar Scalar;
17 typedef typename NumTraits<Scalar>::Real RealScalar;
18 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
68 while (numext::abs2(m1(i,i))<1e-1) m1(i,i) = internal::random<Scalar>();
123 typedef typename MatrixType::Scalar Scalar;
124 typedef typename NumTraits<Scalar>::Real RealScalar;
182 m2.diagonal().array() -= Scalar(1);
192 m2.diagonal().array() -= Scalar(1)
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixMatrix_MKL.h | 41 template <typename Scalar, typename Index,
47 product_triangular_matrix_matrix<Scalar,Index,Mode,
53 #define EIGEN_MKL_TRMM_SPECIALIZE(Scalar, LhsIsTriangular) \
57 struct product_triangular_matrix_matrix<Scalar,Index, Mode, LhsIsTriangular, \
59 static inline void run(Index _rows, Index _cols, Index _depth, const Scalar* _lhs, Index lhsStride,\
60 const Scalar* _rhs, Index rhsStride, Scalar* res, Index resStride, Scalar alpha, level3_blocking<Scalar,Scalar>& blocking) {
[all...] |
| GeneralBlockPanelKernel.h | 63 * Given a m x k times k x n matrix product of scalar types \c LhsScalar and \c RhsScalar,
305 typedef std::complex<RealScalar> Scalar;
314 && packet_traits<Scalar>::Vectorizable,
327 typedef typename packet_traits<Scalar>::type ScalarPacket;
334 typedef typename conditional<Vectorizable,RealPacket, Scalar>::type LhsPacket;
335 typedef typename conditional<Vectorizable,DoublePacket,Scalar>::type RhsPacket;
336 typedef typename conditional<Vectorizable,ScalarPacket,Scalar>::type ResPacket;
337 typedef typename conditional<Vectorizable,DoublePacket,Scalar>::type AccPacket;
339 EIGEN_STRONG_INLINE void initAcc(Scalar& p) { p = Scalar(0);
[all...] |
| /external/deqp/framework/randomshaders/ |
| rsgShader.hpp | 76 std::vector<Scalar> m_min;
77 std::vector<Scalar> m_max;
|
| /external/eigen/Eigen/src/Core/ |
| NestByValue.h | 55 inline Scalar& coeffRef(Index row, Index col)
65 inline Scalar& coeffRef(Index index)
|
| SolveTriangular.h | 22 template <typename Scalar, typename Index, int Side, int Mode, bool Conjugate, int TriStorageOrder, int OtherStorageOrder>
52 typedef typename Lhs::Scalar LhsScalar;
53 typedef typename Rhs::Scalar RhsScalar;
61 // FIXME find a way to allow an inner stride if packet_traits<Scalar>::size==1
84 typedef typename Rhs::Scalar Scalar;
96 typedef internal::gemm_blocking_space<(Rhs::Flags&RowMajorBit) ? RowMajor : ColMajor,Scalar,Scalar,
101 triangular_solve_matrix<Scalar,Index,Side,Mode,LhsProductTraits::NeedToConjugate,(int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor,
|
| Block.h | 52 typedef typename traits<XprType>::Scalar Scalar;
80 MaskPacketAccessBit = (InnerSize == Dynamic || (InnerSize % packet_traits<Scalar>::size) == 0)
83 MaskAlignedBit = (InnerPanel && (OuterStrideAtCompileTime!=Dynamic) && (((OuterStrideAtCompileTime * int(sizeof(Scalar))) % 16) == 0)) ? AlignedBit : 0,
210 inline Scalar& coeffRef(Index rowId, Index colId)
217 inline const Scalar& coeffRef(Index rowId, Index colId) const
228 inline Scalar& coeffRef(Index index)
236 inline const Scalar& coeffRef(Index index) const
282 inline const Scalar* data() const;
382 inline BlockImpl_dense(XprType& xpr, const Scalar* data, Index blockRows, Index blockCols
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexSchur_MKL.h | 48 typedef MatrixType::Scalar Scalar; \
|
| RealSchur_MKL.h | 48 typedef MatrixType::Scalar Scalar; \
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_heap_relax_snode.h | 45 template <typename Scalar, typename Index>
46 void SparseLUImpl<Scalar,Index>::heap_relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end)
|
| SparseLU_panel_bmod.h | 55 template <typename Scalar, typename Index>
56 void SparseLUImpl<Scalar,Index>::panel_bmod(const Index m, const Index w, const Index jcol,
69 const Index PacketSize = internal::packet_traits<Scalar>::size;
105 Map<Matrix<Scalar,Dynamic,Dynamic>, Aligned, OuterStride<> > U(tempv.data(), u_rows, u_cols, OuterStride<>(ldu));
139 Map<Matrix<Scalar,Dynamic,Dynamic>, 0, OuterStride<> > A(glu.lusup.data()+luptr, u_rows, u_rows, OuterStride<>(lda) );
144 Map<Matrix<Scalar,Dynamic,Dynamic>, 0, OuterStride<> > B(glu.lusup.data()+luptr, nrow, u_rows, OuterStride<>(lda) );
149 Map<Matrix<Scalar,Dynamic,Dynamic>, 0, OuterStride<> > L(tempv.data()+w*ldu+offset, nrow, u_cols, OuterStride<>(ldl));
152 internal::sparselu_gemm<Scalar>(L.rows(), L.cols(), B.cols(), B.data(), B.outerStride(), U.data(), U.outerStride(), L.data(), L.outerStride());
|
| SparseLU_pruneL.h | 52 template <typename Scalar, typename Index>
53 void SparseLUImpl<Scalar,Index>::pruneL(const Index jcol, const IndexVector& perm_r, const Index pivrow, const Index nseg, const IndexVector& segrep, BlockIndexVector repfnz, IndexVector& xprune, GlobalLU_t& glu)
|
| SparseLU_column_bmod.h | 52 template <typename Scalar, typename Index>
53 Index SparseLUImpl<Scalar,Index>::column_bmod(const Index jcol, const Index nseg, BlockScalarVector dense, ScalarVector& tempv, BlockIndexVector segrep, BlockIndexVector repfnz, Index fpanelc, GlobalLU_t& glu)
118 Index offset = internal::first_multiple<Index>(new_next, internal::packet_traits<Scalar>::size) - new_next;
131 dense(irow) = Scalar(0.0);
165 Map<Matrix<Scalar,Dynamic,Dynamic>, 0, OuterStride<> > A( &(glu.lusup.data()[luptr]), nsupc, nsupc, OuterStride<>(lda) );
169 new (&A) Map<Matrix<Scalar,Dynamic,Dynamic>, 0, OuterStride<> > ( &(glu.lusup.data()[luptr+nsupc]), nrow, nsupc, OuterStride<>(lda) );
|
| /external/eigen/bench/ |
| sparse_dense_product.cpp | 105 // DynamicSparseMatrix<Scalar> m1(sm1);
123 std::vector<Scalar> gmmV1(cols), gmmV2(cols);
124 Map<Matrix<Scalar,Dynamic,1> >(&gmmV1[0], cols) = v1;
125 Map<Matrix<Scalar,Dynamic,1> >(&gmmV2[0], cols) = v2;
141 boost::numeric::ublas::vector<Scalar> uv1, uv2;
145 // std::vector<Scalar> gmmV1(cols), gmmV2(cols);
146 // Map<Matrix<Scalar,Dynamic,1> >(&gmmV1[0], cols) = v1;
147 // Map<Matrix<Scalar,Dynamic,1> >(&gmmV2[0], cols) = v2;
163 mtl::dense_vector<Scalar> mtlV1(cols, 1.0);
164 mtl::dense_vector<Scalar> mtlV2(cols, 1.0)
[all...] |
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 59 typedef typename MatrixType::Scalar Scalar;
60 typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar;
166 typename internal::traits<MatrixType>::Scalar determinant() const;
215 template<typename Scalar, int StorageOrder, typename PivIndex>
223 typedef Map<Matrix<Scalar, Dynamic, Dynamic, StorageOrder> > MapLU;
298 static Index blocked_lu(Index rows, Index cols, Scalar* lu_data, Index luStride, PivIndex* row_transpositions, PivIndex& nb_transpositions, Index maxBlockSize=256)
380 <typename MatrixType::Scalar, MatrixType::Flags&RowMajorBit?RowMajor:ColMajor, typename TranspositionType::Index>
410 typename internal::traits<MatrixType>::Scalar PartialPivLU<MatrixType>::determinant() const
413 return Scalar(m_det_p) * m_lu.diagonal().prod()
[all...] |
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 60 typedef typename MatrixType::Scalar Scalar;
61 typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar;
63 typedef Matrix<Scalar, RowsAtCompileTime, 1, Options, MaxRowsAtCompileTime, 1> TmpMatrixType;
262 typedef typename MatrixType::Scalar Scalar;
295 Scalar tmp = mat.coeffRef(i,k);
299 if(NumTraits<Scalar>::IsComplex)
352 typedef typename MatrixType::Scalar Scalar;
[all...] |
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| DGMRES.h | 18 typename _Preconditioner = DiagonalPreconditioner<typename _MatrixType::Scalar> >
39 void sortWithPermutation (VectorType& vec, IndexType& perm, typename IndexType::Scalar& ncut)
42 typedef typename IndexType::Scalar Index;
43 typedef typename VectorType::Scalar Scalar;
112 typedef typename MatrixType::Scalar Scalar;
116 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
118 typedef Matrix<Scalar,Dynamic,1> DenseVector;
305 g(0) = Scalar(beta);
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseBlock.h | 132 SparseMatrix<Scalar, IsRowMajor ? RowMajor : ColMajor, Index> tmp(other);
150 std::memcpy(&newdata.value(0), &m_matrix.data().value(0), start*sizeof(Scalar));
153 std::memcpy(&newdata.value(start), &tmp.data().value(0), nnz*sizeof(Scalar));
156 std::memcpy(&newdata.value(start+nnz), &matrix.data().value(end), tail_size*sizeof(Scalar));
168 std::memmove(&matrix.data().value(start+nnz), &matrix.data().value(end), tail_size*sizeof(Scalar));
171 std::memcpy(&matrix.data().value(start), &tmp.data().value(0), nnz*sizeof(Scalar));
201 inline const Scalar* valuePtr() const
203 inline Scalar* valuePtr()
227 const Scalar& lastCoeff() const
320 inline Scalar& coeffRef(int row, int col
[all...] |
