| /external/eigen/Eigen/src/Core/products/ |
| TriangularSolverVector.h | 17 template<typename LhsScalar, typename RhsScalar, typename Index, int Mode, bool Conjugate, int StorageOrder>
18 struct triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheRight, Mode, Conjugate, StorageOrder>
20 static void run(Index size, const LhsScalar* _lhs, Index lhsStride, RhsScalar* rhs)
22 triangular_solve_vector<LhsScalar,RhsScalar,Index,OnTheLeft,
30 template<typename LhsScalar, typename RhsScalar, typename Index, int Mode, bool Conjugate>
31 struct triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mode, Conjugate, RowMajor>
36 static void run(Index size, const LhsScalar* _lhs, Index lhsStride, RhsScalar* rhs)
45 static const Index PanelWidth = EIGEN_TUNE_TRIANGULAR_PANEL_WIDTH
[all...] |
| TriangularSolverMatrix.h | 18 template <typename Scalar, typename Index, int Side, int Mode, bool Conjugate, int TriStorageOrder>
19 struct triangular_solve_matrix<Scalar,Index,Side,Mode,Conjugate,TriStorageOrder,RowMajor>
22 Index size, Index cols,
23 const Scalar* tri, Index triStride,
24 Scalar* _other, Index otherStride,
28 Scalar, Index, Side==OnTheLeft?OnTheRight:OnTheLeft,
38 template <typename Scalar, typename Index, int Mode, bool Conjugate, int TriStorageOrder>
39 struct triangular_solve_matrix<Scalar,Index,OnTheLeft,Mode,Conjugate,TriStorageOrder,ColMajor>
42 Index size, Index otherSize
[all...] |
| CoeffBasedProduct.h | 46 typedef typename promote_index_type<typename traits<_LhsNested>::Index,
47 typename traits<_RhsNested>::Index>::type Index;
160 EIGEN_STRONG_INLINE Index rows() const { return m_lhs.rows(); }
161 EIGEN_STRONG_INLINE Index cols() const { return m_rhs.cols(); }
163 EIGEN_STRONG_INLINE const Scalar coeff(Index row, Index col) const
170 /* Allow index-based non-packet access. It is impossible though to allow index-based packed access,
173 EIGEN_STRONG_INLINE const Scalar coeff(Index index) cons
[all...] |
| SelfadjointMatrixVector_MKL.h | 46 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs>
48 selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,BuiltIn> {};
51 template<typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs> \
52 struct selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,Specialized> { \
54 Index size, const Scalar* lhs, Index lhsStride, \
55 const Scalar* _rhs, Index rhsIncr, Scalar* res, Scalar alpha) { \
60 selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,BuiltIn>::run( \
63 selfadjoint_matrix_vector_product_symv<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs>::run( \
75 template<typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs>
[all...] |
| TriangularMatrixVector_MKL.h | 46 template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs, int StorageOrder>
48 triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,StorageOrder,BuiltIn> {};
51 template<typename Index, int Mode, bool ConjLhs, bool ConjRhs> \
52 struct triangular_matrix_vector_product<Index,Mode,Scalar,ConjLhs,Scalar,ConjRhs,ColMajor,Specialized> { \
53 static EIGEN_DONT_INLINE void run(Index _rows, Index _cols, const Scalar* _lhs, Index lhsStride, \
54 const Scalar* _rhs, Index rhsIncr, Scalar* _res, Index resIncr, Scalar alpha) { \
55 triangular_matrix_vector_product_trmv<Index,Mode,Scalar,ConjLhs,Scalar,ConjRhs,ColMajor>::run(
[all...] |
| GeneralMatrixMatrixTriangular.h | 25 template<typename LhsScalar, typename RhsScalar, typename Index, int mr, int nr, bool ConjLhs, bool ConjRhs, int UpLo>
29 template <typename Index,
36 template <typename Index, typename LhsScalar, int LhsStorageOrder, bool ConjugateLhs,
38 struct general_matrix_matrix_triangular_product<Index,LhsScalar,LhsStorageOrder,ConjugateLhs,RhsScalar,RhsStorageOrder,ConjugateRhs,RowMajor,UpLo,Version>
41 static EIGEN_STRONG_INLINE void run(Index size, Index depth,const LhsScalar* lhs, Index lhsStride,
42 const RhsScalar* rhs, Index rhsStride, ResScalar* res, Index resStride, ResScalar alpha)
44 general_matrix_matrix_triangular_product<Index,
[all...] |
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| BlockOfDynamicSparseMatrix.h | 32 inline InnerIterator(const SparseInnerVectorSet& xpr, Index outer)
35 inline Index row() const { return IsRowMajor ? m_outer : this->index(); }
36 inline Index col() const { return IsRowMajor ? this->index() : m_outer; }
38 Index m_outer;
41 inline SparseInnerVectorSet(const MatrixType& matrix, Index outerStart, Index outerSize)
47 inline SparseInnerVectorSet(const MatrixType& matrix, Index outer)
66 for (Index j=0; j<m_outerSize.value(); ++j
[all...] |
| /external/clang/bindings/python/tests/cindex/ |
| test_file.py | 1 from clang.cindex import Index, File
4 index = Index.create()
5 tu = index.parse('t.c', unsaved_files = [('t.c', "")])
|
| /external/eigen/Eigen/src/Core/ |
| ReturnByValue.h | 62 inline Index rows() const { return static_cast<const Derived*>(this)->rows(); }
63 inline Index cols() const { return static_cast<const Derived*>(this)->cols(); }
71 const Unusable& coeff(Index) const { return *reinterpret_cast<const Unusable*>(this); }
72 const Unusable& coeff(Index,Index) const { return *reinterpret_cast<const Unusable*>(this); }
73 Unusable& coeffRef(Index) { return *reinterpret_cast<Unusable*>(this); }
74 Unusable& coeffRef(Index,Index) { return *reinterpret_cast<Unusable*>(this); }
|
| MapBase.h | 40 typedef typename internal::traits<Derived>::Index Index;
79 inline Index rows() const { return m_rows.value(); }
80 inline Index cols() const { return m_cols.value(); }
90 inline const Scalar& coeff(Index row, Index col) const
95 inline const Scalar& coeff(Index index) const
98 return m_data[index * innerStride()];
101 inline const Scalar& coeffRef(Index row, Index col) cons
[all...] |
| BandMatrix.h | 35 typedef typename DenseMatrixType::Index Index;
54 inline Index supers() const { return derived().supers(); }
57 inline Index subs() const { return derived().subs(); }
68 inline Block<CoefficientsType,Dynamic,1> col(Index i)
71 Index start = 0;
72 Index len = coeffs().rows();
76 len = (std::min)(rows(),std::max<Index>(0,coeffs().rows() - (supers()-i)));
79 len = std::max<Index>(0,coeffs().rows() - (i + 1 - rows() + subs()));
91 template<int Index> struct DiagonalIntReturnType
[all...] |
| Diagonal.h | 22 * \param DiagIndex the index of the sub/super diagonal. The default is 0 and it means the main diagonal.
24 * You can also use Dynamic so the index can be set at runtime.
29 * of a square matrix. It is the return type of MatrixBase::diagonal() and MatrixBase::diagonal(Index) and most of the
32 * \sa MatrixBase::diagonal(), MatrixBase::diagonal(Index)
72 inline Diagonal(MatrixType& matrix, Index index = DiagIndex) : m_matrix(matrix), m_index(index) {}
76 inline Index rows() const
79 inline Index cols() const { return 1; }
81 inline Index innerStride() cons
138 int index() const function in class:Eigen::Diagonal
[all...] |
| /external/eigen/Eigen/src/misc/ |
| Kernel.h | 42 typedef typename Base::Index Index;
50 inline Index rows() const { return m_dec.cols(); }
51 inline Index cols() const { return m_cols; }
52 inline Index rank() const { return m_rank; }
62 Index m_rank, m_cols;
71 typedef typename MatrixType::Index Index; \
|
| /external/llvm/lib/Option/ |
| Option.cpp | 103 unsigned &Index,
109 Spelling = StringRef(Args.getArgString(Index), ArgSize);
117 if (ArgSize != strlen(Args.getArgString(Index)))
120 Arg *A = new Arg(UnaliasedOption, Spelling, Index++);
133 const char *Value = Args.getArgString(Index) + ArgSize;
134 return new Arg(UnaliasedOption, Spelling, Index++, Value);
138 const char *Str = Args.getArgString(Index) + ArgSize;
139 Arg *A = new Arg(UnaliasedOption, Spelling, Index++);
167 if (ArgSize != strlen(Args.getArgString(Index)))
170 Index += 2
[all...] |
| /external/clang/lib/AST/ |
| SelectorLocationsKind.cpp | 20 static SourceLocation getStandardSelLoc(unsigned Index,
27 assert(Index == 0);
35 assert(Index < NumSelArgs);
38 IdentifierInfo *II = Sel.getIdentifierInfoForSlot(Index);
65 SourceLocation getArgLoc(unsigned Index, ArrayRef<T*> Args) {
66 return Index < Args.size() ? getArgLoc(Args[Index]) : SourceLocation();
104 SourceLocation clang::getStandardSelectorLoc(unsigned Index,
109 return getStandardSelLoc(Index, Sel, WithArgSpace,
110 getArgLoc(Index, Args), EndLoc)
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| Minor.h | 62 Index row, Index col)
71 inline Index rows() const { return m_matrix.rows() - 1; }
72 inline Index cols() const { return m_matrix.cols() - 1; }
74 inline Scalar& coeffRef(Index row, Index col)
79 inline const Scalar coeff(Index row, Index col) const
86 const Index m_row, m_col;
101 MatrixBase<Derived>::minor(Index row, Index col
[all...] |
| /external/eigen/Eigen/src/plugins/ |
| BlockMethods.h | 52 * \sa class Block, block(Index,Index)
54 inline Block<Derived> block(Index startRow, Index startCol, Index blockRows, Index blockCols)
59 /** This is the const version of block(Index,Index,Index,Index). *
[all...] |
| /external/eigen/test/ |
| visitor.cpp | 15 typedef typename MatrixType::Index Index;
17 Index rows = p.rows();
18 Index cols = p.cols();
23 for(Index i = 0; i < m.size(); i++)
24 for(Index i2 = 0; i2 < i; i2++)
29 Index minrow=0,mincol=0,maxrow=0,maxcol=0;
30 for(Index j = 0; j < cols; j++)
31 for(Index i = 0; i < rows; i++)
46 Index eigen_minrow, eigen_mincol, eigen_maxrow, eigen_maxcol
[all...] |
| sizeoverflow.cpp | 21 typedef DenseIndex Index;
24 void triggerMatrixBadAlloc(Index rows, Index cols)
32 void triggerVectorBadAlloc(Index size)
46 size_t times_itself_gives_0 = size_t(1) << (8 * sizeof(Index) / 2);
49 size_t times_4_gives_0 = size_t(1) << (8 * sizeof(Index) - 2);
52 size_t times_8_gives_0 = size_t(1) << (8 * sizeof(Index) - 3);
|
| jacobi.cpp | 18 typedef typename MatrixType::Index Index;
19 Index rows = m.rows();
20 Index cols = m.cols();
36 Index p = internal::random<Index>(0, rows-1);
37 Index q;
39 q = internal::random<Index>(0, rows-1);
49 Index p = internal::random<Index>(0, cols-1)
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseTranspose.h | 26 inline Index nonZeros() const { return derived().nestedExpression().nonZeros(); }
29 // NOTE: VC10 trigger an ICE if don't put typename TransposeImpl<MatrixType,Sparse>:: in front of Index,
30 // a typedef typename TransposeImpl<MatrixType,Sparse>::Index Index;
39 EIGEN_STRONG_INLINE InnerIterator(const TransposeImpl& trans, typename TransposeImpl<MatrixType,Sparse>::Index outer)
42 inline typename TransposeImpl<MatrixType,Sparse>::Index row() const { return Base::col(); }
43 inline typename TransposeImpl<MatrixType,Sparse>::Index col() const { return Base::row(); }
52 EIGEN_STRONG_INLINE ReverseInnerIterator(const TransposeImpl& xpr, typename TransposeImpl<MatrixType,Sparse>::Index outer)
55 inline typename TransposeImpl<MatrixType,Sparse>::Index row() const { return Base::col(); }
56 inline typename TransposeImpl<MatrixType,Sparse>::Index col() const { return Base::row();
[all...] |
| SparseSelfAdjointView.h | 42 void permute_symm_to_symm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestOrder,typename MatrixType::Index>& _dest, const typename MatrixType::Index* perm = 0);
45 void permute_symm_to_fullsymm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestOrder,typename MatrixType::Index>& _dest, const typename MatrixType::Index* perm = 0);
55 typedef typename MatrixType::Index Index;
56 typedef Matrix<Index,Dynamic,1> VectorI;
65 inline Index rows() const { return m_matrix.rows(); }
66 inline Index cols() const { return m_matrix.cols(); }
100 template<typename DestScalar,int StorageOrder> void evalTo(SparseMatrix<DestScalar,StorageOrder,Index>& _dest) cons
[all...] |
| /external/llvm/lib/Analysis/ |
| LoopPass.cpp | 140 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
141 LoopPass *LP = getContainedPass(Index);
155 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
156 LoopPass *LP = getContainedPass(Index);
205 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index)
[all...] |
| /external/lzma/CS/7zip/Compress/LZMA/ |
| LzmaBase.cs | 17 public uint Index;
18 public void Init() { Index = 0; }
21 if (Index < 4) Index = 0;
22 else if (Index < 10) Index -= 3;
23 else Index -= 6;
25 public void UpdateMatch() { Index = (uint)(Index < 7 ? 7 : 10); }
26 public void UpdateRep() { Index = (uint)(Index < 7 ? 8 : 11); }
[all...] |
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 43 template<typename Index>
46 static Index run( _MKL_DSS_HANDLE_t pt, Index maxfct, Index mnum, Index type, Index phase, Index n, void *a,
47 Index *ia, Index *ja, Index *perm, Index nrhs, Index *iparm, Index msglvl, void *b, void *x
[all...] |
