anchor.diff:  
     interface
       !====================================================================!
  -    module subroutine kNearest_2D(search, tree, x, y, xQuery, yQuery, k, kNearest)
  +    module function kNearest_2D(search, tree, x, y, xQuery, yQuery, k, radius) result(kNearest)
         !! Overloaded Type bound procedure KdTreeSearch%kNearest()
       !====================================================================!
       class(KdTreeSearch), intent(inout) :: search
  
positive.code:       !! x co-ordinate of the query location
      real(r64),intent(in) :: yQuery
        !! y co-ordinate of the query location
      integer(i32), intent(in) :: k
        !! Number of points to find that are closest to the query
      type(dArgDynamicArray) :: kNearest
        !! Indices of the nearest points to the query location
      end subroutine
      !====================================================================!
      !====================================================================!
      module subroutine kNearest_3D(search, tree, x, y, z, xQuery, yQuery, zQuery, k, kNearest)
        !! Overloaded Type bound procedure KdTreeSearch%kNearest()
      !====================================================================!
      class(KdTreeSearch), intent(inout) :: search
  
negative.code:   use m_select, only: argSelect
    use m_maths, only: variance
    use m_dArgDynamicArray, only: dArgDynamicArray
    use m_strings, only: str
  
    implicit none
  
  