diff --git a/c_source/pruning/pruneVoids.cpp b/c_source/pruning/pruneVoids.cpp index f632d25..82c6273 100644 --- a/c_source/pruning/pruneVoids.cpp +++ b/c_source/pruning/pruneVoids.cpp @@ -512,9 +512,9 @@ int main(int argc, char **argv) { // main processing of each void for (iVoid = 0; iVoid < numVoids; iVoid++) { voidID = voids[iVoid].voidID; - printf(" Working on void %d (of %d) %d %d %f\n",iVoid+1, numVoids, voidID, - voids[iVoid].numPart, - voids[iVoid].radius); + //printf(" Working on void %d (of %d) %d %d %f\n",iVoid+1, numVoids, voidID, + // voids[iVoid].numPart, + // voids[iVoid].radius); voids[iVoid].center[0] = part[voids[iVoid].coreParticle].x; voids[iVoid].center[1] = part[voids[iVoid].coreParticle].y; @@ -666,7 +666,8 @@ int main(int argc, char **argv) { clock4 = clock(); interval = 1.*(clock4 - clock3)/CLOCKS_PER_SEC; //printf(" %.2f for maximum extent\n", interval); - + +/* // compute distance from center to nearest mock boundary particle // (with new boundary handling this will go away) clock3 = clock(); @@ -744,6 +745,7 @@ int main(int argc, char **argv) { clock4 = clock(); interval = 1.*(clock4 - clock3)/CLOCKS_PER_SEC; //printf(" %.2f for nearest edge\n", interval); +*/ // compute eigenvalues and vectors for orientation and shape clock3 = clock(); @@ -847,7 +849,7 @@ int main(int argc, char **argv) { voids.resize(iGood); printf(" 2nd filter: rejected %d too small\n", numTooSmall); - +/* // toss out voids near non-periodic box edges iGood = 0; for (iVoid = 0; iVoid < voids.size(); iVoid++) { @@ -860,7 +862,9 @@ int main(int argc, char **argv) { } voids.resize(iGood); printf(" 3rd filter: rejected %d too close to high redshift boundaries\n", numNearZ); +*/ +/* // toss out voids that are beyond redshift boundaries numNearZ = 0; iGood = 0; @@ -885,6 +889,7 @@ int main(int argc, char **argv) { } voids.resize(iGood); printf(" 4th filter: rejected %d outside redshift boundaries\n", numNearZ); +*/ // find top-level voids numAreParents = 0;