Skip to content
Snippets Groups Projects
Commit 12a8a9df authored by Christophe Geuzaine's avatar Christophe Geuzaine
Browse files

remove unused vars

parent f0d58cd6
No related branches found
No related tags found
No related merge requests found
...@@ -732,9 +732,7 @@ static int isTriangulationParametrizable(const std::vector<MTriangle *> &t, ...@@ -732,9 +732,7 @@ static int isTriangulationParametrizable(const std::vector<MTriangle *> &t,
std::set<MVertex *> v; std::set<MVertex *> v;
std::map<MEdge, int, MEdgeLessThan> e; std::map<MEdge, int, MEdgeLessThan> e;
double surf = 0;
for(std::size_t i = 0; i < t.size(); ++i) { for(std::size_t i = 0; i < t.size(); ++i) {
surf += t[i]->getVolume();
for(int j = 0; j < 3; j++) { for(int j = 0; j < 3; j++) {
v.insert(t[i]->getVertex(j)); v.insert(t[i]->getVertex(j));
auto it = e.find(t[i]->getEdge(j)); auto it = e.find(t[i]->getEdge(j));
......
...@@ -993,7 +993,6 @@ void delaunayTrgl(const std::size_t numThreads, const std::size_t NPTS_AT_ONCE, ...@@ -993,7 +993,6 @@ void delaunayTrgl(const std::size_t numThreads, const std::size_t NPTS_AT_ONCE,
#endif #endif
double totSearch = 0; double totSearch = 0;
double totCavity = 0;
std::vector<std::size_t> _negatives; std::vector<std::size_t> _negatives;
std::vector<cavityContainer> cavity(NPTS_AT_ONCE); std::vector<cavityContainer> cavity(NPTS_AT_ONCE);
std::vector<connContainer> bnd(NPTS_AT_ONCE); std::vector<connContainer> bnd(NPTS_AT_ONCE);
...@@ -1076,7 +1075,6 @@ void delaunayTrgl(const std::size_t numThreads, const std::size_t NPTS_AT_ONCE, ...@@ -1076,7 +1075,6 @@ void delaunayTrgl(const std::size_t numThreads, const std::size_t NPTS_AT_ONCE,
faceToTet.clear(); faceToTet.clear();
const std::size_t cSize = cavityK.size(); const std::size_t cSize = cavityK.size();
const std::size_t bSize = bndK.size(); const std::size_t bSize = bndK.size();
totCavity += cSize;
Choice[K] = cavityK[0]; Choice[K] = cavityK[0];
for(std::size_t i = 0; i < bSize; i++) { for(std::size_t i = 0; i < bSize; i++) {
// reuse memory slots of invalid elements // reuse memory slots of invalid elements
......
...@@ -1826,9 +1826,6 @@ void delaunayMeshIn2D(std::vector<MVertex *> &v, ...@@ -1826,9 +1826,6 @@ void delaunayMeshIn2D(std::vector<MVertex *> &v,
MVertex *box[4]; MVertex *box[4];
initialSquare(v, box, t); initialSquare(v, box, t);
double AVG_ITER = 0;
double AVG_CAVSIZE = 0;
if(hilbertSort) SortHilbert(v); if(hilbertSort) SortHilbert(v);
for(size_t i = 0; i < v.size(); i++) { for(size_t i = 0; i < v.size(); i++) {
...@@ -1836,7 +1833,6 @@ void delaunayMeshIn2D(std::vector<MVertex *> &v, ...@@ -1836,7 +1833,6 @@ void delaunayMeshIn2D(std::vector<MVertex *> &v,
int NITER = 0; int NITER = 0;
MTri3 *found = getTriToBreak(pv, t, NITER); MTri3 *found = getTriToBreak(pv, t, NITER);
AVG_ITER += (double)NITER;
if(!found) { if(!found) {
Msg::Error("Cannot insert a point in 2D Delaunay"); Msg::Error("Cannot insert a point in 2D Delaunay");
continue; continue;
...@@ -1845,7 +1841,6 @@ void delaunayMeshIn2D(std::vector<MVertex *> &v, ...@@ -1845,7 +1841,6 @@ void delaunayMeshIn2D(std::vector<MVertex *> &v,
cavity.clear(); cavity.clear();
recurFindCavity(shell, cavity, pv, found); recurFindCavity(shell, cavity, pv, found);
AVG_CAVSIZE += (double)cavity.size();
std::vector<MTri3 *> extended_cavity; std::vector<MTri3 *> extended_cavity;
for(std::size_t count = 0; count < shell.size(); count++) { for(std::size_t count = 0; count < shell.size(); count++) {
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment