| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 60 typedef typename MatrixType::Index Index;
61 typedef typename internal::plain_row_type<MatrixType, Index>::type IntRowVectorType;
62 typedef typename internal::plain_col_type<MatrixType, Index>::type IntColVectorType;
80 FullPivLU(Index rows, Index cols);
117 inline Index nonzeroPivots() const
295 inline Index rank() const
300 Index result = 0;
301 for(Index i = 0; i < m_nonzero_pivots; ++i
[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(); }
75 typedef typename MatrixType::Index Index; \
103 typedef typename DecompositionType::Index Index;
109 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& a_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 rowId, Index colId) 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 rowId, Index colId) cons
[all...] |
| DiagonalMatrix.h | 25 typedef typename internal::traits<Derived>::Index Index;
56 inline Index rows() const { return diagonal().size(); }
57 inline Index cols() const { return diagonal().size(); }
128 typedef DenseIndex Index;
144 typedef typename internal::traits<DiagonalMatrix>::Index Index;
162 inline DiagonalMatrix(Index dim) : m_diagonal(dim) {}
204 inline void resize(Index size) { m_diagonal.resize(size); }
208 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...] |
| /external/eigen/Eigen/src/SparseLU/ |
| 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)
55 Index jsupno, k, ksub, krep, ksupno;
56 Index lptr, nrow, isub, irow, nextlu, new_next, ufirst;
57 Index fsupc, nsupc, nsupr, luptr, kfnz, no_zeros;
70 Index d_fsupc; // distance between the first column of the current panel and the
[all...] |
| SparseLU_gemm_kernel.h | 24 template<typename Scalar,typename Index>
26 void sparselu_gemm(Index m, Index n, Index d, const Scalar* A, Index lda, const Scalar* B, Index ldb, Scalar* C, Index ldc)
40 Index d_end = (d/RK)*RK; // number of columns of A (rows of B) suitable for full register blocking
41 Index n_end = (n/RN)*RN; // number of columns of B-C suitable for processing RN columns at once
42 Index i0 = internal::first_aligned(A,m)
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseCwiseBinaryOp.h | 72 typedef typename Lhs::Index Index;
76 // NOTE: we have to prefix Index by "typename Lhs::" to avoid an ICE with VC11
77 EIGEN_STRONG_INLINE InnerIterator(const CwiseBinaryOpImpl& binOp, typename Lhs::Index outer)
103 typedef typename Lhs::Index Index;
107 EIGEN_STRONG_INLINE sparse_cwise_binary_op_inner_iterator_selector(const CwiseBinaryXpr& xpr, Index outer)
115 if (m_lhsIter && m_rhsIter && (m_lhsIter.index() == m_rhsIter.index()))
117 m_id = m_lhsIter.index();
144 EIGEN_STRONG_INLINE Index index() const { return m_id; } function in class:Eigen::internal::sparse_cwise_binary_op_inner_iterator_selector
200 EIGEN_STRONG_INLINE Index index() const { return m_lhsIter.index(); } function in class:Eigen::internal::sparse_cwise_binary_op_inner_iterator_selector
240 EIGEN_STRONG_INLINE Index index() const { return m_lhsIter.index(); } function in class:Eigen::internal::sparse_cwise_binary_op_inner_iterator_selector
280 EIGEN_STRONG_INLINE Index index() const { return m_rhsIter.index(); } function in class:Eigen::internal::sparse_cwise_binary_op_inner_iterator_selector
[all...] |
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 44 template<typename Index>
45 static int cs_wclear (Index mark, Index lemax, Index *w, Index n)
47 Index k;
59 template<typename Index>
60 Index cs_tdfs(Index j, Index k, Index *head, const Index *next, Index *post, Index *stack
[all...] |
| /external/eigen/unsupported/test/ |
| svd_common.h | 29 typedef typename MatrixType::Index Index;
30 Index rows = m.rows();
31 Index cols = m.cols();
59 typedef typename MatrixType::Index Index;
60 Index rows = m.rows();
61 Index cols = m.cols();
62 Index diagSize = (std::min)(rows, cols);
83 typedef typename MatrixType::Index 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/Eigen/src/Core/products/ |
| SelfadjointProduct.h | 22 template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs>
23 struct selfadjoint_rank1_update<Scalar,Index,ColMajor,UpLo,ConjLhs,ConjRhs>
25 static void run(Index size, Scalar* mat, Index stride, const Scalar* vecX, const Scalar* vecY, const Scalar& alpha)
30 for (Index i=0; i<size; ++i)
38 template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs>
39 struct selfadjoint_rank1_update<Scalar,Index,RowMajor,UpLo,ConjLhs,ConjRhs>
41 static void run(Index size, Scalar* mat, Index stride, const Scalar* vecX, const Scalar* vecY, const Scalar& alpha)
43 selfadjoint_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,stride,vecY,vecX,alpha)
[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/ |
| selfadjoint.cpp | 17 typedef typename MatrixType::Index Index;
20 Index rows = m.rows();
21 Index cols = m.cols();
|
| /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/include/llvm/DebugInfo/PDB/DIA/ |
| DIAEnumDebugStreams.h | 25 ChildTypePtr getChildAtIndex(uint32_t Index) const override;
|
| DIAEnumLineNumbers.h | 25 ChildTypePtr getChildAtIndex(uint32_t Index) const override;
|
| /external/llvm/include/llvm/DebugInfo/PDB/ |
| IPDBDataStream.h | 30 virtual llvm::Optional<RecordType> getItemAtIndex(uint32_t Index) const = 0;
|
| IPDBEnumChildren.h | 26 virtual ChildTypePtr getChildAtIndex(uint32_t Index) const = 0;
|
| /external/llvm/test/MC/MachO/ARM/ |
| data-in-code.s | 26 @ CHECK: Index: 0
32 @ CHECK: Index: 1
38 @ CHECK: Index: 2
44 @ CHECK: Index: 3
|
| /system/update_engine/payload_generator/ |
| graph_types.h | 56 index(-1),
71 std::vector<Vertex>::size_type index; member in struct:chromeos_update_engine::Vertex
77 typedef std::vector<Vertex>::size_type Index;
78 static const Vertex::Index kInvalidIndex;
83 typedef std::pair<Vertex::Index, Vertex::Index> Edge;
|
