forked from lijiext/lammps
git-svn-id: svn://svn.icms.temple.edu/lammps-ro/trunk@5529 f3b2605a-c512-4ea7-a41b-209d697bcdaa
This commit is contained in:
parent
81f821578b
commit
56f9e680c6
|
@ -840,7 +840,8 @@ void bifactor(int n, int *factor1, int *factor2)
|
|||
{
|
||||
int n1,n2,facmax;
|
||||
|
||||
facmax = static_cast<int> (sqrt((double) n));
|
||||
//facmax = static_cast<int> (sqrt((double) n));
|
||||
facmax = static_cast<int> (sqrt(n));
|
||||
|
||||
for (n1 = facmax; n1 > 0; n1--) {
|
||||
n2 = n/n1;
|
||||
|
|
|
@ -88,7 +88,7 @@ void FixEventTAD::restart(char *buf)
|
|||
|
||||
event_number = static_cast<int> (list[n++]);
|
||||
event_timestep = static_cast<int> (list[n++]);
|
||||
tlo = static_cast<double> (list[n++]);
|
||||
tlo = list[n++];
|
||||
ebarrier = list[n++];
|
||||
}
|
||||
|
||||
|
|
|
@ -446,7 +446,7 @@ int FixOrientFCC::pack_comm(int n, int *list, double *buf,
|
|||
for (i = 0; i < n; i++) {
|
||||
k = list[i];
|
||||
num = nbr[k].n;
|
||||
buf[m++] = static_cast<double> (num);
|
||||
buf[m++] = num;
|
||||
buf[m++] = nbr[k].duxi;
|
||||
|
||||
for (j = 0; j < num; j++) {
|
||||
|
@ -461,7 +461,7 @@ int FixOrientFCC::pack_comm(int n, int *list, double *buf,
|
|||
|
||||
id = nbr[k].id[j];
|
||||
if (k < nlocal) id = tag[id];
|
||||
buf[m++] = static_cast<double> (id);
|
||||
buf[m++] = id;
|
||||
}
|
||||
|
||||
m += (12-num) * 3;
|
||||
|
|
Loading…
Reference in New Issue