Lines Matching refs:inner
148 const Index inner = IsRowMajor ? col : row;
151 eigen_assert(inner < innerSize());
153 if (outer == inner)
157 if (inner > outer) //upper matrix
159 const Index minOuterIndex = inner - m_data.upperProfile(inner);
161 return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner)));
165 if (inner < outer) //lower matrix
168 if (inner >= minInnerIndex)
169 return this->m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer)));
173 return m_data.upper(m_colStartIndex[inner] + outer - inner);
175 if (outer > inner) //upper matrix
177 const Index maxOuterIndex = inner + m_data.upperProfile(inner);
179 return this->m_data.upper(m_colStartIndex[inner] + (outer - inner));
183 if (outer < inner) //lower matrix
187 if (inner <= maxInnerIndex)
188 return this->m_data.lower(m_rowStartIndex[outer] + (inner - outer));
197 const Index inner = IsRowMajor ? col : row;
200 eigen_assert(inner < innerSize());
202 if (outer == inner)
208 const Index minOuterIndex = inner - m_data.upperProfile(inner);
210 return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner)));
215 eigen_assert(inner >= minInnerIndex && "you try to acces a coeff that do not exist in the storage");
216 return this->m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer)));
219 if (outer > inner) //upper matrix
221 const Index maxOuterIndex = inner + m_data.upperProfile(inner);
223 return this->m_data.upper(m_colStartIndex[inner] + (outer - inner));
225 if (outer < inner) //lower matrix
228 eigen_assert(inner <= maxInnerIndex && "you try to acces a coeff that do not exist in the storage");
229 return this->m_data.lower(m_rowStartIndex[outer] + (inner - outer));
242 const Index inner = IsRowMajor ? col : row;
245 eigen_assert(inner < innerSize());
246 eigen_assert(inner != outer);
250 if (inner >= minInnerIndex)
251 return this->m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer)));
257 if (inner <= maxInnerIndex)
258 return this->m_data.lower(m_rowStartIndex[outer] + (inner - outer));
266 const Index inner = IsRowMajor ? col : row;
269 eigen_assert(inner < innerSize());
270 eigen_assert(inner != outer);
273 const Index minOuterIndex = inner - m_data.upperProfile(inner);
275 return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner)));
279 const Index maxOuterIndex = inner + m_data.upperProfile(inner);
281 return this->m_data.upper(m_colStartIndex[inner] + (outer - inner));
295 const Index inner = IsRowMajor ? col : row;
298 eigen_assert(inner < innerSize());
299 eigen_assert(inner != outer);
303 eigen_assert(inner >= minInnerIndex && "you try to acces a coeff that do not exist in the storage");
304 return this->m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer)));
307 eigen_assert(inner <= maxInnerIndex && "you try to acces a coeff that do not exist in the storage");
308 return this->m_data.lower(m_rowStartIndex[outer] + (inner - outer));
314 const Index inner = IsRowMajor ? col : row;
317 eigen_assert(inner < innerSize());
318 eigen_assert(inner != outer);
322 return inner >= minInnerIndex;
325 return inner <= maxInnerIndex;
331 const Index inner = IsRowMajor ? col : row;
334 eigen_assert(inner < innerSize());
335 eigen_assert(inner != outer);
338 const Index minOuterIndex = inner - m_data.upperProfile(inner);
340 return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner)));
342 const Index maxOuterIndex = inner + m_data.upperProfile(inner);
344 return this->m_data.upper(m_colStartIndex[inner] + (outer - inner));
350 const Index inner = IsRowMajor ? col : row;
353 eigen_assert(inner < innerSize());
354 eigen_assert(inner != outer);
357 const Index minOuterIndex = inner - m_data.upperProfile(inner);
360 const Index maxOuterIndex = inner + m_data.upperProfile(inner);
402 const Index inner = IsRowMajor ? col : row;
405 eigen_assert(inner < innerSize());
407 if (outer == inner)
411 if (outer < inner) //upper matrix
414 minOuterIndex = inner - m_data.upperProfile(inner);
418 const Index previousProfile = m_data.upperProfile(inner);
420 m_data.upperProfile(inner) = inner - outer;
423 const Index bandIncrement = m_data.upperProfile(inner) - previousProfile;
426 const Index start = m_colStartIndex[inner];
433 for (Index innerIdx = cols(); innerIdx > inner; innerIdx--) {
440 return m_data.upper(m_colStartIndex[inner]);
442 return m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner)));
446 if (outer > inner) //lower matrix
449 if (inner < minInnerIndex) //The value does not yet exist
452 m_data.lowerProfile(outer) = outer - inner;
472 return m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer)));
476 if (outer > inner) //upper matrix
478 const Index maxOuterIndex = inner + m_data.upperProfile(inner);
481 const Index previousProfile = m_data.upperProfile(inner);
482 m_data.upperProfile(inner) = outer - inner;
484 const Index bandIncrement = m_data.upperProfile(inner) - previousProfile;
487 const Index start = m_rowStartIndex[inner + 1];
493 for (Index innerIdx = inner + 1; innerIdx < outerSize() + 1; innerIdx++) {
496 memset(this->_upperPtr() + m_rowStartIndex[inner] + previousProfile + 1, 0, (bandIncrement - 1) * sizeof (Scalar));
497 return m_data.upper(m_rowStartIndex[inner] + m_data.upperProfile(inner));
499 return m_data.upper(m_rowStartIndex[inner] + (outer - inner));
503 if (outer < inner) //lower matrix
506 if (inner > maxInnerIndex) //The value does not yet exist
509 m_data.lowerProfile(outer) = inner - outer;
526 return m_data.lower(m_colStartIndex[outer] + (inner - outer));
