Searched refs:m_innerIndices (Results 1 – 2 of 2) sorted by relevance
| /external/eigen/Eigen/src/SparseCore/ |
| D | SparseMap.h | 72 IndexPointer m_innerIndices;
97 inline const StorageIndex* innerIndexPtr() const { return m_innerIndices; }
114 else if (end>0 && inner==m_innerIndices[end-1])
119 const StorageIndex* r = std::lower_bound(&m_innerIndices[start],&m_innerIndices[end-1],inner);
120 const Index id = r-&m_innerIndices[0];
127 m_innerIndices(innerIndexPtr), m_values(valuePtr), m_innerNonZeros(innerNonZerosPtr)
133 m_innerIndices(innerIndexPtr), m_values(valuePtr), m_innerNonZeros(0)
172 inline StorageIndex* innerIndexPtr() { return Base::m_innerIndices; }
189 … StorageIndex* r = std::lower_bound(&Base::m_innerIndices[start],&Base::m_innerIndices[end],inner);
190 const Index id = r - &Base::m_innerIndices[0];
|
| /external/eigen/Eigen/src/MetisSupport/ |
| D | MetisSupport.h | 66 m_innerIndices.resize(TotNz); in get_symmetrized_graph()
83 m_innerIndices(CurNz) = idx; in get_symmetrized_graph()
94 m_innerIndices(CurNz) = idx; in get_symmetrized_graph()
112 …output_error = METIS_NodeND(&m, m_indexPtr.data(), m_innerIndices.data(), NULL, NULL, perm.data(),… in operator()
133 IndexVector m_innerIndices; // Adjacency list variable
|