mirror of
https://github.com/wpilibsuite/allwpilib
synced 2026-06-26 01:51:41 +00:00
69 lines
2.6 KiB
Diff
69 lines
2.6 KiB
Diff
From 7846c7387c1cb09cef7329630012ea1aefe64cf9 Mon Sep 17 00:00:00 2001
|
|
From: Laurent Rineau <laurent.rineau@cgal.org>
|
|
Date: Tue, 11 Oct 2022 17:37:04 +0000
|
|
Subject: [PATCH] Eigen/Sparse: fix warnings -Wunused-but-set-variable
|
|
|
|
---
|
|
Eigen/src/SparseCore/TriangularSolver.h | 4 ++--
|
|
Eigen/src/SparseLU/SparseLU_heap_relax_snode.h | 5 -----
|
|
2 files changed, 2 insertions(+), 7 deletions(-)
|
|
|
|
diff --git a/Eigen/src/SparseCore/TriangularSolver.h b/Eigen/src/SparseCore/TriangularSolver.h
|
|
index 79c867c25..a9fbeebc1 100644
|
|
--- a/Eigen/src/SparseCore/TriangularSolver.h
|
|
+++ b/Eigen/src/SparseCore/TriangularSolver.h
|
|
@@ -272,11 +272,11 @@ struct sparse_solve_triangular_sparse_selector<Lhs,Rhs,Mode,UpLo,ColMajor>
|
|
}
|
|
|
|
|
|
- Index count = 0;
|
|
+// Index count = 0;
|
|
// FIXME compute a reference value to filter zeros
|
|
for (typename AmbiVector<Scalar,StorageIndex>::Iterator it(tempVector/*,1e-12*/); it; ++it)
|
|
{
|
|
- ++ count;
|
|
+// ++ count;
|
|
// std::cerr << "fill " << it.index() << ", " << col << "\n";
|
|
// std::cout << it.value() << " ";
|
|
// FIXME use insertBack
|
|
diff --git a/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h b/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h
|
|
index 7bed85de5..2a8d80b24 100644
|
|
--- a/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h
|
|
+++ b/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h
|
|
@@ -77,8 +77,6 @@ void SparseLUImpl<Scalar,StorageIndex>::heap_relax_snode (const Index n, IndexVe
|
|
// Identify the relaxed supernodes by postorder traversal of the etree
|
|
Index snode_start; // beginning of a snode
|
|
StorageIndex k;
|
|
- Index nsuper_et_post = 0; // Number of relaxed snodes in postordered etree
|
|
- Index nsuper_et = 0; // Number of relaxed snodes in the original etree
|
|
StorageIndex l;
|
|
for (j = 0; j < n; )
|
|
{
|
|
@@ -90,7 +88,6 @@ void SparseLUImpl<Scalar,StorageIndex>::heap_relax_snode (const Index n, IndexVe
|
|
parent = et(j);
|
|
}
|
|
// Found a supernode in postordered etree, j is the last column
|
|
- ++nsuper_et_post;
|
|
k = StorageIndex(n);
|
|
for (Index i = snode_start; i <= j; ++i)
|
|
k = (std::min)(k, inv_post(i));
|
|
@@ -99,7 +96,6 @@ void SparseLUImpl<Scalar,StorageIndex>::heap_relax_snode (const Index n, IndexVe
|
|
{
|
|
// This is also a supernode in the original etree
|
|
relax_end(k) = l; // Record last column
|
|
- ++nsuper_et;
|
|
}
|
|
else
|
|
{
|
|
@@ -109,7 +105,6 @@ void SparseLUImpl<Scalar,StorageIndex>::heap_relax_snode (const Index n, IndexVe
|
|
if (descendants(i) == 0)
|
|
{
|
|
relax_end(l) = l;
|
|
- ++nsuper_et;
|
|
}
|
|
}
|
|
}
|
|
--
|
|
2.40.0
|
|
|