anchor.diff:    call Msg('==========================')
   
     call strings_test(test)
  -
  +  
     call fileIO_test(test)
  -
  -  call random_test(test)
  -
  +  
  +  call random_test(test, .false.)
  +  
     call time_test(test)
  -
  +  
     call indexing_test(test)
  -
  +  
     call allocate_test(test)
  -
  +  
     call reallocate_test(test)
  -
  +  
     call copy_test(test)
  -
  +  
     call sorting_test(test, N)
  -
  +  
     call select_test(test, N)
  -
  +  
     call array1D_test(test)
  -
  +  
     call maths_test(test)
   
   
  
positive.code:   tree = KdTree(a2D)
  
    ia = search%nearest(tree, a2D, [0.d0, 0.d0])
    call search%kNearest(tree, a2D, [0.d0, 0.d0], 10, da)
  
    c1D = a1D**2.d0
    c1D = c1D + b1D**2.d0
  
negative.code:   type(KdTreeSearch) :: search
  
    type(dArgDynamicArray) :: da
    integer(i32) :: iSearch(3) ! Used for testing kNearest.
  
  ! Get an integer from command line argument
    ib = command_argument_count()
  