mirror of
https://github.com/wpilibsuite/allwpilib
synced 2026-06-21 01:01:43 +00:00
66 lines
2.7 KiB
Diff
66 lines
2.7 KiB
Diff
From 0000000000000000000000000000000000000000 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 3/3] 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 f9c56ba79800e209dcf3f18ba37dbb8023488bca..7cb2c2665f0e24924da88f11c0fe3ca0c0af52e3 100644
|
|
--- a/Eigen/src/SparseCore/TriangularSolver.h
|
|
+++ b/Eigen/src/SparseCore/TriangularSolver.h
|
|
@@ -270,11 +270,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 6f75d500e5f831f414175ce46dbceffa0acd5539..7aecbcad8ed2703000d62cfd5d88d983c69a7423 100644
|
|
--- a/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h
|
|
+++ b/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h
|
|
@@ -75,8 +75,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; )
|
|
{
|
|
@@ -88,7 +86,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));
|
|
@@ -97,7 +94,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
|
|
{
|
|
@@ -107,7 +103,6 @@ void SparseLUImpl<Scalar,StorageIndex>::heap_relax_snode (const Index n, IndexVe
|
|
if (descendants(i) == 0)
|
|
{
|
|
relax_end(l) = l;
|
|
- ++nsuper_et;
|
|
}
|
|
}
|
|
}
|