bud_utils.f90 File Reference

Data Types
interface	sort_ps
	Sorting routine for integer arrays (partially sorted) More...
interface	sort_heap
	Heap sort algorithm for integers. More...
interface	sort_quick
	Quick-sort array. More...
interface	find_bin
	Searches for a specific integer value in a sorted array (binary search) More...
interface	find_binheur
	Searches for a specific integer value in a sorted array (heuristic search) More...
interface	nuniq_sorted
	Count number of unique value for a sorted array. More...
interface	nuniq
	Count number of unique values in a non-sorted array. More...
interface	modp
	Return wrapped integer by modulo operation. More...

Modules
module	bud_utils

Functions/Subroutines
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	insert_mid (n, array, sarray, sF, sA, P)
pure subroutine	insert_front (n, array, sarray, sA, P)
pure subroutine	insert_back (n, array, sarray, sA, P)
pure subroutine	sort_heap_is_ (n, array)
pure subroutine	siftdown (n, array, person)
pure subroutine	sort_heap_idx_is_ (n, array, pvt)
pure subroutine	siftdown (n, array, pvt, person)
recursive pure subroutine	sort_quick_is_ (n, array)
pure subroutine	partition (n, array, mark)
pure subroutine	sort_quick_idx_is_ (n, array, pvt)
recursive pure subroutine	internal_quick_is_ (n, array, m, pvt)
pure subroutine	partition (n, array, m, pvt, mark)
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	insert_mid (n, array, sarray, sF, sA, P)
pure subroutine	insert_front (n, array, sarray, sA, P)
pure subroutine	insert_back (n, array, sarray, sA, P)
pure subroutine	sort_heap_ii_ (n, array)
pure subroutine	siftdown (n, array, person)
pure subroutine	sort_heap_idx_ii_ (n, array, pvt)
pure subroutine	siftdown (n, array, pvt, person)
recursive pure subroutine	sort_quick_ii_ (n, array)
pure subroutine	partition (n, array, mark)
pure subroutine	sort_quick_idx_ii_ (n, array, pvt)
recursive pure subroutine	internal_quick_ii_ (n, array, m, pvt)
pure subroutine	partition (n, array, m, pvt, mark)
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	insert_mid (n, array, sarray, sF, sA, P)
pure subroutine	insert_front (n, array, sarray, sA, P)
pure subroutine	insert_back (n, array, sarray, sA, P)
pure subroutine	sort_heap_il_ (n, array)
pure subroutine	siftdown (n, array, person)
pure subroutine	sort_heap_idx_il_ (n, array, pvt)
pure subroutine	siftdown (n, array, pvt, person)
recursive pure subroutine	sort_quick_il_ (n, array)
pure subroutine	partition (n, array, mark)
pure subroutine	sort_quick_idx_il_ (n, array, pvt)
recursive pure subroutine	internal_quick_il_ (n, array, m, pvt)
pure subroutine	partition (n, array, m, pvt, mark)
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)

Variables
integer, parameter, private	bud_id_len = 36
	Size of ID parameter for bud data-containers. More...