| /external/eigen/Eigen/src/Eigenvalues/ |
| HessenbergDecomposition.h | 74 typedef typename MatrixType::Index Index;
100 HessenbergDecomposition(Index size = Size==Dynamic ? 2 : Size)
295 Index n = matA.rows();
297 for (Index i = 0; i<n-1; ++i)
300 Index remainingSize = n-i-1;
340 typedef typename MatrixType::Index Index;
357 Index n = result.rows();
362 Index rows() const { return m_hess.packedMatrix().rows();
[all...] |
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 59 typedef typename MatrixType::Index Index;
60 typedef typename internal::plain_row_type<MatrixType, Index>::type IntRowVectorType;
61 typedef typename internal::plain_col_type<MatrixType, Index>::type IntColVectorType;
79 FullPivLU(Index rows, Index cols);
116 inline Index nonzeroPivots() const
294 inline Index rank() const
298 Index result = 0;
299 for(Index i = 0; i < m_nonzero_pivots; ++i
[all...] |
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 48 template<typename Index>
49 static int cs_wclear (Index mark, Index lemax, Index *w, Index n)
51 Index k;
63 template<typename Index>
64 Index cs_tdfs(Index j, Index k, Index *head, const Index *next, Index *post, Index *stack
[all...] |
| /external/eigen/Eigen/src/misc/ |
| SparseSolve.h | 24 typedef SparseMatrix<typename Rhs::Scalar, Rhs::Options, typename Rhs::Index> ReturnType;
33 typedef typename Base::Index Index;
39 inline Index rows() const { return m_dec.cols(); }
40 inline Index cols() const { return m_rhs.cols(); }
58 typedef typename MatrixType::Index Index; \
86 typedef typename DecompositionType::Index Index;
92 inline Index rows() const { return m_dec.cols();
[all...] |
| /external/eigen/blas/ |
| BandTriangularSolver.h | 18 template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, int StorageOrder>
22 template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar>
23 struct band_solve_triangular_selector<Index,Mode,LhsScalar,ConjLhs,RhsScalar,RowMajor>
28 static void run(Index size, Index k, const LhsScalar* _lhs, Index lhsStride, RhsScalar* _other)
58 template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar>
59 struct band_solve_triangular_selector<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ColMajor>
64 static void run(Index size, Index k, const LhsScalar* _lhs, Index lhsStride, RhsScalar* _other
[all...] |
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineMatrixBase.h | 31 typedef typename internal::index<StorageKind>::type Index;
105 inline Index rows() const {
110 inline Index cols() const {
116 inline Index size() const {
122 inline Index nonZeros() const {
128 Index outerSize() const {
134 Index innerSize() const {
159 for (Index row = 0; row < rows(); row++)
160 for (Index col = 0; col < cols(); col++)
[all...] |
| SkylineProduct.h | 97 EIGEN_STRONG_INLINE Index rows() const {
101 EIGEN_STRONG_INLINE Index cols() const {
138 for (Index col = 0; col < rhs.cols(); col++) {
139 for (Index row = 0; row < lhs.rows(); row++) {
144 for (Index row = 0; row < lhs.rows(); row++) {
146 const Index stop = lIt.col() + lIt.size();
147 for (Index col = 0; col < rhs.cols(); col++) {
149 Index k = lIt.col();
164 for (Index lhscol = 0; lhscol < lhs.cols(); lhscol++) {
166 const Index stop = uIt.size() + uIt.row()
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Replicate.h | 82 inline Replicate(const OriginalMatrixType& matrix, Index rowFactor, Index colFactor)
89 inline Index rows() const { return m_matrix.rows() * m_rowFactor.value(); }
90 inline Index cols() const { return m_matrix.cols() * m_colFactor.value(); }
92 inline Scalar coeff(Index row, Index col) const
95 const Index actual_row = internal::traits<MatrixType>::RowsAtCompileTime==1 ? 0
98 const Index actual_col = internal::traits<MatrixType>::ColsAtCompileTime==1 ? 0
105 inline PacketScalar packet(Index row, Index col) cons
[all...] |
| DenseBase.h | 51 typedef typename internal::traits<Derived>::Index Index;
175 inline Index nonZeros() const { return size(); }
186 Index outerSize() const
197 Index innerSize() const
207 void resize(Index size)
217 void resize(Index rows, Index cols)
290 SegmentReturnType segment(Index start, Index size)
[all...] |
| DiagonalMatrix.h | 24 typedef typename internal::traits<Derived>::Index Index;
55 inline Index rows() const { return diagonal().size(); }
56 inline Index cols() const { return diagonal().size(); }
111 typedef DenseIndex Index;
127 typedef typename internal::traits<DiagonalMatrix>::Index Index;
145 inline DiagonalMatrix(Index dim) : m_diagonal(dim) {}
187 inline void resize(Index size) { m_diagonal.resize(size); }
191 inline void setZero(Index size) { m_diagonal.setZero(size);
[all...] |
| SelfCwiseBinaryOp.h | 57 inline Index rows() const { return m_matrix.rows(); }
58 inline Index cols() const { return m_matrix.cols(); }
59 inline Index outerStride() const { return m_matrix.outerStride(); }
60 inline Index innerStride() const { return m_matrix.innerStride(); }
65 inline Scalar& coeffRef(Index row, Index col)
70 inline const Scalar& coeffRef(Index row, Index col) const
77 inline Scalar& coeffRef(Index index)
[all...] |
| Redux.h | 143 index = Start * packet_traits<typename Derived::Scalar>::size, enumerator in enum:Eigen::internal::redux_vec_unroller::__anon19456
144 outer = index / int(Derived::InnerSizeAtCompileTime),
145 inner = index % int(Derived::InnerSizeAtCompileTime),
172 typedef typename Derived::Index Index;
178 for(Index i = 1; i < mat.innerSize(); ++i)
180 for(Index i = 1; i < mat.outerSize(); ++i)
181 for(Index j = 0; j < mat.innerSize(); ++j)
197 typedef typename Derived::Index Index;
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointProduct.h | 21 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjLhs, bool ConjRhs>
24 template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs>
25 struct selfadjoint_rank1_update<Scalar,Index,ColMajor,UpLo,ConjLhs,ConjRhs>
27 static void run(Index size, Scalar* mat, Index stride, const Scalar* vec, Scalar alpha)
32 for (Index i=0; i<size; ++i)
40 template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs>
41 struct selfadjoint_rank1_update<Scalar,Index,RowMajor,UpLo,ConjLhs,ConjRhs>
43 static void run(Index size, Scalar* mat, Index stride, const Scalar* vec, Scalar alpha
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseDiagonalProduct.h | 35 typedef typename promote_index_type<typename traits<Lhs>::Index,
36 typename traits<Rhs>::Index>::type Index;
89 EIGEN_STRONG_INLINE Index rows() const { return m_lhs.rows(); }
90 EIGEN_STRONG_INLINE Index cols() const { return m_rhs.cols(); }
108 typedef typename Lhs::Index Index;
111 const SparseDiagonalProductType& expr, Index outer)
128 typedef typename Lhs::Index Index;
[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());
61 for(Index j=0; j<m_matrix.outerSize(); ++j)
63 Index jp = m_permutation.indices().coeff(j);
67 for(Index j=0; j<m_matrix.outerSize(); ++j
[all...] |
| SparseCwiseBinaryOp.h | 72 typedef typename Lhs::Index Index;
76 EIGEN_STRONG_INLINE InnerIterator(const CwiseBinaryOpImpl& binOp, typename CwiseBinaryOpImpl::Index outer)
102 typedef typename Lhs::Index Index;
106 EIGEN_STRONG_INLINE sparse_cwise_binary_op_inner_iterator_selector(const CwiseBinaryXpr& xpr, Index outer)
114 if (m_lhsIter && m_rhsIter && (m_lhsIter.index() == m_rhsIter.index()))
116 m_id = m_lhsIter.index();
121 else if (m_lhsIter && (!m_rhsIter || (m_lhsIter.index() < m_rhsIter.index()))
143 EIGEN_STRONG_INLINE Index index() const { return m_id; } function in class:Eigen::internal::sparse_cwise_binary_op_inner_iterator_selector
199 EIGEN_STRONG_INLINE Index index() const { return m_lhsIter.index(); } function in class:Eigen::internal::sparse_cwise_binary_op_inner_iterator_selector
239 EIGEN_STRONG_INLINE Index index() const { return m_lhsIter.index(); } function in class:Eigen::internal::sparse_cwise_binary_op_inner_iterator_selector
279 EIGEN_STRONG_INLINE Index index() const { return m_rhsIter.index(); } function in class:Eigen::internal::sparse_cwise_binary_op_inner_iterator_selector
[all...] |
| /external/llvm/include/llvm/IR/ |
| Attributes.h | 195 /// its parameters. You access the attributes for each of them via an index into
196 /// the AttributeSet object. The function attributes are at index
197 /// `AttributeSet::FunctionIndex', the return value is at index
199 /// index `1'.
215 /// \brief The attributes for the specified index are returned.
216 AttributeSetNode *getAttributes(unsigned Index) const;
240 static AttributeSet get(LLVMContext &C, unsigned Index,
242 static AttributeSet get(LLVMContext &C, unsigned Index, AttrBuilder &B);
244 /// \brief Add an attribute to the attribute set at the given index. Since
246 AttributeSet addAttribute(LLVMContext &C, unsigned Index,
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| IIntStream.cs | 58 /// The Lexer tracks line/col info as well as input index so its markers are
64 /// <see cref="IIntStream.Index"/>, or some other marker.</returns>
68 /// Return the current input symbol index 0..n where n indicates the
69 /// last symbol has been read. The index is the symbol about to be
72 int Index { get; }
76 /// <see cref="IIntStream.Index"/> would return marker.
79 /// The marker will usually be <see cref="IIntStream.Index"/> but
117 /// Set the input cursor to the position indicated by index. This is
125 /// and in that its argument is strictly an input cursor (index).
137 /// The index is 0..n-1. A seek to position i means that LA(1) will return
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| IIntStream.cs | 56 * current input position, Index, or some other marker so that
59 * track line/col info as well as input index so its markers are
66 * Return the current input symbol index 0..n where n indicates the
67 * last symbol has been read. The index is the symbol about to be
71 int Index
77 * Reset the stream so that next call to index would return marker.
78 * The marker will usually be Index but it doesn't have to be. It's
114 * Set the input cursor to the position indicated by index. This is
122 * requirement and in that its argument is strictly an input cursor (index).
132 * The index is 0..n-1. A seek to position i means that LA(1) wil
[all...] |
| /external/eigen/doc/examples/ |
| Tutorial_ReductionsVisitorsBroadcasting_broadcast_1nn.cpp | 18 MatrixXf::Index index; local
20 (m.colwise() - v).colwise().squaredNorm().minCoeff(&index);
22 cout << "Nearest neighbour is column " << index << ":" << endl;
23 cout << m.col(index) << endl;
|
| /external/eigen/test/ |
| corners.cpp | 18 typedef typename MatrixType::Index Index;
19 Index rows = m.rows();
20 Index cols = m.cols();
22 Index r = internal::random<Index>(1,rows);
23 Index c = internal::random<Index>(1,cols);
33 Index sr = internal::random<Index>(1,rows) - 1
[all...] |
| selfadjoint.cpp | 17 typedef typename MatrixType::Index Index;
21 Index rows = m.rows();
22 Index cols = m.cols();
|
| determinant.cpp | 19 typedef typename MatrixType::Index Index;
20 Index size = m.rows();
30 Index i = internal::random<Index>(0, size-1);
31 Index j;
33 j = internal::random<Index>(0, size-1);
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| rwupdt.h | 12 typedef DenseIndex Index;
14 const Index n = r.cols();
22 for (Index j = 0; j < n; ++j) {
27 for (Index i = 0; i < j; ++i) {
|
| /external/llvm/lib/MC/ |
| MCELFObjectTargetWriter.cpp | 43 // just to match gnu as for easier comparison. The use type and index is an
52 if (B.Index != A.Index)
53 return B.Index - A.Index;
|
