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.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| type(dyn_projectionarray_type), | intent(in) | :: | me | |||
| type(ply_prj_init_type), | 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 |