12345qiupeng
/
gtsam
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix c++ warnings

release/4.3a0
Frank Dellaert 2024-08-15 17:13:19 -07:00
parent c6bd3f8e32
commit a3afa5740a
3 changed files with 1 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
gtsam/3rdparty/Eigen/Eigen/src/SparseCore/TriangularSolver.h vendored
View File

@ -270,11 +270,9 @@ struct sparse_solve_triangular_sparse_selector<Lhs,Rhs,Mode,UpLo,ColMajor>
} }
Index count = 0;
// FIXME compute a reference value to filter zeros // FIXME compute a reference value to filter zeros
for (typename AmbiVector<Scalar,StorageIndex>::Iterator it(tempVector/*,1e-12*/); it; ++it) for (typename AmbiVector<Scalar,StorageIndex>::Iterator it(tempVector/*,1e-12*/); it; ++it)
{ {
++ count;
// std::cerr << "fill " << it.index() << ", " << col << "\n"; // std::cerr << "fill " << it.index() << ", " << col << "\n";
// std::cout << it.value() << " "; // std::cout << it.value() << " ";
// FIXME use insertBack // FIXME use insertBack

5
gtsam/3rdparty/Eigen/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h vendored
View File

@ -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 // Identify the relaxed supernodes by postorder traversal of the etree
Index snode_start; // beginning of a snode Index snode_start; // beginning of a snode
StorageIndex k; 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; StorageIndex l;
for (j = 0; j < n; ) for (j = 0; j < n; )
{ {
@ -88,7 +86,6 @@ void SparseLUImpl<Scalar,StorageIndex>::heap_relax_snode (const Index n, IndexVe
parent = et(j); parent = et(j);
} }
// Found a supernode in postordered etree, j is the last column // Found a supernode in postordered etree, j is the last column
++nsuper_et_post;
k = StorageIndex(n); k = StorageIndex(n);
for (Index i = snode_start; i <= j; ++i) for (Index i = snode_start; i <= j; ++i)
k = (std::min)(k, inv_post(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 // This is also a supernode in the original etree
relax_end(k) = l; // Record last column relax_end(k) = l; // Record last column
++nsuper_et;
} }
else else
{ {
@ -107,7 +103,6 @@ void SparseLUImpl<Scalar,StorageIndex>::heap_relax_snode (const Index n, IndexVe
if (descendants(i) == 0) if (descendants(i) == 0)
{ {
relax_end(l) = l; relax_end(l) = l;
++nsuper_et;
} }
} }
} }

2
gtsam/3rdparty/metis/GKlib/pdb.c vendored
View File

@ -131,7 +131,7 @@ that structure.
/************************************************************************/ /************************************************************************/
pdbf *gk_readpdbfile(char *fname) { /* {{{ */ pdbf *gk_readpdbfile(char *fname) { /* {{{ */
int i=0, res=0; int i=0, res=0;
char linetype[6]; char linetype[7];
int aserial; int aserial;
char aname[5] = " \0"; char aname[5] = " \0";
char altLoc = ' '; char altLoc = ' ';