Detailed Description

Generic utility functions used throughout.

Several utility functions which enables a large variety of optimized algorithms used in various routines in the bud library.

Collaboration diagram for Utilities for generic usage in different buds:

Modules
module	bud_utils

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...

Functions/Subroutines
pure subroutine	sort_ps_is_ (n, array, sarray)

pure subroutine	sort_ps_ii_ (n, array, sarray)

pure subroutine	sort_ps_il_ (n, array, sarray)

pure subroutine	sort_heap_is_ (n, array)

pure subroutine	sort_heap_ii_ (n, array)

pure subroutine	sort_heap_il_ (n, array)

pure subroutine	sort_heap_idx_is_ (n, array, pvt)

pure subroutine	sort_heap_idx_ii_ (n, array, pvt)

pure subroutine	sort_heap_idx_il_ (n, array, pvt)

recursive pure subroutine	sort_quick_is_ (n, array)

recursive pure subroutine	sort_quick_ii_ (n, array)

recursive pure subroutine	sort_quick_il_ (n, array)

pure subroutine	sort_quick_idx_is_ (n, array, pvt)

pure subroutine	sort_quick_idx_ii_ (n, array, pvt)

pure subroutine	sort_quick_idx_il_ (n, array, pvt)

pure subroutine	find_bin_is_ (n, array, val, idx)

pure subroutine	find_bin_ii_ (n, array, val, idx)

pure subroutine	find_bin_il_ (n, array, val, idx)

pure subroutine	find_binheur_is_ (n, array, val, idx)

pure subroutine	find_binheur_ii_ (n, array, val, idx)

pure subroutine	find_binheur_il_ (n, array, val, idx)

pure integer(is_) function	nuniq_sorted_is_ (n, array)

pure integer(ii_) function	nuniq_sorted_ii_ (n, array)

pure integer(il_) function	nuniq_sorted_il_ (n, array)

pure integer(is_) function	nuniq_is_ (n, array)

pure integer(ii_) function	nuniq_ii_ (n, array)

pure integer(il_) function	nuniq_il_ (n, array)

pure integer(is_) function	nuniq_pvt_is_ (n, array, pvt)

pure integer(ii_) function	nuniq_pvt_ii_ (n, array, pvt)

pure integer(il_) function	nuniq_pvt_il_ (n, array, pvt)

elemental integer(is_) function	modp_is_ (i, n)

elemental integer(ii_) function	modp_ii_ (i, n)

elemental integer(il_) function	modp_il_ (i, n)

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...

Function/Subroutine Documentation

pure subroutine find_bin_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), intent(in)	val,
		integer(ii_), intent(out)	idx
	)

private

Parameters

[in]	n	number of elements in `array`
[in]	array	the searced array
[in]	val	value to search for in array
[out]	idx	index in array which contains `val`, if non-existing `val=-1`

pure subroutine bud_utils::find_bin_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), intent(in)	val,
		integer(ii_), intent(out)	idx
	)

private

Parameters

[in]	n	number of elements in `array`
[in]	array	the searced array
[in]	val	value to search for in array
[out]	idx	index in array which contains `val`, if non-existing `val=-1`

pure subroutine find_bin_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), intent(in)	val,
		integer(il_), intent(out)	idx
	)

private

Parameters

[in]	n	number of elements in `array`
[in]	array	the searced array
[in]	val	value to search for in array
[out]	idx	index in array which contains `val`, if non-existing `val=-1`

pure subroutine bud_utils::find_bin_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), intent(in)	val,
		integer(il_), intent(out)	idx
	)

private

Parameters

[in]	n	number of elements in `array`
[in]	array	the searced array
[in]	val	value to search for in array
[out]	idx	index in array which contains `val`, if non-existing `val=-1`

pure subroutine find_bin_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), intent(in)	val,
		integer(is_), intent(out)	idx
	)

private

Parameters

[in]	n	number of elements in `array`
[in]	array	the searced array
[in]	val	value to search for in array
[out]	idx	index in array which contains `val`, if non-existing `val=-1`

pure subroutine bud_utils::find_bin_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), intent(in)	val,
		integer(is_), intent(out)	idx
	)

private

Parameters

[in]	n	number of elements in `array`
[in]	array	the searced array
[in]	val	value to search for in array
[out]	idx	index in array which contains `val`, if non-existing `val=-1`

pure subroutine bud_utils::find_binheur_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), intent(in)	val,
		integer(ii_), intent(out)	idx
	)

private

Parameters

[in]	n	number of elements in `array`
[in]	array	the searced array
[in]	val	value to search for in array
[out]	idx	index in array which contains `val`, if non-existing `val=-1`

pure subroutine find_binheur_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), intent(in)	val,
		integer(ii_), intent(out)	idx
	)

private

Parameters

[in]	n	number of elements in `array`
[in]	array	the searced array
[in]	val	value to search for in array
[out]	idx	index in array which contains `val`, if non-existing `val=-1`

pure subroutine find_binheur_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), intent(in)	val,
		integer(il_), intent(out)	idx
	)

private

Parameters

[in]	n	number of elements in `array`
[in]	array	the searced array
[in]	val	value to search for in array
[out]	idx	index in array which contains `val`, if non-existing `val=-1`

pure subroutine bud_utils::find_binheur_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), intent(in)	val,
		integer(il_), intent(out)	idx
	)

private

Parameters

[in]	n	number of elements in `array`
[in]	array	the searced array
[in]	val	value to search for in array
[out]	idx	index in array which contains `val`, if non-existing `val=-1`

pure subroutine find_binheur_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), intent(in)	val,
		integer(is_), intent(out)	idx
	)

private

Parameters

[in]	n	number of elements in `array`
[in]	array	the searced array
[in]	val	value to search for in array
[out]	idx	index in array which contains `val`, if non-existing `val=-1`

pure subroutine bud_utils::find_binheur_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), intent(in)	val,
		integer(is_), intent(out)	idx
	)

private

Parameters

[in]	n	number of elements in `array`
[in]	array	the searced array
[in]	val	value to search for in array
[out]	idx	index in array which contains `val`, if non-existing `val=-1`

pure subroutine sort_ps_is_::insert_back	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), dimension(n), intent(inout)	sarray,
		integer(is_), intent(in)	sA,
		integer(is_), intent(out)	P
	)

private

Here is the caller graph for this function:

pure subroutine sort_ps_ii_::insert_back	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), dimension(n), intent(inout)	sarray,
		integer(ii_), intent(in)	sA,
		integer(ii_), intent(out)	P
	)

private

pure subroutine sort_ps_il_::insert_back	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), dimension(n), intent(inout)	sarray,
		integer(il_), intent(in)	sA,
		integer(il_), intent(out)	P
	)

private

pure subroutine sort_ps_is_::insert_front	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), dimension(n), intent(inout)	sarray,
		integer(is_), intent(in)	sA,
		integer(is_), intent(out)	P
	)

private

Here is the caller graph for this function:

pure subroutine sort_ps_ii_::insert_front	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), dimension(n), intent(inout)	sarray,
		integer(ii_), intent(in)	sA,
		integer(ii_), intent(out)	P
	)

private

pure subroutine sort_ps_il_::insert_front	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), dimension(n), intent(inout)	sarray,
		integer(il_), intent(in)	sA,
		integer(il_), intent(out)	P
	)

private

pure subroutine sort_ps_is_::insert_mid	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), dimension(n), intent(inout)	sarray,
		integer(is_), intent(inout)	sF,
		integer(is_), intent(in)	sA,
		integer(is_), intent(out)	P
	)

private

Here is the call graph for this function:

Here is the caller graph for this function:

pure subroutine sort_ps_ii_::insert_mid	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), dimension(n), intent(inout)	sarray,
		integer(ii_), intent(inout)	sF,
		integer(ii_), intent(in)	sA,
		integer(ii_), intent(out)	P
	)

private

Here is the call graph for this function:

pure subroutine sort_ps_il_::insert_mid	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), dimension(n), intent(inout)	sarray,
		integer(il_), intent(inout)	sF,
		integer(il_), intent(in)	sA,
		integer(il_), intent(out)	P
	)

private

Here is the call graph for this function:

recursive pure subroutine sort_quick_idx_ii_::internal_quick_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), intent(in)	m,
		integer(ii_), dimension(m), intent(out)	pvt
	)

private

Here is the call graph for this function:

Here is the caller graph for this function:

recursive pure subroutine sort_quick_idx_il_::internal_quick_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), intent(in)	m,
		integer(il_), dimension(m), intent(out)	pvt
	)

private

Here is the call graph for this function:

Here is the caller graph for this function:

recursive pure subroutine sort_quick_idx_is_::internal_quick_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), intent(in)	m,
		integer(is_), dimension(m), intent(out)	pvt
	)

private

Here is the call graph for this function:

Here is the caller graph for this function:

elemental integer(ii_) function modp_ii_	(	integer(ii_), intent(in)	i,
		integer(ii_), intent(in)	n
	)

private

Parameters

[in]	i	number to extract the remainer of
[in]	n	divisor

Returns: the remainder of (i+1) % n

elemental integer(ii_) function bud_utils::modp_ii_	(	integer(ii_), intent(in)	i,
		integer(ii_), intent(in)	n
	)

private

Parameters

[in]	i	number to extract the remainer of
[in]	n	divisor

Returns: the remainder of (i+1) % n

elemental integer(il_) function modp_il_	(	integer(il_), intent(in)	i,
		integer(il_), intent(in)	n
	)

private

Parameters

[in]	i	number to extract the remainer of
[in]	n	divisor

Returns: the remainder of (i+1) % n

elemental integer(il_) function bud_utils::modp_il_	(	integer(il_), intent(in)	i,
		integer(il_), intent(in)	n
	)

private

Parameters

[in]	i	number to extract the remainer of
[in]	n	divisor

Returns: the remainder of (i+1) % n

elemental integer(is_) function bud_utils::modp_is_	(	integer(is_), intent(in)	i,
		integer(is_), intent(in)	n
	)

private

Parameters

[in]	i	number to extract the remainer of
[in]	n	divisor

Returns: the remainder of (i+1) % n

elemental integer(is_) function modp_is_	(	integer(is_), intent(in)	i,
		integer(is_), intent(in)	n
	)

private

Parameters

[in]	i	number to extract the remainer of
[in]	n	divisor

Returns: the remainder of (i+1) % n

pure integer(ii_) function bud_utils::nuniq_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers

Returns: number of unique values in sorted array

pure integer(ii_) function nuniq_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers

Returns: number of unique values in sorted array

pure integer(il_) function bud_utils::nuniq_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers

Returns: number of unique values in sorted array

pure integer(il_) function nuniq_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers

Returns: number of unique values in sorted array

pure integer(is_) function nuniq_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers

Returns: number of unique values in sorted array

pure integer(is_) function bud_utils::nuniq_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers

Returns: number of unique values in sorted array

pure integer(ii_) function bud_utils::nuniq_pvt_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), dimension(n), intent(in)	pvt
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers
[in]	pvt	pivoting array that creates a sorted array

Returns: number of unique values in sorted array

pure integer(ii_) function nuniq_pvt_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), dimension(n), intent(in)	pvt
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers
[in]	pvt	pivoting array that creates a sorted array

Returns: number of unique values in sorted array

pure integer(il_) function bud_utils::nuniq_pvt_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), dimension(n), intent(in)	pvt
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers
[in]	pvt	pivoting array that creates a sorted array

Returns: number of unique values in sorted array

pure integer(il_) function nuniq_pvt_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), dimension(n), intent(in)	pvt
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers
[in]	pvt	pivoting array that creates a sorted array

Returns: number of unique values in sorted array

pure integer(is_) function bud_utils::nuniq_pvt_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), dimension(n), intent(in)	pvt
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers
[in]	pvt	pivoting array that creates a sorted array

Returns: number of unique values in sorted array

pure integer(is_) function nuniq_pvt_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), dimension(n), intent(in)	pvt
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers
[in]	pvt	pivoting array that creates a sorted array

Returns: number of unique values in sorted array

pure integer(ii_) function bud_utils::nuniq_sorted_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers

Returns: number of unique values in sorted array

pure integer(ii_) function nuniq_sorted_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers

Returns: number of unique values in sorted array

pure integer(il_) function bud_utils::nuniq_sorted_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers

Returns: number of unique values in sorted array

pure integer(il_) function nuniq_sorted_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers

Returns: number of unique values in sorted array

pure integer(is_) function nuniq_sorted_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers

Returns: number of unique values in sorted array

pure integer(is_) function bud_utils::nuniq_sorted_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array
	)

private

Parameters

[in]	n	size of array
[in]	array	sorted array where we count unique numbers

Returns: number of unique values in sorted array

pure subroutine sort_quick_is_::partition	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(inout)	array,
		integer(is_), intent(out)	mark
	)

private

Here is the caller graph for this function:

pure subroutine sort_quick_idx_is_::partition	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), intent(in)	m,
		integer(is_), dimension(m), intent(inout)	pvt,
		integer(is_), intent(out)	mark
	)

private

pure subroutine sort_quick_ii_::partition	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(inout)	array,
		integer(ii_), intent(out)	mark
	)

private

pure subroutine sort_quick_idx_ii_::partition	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), intent(in)	m,
		integer(ii_), dimension(m), intent(inout)	pvt,
		integer(ii_), intent(out)	mark
	)

private

pure subroutine sort_quick_il_::partition	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(inout)	array,
		integer(il_), intent(out)	mark
	)

private

pure subroutine sort_quick_idx_il_::partition	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), intent(in)	m,
		integer(il_), dimension(m), intent(inout)	pvt,
		integer(il_), intent(out)	mark
	)

private

pure subroutine sort_heap_is_::siftdown	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(inout)	array,
		integer(is_), intent(in)	person
	)

private

Here is the caller graph for this function:

pure subroutine sort_heap_idx_is_::siftdown	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), dimension(n), intent(inout)	pvt,
		integer(is_), intent(in)	person
	)

private

pure subroutine sort_heap_ii_::siftdown	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(inout)	array,
		integer(ii_), intent(in)	person
	)

private

pure subroutine sort_heap_idx_ii_::siftdown	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), dimension(n), intent(inout)	pvt,
		integer(ii_), intent(in)	person
	)

private

pure subroutine sort_heap_il_::siftdown	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(inout)	array,
		integer(il_), intent(in)	person
	)

private

pure subroutine sort_heap_idx_il_::siftdown	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), dimension(n), intent(inout)	pvt,
		integer(il_), intent(in)	person
	)

private

pure subroutine sort_heap_idx_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), dimension(n), intent(out)	pvt
	)

private

Parameters

[in]	n	number of elements in array
[in]	array	unaltered array on exit
[out]	pvt	pivoting array such that array(pvt(1)) is the smallest number

pure subroutine bud_utils::sort_heap_idx_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), dimension(n), intent(out)	pvt
	)

private

Parameters

[in]	n	number of elements in array
[in]	array	unaltered array on exit
[out]	pvt	pivoting array such that array(pvt(1)) is the smallest number

Here is the call graph for this function:

pure subroutine sort_heap_idx_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), dimension(n), intent(out)	pvt
	)

private

Parameters

[in]	n	number of elements in array
[in]	array	unaltered array on exit
[out]	pvt	pivoting array such that array(pvt(1)) is the smallest number

pure subroutine bud_utils::sort_heap_idx_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), dimension(n), intent(out)	pvt
	)

private

Parameters

[in]	n	number of elements in array
[in]	array	unaltered array on exit
[out]	pvt	pivoting array such that array(pvt(1)) is the smallest number

Here is the call graph for this function:

pure subroutine sort_heap_idx_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), dimension(n), intent(out)	pvt
	)

private

Parameters

[in]	n	number of elements in array
[in]	array	unaltered array on exit
[out]	pvt	pivoting array such that array(pvt(1)) is the smallest number

pure subroutine bud_utils::sort_heap_idx_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), dimension(n), intent(out)	pvt
	)

private

Parameters

[in]	n	number of elements in array
[in]	array	unaltered array on exit
[out]	pvt	pivoting array such that array(pvt(1)) is the smallest number

Here is the call graph for this function:

pure subroutine sort_heap_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(inout)	array
	)

private

Parameters

[in]	n	number of elements in array
[in,out]	array	sorted array on exit

pure subroutine bud_utils::sort_heap_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(inout)	array
	)

private

Parameters

[in]	n	number of elements in array
[in,out]	array	sorted array on exit

Here is the call graph for this function:

pure subroutine sort_heap_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(inout)	array
	)

private

Parameters

[in]	n	number of elements in array
[in,out]	array	sorted array on exit

pure subroutine bud_utils::sort_heap_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(inout)	array
	)

private

Parameters

[in]	n	number of elements in array
[in,out]	array	sorted array on exit

Here is the call graph for this function:

pure subroutine sort_heap_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(inout)	array
	)

private

Parameters

[in]	n	number of elements in array
[in,out]	array	sorted array on exit

pure subroutine bud_utils::sort_heap_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(inout)	array
	)

private

Parameters

[in]	n	number of elements in array
[in,out]	array	sorted array on exit

Here is the call graph for this function:

pure subroutine sort_ps_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), dimension(n), intent(out)	sarray
	)

private

Parameters

[in]	n	size of array to be sorted
[in]	array	array to be sorted
[out]	sarray	sorted array

pure subroutine bud_utils::sort_ps_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), dimension(n), intent(out)	sarray
	)

private

Parameters

[in]	n	size of array to be sorted
[in]	array	array to be sorted
[out]	sarray	sorted array

Here is the call graph for this function:

pure subroutine sort_ps_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), dimension(n), intent(out)	sarray
	)

private

Parameters

[in]	n	size of array to be sorted
[in]	array	array to be sorted
[out]	sarray	sorted array

pure subroutine bud_utils::sort_ps_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), dimension(n), intent(out)	sarray
	)

private

Parameters

[in]	n	size of array to be sorted
[in]	array	array to be sorted
[out]	sarray	sorted array

Here is the call graph for this function:

pure subroutine sort_ps_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), dimension(n), intent(out)	sarray
	)

private

Parameters

[in]	n	size of array to be sorted
[in]	array	array to be sorted
[out]	sarray	sorted array

pure subroutine bud_utils::sort_ps_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), dimension(n), intent(out)	sarray
	)

private

Parameters

[in]	n	size of array to be sorted
[in]	array	array to be sorted
[out]	sarray	sorted array

Here is the call graph for this function:

pure subroutine sort_quick_idx_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), dimension(n), intent(out)	pvt
	)

private

Parameters

[in]	n	size of array to sort
[in]	array	array to retrieve the pivoting table of
[out]	pvt	pivoting array for converting array to a sorted array

pure subroutine bud_utils::sort_quick_idx_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(in)	array,
		integer(ii_), dimension(n), intent(out)	pvt
	)

private

Parameters

[in]	n	size of array to sort
[in]	array	array to retrieve the pivoting table of
[out]	pvt	pivoting array for converting array to a sorted array

Here is the call graph for this function:

pure subroutine sort_quick_idx_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), dimension(n), intent(out)	pvt
	)

private

Parameters

[in]	n	size of array to sort
[in]	array	array to retrieve the pivoting table of
[out]	pvt	pivoting array for converting array to a sorted array

pure subroutine bud_utils::sort_quick_idx_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(in)	array,
		integer(il_), dimension(n), intent(out)	pvt
	)

private

Parameters

[in]	n	size of array to sort
[in]	array	array to retrieve the pivoting table of
[out]	pvt	pivoting array for converting array to a sorted array

Here is the call graph for this function:

pure subroutine sort_quick_idx_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), dimension(n), intent(out)	pvt
	)

private

Parameters

[in]	n	size of array to sort
[in]	array	array to retrieve the pivoting table of
[out]	pvt	pivoting array for converting array to a sorted array

pure subroutine bud_utils::sort_quick_idx_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(in)	array,
		integer(is_), dimension(n), intent(out)	pvt
	)

private

Parameters

[in]	n	size of array to sort
[in]	array	array to retrieve the pivoting table of
[out]	pvt	pivoting array for converting array to a sorted array

Here is the call graph for this function:

recursive pure subroutine sort_quick_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(inout)	array
	)

private

Parameters

[in]	n	size of array to sort
[in,out]	array	on exit, the sorted array

recursive pure subroutine bud_utils::sort_quick_ii_	(	integer(ii_), intent(in)	n,
		integer(ii_), dimension(n), intent(inout)	array
	)

private

Parameters

[in]	n	size of array to sort
[in,out]	array	on exit, the sorted array

Here is the call graph for this function:

recursive pure subroutine bud_utils::sort_quick_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(inout)	array
	)

private

Parameters

[in]	n	size of array to sort
[in,out]	array	on exit, the sorted array

Here is the call graph for this function:

recursive pure subroutine sort_quick_il_	(	integer(il_), intent(in)	n,
		integer(il_), dimension(n), intent(inout)	array
	)

private

Parameters

[in]	n	size of array to sort
[in,out]	array	on exit, the sorted array

recursive pure subroutine sort_quick_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(inout)	array
	)

private

Parameters

[in]	n	size of array to sort
[in,out]	array	on exit, the sorted array

recursive pure subroutine bud_utils::sort_quick_is_	(	integer(is_), intent(in)	n,
		integer(is_), dimension(n), intent(inout)	array
	)

private

Parameters

[in]	n	size of array to sort
[in,out]	array	on exit, the sorted array

Here is the call graph for this function:

Variable Documentation

integer, parameter, private bud_id_len = 36

private

Size of ID parameter for bud data-containers.

Detailed Description

Modules

Data Types

Functions/Subroutines

Variables

Function/Subroutine Documentation

Variable Documentation