anchor.diff:         end function f_integral
       end interface
       do i=1,size(xx)
  -    if(i==1) then
  -    xmin = xx(1)
  -    else
  -    xmin = f_average(xx(i-1), xx(i))
  -    end if
  -    if(i==size(xx)) then
  -    xmax = xx(size(xx))
  -    else
  -    xmax = f_average(xx(i), xx(i+1))
  -    end if
  -    yy(i) = f_integral(x, y, xmin, xmax) / (xmax - xmin)
  -    end do
  -    end subroutine rebin_general_sp
  +       if(i==1) then
  +          xmin = xx(1)
  +       else
  +          xmin = f_average(xx(i-1), xx(i))
  +       end if
  +       if(i==size(xx)) then
  +          xmax = xx(size(xx))
  +       else
  +          xmax = f_average(xx(i), xx(i+1))
  +       end if
  +       yy(i) = f_integral(x, y, xmin, xmax) / (xmax - xmin)
  +    end do
  +  end subroutine rebin_general_sp
   
     integer function locate_sp(xx,x)
       ! Locate a value in a sorted array
  
positive.code:        end function f_integral
      end interface
      do i=1,size(xx)
      if(i==1) then
      xmin = xx(1)
      else
      xmin = f_average(xx(i-1), xx(i))
      end if
      if(i==size(xx)) then
      xmax = xx(size(xx))
      else
      xmax = f_average(xx(i), xx(i+1))
      end if
      yy(i) = f_integral(x, y, xmin, xmax) / (xmax - xmin)
      end do
      end subroutine rebin_general_dp
  
    integer function locate_dp(xx,x)
      ! Locate a value in a sorted array
  
negative.code: ! MD5 of template: de1baa4b78ae2b9da8efc3705a89c946
  ! Array related routines (Integration, Interpolation, etc.)
  ! Thomas Robitaille (c) 2009
  
  