Merge branch 'debug'

src/encounter/encounter_check.f90

@@ -452,7 +452,7 @@ subroutine encounter_check_all_sort_and_sweep_plplm(nplm, nplt, xplm, vplm, xplt
 
          ntot_last = ntot
       end if
-     
+
       !$omp parallel do default(private) schedule(static) &
       !$omp shared(xplm, xplt, vplm, vplt, rencm, renct, boundingbox) &
       !$omp firstprivate(dt, nplm, nplt, ntot)

src/util/util_sort.f90

@@ -74,10 +74,14 @@ module pure subroutine util_sort_dp(arr)
       do i = 2, n
          tmp = arr(i)
          j = i - 1
-         do while ((j >= 1) .and. (arr(j) > tmp))
+         do while ((j > 1) .and. (arr(j) > tmp))
             arr(j + 1) = arr(j)
             j = j - 1
          end do
+         if ((j == 1) .and. (arr(j) > tmp)) then
+            arr(j + 1) = arr(j)
+            j = j - 1
+         end if
          arr(j + 1) = tmp
       end do
 
@@ -108,11 +112,14 @@ module pure subroutine util_sort_index_dp(arr, ind)
       do i = 2, n
          itmp = ind(i)
          j = i - 1
-         do while ((j >= 2) .and. (arr(ind(j)) > itmp))
+         do while ((j > 1) .and. (arr(ind(j)) > arr(itmp)))
             ind(j + 1) = ind(j)
             j = j - 1
          end do
-         if ((j == 1) .and. (arr(ind(1)) > itmp)) ind(2) = ind(1)
+         if ((j == 1) .and. (arr(ind(j)) > arr(itmp))) then
+            ind(j + 1) = ind(j)
+            j = j - 1
+         end if
          ind(j + 1) = itmp
       end do
 
@@ -137,10 +144,14 @@ module pure subroutine util_sort_i4b(arr)
       do i = 2, n
          tmp = arr(i)
          j = i - 1
-         do while ((j >= 1) .and. (arr(j) > tmp))
+         do while ((j > 1) .and. (arr(j) > tmp))
             arr(j + 1) = arr(j)
             j = j - 1
          end do
+         if ((j == 1) .and. (arr(j) > tmp)) then
+            arr(j + 1) = arr(j)
+            j = j - 1
+         end if
          arr(j + 1) = tmp
       end do
 
@@ -168,21 +179,17 @@ module pure subroutine util_sort_index_i4b(arr, ind)
          allocate(ind(n))
          ind = [(i, i=1, n)]
       end if
-
-      itmp = ind(2)
-      if (arr(ind(1)) > itmp) then
-         ind(2) = ind(1)
-         ind(1) = itmp
-      end if
-
       do i = 2, n
          itmp = ind(i)
          j = i - 1
-         do while ((j >= 2) .and. (arr(ind(j)) > itmp))
+         do while ((j > 1) .and. (arr(ind(j)) > arr(itmp)))
             ind(j + 1) = ind(j)
             j = j - 1
          end do
-         if ((j == 1) .and. (arr(ind(1)) > itmp)) ind(2) = ind(1)
+         if ((j == 1) .and. (arr(ind(j)) > arr(itmp))) then
+            ind(j + 1) = ind(j)
+            j = j - 1
+         end if
          ind(j + 1) = itmp
       end do
 
@@ -207,10 +214,14 @@ module pure subroutine util_sort_sp(arr)
       do i = 2, n
          tmp = arr(i)
          j = i - 1
-         do while ((j >= 1) .and. (arr(j) > tmp))
+         do while ((j > 1) .and. (arr(j) > tmp))
             arr(j + 1) = arr(j)
             j = j - 1
          end do
+         if ((j == 1) .and. (arr(j) > tmp)) then
+            arr(j + 1) = arr(j)
+            j = j - 1
+         end if
          arr(j + 1) = tmp
       end do
 
@@ -241,11 +252,14 @@ module pure subroutine util_sort_index_sp(arr, ind)
       do i = 2, n
          itmp = ind(i)
          j = i - 1
-         do while ((j >= 2) .and. (arr(ind(j)) > itmp))
+         do while ((j > 1) .and. (arr(ind(j)) > arr(itmp)))
             ind(j + 1) = ind(j)
             j = j - 1
          end do
-         if ((j == 1) .and. (arr(ind(1)) > itmp)) ind(2) = ind(1)
+         if ((j == 1) .and. (arr(ind(j)) > arr(itmp))) then
+            ind(j + 1) = ind(j)
+            j = j - 1
+         end if
          ind(j + 1) = itmp
       end do