guilhem_lavaux/vide_public
0
0
Fork 0
mirror of https://bitbucket.org/cosmicvoids/vide_public.git synced 2025-07-04 15:21:11 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Removed redshift cuts in pruning, since this is now handled automatically with new boundary management scheme

Browse source
This commit is contained in:
Paul M. Sutter 2025-01-09 16:09:49 +08:00
parent cf97cfba5d
commit a1d0b675c7
1 changed files with 10 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

15
c_source/pruning/pruneVoids.cpp
View file

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