posofval_long Function

public function posofval_long(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_long and then returns the looked up position in the original unsorted array, which corresponds to the position returned by the append routine.


type(dyn_longarray_type), intent(in) :: me
integer(kind=long_k), intent(in) :: val
logical, intent(in), optional :: nextifnotfound

flag to indicate, if the position of the next entry in the sorted list should be returned instead, if val is not found.

integer, intent(in), optional :: lower
integer, intent(in), optional :: upper

Return Value integer


proc~~posofval_long~~CallsGraph proc~posofval_long posofval_long interface~sortedposofval~4 sortedposofval proc~posofval_long->interface~sortedposofval~4 proc~sortposofval_label sortposofval_label interface~sortedposofval~4->proc~sortposofval_label

Called by

proc~~posofval_long~~CalledByGraph proc~posofval_long posofval_long interface~positionofval positionofval interface~positionofval->proc~posofval_long



integer, public :: sortpos
integer, public :: lb
integer, public :: ub