Lines Matching defs:Dest
234 template<typename Dest> void scaleAndAddTo(Dest& dest, const Scalar& alpha) const
257 dest.row(j) += i.value() * m_rhs.row(j);
266 dest.row(a) += (v) * m_rhs.row(b);
267 dest.row(b) += numext::conj(v) * m_rhs.row(a);
270 dest.row(j) += i.value() * m_rhs.row(j);
295 template<typename Dest> void scaleAndAddTo(Dest& /*dest*/, const Scalar& /*alpha*/) const
318 typedef SparseMatrix<Scalar,DestOrder,Index> Dest;
321 Dest& dest(_dest.derived());
323 StorageOrderMatch = int(Dest::IsRowMajor) == int(MatrixType::IsRowMajor)
330 dest.resize(size,size);
354 dest.resizeNonZeros(nnz);
355 dest.outerIndexPtr()[0] = 0;
357 dest.outerIndexPtr()[j+1] = dest.outerIndexPtr()[j] + count[j];
359 count[j] = dest.outerIndexPtr()[j];
376 dest.innerIndexPtr()[k] = StorageOrderMatch ? ip : jp;
377 dest.valuePtr()[k] = it.value();
382 dest.innerIndexPtr()[k] = ip;
383 dest.valuePtr()[k] = it.value();
390 dest.innerIndexPtr()[k] = ip;
391 dest.valuePtr()[k] = it.value();
393 dest.innerIndexPtr()[k] = jp;
394 dest.valuePtr()[k] = numext::conj(it.value());
405 SparseMatrix<Scalar,DstOrder,Index>& dest(_dest.derived());
417 dest.resize(size,size);
431 dest.outerIndexPtr()[0] = 0;
433 dest.outerIndexPtr()[j+1] = dest.outerIndexPtr()[j] + count[j];
434 dest.resizeNonZeros(dest.outerIndexPtr()[size]);
436 count[j] = dest.outerIndexPtr()[j];
451 dest.innerIndexPtr()[k] = int(DstUpLo)==int(Lower) ? (std::max)(ip,jp) : (std::min)(ip,jp);
455 dest.valuePtr()[k] = numext::conj(it.value());
457 dest.valuePtr()[k] = it.value();
494 template<typename DestType,unsigned int DestUpLo> void evalTo(SparseSelfAdjointView<DestType,DestUpLo>& dest) const
496 internal::permute_symm_to_symm<UpLo,DestUpLo>(m_matrix,dest.matrix(),m_perm.indices().data());
