Lines Matching refs:inner
29 * decrease as the number of nonzeros per inner-vector increase. In practice, we observed very good performance
95 const Index inner = IsRowMajor ? col : row;
96 return m_data[outer].at(inner);
106 const Index inner = IsRowMajor ? col : row;
107 return m_data[outer].atWithInsertion(inner);
147 * - the new coefficient is the last one of the given inner vector.
156 inline Scalar& insertBackByOuterInner(Index outer, Index inner)
158 eigen_assert(outer<Index(m_data.size()) && inner<m_innerSize && "out of range");
159 eigen_assert(((m_data[outer].size()==0) || (m_data[outer].index(m_data[outer].size()-1)<inner))
161 m_data[outer].append(0, inner);
168 const Index inner = IsRowMajor ? col : row;
174 while ( (id >= startId) && (m_data[outer].index(id) > inner) )
180 m_data[outer].index(id+1) = inner;
291 * 2 - this the coefficient with greater inner coordinate for the given outer coordinate.
300 const Index inner = IsRowMajor ? col : row;
301 return insertBack(outer,inner);
305 * Like fill() but with random inner coordinates.
