Skip to content

Commit

Permalink
Apply suggestions from code review
Browse files Browse the repository at this point in the history
  • Loading branch information
jvdp1 authored Jul 9, 2024
1 parent 3cf4711 commit 01faf83
Show file tree
Hide file tree
Showing 2 changed files with 0 additions and 7 deletions.
1 change: 0 additions & 1 deletion doc/specs/stdlib_sorting.md
Original file line number Diff line number Diff line change
Expand Up @@ -160,7 +160,6 @@ housekeeping it has slower runtime performance than `ORD_SORT`.
provided as optional `work` and `iwork` arguments or allocated
internally on the stack.


#### The `SORT_INDEX` subroutine

The `SORT` and `ORD_SORT` subroutines can sort rank 1 isolated
Expand Down
6 changes: 0 additions & 6 deletions src/stdlib_sorting.fypp
Original file line number Diff line number Diff line change
Expand Up @@ -15,8 +15,6 @@
& + BITSET_TYPES_ALT_NAME
#:set IR_INDEX_TYPES_ALT_NAME = INT_TYPES_ALT_NAME + REAL_TYPES_ALT_NAME



!! Licensing:
!!
!! This file is subject both to the Fortran Standard Library license, and
Expand Down Expand Up @@ -578,7 +576,6 @@ module stdlib_sorting
end interface sort
interface sort_adj
!! Version: experimental
!!
Expand Down Expand Up @@ -664,7 +661,6 @@ contains
${ti}$, intent(out), optional :: iwork(0:)
logical, intent(in), optional :: reverse
integer(int_index) :: array_size, i
array_size = size(array, kind=int_index)
Expand All @@ -683,8 +679,6 @@ contains
call sort_adj(array, index, work, iwork, reverse)
end subroutine ${name1}$_sort_index_${namei}$
#:endfor
Expand Down

0 comments on commit 01faf83

Please sign in to comment.