OilfieldToolsNet/LBPM
4
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

debugging uCT filter

Browse Source
This commit is contained in:
James E McClure 2018-06-05 17:50:44 -04:00
parent 20da80d62e
commit abcf99e255
1 changed files with 10 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
tests/lbpm_uCT_pp.cpp
View File

@ -73,7 +73,7 @@ int main(int argc, char **argv)
//.......................................................................
// Reading the domain information file
//.......................................................................
std::shared_ptr<Domain> Dm (new Domain(domain_db, comm));
std::shared_ptr<Domain> Dm ();
for (int i=0; i<Dm->Nx*Dm->Ny*Dm->Nz; i++) Dm->id[i] = 1;
Dm->CommInit();
@ -100,15 +100,16 @@ int main(int argc, char **argv)
}
int N_levels = Nx.size();
// Initialize the domain
std::vector<std::shared_ptr<Domain>> Dm(N_levels);
// Initialize the domain
std::vector<std::shared_ptr<Domain>> Dm(N_levels);
for (int i=0; i<N_levels; i++) {
Dm[i].reset( new Domain(Nx[i],Ny[i],Nz[i],rank,nprocx,nprocy,nprocz,Lx,Ly,Lz,BC) );
int N = (Nx[i]+2)*(Ny[i]+2)*(Nz[i]+2);
for (int n=0; n<N; n++)
Dm[i]->id[n] = 1;
Dm[i]->CommInit(comm);
}
Dm[i].reset( new Domain(domain_db, comm) );
int N = (Nx[i]+2)*(Ny[i]+2)*(Nz[i]+2);
for (int n=0; n<N; n++){
Dm[i]->id[n] = 1;
}
Dm[i]->CommInit();
}
// array containing a distance mask
Array<float> MASK(Nx[0]+2,Ny[0]+2,Nz[0]+2);