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

fix warn

parent a5a723cc
No related branches found
No related tags found
No related merge requests found
...@@ -520,19 +520,17 @@ class MHexahedronN : public MHexahedron { ...@@ -520,19 +520,17 @@ class MHexahedronN : public MHexahedron {
int n = _order-1; int n = _order-1;
for (int i = 0; i < 4; i++) { for (int i = 0; i < 4; i++) {
if(faces2edge_hexa(num, i) > 0) if(faces2edge_hexa(num, i) > 0){
{
int edge_num = faces2edge_hexa(num, i) - 1; int edge_num = faces2edge_hexa(num, i) - 1;
for (int j = 0; j < n; j++) v[++count] = _vs[n*edge_num + j]; for (int j = 0; j < n; j++) v[++count] = _vs[n*edge_num + j];
} }
else else{
{
int edge_num = -faces2edge_hexa(num, i) - 1; int edge_num = -faces2edge_hexa(num, i) - 1;
for (int j = n-1; j >= 0; j--) v[++count] = _vs[n*edge_num + j]; for (int j = n-1; j >= 0; j--) v[++count] = _vs[n*edge_num + j];
} }
} }
if (v.size() > count + 1) { if ((int)v.size() > count + 1) {
int start = 12 * n + num * n*n; int start = 12 * n + num * n*n;
for (int i = 0; i < n*n; i++){ for (int i = 0; i < n*n; i++){
v[++count] = _vs[start + i]; v[++count] = _vs[start + i];
......
...@@ -361,19 +361,17 @@ class MTetrahedronN : public MTetrahedron { ...@@ -361,19 +361,17 @@ class MTetrahedronN : public MTetrahedron {
int n = _order - 1; int n = _order - 1;
for (int i = 0; i < 3; i++) { for (int i = 0; i < 3; i++) {
if(faces2edge_tetra(num, i) > 0) if(faces2edge_tetra(num, i) > 0){
{
int edge_num = faces2edge_tetra(num, i) - 1; int edge_num = faces2edge_tetra(num, i) - 1;
for (int j = 0; j < n; j++) v[++count] = _vs[n*edge_num + j]; for (int j = 0; j < n; j++) v[++count] = _vs[n*edge_num + j];
} }
else else{
{
int edge_num = -faces2edge_tetra(num, i) - 1; int edge_num = -faces2edge_tetra(num, i) - 1;
for (int j = n-1; j >= 0; j--) v[++count] = _vs[n*edge_num + j]; for (int j = n-1; j >= 0; j--) v[++count] = _vs[n*edge_num + j];
} }
} }
if (v.size() > count + 1) { if ((int)v.size() > count + 1) {
int start = 6 * n + num * (n-1)*n/2; int start = 6 * n + num * (n-1)*n/2;
for (int i = 0; i < (n-1)*n/2; i++){ for (int i = 0; i < (n-1)*n/2; i++){
v[++count] = _vs[start + i]; v[++count] = _vs[start + i];
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment