HomeSort by relevance Sort by last modified time
    Searched refs:eigen_internal_assert (Results 1 - 25 of 29) sorted by null

1 2

  /external/eigen/Eigen/src/Core/products/
Parallelizer.h 24 eigen_internal_assert(v!=0);
29 eigen_internal_assert(v!=0);
41 eigen_internal_assert(false);
GeneralMatrixMatrix.h 90 eigen_internal_assert(blockA!=0);
369 eigen_internal_assert(this->m_blockA==0 && this->m_blockB==0);
GeneralBlockPanelKernel.h 62 eigen_internal_assert(l1!=0 && l2!=0);
69 eigen_internal_assert(l1!=0 && l2!=0);
76 eigen_internal_assert(false);
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 same");
661 eigen_internal_assert(unpacket_traits<ScalarPacket>::size<=4);
812 eigen_internal_assert(unpacket_traits<RhsPacket>::size<=4)
    [all...]
GeneralMatrixVector.h 96 eigen_internal_assert(resIncr==1);
157 // eigen_internal_assert(size_t(firstLhs+lhsAlignmentOffset)%sizeof(LhsPacket)==0 || size<LhsPacketSize);
174 /* eigen_internal_assert( (alignmentPattern==NoneAligned)
371 eigen_internal_assert(rhs.stride()==1);
431 // eigen_internal_assert(size_t(firstLhs+lhsAlignmentOffset)%sizeof(LhsPacket)==0 || depth<LhsPacketSize);
447 /* eigen_internal_assert( alignmentPattern==NoneAligned
  /external/eigen/Eigen/src/SparseCore/
CompressedStorage.h 118 inline Scalar& value(Index i) { eigen_internal_assert(m_values!=0); return m_values[i]; }
119 inline const Scalar& value(Index i) const { eigen_internal_assert(m_values!=0); return m_values[i]; }
121 inline StorageIndex& index(Index i) { eigen_internal_assert(m_indices!=0); return m_indices[i]; }
122 inline const StorageIndex& index(Index i) const { eigen_internal_assert(m_indices!=0); return m_indices[i]; }
233 eigen_internal_assert(size!=m_allocatedSize);
SparseVector.h 443 eigen_internal_assert(src.innerSize()==src.size());
454 eigen_internal_assert(src.outerSize()==src.size());
SparseMatrix.h 469 eigen_internal_assert(m_outerIndex!=0 && m_outerSize>0);
1192 eigen_internal_assert(data_end < m_data.allocatedSize()); function
    [all...]
AmbiVector.h 240 eigen_internal_assert(m_llSize<m_allocatedElements && "internal error: overflow in sparse mode");
SparseCompressedBase.h 320 eigen_internal_assert(row>=0 && row<m_matrix->rows() && col>=0 && col<m_matrix->cols());
SparseCwiseBinaryOp.h 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; }
  /external/eigen/Eigen/src/Core/
DenseCoeffsBase.h 98 eigen_internal_assert(row >= 0 && row < rows()
143 eigen_internal_assert(index >= 0 && index < size());
234 eigen_internal_assert(row >= 0 && row < rows() && col >= 0 && col < cols());
263 eigen_internal_assert(index >= 0 && index < size());
342 eigen_internal_assert(row >= 0 && row < rows()
391 eigen_internal_assert(index >= 0 && index < size());
SelfAdjointView.h 301 eigen_internal_assert(row!=col);
313 { eigen_internal_assert(false && "should never be called"); }
DenseStorage.h 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);
PermutationMatrix.h 328 eigen_internal_assert(size <= NumTraits<StorageIndex>::highest());
400 eigen_internal_assert(m_indices.size() <= NumTraits<StorageIndex>::highest());
TriangularMatrix.h 760 eigen_internal_assert(row!=col);
776 eigen_internal_assert(row!=col);
    [all...]
  /external/eigen/unsupported/Eigen/CXX11/src/Tensor/
TensorFixedSize.h 81 eigen_internal_assert(checkIndexRange(indices));
88 eigen_internal_assert(index >= 0 && index < size());
113 eigen_internal_assert(checkIndexRange(indices));
120 eigen_internal_assert(index >= 0 && index < size());
197 eigen_internal_assert(index >= 0 && index < size());
Tensor.h 126 eigen_internal_assert(checkIndexRange(indices));
149 eigen_internal_assert(index >= 0 && index < size());
166 eigen_internal_assert(checkIndexRange(indices));
189 eigen_internal_assert(index >= 0 && index < size());
243 eigen_internal_assert(index >= 0 && index < size());
TensorMap.h 144 eigen_internal_assert(index >= 0 && index < size());
231 eigen_internal_assert(index >= 0 && index < size());
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteLUT.h 361 eigen_internal_assert(ki_it && ki_it.col()==minrow);
385 eigen_internal_assert(sizeu<=n);
391 eigen_internal_assert(sizel<=ii);
IncompleteCholesky.h 257 eigen_internal_assert(rowIdx[colPtr[j]]==j && "IncompleteCholesky: only the lower triangular part must be stored");
299 eigen_internal_assert(rowIdx[jk]==j);
  /external/eigen/unsupported/Eigen/CXX11/src/TensorSymmetry/
DynamicSymmetry.h 181 eigen_internal_assert(g1.representation.size() == m_numIndices);
182 eigen_internal_assert(g2.representation.size() == m_numIndices);
  /external/eigen/Eigen/src/Core/util/
Macros.h 581 #define eigen_internal_assert(x) eigen_assert(x) macro
583 #define eigen_internal_assert(x)
    [all...]
Memory.h 495 eigen_internal_assert(start!=0 && end!=0 && target!=0);
518 eigen_internal_assert(start!=0 && end!=0 && target!=0);
    [all...]
  /external/eigen/Eigen/src/LU/
FullPivLU.h 664 eigen_internal_assert(p == rank());
733 eigen_internal_assert(p == rank());
    [all...]
  /external/eigen/Eigen/src/SparseLU/
SparseLU_gemm_kernel.h 44 eigen_internal_assert(((lda%PacketSize)==0) && ((ldc%PacketSize)==0) && (i0==internal::first_default_aligned(C,m)));

Completed in 309 milliseconds

1 2