anchor.diff:         cArea = iLength_(i) * iWidth_(i)
   
          if ( cArea .lt. min(lItArea, rArea) .and. cArea .gt. area ) then
  -
  -          !write(*,*) cArea, lItArea, rArea, iNumber_(i)
   
             area = cArea
   
  
positive.code:   subroutine drawPattern(filename, nit, itwid, itlen, container)
  
      ! This subroutine draws a pre-optimized pattern for the given item
  
      implicit none
  
  
negative.code: 
    subroutine reduction(numberOfSolutions, csvoutput)
  
      ! This subroutine applies the reduction heuristic. It uses the
      ! values given by vector 'maxItems' to quickly eliminates items of
      ! the same type.
  
      ! TODO: It is a good idea to identify when different items have
      ! the same sizes.
  
      implicit none
  
  