ply_dynarray_project_module Module

private pure function isEqual(left, right) result(equality)

This function provides the test for equality of two projections.

Two projections are considered to be equal, if their kind, nodes_kind, maxPolyDegree and oversampling are equal.

Arguments

Return Value logical

is equal??

private pure function isUnequal(left, right) result(unequality)

This function provides the test for unequality of two projections.

Two projections are considered to be unequal, if their kind, nodes_kind, maxpolydegree or factor are not equal.

Arguments

Return Value logical

is unequal??

private pure function isSmaller(left, right) result(small)

This function provides a < comparison of two projections.

Sorting of projections is given by maxPolyDegree, kind, nodes_kind and last by factor.

Arguments

Return Value logical

is smaller??

private pure function isSmallerOrEqual(left, right) result(small)

This function provides a <= comparison of two projections.

Sorting of projections is given by maxPolyDegree, kind, nodes_kind and last by factor.

Arguments

Return Value logical

is smaller??

private pure function isGreater(left, right) result(great)

This function provides a > comparison of two projections.

Sorting of projections is given by maxPolyDegree, kind, nodes_kind and last by factor.

Arguments

Return Value logical

is greater??

private pure function isGreaterOrEqual(left, right) result(great)

This function provides a >= comparison of two projections.

Sorting of projections is given by maxPolyDegree, kind, nodes_kind and last by factor.

Arguments

Return Value logical

is greater??

private subroutine init_da_projection(me, length)

initialization of a dynamic array

before a dynamic array can be used, it has to be initialized with this routine. the initial length provided here, can avoid reallocations and memory copying, if approximated correctly enough. if none is specified, the provided container initially will be of size 0.

Arguments

private subroutine append_da_projection(me, val, length, pos, wasadded)

appending a value to the dynamic array

with this subroutine, a given value can be added to the dynamic array. the actual position of this value in the dynamic array will be returned, so it can be found again easily later. with the wasadded flag, it is indicated,\n wasadded = true, if this entry had to be added,\n wasadded = false, if this was already found in the array.

Arguments

private subroutine append_da_vecprojection(me, val, length, pos, wasadded)

appending a sorted list of values to the dynamic array

with this subroutine, a given list of sorted values can be added to the dynamic array. the actual positions of these values in the dynamic array will be returned, so it can be found again easily later. with the wasadded flag, it is indicated,\n wasadded = true, if this entry had to be added,\n wasadded = false, if this was already found in the array.

Arguments

private subroutine truncate_da_projection(me)

truncate the array after the last valid entry and hence cut off the empty trailing empty entries

Arguments

private subroutine empty_da_projection(me)

empty all contents of the array without changing the size or status of any array

Arguments

private subroutine sorttruncate_da_projection(me)

fixing the dynamic array

truncate the array after the last valid entry and hence cut off the empty trailing empty entries store the array in the sorted order according to the sorted( ) array

Arguments

private function posofval_projection(me, val, nextifnotfound, lower, upper) result(pos)

the actual position of a given value in the dynamic array

most likely this is what you need in codes, using this data structure, it first does the binary search on the sorted values with sortposofval_projection and then returns the looked up position in the original unsorted array, which corresponds to the position returned by the append routine.

Arguments

Return Value integer

private pure subroutine Copy_ply_prj_init(left, right)

Arguments

private subroutine destroy_da_projection(me)

destruction of a dynamic array

this subroutine takes care of a proper destruction of a dynamic array, it frees the allocated memory and resets the internal counts to 0.

Arguments

private subroutine expand_da_projection(me, increment, length)

expanding the dynamic array

this is a helping subroutine, which doubles the container of the given dynamic array. as the container might be initially 0-sized, a module variable minlength has been introduced, which is used here, to at least create a container of this size.

Arguments

private function sortposofval_projection(me, val, nextifnotfound, lower, upper) result(pos)

return the sorted position of a value in the given dynamic array

if the value was not found, - return 0 if nextifnotfound = .false. - return position at the end if nextifnotfound = .true.

binary search on sorted list

Arguments

Return Value integer