| /external/eigen/Eigen/src/SparseQR/ |
| SparseQR.h | 24 typedef typename ReturnType::Index Index;
72 typedef typename MatrixType::Index Index;
73 typedef SparseMatrix<Scalar,ColMajor,Index> QRMatrixType;
74 typedef Matrix<Index, Dynamic, 1> IndexVector;
76 typedef PermutationMatrix<Dynamic, Dynamic, Index> PermutationType;
108 inline Index rows() const { return m_pmat.rows(); }
112 inline Index cols() const { return m_pmat.cols();}
122 Index rank() const
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointMatrixMatrix_MKL.h | 44 template <typename Index, \
47 struct product_selfadjoint_matrix<EIGTYPE,Index,LhsStorageOrder,true,ConjugateLhs,RhsStorageOrder,false,ConjugateRhs,ColMajor> \
51 Index rows, Index cols, \
52 const EIGTYPE* _lhs, Index lhsStride, \
53 const EIGTYPE* _rhs, Index rhsStride, \
54 EIGTYPE* res, Index resStride, \
96 template <typename Index, \
99 struct product_selfadjoint_matrix<EIGTYPE,Index,LhsStorageOrder,true,ConjugateLhs,RhsStorageOrder,false,ConjugateRhs,ColMajor> \
102 Index rows, Index cols,
[all...] |
| GeneralMatrixMatrix_MKL.h | 51 typename Index, \
54 struct general_matrix_matrix_product<Index,EIGTYPE,LhsStorageOrder,ConjugateLhs,EIGTYPE,RhsStorageOrder,ConjugateRhs,ColMajor> \
56 static void run(Index rows, Index cols, Index depth, \
57 const EIGTYPE* _lhs, Index lhsStride, \
58 const EIGTYPE* _rhs, Index rhsStride, \
59 EIGTYPE* res, Index resStride, \
62 GemmParallelInfo<Index>* /*info = 0*/) \
|
| GeneralMatrixMatrixTriangular.h | 15 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjLhs, bool ConjRhs>
28 template<typename LhsScalar, typename RhsScalar, typename Index, int mr, int nr, bool ConjLhs, bool ConjRhs, int UpLo>
32 template <typename Index,
39 template <typename Index, typename LhsScalar, int LhsStorageOrder, bool ConjugateLhs,
41 struct general_matrix_matrix_triangular_product<Index,LhsScalar,LhsStorageOrder,ConjugateLhs,RhsScalar,RhsStorageOrder,ConjugateRhs,RowMajor,UpLo,Version>
44 static EIGEN_STRONG_INLINE void run(Index size, Index depth,const LhsScalar* lhs, Index lhsStride,
45 const RhsScalar* rhs, Index rhsStride, ResScalar* res, Index resStride, const ResScalar& alpha
[all...] |
| SelfadjointRank2Update.h | 21 template<typename Scalar, typename Index, typename UType, typename VType, int UpLo>
24 template<typename Scalar, typename Index, typename UType, typename VType>
25 struct selfadjoint_rank2_update_selector<Scalar,Index,UType,VType,Lower>
27 static void run(Scalar* mat, Index stride, const UType& u, const VType& v, const Scalar& alpha)
29 const Index size = u.size();
30 for (Index i=0; i<size; ++i)
39 template<typename Scalar, typename Index, typename UType, typename VType>
40 struct selfadjoint_rank2_update_selector<Scalar,Index,UType,VType,Upper>
42 static void run(Scalar* mat, Index stride, const UType& u, const VType& v, const Scalar& alpha)
44 const Index size = u.size()
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| ConservativeSparseSparseProduct.h | 21 typedef typename remove_all<Lhs>::type::Index Index;
24 Index rows = lhs.innerSize();
25 Index cols = rhs.outerSize();
30 Matrix<Index,Dynamic,1> indices(rows);
38 Index estimated_nnz_prod = lhs.nonZeros() + rhs.nonZeros();
41 res.reserve(Index(estimated_nnz_prod));
43 for (Index j=0; j<cols; ++j)
47 Index nnz = 0;
51 Index k = rhsIt.index()
[all...] |
| SparseTriangularView.h | 42 inline Index rows() const { return m_matrix.rows(); }
43 inline Index cols() const { return m_matrix.cols(); }
69 typedef typename SparseTriangularView::Index Index;
72 EIGEN_STRONG_INLINE InnerIterator(const SparseTriangularView& view, Index outer)
77 while((*this) && ((HasUnitDiag||SkipDiag) ? this->index()<=outer : this->index()<outer))
82 else if(HasUnitDiag && ((!Base::operator bool()) || Base::index()>=Base::outer()))
97 if(HasUnitDiag && (!SkipFirst) && ((!Base::operator bool()) || Base::index()>=Base::outer()))
107 inline Index row() const { return (MatrixType::Flags&RowMajorBit ? Base::outer() : this->index());
109 inline Index index() const function in class:Eigen::SparseTriangularView::InnerIterator
[all...] |
| SparsePermutation.h | 24 typedef typename MatrixTypeNestedCleaned::Index Index;
31 SparseMatrix<Scalar,SrcStorageOrder,Index>,
32 SparseMatrix<Scalar,int(SrcStorageOrder)==RowMajor?ColMajor:RowMajor,Index> >::type ReturnType;
41 typedef typename MatrixTypeNestedCleaned::Index Index;
59 SparseMatrix<Scalar,SrcStorageOrder,Index> tmp(m_matrix.rows(), m_matrix.cols());
60 Matrix<Index,Dynamic,1> sizes(m_matrix.outerSize());
61 for(Index j=0; j<m_matrix.outerSize(); ++j)
63 Index jp = m_permutation.indices().coeff(j)
[all...] |
| /external/eigen/test/ |
| sparse.h | 56 template<typename Scalar,int Opt1,int Opt2,typename Index> void
59 SparseMatrix<Scalar,Opt2,Index>& sparseMat,
61 std::vector<Matrix<Index,2,1> >* zeroCoords = 0,
62 std::vector<Matrix<Index,2,1> >* nonzeroCoords = 0)
64 enum { IsRowMajor = SparseMatrix<Scalar,Opt2,Index>::IsRowMajor };
69 for(Index j=0; j<sparseMat.outerSize(); j++)
72 for(Index i=0; i<sparseMat.innerSize(); i++)
96 nonzeroCoords->push_back(Matrix<Index,2,1> (ai,aj));
100 zeroCoords->push_back(Matrix<Index,2,1> (ai,aj));
108 template<typename Scalar,int Opt1,int Opt2,typename Index> voi
[all...] |
| nullary.cpp | 15 typedef typename MatrixType::Index Index;
20 for (Index i = 0; i < A.rows(); ++i) {
21 for (Index j = i+1; j < A.cols(); ++j) {
25 for (Index i = 0; i < A.rows(); ++i) {
26 for (Index j = 0; j < (std::min)(i, A.cols()); ++j) {
38 typedef typename internal::traits<VectorType>::Index Index;
41 const Index size = base.size();
107 typedef typename MatrixType::Index Index
[all...] |
| /external/eigen/Eigen/src/Core/ |
| CwiseNullaryOp.h | 57 CwiseNullaryOp(Index nbRows, Index nbCols, const NullaryOp& func = NullaryOp())
66 EIGEN_STRONG_INLINE Index rows() const { return m_rows.value(); }
67 EIGEN_STRONG_INLINE Index cols() const { return m_cols.value(); }
69 EIGEN_STRONG_INLINE const Scalar coeff(Index rowId, Index colId) const
75 EIGEN_STRONG_INLINE PacketScalar packet(Index rowId, Index colId) const
80 EIGEN_STRONG_INLINE const Scalar coeff(Index index) cons
[all...] |
| TriangularMatrix.h | 43 typedef typename internal::traits<Derived>::Index Index;
49 inline Index rows() const { return derived().rows(); }
50 inline Index cols() const { return derived().cols(); }
51 inline Index outerStride() const { return derived().outerStride(); }
52 inline Index innerStride() const { return derived().innerStride(); }
54 inline Scalar coeff(Index row, Index col) const { return derived().coeff(row,col); }
55 inline Scalar& coeffRef(Index row, Index col) { return derived().coeffRef(row,col);
[all...] |
| Assign.h | 134 template<typename Derived1, typename Derived2, int Index, int Stop>
138 outer = Index / Derived1::InnerSizeAtCompileTime,
139 inner = Index % Derived1::InnerSizeAtCompileTime
145 assign_DefaultTraversal_CompleteUnrolling<Derived1, Derived2, Index+1, Stop>::run(dst, src);
155 template<typename Derived1, typename Derived2, int Index, int Stop>
158 static EIGEN_STRONG_INLINE void run(Derived1 &dst, const Derived2 &src, typename Derived1::Index outer)
160 dst.copyCoeffByOuterInner(outer, Index, src);
161 assign_DefaultTraversal_InnerUnrolling<Derived1, Derived2, Index+1, Stop>::run(dst, src, outer);
168 static EIGEN_STRONG_INLINE void run(Derived1 &, const Derived2 &, typename Derived1::Index) {}
175 template<typename Derived1, typename Derived2, int Index, int Stop
[all...] |
| /external/eigen/blas/ |
| PackedTriangularMatrixVector.h | 15 template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs, int StorageOrder>
18 template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs>
19 struct packed_triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,ColMajor>
27 static void run(Index size, const LhsScalar* lhs, const RhsScalar* rhs, ResScalar* res, ResScalar alpha)
34 for (Index i=0; i<size; ++i)
36 Index s = IsLower&&(HasUnitDiag||HasZeroDiag) ? 1 : 0;
37 Index r = IsLower ? size-i: i+1;
47 template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs>
48 struct packed_triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,RowMajor>
56 static void run(Index size, const LhsScalar* lhs, const RhsScalar* rhs, ResScalar* res, ResScalar alpha
[all...] |
| /system/update_engine/payload_generator/ |
| tarjan_unittest.cc | 37 const Vertex::Index n_a = 0;
38 const Vertex::Index n_b = 1;
39 const Vertex::Index n_c = 2;
40 const Vertex::Index n_d = 3;
41 const Vertex::Index n_e = 4;
42 const Vertex::Index n_f = 5;
43 const Vertex::Index n_g = 6;
44 const Vertex::Index n_h = 7;
64 for (Vertex::Index i = n_a; i <= n_e; i++) {
65 vector<Vertex::Index> vertex_indexes
[all...] |
| /external/eigen/Eigen/src/QR/ |
| FullPivHouseholderQR.h | 63 typedef typename MatrixType::Index Index;
66 typedef Matrix<Index, 1,
94 FullPivHouseholderQR(Index rows, Index cols)
218 inline Index rank() const
223 Index result = 0;
224 for(Index i = 0; i < m_nonzero_pivots; ++i)
235 inline Index dimensionOfKernel() const
292 inline Index rows() const { return m_qr.rows();
[all...] |
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| r1mpyq.h | 10 typedef DenseIndex Index;
13 for (Index j = n-2; j>=0; --j)
14 for (Index i = 0; i<m; ++i) {
20 for (Index j = 0; j<n-1; ++j)
21 for (Index i = 0; i<m; ++i) {
|
| /external/llvm/include/llvm/Option/ |
| Arg.h | 46 /// \brief The index at which this argument appears in the containing
48 unsigned Index;
62 Arg(const Option Opt, StringRef Spelling, unsigned Index,
64 Arg(const Option Opt, StringRef Spelling, unsigned Index,
66 Arg(const Option Opt, StringRef Spelling, unsigned Index,
72 unsigned getIndex() const { return Index; }
|
| /external/llvm/lib/Analysis/ |
| RegionPass.cpp | 70 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
71 RegionPass *RP = (RegionPass *)getContainedPass(Index);
84 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
85 RegionPass *P = (RegionPass*)getContainedPass(Index);
141 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index)
[all...] |
| /external/llvm/include/llvm/IR/ |
| Attributes.h | 168 /// its parameters. You access the attributes for each of them via an index into
169 /// the AttributeSet object. The function attributes are at index
170 /// `AttributeSet::FunctionIndex', the return value is at index
172 /// index `1'.
189 /// \brief The attributes for the specified index are returned.
190 AttributeSetNode *getAttributes(unsigned Index) const;
214 static AttributeSet get(LLVMContext &C, unsigned Index,
216 static AttributeSet get(LLVMContext &C, unsigned Index, const AttrBuilder &B);
218 /// \brief Add an attribute to the attribute set at the given index. Because
220 AttributeSet addAttribute(LLVMContext &C, unsigned Index,
[all...] |
| /external/mesa3d/src/mesa/program/ |
| programopt.c | 92 newInst[i].DstReg.Index = VERT_RESULT_HPOS;
95 newInst[i].SrcReg[0].Index = mvpRef[i];
98 newInst[i].SrcReg[1].Index = VERT_ATTRIB_POS;
164 newInst[0].DstReg.Index = hposTemp;
167 newInst[0].SrcReg[0].Index = VERT_ATTRIB_POS;
170 newInst[0].SrcReg[1].Index = mvpRef[0];
176 newInst[i].DstReg.Index = hposTemp;
179 newInst[i].SrcReg[0].Index = VERT_ATTRIB_POS;
182 newInst[i].SrcReg[1].Index = mvpRef[i];
185 newInst[i].SrcReg[2].Index = hposTemp
[all...] |
| /external/eigen/unsupported/Eigen/src/SVD/ |
| BDCSVD.h | 49 typedef typename MatrixType::Index Index;
90 BDCSVD(Index rows, Index cols, unsigned int computationOptions = 0)
198 void allocate(Index rows, Index cols, unsigned int computationOptions);
199 void divide (Index firstCol, Index lastCol, Index firstRowW,
200 Index firstColW, Index shift)
[all...] |
| /external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
| KroneckerTensorProduct.h | 17 template<typename Scalar, int Options, typename Index> class SparseMatrix;
35 typedef typename Base::Index Index;
46 inline Index rows() const { return m_A.rows() * m_B.rows(); }
47 inline Index cols() const { return m_A.cols() * m_B.cols(); }
49 Scalar coeff(Index row, Index col) const
55 Scalar coeff(Index i) const
83 typedef typename internal::traits<KroneckerProductSparse>::Index Index;
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
| Antlr.Runtime.Tests.pas | 50 CheckEquals(0, Stream.Index);
55 CheckEquals(1, Stream.Index);
60 CheckEquals(2, Stream.Index);
65 CheckEquals(3, Stream.Index);
70 CheckEquals(4, Stream.Index);
75 CheckEquals(5, Stream.Index);
80 CheckEquals(6, Stream.Index);
85 CheckEquals(7, Stream.Index);
90 CheckEquals(8, Stream.Index);
95 CheckEquals(8, Stream.Index);
[all...] |
| /external/eigen/unsupported/test/ |
| matrix_function.cpp | 26 MatrixType randomMatrixWithRealEivals(const typename MatrixType::Index size)
28 typedef typename MatrixType::Index Index;
32 for (Index i = 0; i < size; ++i) {
45 static MatrixType run(const typename MatrixType::Index size);
52 static MatrixType run(const typename MatrixType::Index size)
54 typedef typename MatrixType::Index Index;
57 Index i = 0;
59 Index randomInt = internal::random<Index>(-1, 1)
[all...] |
