anchor.diff:  
     ! ================================================================================================ !
     !  A.Mereghetti, CERN, BE-ABP-HSS
  -  !  Last modified: 15-04-2019
  +  !  Last modified: 24-04-2019
     !  Given arrays xa and ya, each of length n, and given a value x, this function returns a
     !        value y, and an error estimate dy. If P(x) is the polynomial of degree N−1 such that
     !        P(xa_i)=ya_i, i=1,...,n , then the returned value y = P ( x ).
     !  This function implements Neville's method
  -  !  from Numerical Recipes in Fortran 77
  +  !  function from Numerical Recipes in Fortran 77
     ! ================================================================================================ !
     real(kind=fPrec) function nevilleMethod(xa,ya,nn,x,dy)
       
  
positive.code: 
    ! ================================================================================================ !
    !  A.Mereghetti, CERN, BE-ABP-HSS
    !  Last modified: 15-04-2019
    !  Given an array xvals(1:datalen), and given a value x, it returns a value such that x is
    !      between xvals(huntBin) and xvals(huntBin+1). xvals(1:datalen) must be monotonic in
    !      increasing/decreasing order - not checked!
    !  -1 is returned to indicate that x is out of range. jlo in input is taken as initial guess
    !  from Numerical Recipes in Fortran 77
    ! ================================================================================================ !
    integer function huntBin(x,xvals,datalen,jlo)
      
  
negative.code:     integer,          intent(inout) :: jguess
      real(kind=fPrec), intent(in)    :: x, xvals(1:datalen), yvals(1:datalen)
  
      integer ii, jj, jMin, jMax
      real(kind=fPrec) dy
  
      polinterp = zero ! -Wmaybe-uninitialized
  