Lines Matching refs:m_outerSize
127 Index m_outerSize;
136 inline Index rows() const { return IsRowMajor ? m_outerSize : m_innerSize; }
138 inline Index cols() const { return IsRowMajor ? m_innerSize : m_outerSize; }
143 inline Index outerSize() const { return m_outerSize; }
254 memset(m_outerIndex, 0, (m_outerSize+1)*sizeof(StorageIndex));
256 memset(m_innerNonZeros, 0, (m_outerSize)*sizeof(StorageIndex));
303 m_innerNonZeros = static_cast<StorageIndex*>(std::malloc(m_outerSize * sizeof(StorageIndex)));
310 for(Index j=0; j<m_outerSize; ++j)
317 StorageIndex previousOuterIndex = m_outerIndex[m_outerSize];
318 for(Index j=m_outerSize-1; j>=0; --j)
330 m_outerIndex[m_outerSize] = m_outerIndex[m_outerSize-1] + m_innerNonZeros[m_outerSize-1] + reserveSizes[m_outerSize-1];
332 m_data.resize(m_outerIndex[m_outerSize]);
336 StorageIndex* newOuterIndex = static_cast<StorageIndex*>(std::malloc((m_outerSize+1)*sizeof(StorageIndex)));
340 for(Index j=0; j<m_outerSize; ++j)
347 newOuterIndex[m_outerSize] = count;
350 for(Index j=m_outerSize-1; j>=0; --j)
427 Index i = m_outerSize;
432 while (i<=m_outerSize)
469 eigen_internal_assert(m_outerIndex!=0 && m_outerSize>0);
473 for(Index j=1; j<m_outerSize; ++j)
490 m_data.resize(m_outerIndex[m_outerSize]);
499 m_innerNonZeros = static_cast<StorageIndex*>(std::malloc(m_outerSize * sizeof(StorageIndex)));
500 for (Index i = 0; i < m_outerSize; i++)
526 for(Index j=0; j<m_outerSize; ++j)
541 m_outerIndex[m_outerSize] = k;
569 StorageIndex *newInnerNonZeros = static_cast<StorageIndex*>(std::realloc(m_innerNonZeros, (m_outerSize + outerChange) * sizeof(StorageIndex)));
573 for(Index i=m_outerSize; i<m_outerSize+outerChange; i++)
579 m_innerNonZeros = static_cast<StorageIndex*>(std::malloc((m_outerSize+outerChange+1) * sizeof(StorageIndex)));
581 for(Index i = 0; i < m_outerSize; i++)
588 for(Index i = 0; i < m_outerSize + (std::min)(outerChange, Index(0)); i++)
602 StorageIndex *newOuterIndex = static_cast<StorageIndex*>(std::realloc(m_outerIndex, (m_outerSize + outerChange + 1) * sizeof(StorageIndex)));
607 StorageIndex last = m_outerSize == 0 ? 0 : m_outerIndex[m_outerSize];
608 for(Index i=m_outerSize; i<m_outerSize+outerChange+1; i++)
611 m_outerSize += outerChange;
626 if (m_outerSize != outerSize || m_outerSize==0)
632 m_outerSize = outerSize;
639 memset(m_outerIndex, 0, (m_outerSize+1)*sizeof(StorageIndex));
660 : m_outerSize(-1), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
668 : m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
677 : m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
697 : m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
705 : Base(), m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
714 : Base(), m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
724 : Base(), m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
737 std::swap(m_outerSize, other.m_outerSize);
768 internal::smart_copy(other.m_outerIndex, other.m_outerIndex + m_outerSize + 1, m_outerIndex);
1047 m_outerIndex[m_outerSize] = count;
1052 m_data.resize(m_outerIndex[m_outerSize]);
1145 m_innerNonZeros = static_cast<StorageIndex*>(std::malloc(m_outerSize * sizeof(StorageIndex)));
1148 memset(m_innerNonZeros, 0, (m_outerSize)*sizeof(StorageIndex));
1153 for(Index j=1; j<=m_outerSize; ++j)
1159 m_innerNonZeros = static_cast<StorageIndex*>(std::malloc(m_outerSize * sizeof(StorageIndex)));
1161 for(Index j=0; j<m_outerSize; ++j)
1194 for(Index k=outer+1; k<=m_outerSize; ++k)
1205 eigen_internal_assert(outer+1==m_outerSize || m_innerNonZeros[outer+1]==0);
1219 for(Index k=outer+1; k<=m_outerSize; ++k)
1242 this->reserveInnerVectors(Array<StorageIndex,Dynamic,1>::Constant(m_outerSize, 2));
1324 double nnzEstimate = double(m_outerIndex[outer])*double(m_outerSize)/double(outer+1);
1345 while (k<=m_outerSize && m_outerIndex[k]!=0)
1362 while (j<=m_outerSize && m_outerIndex[j]!=0)
