OilfieldToolsNet/opm-core
4
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Remove commented out debug code.

Browse Source
This commit is contained in:
Jostein R. Natvig 2009-06-18 16:12:42 +00:00
parent eee76550ef
commit 286deeaec8
1 changed files with 0 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
facetopology.c
View File

@ -78,22 +78,13 @@ static int *computeFaceTopology(int *a1,
mask[3] = intersect[2]; mask[3] = intersect[2];
} }
} }
/* fprintf(stderr, "intersect: %d %d %d %d\n", */
/* intersect[0], */
/* intersect[1], */
/* intersect[2], */
/* intersect[3]); */
/* fprintf(stderr, "face: "); */
int k; int k;
int *f = faces; int *f = faces;
for (k=0; k<8; ++k){ for (k=0; k<8; ++k){
if(mask[k] != -1){ if(mask[k] != -1){
*f++ = mask[k]; *f++ = mask[k];
/* fprintf(stderr, "%d ", f[-1]); */
} }
} }
/* fprintf(stderr, "\n"); */
return f; return f;
} }
@ -156,11 +147,6 @@ void findconnections(int n, int *pts[4],
while(j<n-1 && (b1[j] < a1[i+1] || b2[j] < a2[i+1])){ while(j<n-1 && (b1[j] < a1[i+1] || b2[j] < a2[i+1])){
/*debug:*/
/* int k; */
/* for (k=0; k<n; ++k) itop[k]=-1; */
/* for (k=0; k<n; ++k) ibottom[k]=-1; */
if (b1[j] == b1[j+1] && b2[j] == b2[j+1]){ if (b1[j] == b1[j+1] && b2[j] == b2[j+1]){
itop[j+1] = itop[j]; itop[j+1] = itop[j];
++j; ++j;