anchor.diff:    ! Sorting routines
     use m_Sort
     use m_Select
  +  use m_Searching
     use m_maths
     use m_KdTree
   
  
positive.code:   type(KdTreeSearch) :: search
  
    type(dArgDynamicArray) :: da
  
  ! Get an integer from command line argument
    ib = command_argument_count()
  
negative.code:   tree = KdTree(a1D, b1D, c1D)
  
    ia = search%nearest(tree, a1D, b1D, c1D, 0.d0, 0.d0, 0.d0)
    da = search%kNearest(tree, a1D, b1D, c1D, 0.d0, 0.d0, 0.d0, 10)
  
    d1D = a1D**2.d0
    d1D = d1D + b1D**2.d0
  