appended ALT_NAME of bitsets to IRSC ALT_NAME

Author: degawa

Diff for: src/stdlib_sorting.fypp

@@ -9,7 +9,8 @@
 #! For better code reuse in fypp, make lists that contain the input types,
 #! with each having output types and a separate name prefix for subroutines
 #! This approach allows us to have the same code for all input types.
-#:set IRSC_TYPES_ALT_NAME = INT_TYPES_ALT_NAME + REAL_TYPES_ALT_NAME + STRING_TYPES_ALT_NAME + CHAR_TYPES_ALT_NAME
+#:set IRSCB_TYPES_ALT_NAME = INT_TYPES_ALT_NAME + REAL_TYPES_ALT_NAME + STRING_TYPES_ALT_NAME + CHAR_TYPES_ALT_NAME &
+    & + BITSET_TYPES_ALT_NAME
 
 !! Licensing:
 !!
@@ -414,7 +415,7 @@ module stdlib_sorting
 !! sorted data, having O(N) performance on uniformly non-increasing or
 !! non-decreasing data.
 
-#:for t1, t2, name1 in IRSC_TYPES_ALT_NAME
+#:for t1, t2, name1 in IRSCB_TYPES_ALT_NAME
         module subroutine ${name1}$_ord_sort( array, work, reverse )
 !! Version: experimental
 !!
@@ -480,7 +481,7 @@ module stdlib_sorting
 !! on the `introsort` of David Musser.
 !! ([Specification](../page/specs/stdlib_sorting.html#sort-sorts-an-input-array))
 
-#:for t1, t2, name1 in IRSC_TYPES_ALT_NAME
+#:for t1, t2, name1 in IRSCB_TYPES_ALT_NAME
         pure module subroutine ${name1}$_sort( array, reverse )
 !! Version: experimental
 !!
@@ -511,7 +512,7 @@ module stdlib_sorting
 !! non-decreasing sort, but if the optional argument `REVERSE` is present
 !! with a value of `.TRUE.` the indices correspond to a non-increasing sort.
 
-#:for t1, t2, name1 in IRSC_TYPES_ALT_NAME
+#:for t1, t2, name1 in IRSCB_TYPES_ALT_NAME
         module subroutine ${name1}$_sort_index( array, index, work, iwork, &
             reverse )
 !! Version: experimental

Diff for: src/stdlib_sorting_ord_sort.fypp

@@ -8,7 +8,8 @@
 #! For better code reuse in fypp, make lists that contain the input types,
 #! with each having output types and a separate name prefix for subroutines
 #! This approach allows us to have the same code for all input types.
-#:set IRSC_TYPES_ALT_NAME = INT_TYPES_ALT_NAME + REAL_TYPES_ALT_NAME + STRING_TYPES_ALT_NAME + CHAR_TYPES_ALT_NAME
+#:set IRSCB_TYPES_ALT_NAME = INT_TYPES_ALT_NAME + REAL_TYPES_ALT_NAME + STRING_TYPES_ALT_NAME + CHAR_TYPES_ALT_NAME &
+    & + BITSET_TYPES_ALT_NAME
 
 #:set SIGN_NAME = ["increase", "decrease"]
 #:set SIGN_TYPE = [">", "<"]
@@ -70,7 +71,7 @@ submodule(stdlib_sorting) stdlib_sorting_ord_sort
 
 contains
 
-#:for t1, t2, t3, name1 in IRSC_TYPES_ALT_NAME
+#:for t1, t2, t3, name1 in IRSCB_TYPES_ALT_NAME
     module subroutine ${name1}$_ord_sort( array, work, reverse )
         ${t1}$, intent(inout)         :: array(0:)
         ${t3}$, intent(out), optional :: work(0:)
@@ -86,7 +87,7 @@ contains
 #:endfor
 
 #:for sname, signt, signoppt in SIGN_NAME_TYPE
-#:for t1, t2, t3, name1 in IRSC_TYPES_ALT_NAME
+#:for t1, t2, t3, name1 in IRSCB_TYPES_ALT_NAME
 
     subroutine ${name1}$_${sname}$_ord_sort( array, work )
 ! A translation to Fortran 2008, of the `"Rust" sort` algorithm found in

Diff for: src/stdlib_sorting_sort.fypp

@@ -8,7 +8,8 @@
 #! For better code reuse in fypp, make lists that contain the input types,
 #! with each having output types and a separate name prefix for subroutines
 #! This approach allows us to have the same code for all input types.
-#:set IRSC_TYPES_ALT_NAME = INT_TYPES_ALT_NAME + REAL_TYPES_ALT_NAME + STRING_TYPES_ALT_NAME + CHAR_TYPES_ALT_NAME
+#:set IRSCB_TYPES_ALT_NAME = INT_TYPES_ALT_NAME + REAL_TYPES_ALT_NAME + STRING_TYPES_ALT_NAME + CHAR_TYPES_ALT_NAME &
+    & + BITSET_TYPES_ALT_NAME
 
 #:set SIGN_NAME = ["increase", "decrease"]
 #:set SIGN_TYPE = [">", "<"]
@@ -74,7 +75,7 @@ submodule(stdlib_sorting) stdlib_sorting_sort
 
 contains
 
-#:for t1, t2, name1 in IRSC_TYPES_ALT_NAME
+#:for t1, t2, name1 in IRSCB_TYPES_ALT_NAME
     pure module subroutine ${name1}$_sort( array, reverse )
             ${t1}$, intent(inout) :: array(0:)
             logical, intent(in), optional            :: reverse
@@ -88,7 +89,7 @@ contains
 #:endfor
 
 #:for sname, signt, signoppt in SIGN_NAME_TYPE
-#:for t1, t2, name1 in IRSC_TYPES_ALT_NAME
+#:for t1, t2, name1 in IRSCB_TYPES_ALT_NAME
 
     pure subroutine ${name1}$_${sname}$_sort( array )
 ! `${name1}$_${sname}$_sort( array )` sorts the input `ARRAY` of type `${t1}$`

Diff for: src/stdlib_sorting_sort_index.fypp

@@ -8,7 +8,8 @@
 #! For better code reuse in fypp, make lists that contain the input types,
 #! with each having output types and a separate name prefix for subroutines
 #! This approach allows us to have the same code for all input types.
-#:set IRSC_TYPES_ALT_NAME = INT_TYPES_ALT_NAME + REAL_TYPES_ALT_NAME + STRING_TYPES_ALT_NAME + CHAR_TYPES_ALT_NAME
+#:set IRSCB_TYPES_ALT_NAME = INT_TYPES_ALT_NAME + REAL_TYPES_ALT_NAME + STRING_TYPES_ALT_NAME + CHAR_TYPES_ALT_NAME &
+    & + BITSET_TYPES_ALT_NAME
 
 !! Licensing:
 !!
@@ -65,7 +66,7 @@ submodule(stdlib_sorting) stdlib_sorting_sort_index
 
 contains
 
-#:for t1, t2, t3, name1 in IRSC_TYPES_ALT_NAME
+#:for t1, t2, t3, name1 in IRSCB_TYPES_ALT_NAME
 
     module subroutine ${name1}$_sort_index( array, index, work, iwork, reverse )
 ! A modification of `${name1}$_ord_sort` to return an array of indices that