HomeSort by relevance Sort by last modified time
    Searched refs:m_innerNonZeros (Results 1 - 2 of 2) sorted by null

  /external/eigen/Eigen/src/SparseCore/
SparseMatrix.h 130 StorageIndex* m_innerNonZeros; // optional, if null then the data is compressed
175 inline const StorageIndex* innerNonZeroPtr() const { return m_innerNonZeros; }
179 inline StorageIndex* innerNonZeroPtr() { return m_innerNonZeros; }
194 Index end = m_innerNonZeros ? m_outerIndex[outer] + m_innerNonZeros[outer] : m_outerIndex[outer+1];
214 Index end = m_innerNonZeros ? m_outerIndex[outer] + m_innerNonZeros[outer] : m_outerIndex[outer+1];
255 if(m_innerNonZeros)
256 memset(m_innerNonZeros, 0, (m_outerSize)*sizeof(StorageIndex));
303 m_innerNonZeros = static_cast<StorageIndex*>(std::malloc(m_outerSize * sizeof(StorageIndex)))
    [all...]
SparseMap.h 74 IndexPointer m_innerNonZeros;
90 bool isCompressed() const { return m_innerNonZeros==0; }
101 inline const StorageIndex* innerNonZeroPtr() const { return m_innerNonZeros; }
111 Index end = isCompressed() ? m_outerIndex[outer+1] : start + m_innerNonZeros[outer];
127 m_innerIndices(innerIndexPtr), m_values(valuePtr), m_innerNonZeros(innerNonZerosPtr)
133 m_innerIndices(innerIndexPtr), m_values(valuePtr), m_innerNonZeros(0)
176 inline StorageIndex* innerNonZeroPtr() { return Base::m_innerNonZeros; }
186 Index end = Base::isCompressed() ? Base::m_outerIndex[outer+1] : start + Base::m_innerNonZeros[outer];

Completed in 224 milliseconds