anchor.diff:      integer,          intent(inout) :: jguess
       real(kind=fPrec), intent(in)    :: x, xvals(1:datalen), yvals(1:datalen)
   
  -    integer jj, jMin, jMax
  +    integer ii, jj, jMin, jMax
       real(kind=fPrec) dy
   
       polinterp = zero ! -Wmaybe-uninitialized
  
positive.code:     if(present(jlo)) klo = jlo
      ascnd=xvals(datalen).ge.xvals(1) ! True if ascending order of table, false otherwise.
      
      if(klo.le.0.or.klo.gt.datalen)then
         ! Input guess not useful. Go immediately to bisection.
         klo=0
         jhi=datalen+1
         goto 3
      endif
      
      ! set the hunting increment.
      inc=1
  
negative.code:   ! ================================================================================================ !
    real(kind=fPrec) function polinterp(x,xvals,yvals,datalen,mpoints,jguess)
  
      use crcoall, only : lout
      use numerical_constants, only : zero
      implicit none
  
  