rename run_type_default to run_type

Author: jvdp1

src/stdlib_sorting.fypp

@@ -151,14 +151,14 @@ module stdlib_sorting
         max_merge_stack = int( ceiling( log( 2._dp**64 ) / &
                                log(1.6180339887_dp) ) )
 
-    type run_type_default
+    type run_type
 !! Version: experimental
 !!
 !! Used to pass state around in a stack among helper functions for the
 !! `ORD_SORT` and `SORT_INDEX` algorithms
         integer(int_index) :: base = 0
         integer(int_index) :: len = 0
-    end type run_type_default
+    end type run_type
 
     public ord_sort
 !! Version: experimental

src/stdlib_sorting_ord_sort.fypp

@@ -186,7 +186,7 @@ contains
 ! 1. len(-3) > len(-2) + len(-1)
 ! 2. len(-2) > len(-1)
             integer(int_index) :: r
-            type(run_type_default), intent(in), target :: runs(0:)
+            type(run_type), intent(in), target :: runs(0:)
 
             integer(int_index) :: n
             logical :: test
@@ -277,7 +277,7 @@ contains
 
             integer(int_index) :: array_size, finish, min_run, r, r_count, &
                 start
-            type(run_type_default) :: runs(0:max_merge_stack-1), left, right
+            type(run_type) :: runs(0:max_merge_stack-1), left, right
 
             array_size = size(array, kind=int_index)
 
@@ -326,7 +326,7 @@ contains
                 end do Insert
                 if ( start == 0 .and. finish == array_size - 1 ) return
 
-                runs(r_count) = run_type_default( base = start, &
+                runs(r_count) = run_type( base = start, &
                                           len = finish - start + 1 )
                 finish = start-1
                 r_count = r_count + 1
@@ -342,7 +342,7 @@ contains
                                        right % base + right % len - 1 ), &
                                 left % len, buf )
 
-                    runs(r) = run_type_default( base = left % base, &
+                    runs(r) = run_type( base = left % base, &
                                         len = left % len + right % len )
                     if ( r == r_count - 3 ) runs(r+1) = runs(r+2)
                     r_count = r_count - 1

src/stdlib_sorting_sort_index.fypp

@@ -221,7 +221,7 @@ contains
 ! 2. len(-2) > len(-1)
 
             integer(int_index) :: r
-            type(run_type_default), intent(in), target :: runs(0:)
+            type(run_type), intent(in), target :: runs(0:)
 
             integer(int_index) :: n
             logical :: test
@@ -322,7 +322,7 @@ contains
 
             integer(int_index) :: array_size, finish, min_run, r, r_count, &
                 start
-            type(run_type_default) :: runs(0:max_merge_stack-1), left, right
+            type(run_type) :: runs(0:max_merge_stack-1), left, right
 
             array_size = size(array, kind=int_index)
 
@@ -372,7 +372,7 @@ contains
                 end do Insert
                 if ( start == 0 .and. finish == array_size - 1 ) return
 
-                runs(r_count) = run_type_default( base = start, &
+                runs(r_count) = run_type( base = start, &
                                           len = finish - start + 1 )
                 finish = start-1
                 r_count = r_count + 1
@@ -390,7 +390,7 @@ contains
                                 index( left % base: &
                                      right % base + right % len - 1 ), ibuf )
 
-                    runs(r) = run_type_default( base = left % base, &
+                    runs(r) = run_type( base = left % base, &
                                         len = left % len + right % len )
                     if ( r == r_count - 3 ) runs(r+1) = runs(r+2)
                     r_count = r_count - 1