Perform an interval search on an array Returns a length 3 integer(i32) array where the last two entries are the left and right neighbours The first entry of iout is -1 if the value is not present in the vector Assumes this is sorted!See m_searching for more information on how to use this interface
interfaced with intervalSearch
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=i32) | :: | this(:) | Vector to search within |
|||
integer(kind=i32) | :: | v | Number to find in the vector |
|||
integer(kind=i32) | :: | imin | Left integer |
|||
integer(kind=i32) | :: | imax | Right integer |
Location of i in this. iout(1) = -1 if not present with iout(2-3) as the interval
interfaced with intervalSearch
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=i64) | :: | this(:) | Vector to search within |
|||
integer(kind=i64) | :: | v | Number to find in the vector |
|||
integer(kind=i32) | :: | imin | Left integer |
|||
integer(kind=i32) | :: | imax | Right integer |
Location of i in this. iout(1) = -1 if not present with iout(2-3) as the interval
interfaced with intervalSearch
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=r32) | :: | this(:) | Vector to search within |
|||
real(kind=r32) | :: | v | Number to find in the vector |
|||
integer(kind=i32) | :: | imin | Left integer |
|||
integer(kind=i32) | :: | imax | Right integer |
Location of i in this. iout(1) = -1 if not present with iout(2-3) as the interval
interfaced with intervalSearch
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=r64) | :: | this(:) | Vector to search within |
|||
real(kind=r64) | :: | v | Number to find in the vector |
|||
integer(kind=i32) | :: | imin | Left integer |
|||
integer(kind=i32) | :: | imax | Right integer |
Location of i in this. iout(1) = -1 if not present with iout(2-3) as the interval