Searched refs:eigen_internal_assert (Results 1 – 25 of 30) sorted by relevance
12
118 inline Scalar& value(Index i) { eigen_internal_assert(m_values!=0); return m_values[i]; } in value()119 …inline const Scalar& value(Index i) const { eigen_internal_assert(m_values!=0); return m_values[i]… in value()121 … inline StorageIndex& index(Index i) { eigen_internal_assert(m_indices!=0); return m_indices[i]; } in index()122 …inline const StorageIndex& index(Index i) const { eigen_internal_assert(m_indices!=0); return m_in… in index()233 eigen_internal_assert(size!=m_allocatedSize); in reallocate()
443 eigen_internal_assert(src.innerSize()==src.size());454 eigen_internal_assert(src.outerSize()==src.size());
469 eigen_internal_assert(m_outerIndex!=0 && m_outerSize>0);1173 eigen_internal_assert(m_innerNonZeros[outer]==0);1192 eigen_internal_assert(data_end < m_data.allocatedSize());1205 eigen_internal_assert(outer+1==m_outerSize || m_innerNonZeros[outer+1]==0);1217 eigen_internal_assert(data_end < m_data.allocatedSize());
240 … eigen_internal_assert(m_llSize<m_allocatedElements && "internal error: overflow in sparse mode"); in coeffRef()
320 eigen_internal_assert(row>=0 && row<m_matrix->rows() && col>=0 && col<m_matrix->cols());
194 …EIGEN_STRONG_INLINE Scalar value() const { eigen_internal_assert(m_id<m_innerSize); return m_value…282 …EIGEN_STRONG_INLINE Scalar value() const { eigen_internal_assert(m_id<m_innerSize); return m_value…
26 eigen_internal_assert(v!=0); in manage_multi_threading()31 eigen_internal_assert(v!=0); in manage_multi_threading()43 eigen_internal_assert(false); in manage_multi_threading()
62 eigen_internal_assert(l1!=0 && l2!=0); in manage_caching_sizes()69 eigen_internal_assert(l1!=0 && l2!=0); in manage_caching_sizes()76 eigen_internal_assert(false); in manage_caching_sizes()121 eigen_internal_assert(k > 0);128 eigen_internal_assert(n_cache >= static_cast<Index>(nr));130 eigen_internal_assert(n > 0);141 eigen_internal_assert(m > 0);187 …eigen_internal_assert(((old_k/k) == (old_k/max_kc)) && "the number of sweeps has to remain the sam…661 eigen_internal_assert(unpacket_traits<ScalarPacket>::size<=4);812 eigen_internal_assert(unpacket_traits<RhsPacket>::size<=4);
90 eigen_internal_assert(blockA!=0);368 eigen_internal_assert(this->m_blockA==0 && this->m_blockB==0);
96 eigen_internal_assert(resIncr==1);371 eigen_internal_assert(rhs.stride()==1);
98 eigen_internal_assert(row >= 0 && row < rows() in coeff()143 eigen_internal_assert(index >= 0 && index < size()); in coeff()234 eigen_internal_assert(row >= 0 && row < rows() && col >= 0 && col < cols()); in packet()263 eigen_internal_assert(index >= 0 && index < size()); in packet()342 eigen_internal_assert(row >= 0 && row < rows() in coeffRef()391 eigen_internal_assert(index >= 0 && index < size()); in coeffRef()
301 eigen_internal_assert(row!=col);313 { eigen_internal_assert(false && "should never be called"); }
205 eigen_internal_assert(size==rows*cols && rows==_Rows && cols==_Cols);351 eigen_internal_assert(size==rows*cols && rows>=0 && cols >=0);431 eigen_internal_assert(size==rows*cols && rows==_Rows && cols >=0);505 eigen_internal_assert(size==rows*cols && rows>=0 && cols == _Cols);
328 eigen_internal_assert(size <= NumTraits<StorageIndex>::highest());400 eigen_internal_assert(m_indices.size() <= NumTraits<StorageIndex>::highest());
760 eigen_internal_assert(row!=col);776 eigen_internal_assert(row!=col);
81 eigen_internal_assert(checkIndexRange(indices)); in coeff()88 eigen_internal_assert(index >= 0 && index < size()); in coeff()113 eigen_internal_assert(checkIndexRange(indices)); in coeffRef()120 eigen_internal_assert(index >= 0 && index < size()); in coeffRef()197 eigen_internal_assert(index >= 0 && index < size()); in operator()
126 eigen_internal_assert(checkIndexRange(indices)); in coeff()149 eigen_internal_assert(index >= 0 && index < size()); in coeff()166 eigen_internal_assert(checkIndexRange(indices)); in coeffRef()189 eigen_internal_assert(index >= 0 && index < size()); in coeffRef()243 eigen_internal_assert(index >= 0 && index < size()); in operator()
144 eigen_internal_assert(index >= 0 && index < size()); in operator()231 eigen_internal_assert(index >= 0 && index < size()); in operator()
361 eigen_internal_assert(ki_it && ki_it.col()==minrow); in factorize()385 eigen_internal_assert(sizeu<=n); in factorize()391 eigen_internal_assert(sizel<=ii); in factorize()
257 …eigen_internal_assert(rowIdx[colPtr[j]]==j && "IncompleteCholesky: only the lower triangular part … in factorize()299 eigen_internal_assert(rowIdx[jk]==j); in factorize()
181 eigen_internal_assert(g1.representation.size() == m_numIndices); in mul()182 eigen_internal_assert(g2.representation.size() == m_numIndices); in mul()
581 #define eigen_internal_assert(x) eigen_assert(x) macro583 #define eigen_internal_assert(x) macro
495 eigen_internal_assert(start!=0 && end!=0 && target!=0);518 eigen_internal_assert(start!=0 && end!=0 && target!=0);
664 eigen_internal_assert(p == rank());733 eigen_internal_assert(p == rank());
44 …eigen_internal_assert(((lda%PacketSize)==0) && ((ldc%PacketSize)==0) && (i0==internal::first_defau… in sparselu_gemm()