|
| elemental integer(is_) function | modp_is_ (i, n) |
| |
| elemental integer(ii_) function | modp_ii_ (i, n) |
| |
| elemental integer(il_) function | modp_il_ (i, n) |
| |
| pure subroutine | sort_ps_is_ (n, array, sarray) |
| |
| pure subroutine | sort_heap_is_ (n, array) |
| |
| pure subroutine | sort_heap_idx_is_ (n, array, pvt) |
| |
| recursive pure subroutine | sort_quick_is_ (n, array) |
| |
| pure subroutine | sort_quick_idx_is_ (n, array, pvt) |
| |
| pure subroutine | find_bin_is_ (n, array, val, idx) |
| |
| pure subroutine | find_binheur_is_ (n, array, val, idx) |
| |
| pure integer(is_) function | nuniq_sorted_is_ (n, array) |
| |
| pure integer(is_) function | nuniq_is_ (n, array) |
| |
| pure integer(is_) function | nuniq_pvt_is_ (n, array, pvt) |
| |
| pure subroutine | sort_ps_ii_ (n, array, sarray) |
| |
| pure subroutine | sort_heap_ii_ (n, array) |
| |
| pure subroutine | sort_heap_idx_ii_ (n, array, pvt) |
| |
| recursive pure subroutine | sort_quick_ii_ (n, array) |
| |
| pure subroutine | sort_quick_idx_ii_ (n, array, pvt) |
| |
| pure subroutine | find_bin_ii_ (n, array, val, idx) |
| |
| pure subroutine | find_binheur_ii_ (n, array, val, idx) |
| |
| pure integer(ii_) function | nuniq_sorted_ii_ (n, array) |
| |
| pure integer(ii_) function | nuniq_ii_ (n, array) |
| |
| pure integer(ii_) function | nuniq_pvt_ii_ (n, array, pvt) |
| |
| pure subroutine | sort_ps_il_ (n, array, sarray) |
| |
| pure subroutine | sort_heap_il_ (n, array) |
| |
| pure subroutine | sort_heap_idx_il_ (n, array, pvt) |
| |
| recursive pure subroutine | sort_quick_il_ (n, array) |
| |
| pure subroutine | sort_quick_idx_il_ (n, array, pvt) |
| |
| pure subroutine | find_bin_il_ (n, array, val, idx) |
| |
| pure subroutine | find_binheur_il_ (n, array, val, idx) |
| |
| pure integer(il_) function | nuniq_sorted_il_ (n, array) |
| |
| pure integer(il_) function | nuniq_il_ (n, array) |
| |
| pure integer(il_) function | nuniq_pvt_il_ (n, array, pvt) |
| |