anchor.diff:    call argSort(c1D, ia1D)
   
     call test%test(ia == ia1d(1), 'KD - KdTreeSearch%nearest')
  -  call test%test(all(da%i%values == ia1D(1:10)) .and. all(da%v%values == sqrt(c1D(ia1D(1:10)))), 'KD - KdTreeSearch%kNearest')
  +  call test%test(all(da%i%values == ia1D(1:10)) .and. all(abs(da%v%values - sqrt(c1D(ia1D(1:10)))) <= 1.d-15), 'KD - KdTreeSearch%kNearest')
   
     call tree%deallocate()
   
  
positive.code:   call argSort(d1D, ia1D)
  
    call test%test(ia == ia1D(1), '3D - KdTreeSearch%nearest')
    call test%test(all(da%i%values == ia1D(1:10)) .and. all(da%v%values == sqrt(d1D(ia1D(1:10)))), '3D - KdTreeSearch%kNearest')
  
    call tree%deallocate()
  
  
negative.code:   call argSort(c1D, ia1D)
  
    call test%test(ia == ia1D(1), '2D - KdTreeSearch%nearest')
    call test%test(all(da%i%values == ia1D(1:10)) .and. all(abs(da%v%values - sqrt(c1D(ia1D(1:10)))) <= 1.d-15), '2D - KdTreeSearch%kNearest')
  
    call tree%deallocate()
  
  