binarysearch Module Reference

Functions/Subroutines
pure recursive integer function, public	binarysearch_real (vec, scal, min, max)

Function/Subroutine Documentation

binarysearch_real()

pure recursive integer function, public binarysearch::binarysearch_real	(	real*8, dimension(:), intent(in)	vec,
		real*8, intent(in)	scal,
		integer, intent(in), optional	min,
		integer, intent(in), optional	max
	)

Definition at line 678 of file MODULES.f90.

    ! input parameters
    real*8, intent(in)              :: vec(:)
    real*8, intent(in)              :: scal
    integer, optional, intent(in) :: min
    integer, optional, intent(in) :: max
 
    ! result
    integer           :: idx
 
    !locals
    integer           :: i
    
    ! logic    
    if(.not.present(min)) then
       idx = binarysearch_real(vec,scal, 1, size(vec))
    else
 
       i = ishft(min+max, -1)
       
       !write(*,*) i, scal
       !read(*,*)
       !write(*,*) vec
       !read(*,*)
       
       
       if(scal >= vec(i) .and. scal < vec(i+1)) then
          idx = i
          
       else if( scal < vec(i) ) then
          idx = binarysearch_real(vec,scal, min, ishft(min+max, -1) - 1)
          
       elseif(scal > vec(i)) then
          idx = binarysearch_real(vec,scal, ishft(min+max, -1) + 1, max)
       end if
    end if

References binarysearch_real().

Referenced by binarysearch_real(), and get_func_value().

Here is the call graph for this function:

Here is the caller graph for this function: