style update
This commit is contained in:
@ -228,21 +228,21 @@ Neighbor::~Neighbor()
|
|||||||
|
|
||||||
memory->destroy(cutneighsq);
|
memory->destroy(cutneighsq);
|
||||||
memory->destroy(cutneighghostsq);
|
memory->destroy(cutneighghostsq);
|
||||||
delete [] cuttype;
|
delete[] cuttype;
|
||||||
delete [] cuttypesq;
|
delete[] cuttypesq;
|
||||||
delete [] fixchecklist;
|
delete[] fixchecklist;
|
||||||
|
|
||||||
for (int i = 0; i < nlist; i++) delete lists[i];
|
for (int i = 0; i < nlist; i++) delete lists[i];
|
||||||
for (int i = 0; i < nbin; i++) delete neigh_bin[i];
|
for (int i = 0; i < nbin; i++) delete neigh_bin[i];
|
||||||
for (int i = 0; i < nstencil; i++) delete neigh_stencil[i];
|
for (int i = 0; i < nstencil; i++) delete neigh_stencil[i];
|
||||||
for (int i = 0; i < nlist; i++) delete neigh_pair[i];
|
for (int i = 0; i < nlist; i++) delete neigh_pair[i];
|
||||||
delete [] lists;
|
delete[] lists;
|
||||||
delete [] neigh_bin;
|
delete[] neigh_bin;
|
||||||
delete [] neigh_stencil;
|
delete[] neigh_stencil;
|
||||||
delete [] neigh_pair;
|
delete[] neigh_pair;
|
||||||
|
|
||||||
delete [] slist;
|
delete[] slist;
|
||||||
delete [] plist;
|
delete[] plist;
|
||||||
|
|
||||||
for (int i = 0; i < nrequest; i++)
|
for (int i = 0; i < nrequest; i++)
|
||||||
if (requests[i]) delete requests[i];
|
if (requests[i]) delete requests[i];
|
||||||
@ -251,15 +251,15 @@ Neighbor::~Neighbor()
|
|||||||
if (old_requests[i]) delete old_requests[i];
|
if (old_requests[i]) delete old_requests[i];
|
||||||
memory->sfree(old_requests);
|
memory->sfree(old_requests);
|
||||||
|
|
||||||
delete [] binclass;
|
delete[] binclass;
|
||||||
delete [] binnames;
|
delete[] binnames;
|
||||||
delete [] binmasks;
|
delete[] binmasks;
|
||||||
delete [] stencilclass;
|
delete[] stencilclass;
|
||||||
delete [] stencilnames;
|
delete[] stencilnames;
|
||||||
delete [] stencilmasks;
|
delete[] stencilmasks;
|
||||||
delete [] pairclass;
|
delete[] pairclass;
|
||||||
delete [] pairnames;
|
delete[] pairnames;
|
||||||
delete [] pairmasks;
|
delete[] pairmasks;
|
||||||
|
|
||||||
delete neigh_bond;
|
delete neigh_bond;
|
||||||
delete neigh_angle;
|
delete neigh_angle;
|
||||||
@ -274,11 +274,11 @@ Neighbor::~Neighbor()
|
|||||||
|
|
||||||
memory->destroy(ex1_group);
|
memory->destroy(ex1_group);
|
||||||
memory->destroy(ex2_group);
|
memory->destroy(ex2_group);
|
||||||
delete [] ex1_bit;
|
delete[] ex1_bit;
|
||||||
delete [] ex2_bit;
|
delete[] ex2_bit;
|
||||||
|
|
||||||
memory->destroy(ex_mol_group);
|
memory->destroy(ex_mol_group);
|
||||||
delete [] ex_mol_bit;
|
delete[] ex_mol_bit;
|
||||||
memory->destroy(ex_mol_intra);
|
memory->destroy(ex_mol_intra);
|
||||||
|
|
||||||
memory->destroy(type2collection);
|
memory->destroy(type2collection);
|
||||||
@ -484,7 +484,7 @@ void Neighbor::init()
|
|||||||
restart_check = 0;
|
restart_check = 0;
|
||||||
if (output->restart_flag) restart_check = 1;
|
if (output->restart_flag) restart_check = 1;
|
||||||
|
|
||||||
delete [] fixchecklist;
|
delete[] fixchecklist;
|
||||||
fixchecklist = nullptr;
|
fixchecklist = nullptr;
|
||||||
fixchecklist = new int[modify->nfix];
|
fixchecklist = new int[modify->nfix];
|
||||||
|
|
||||||
@ -607,8 +607,8 @@ void Neighbor::init()
|
|||||||
if (lmp->kokkos)
|
if (lmp->kokkos)
|
||||||
init_ex_bit_kokkos();
|
init_ex_bit_kokkos();
|
||||||
else {
|
else {
|
||||||
delete [] ex1_bit;
|
delete[] ex1_bit;
|
||||||
delete [] ex2_bit;
|
delete[] ex2_bit;
|
||||||
ex1_bit = new int[nex_group];
|
ex1_bit = new int[nex_group];
|
||||||
ex2_bit = new int[nex_group];
|
ex2_bit = new int[nex_group];
|
||||||
}
|
}
|
||||||
@ -623,7 +623,7 @@ void Neighbor::init()
|
|||||||
if (lmp->kokkos)
|
if (lmp->kokkos)
|
||||||
init_ex_mol_bit_kokkos();
|
init_ex_mol_bit_kokkos();
|
||||||
else {
|
else {
|
||||||
delete [] ex_mol_bit;
|
delete[] ex_mol_bit;
|
||||||
ex_mol_bit = new int[nex_mol];
|
ex_mol_bit = new int[nex_mol];
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -801,10 +801,10 @@ int Neighbor::init_pair()
|
|||||||
for (i = 0; i < nbin; i++) delete neigh_bin[i];
|
for (i = 0; i < nbin; i++) delete neigh_bin[i];
|
||||||
for (i = 0; i < nstencil; i++) delete neigh_stencil[i];
|
for (i = 0; i < nstencil; i++) delete neigh_stencil[i];
|
||||||
for (i = 0; i < nlist; i++) delete neigh_pair[i];
|
for (i = 0; i < nlist; i++) delete neigh_pair[i];
|
||||||
delete [] lists;
|
delete[] lists;
|
||||||
delete [] neigh_bin;
|
delete[] neigh_bin;
|
||||||
delete [] neigh_stencil;
|
delete[] neigh_stencil;
|
||||||
delete [] neigh_pair;
|
delete[] neigh_pair;
|
||||||
|
|
||||||
// error check on requests
|
// error check on requests
|
||||||
// do not allow occasional, ghost, bin list
|
// do not allow occasional, ghost, bin list
|
||||||
@ -1026,8 +1026,8 @@ int Neighbor::init_pair()
|
|||||||
// slist = indices of perpetual NStencil classes
|
// slist = indices of perpetual NStencil classes
|
||||||
// perpetual = used by any perpetual NPair class
|
// perpetual = used by any perpetual NPair class
|
||||||
|
|
||||||
delete [] slist;
|
delete[] slist;
|
||||||
delete [] plist;
|
delete[] plist;
|
||||||
nstencil_perpetual = npair_perpetual = 0;
|
nstencil_perpetual = npair_perpetual = 0;
|
||||||
slist = new int[nstencil];
|
slist = new int[nstencil];
|
||||||
plist = new int[nlist];
|
plist = new int[nlist];
|
||||||
@ -2058,8 +2058,7 @@ int Neighbor::request(void *requestor, int instance)
|
|||||||
if (nrequest == maxrequest) {
|
if (nrequest == maxrequest) {
|
||||||
maxrequest += RQDELTA;
|
maxrequest += RQDELTA;
|
||||||
requests = (NeighRequest **)
|
requests = (NeighRequest **)
|
||||||
memory->srealloc(requests,maxrequest*sizeof(NeighRequest *),
|
memory->srealloc(requests,maxrequest*sizeof(NeighRequest *), "neighbor:requests");
|
||||||
"neighbor:requests");
|
|
||||||
}
|
}
|
||||||
|
|
||||||
requests[nrequest] = new NeighRequest(lmp, nrequest, requestor, instance);
|
requests[nrequest] = new NeighRequest(lmp, nrequest, requestor, instance);
|
||||||
|
|||||||
Reference in New Issue
Block a user