anchor.diff:      end if
   
       ! CASE 2: Far apart bbox-es.
  -    nodes1(1, :) = [0.0_dp, 0.0_dp]
  -    nodes1(2, :) = [1.0_dp, 0.0_dp]
  -    nodes1(3, :) = [1.0_dp, 1.0_dp]
  -    nodes1(4, :) = [0.0_dp, 1.0_dp]
  -    nodes2(1, :) = [100.0_dp, 100.0_dp]
  -    nodes2(2, :) = [101.0_dp, 100.0_dp]
  -    nodes2(3, :) = [101.0_dp, 101.0_dp]
  -    nodes2(4, :) = [100.0_dp, 101.0_dp]
  +    forall (i = 1:4)
  +       other(i, :) = unit_square(i, :) + [100.0_dp, 100.0_dp]
  +    end forall
       call bbox_intersect( &
  -         4, nodes1, 4, nodes2, enum_)
  +         4, unit_square, 4, other, enum_)
       if (enum_ == BoxIntersectionType_DISJOINT) then
          call print_status(name, case_id, .TRUE.)
       else
  
positive.code: 
      ! CASE 5: Almost tangent bbox-es.
      delta = 1.0_dp + spacing(1.0_dp)
      nodes1(1, :) = [0.0_dp, 0.0_dp]
      nodes1(2, :) = [1.0_dp, 0.0_dp]
      nodes1(3, :) = [1.0_dp, 1.0_dp]
      nodes1(4, :) = [0.0_dp, 1.0_dp]
      nodes2(1, :) = [delta, 0.0_dp]
      nodes2(2, :) = [1.0_dp + delta, 0.0_dp]
      nodes2(3, :) = [1.0_dp + delta, 1.0_dp]
      nodes2(4, :) = [delta, 1.0_dp]
      call bbox_intersect( &
           4, nodes1, 4, nodes2, enum_)
      if (enum_ == BoxIntersectionType_DISJOINT) then
         call print_status(name, case_id, .TRUE.)
      else
  
negative.code:     end if
  
      ! CASE 4: Tangent bbox-es.
      forall (i = 1:4)
         other(i, :) = unit_square(i, :) + [1.0_dp, 0.0_dp]
      end forall
      call bbox_intersect( &
           4, unit_square, 4, other, enum_)
      if (enum_ == BoxIntersectionType_TANGENT) then
         call print_status(name, case_id, .TRUE.)
      else
  