File tree Expand file tree Collapse file tree 3 files changed +7
-5
lines changed Expand file tree Collapse file tree 3 files changed +7
-5
lines changed Original file line number Diff line number Diff line change @@ -25,7 +25,7 @@ which implements selection algorithms.
25
25
The module ` stdlib_selection ` defines two generic subroutines:
26
26
* ` select ` is used to find the k-th smallest entry of an array. The input
27
27
array is also modified in-place, and on return will be partially sorted
28
- such that ` all(array(1:k) <= array(k))) ` and ` all(array(k) <= array((k+1):size(array))) ` .
28
+ such that ` all(array(1:k) <= array(k))) ` and ` all(array(k) <= array((k+1):size(array))) ` is true .
29
29
The user can optionally specify ` left ` and ` right ` indices to constrain the search
30
30
for the k-th smallest value. This can be useful if you have previously called ` select `
31
31
to find a smaller or larger rank (that will have led to partial sorting of
Original file line number Diff line number Diff line change @@ -8,7 +8,7 @@ module stdlib_selection
8
8
! This code was modified from the "Coretran" implementation "quickSelect" by
9
9
! Leon Foks, https://github.com/leonfoks/coretran/tree/master/src/sorting
10
10
!
11
- ! Leon Foks gave permission to be release this code under stdlib's MIT license.
11
+ ! Leon Foks gave permission to release this code under stdlib's MIT license.
12
12
! (https://github.com/fortran-lang/stdlib/pull/500#commitcomment-57418593)
13
13
!
14
14
@@ -18,7 +18,7 @@ implicit none
18
18
19
19
private
20
20
21
- public select, arg_select
21
+ public :: select, arg_select
22
22
23
23
interface select
24
24
!! version: experimental
@@ -57,7 +57,8 @@ contains
57
57
${arraytype}$, intent(inout) :: a(:)
58
58
!! Array in which we seek the k-th smallest entry.
59
59
!! On output it will be partially sorted such that
60
- !! `all(a(1:(k-1)) <= a(k)) .and. all(a(k) <= a((k+1):size(a)))`.
60
+ !! `all(a(1:(k-1)) <= a(k)) .and. all(a(k) <= a((k+1):size(a)))`
61
+ !! is true.
61
62
${inttype}$, intent(in) :: k
62
63
!! We want the k-th smallest entry. E.G. `k=1` leads to
63
64
!! `kth_smallest=min(a)`, and `k=size(a)` leads to
Original file line number Diff line number Diff line change 1
1
### Pre-process: .fpp -> .f90 via Fypp
2
2
3
3
# Create a list of the files to be preprocessed
4
- set (fppFiles
4
+ set (
5
+ fppFiles
5
6
test_selection.fypp
6
7
)
7
8
You can’t perform that action at this time.
0 commit comments