replace for (;;) with while (true)

This commit is contained in:
Axel Kohlmeyer
2023-06-25 05:56:51 -04:00
parent bfa39a37ff
commit 92c118b29f
6 changed files with 18 additions and 18 deletions

View File

@ -357,7 +357,7 @@ void ComputeAcklandAtom::select(int k, int n, double *arr)
arr--;
l = 1;
ir = n;
for (;;) {
while (true) {
if (ir <= l+1) {
if (ir == l+1 && arr[ir] < arr[l]) {
SWAP(arr[l],arr[ir])
@ -378,7 +378,7 @@ void ComputeAcklandAtom::select(int k, int n, double *arr)
i = l+1;
j = ir;
a = arr[l+1];
for (;;) {
while (true) {
do i++; while (arr[i] < a);
do j--; while (arr[j] > a);
if (j < i) break;
@ -403,7 +403,7 @@ void ComputeAcklandAtom::select2(int k, int n, double *arr, int *iarr)
iarr--;
l = 1;
ir = n;
for (;;) {
while (true) {
if (ir <= l+1) {
if (ir == l+1 && arr[ir] < arr[l]) {
SWAP(arr[l],arr[ir])
@ -430,7 +430,7 @@ void ComputeAcklandAtom::select2(int k, int n, double *arr, int *iarr)
j = ir;
a = arr[l+1];
ia = iarr[l+1];
for (;;) {
while (true) {
do i++; while (arr[i] < a);
do j--; while (arr[j] > a);
if (j < i) break;

View File

@ -442,7 +442,7 @@ void ComputeBasalAtom::select(int k, int n, double *arr)
arr--;
l = 1;
ir = n;
for (;;) {
while (true) {
if (ir <= l+1) {
if (ir == l+1 && arr[ir] < arr[l]) {
SWAP(arr[l],arr[ir])
@ -463,7 +463,7 @@ void ComputeBasalAtom::select(int k, int n, double *arr)
i = l+1;
j = ir;
a = arr[l+1];
for (;;) {
while (true) {
do i++; while (arr[i] < a);
do j--; while (arr[j] > a);
if (j < i) break;
@ -488,7 +488,7 @@ void ComputeBasalAtom::select2(int k, int n, double *arr, int *iarr)
iarr--;
l = 1;
ir = n;
for (;;) {
while (true) {
if (ir <= l+1) {
if (ir == l+1 && arr[ir] < arr[l]) {
SWAP(arr[l],arr[ir])
@ -515,7 +515,7 @@ void ComputeBasalAtom::select2(int k, int n, double *arr, int *iarr)
j = ir;
a = arr[l+1];
ia = iarr[l+1];
for (;;) {
while (true) {
do i++; while (arr[i] < a);
do j--; while (arr[j] > a);
if (j < i) break;

View File

@ -281,7 +281,7 @@ void ComputeHexOrderAtom::select2(int k, int n, double *arr, int *iarr)
iarr--;
l = 1;
ir = n;
for (;;) {
while (true) {
if (ir <= l+1) {
if (ir == l+1 && arr[ir] < arr[l]) {
SWAP(arr[l],arr[ir])
@ -308,7 +308,7 @@ void ComputeHexOrderAtom::select2(int k, int n, double *arr, int *iarr)
j = ir;
a = arr[l+1];
ia = iarr[l+1];
for (;;) {
while (true) {
do i++; while (arr[i] < a);
do j--; while (arr[j] > a);
if (j < i) break;

View File

@ -386,7 +386,7 @@ void ComputeOrientOrderAtomKokkos<DeviceType>::select3(int k, int n, int ii) con
l = 0;
ir = n-1;
for (;;) {
while (true) {
if (ir <= l+1) {
if (ir == l+1 && arr[ir] < arr[l]) {
SWAP(arr,l,ir);
@ -421,7 +421,7 @@ void ComputeOrientOrderAtomKokkos<DeviceType>::select3(int k, int n, int ii) con
a3[0] = arr3(l+1,0);
a3[1] = arr3(l+1,1);
a3[2] = arr3(l+1,2);
for (;;) {
while (true) {
do i++; while (arr[i] < a);
do j--; while (arr[j] > a);
if (j < i) break;

View File

@ -338,7 +338,7 @@ void ComputeCentroAtom::select(int k, int n, double *arr)
arr--;
l = 1;
ir = n;
for (;;) {
while (true) {
if (ir <= l + 1) {
if (ir == l + 1 && arr[ir] < arr[l]) { SWAP(arr[l], arr[ir]) }
return;
@ -351,7 +351,7 @@ void ComputeCentroAtom::select(int k, int n, double *arr)
i = l + 1;
j = ir;
a = arr[l + 1];
for (;;) {
while (true) {
do i++;
while (arr[i] < a);
do j--;
@ -378,7 +378,7 @@ void ComputeCentroAtom::select2(int k, int n, double *arr, int *iarr)
iarr--;
l = 1;
ir = n;
for (;;) {
while (true) {
if (ir <= l + 1) {
if (ir == l + 1 && arr[ir] < arr[l]) {
SWAP(arr[l], arr[ir])
@ -405,7 +405,7 @@ void ComputeCentroAtom::select2(int k, int n, double *arr, int *iarr)
j = ir;
a = arr[l + 1];
ia = iarr[l + 1];
for (;;) {
while (true) {
do i++;
while (arr[i] < a);
do j--;

View File

@ -370,7 +370,7 @@ void ComputeOrientOrderAtom::select3(int k, int n, double *arr, int *iarr, doubl
arr3--;
l = 1;
ir = n;
for (;;) {
while (true) {
if (ir <= l + 1) {
if (ir == l + 1 && arr[ir] < arr[l]) {
SWAP(arr[l], arr[ir]);
@ -405,7 +405,7 @@ void ComputeOrientOrderAtom::select3(int k, int n, double *arr, int *iarr, doubl
a3[0] = arr3[l + 1][0];
a3[1] = arr3[l + 1][1];
a3[2] = arr3[l + 1][2];
for (;;) {
while (true) {
do i++;
while (arr[i] < a);
do j--;