anchor.diff:      integer,intent(in)::b(:) !< array b
       integer,allocatable::findUnion(:) !< intersection of a and b
       
  -    findUnion=a
  +    allocate(findUnion(size(a)))
  +    findUnion(:)=a(:)
       do i=1,size(b)
         if(.not.any(a(:)==b(i)))then
           call pushArr(findUnion,b(i))
  
positive.code:     end do
    end function
    
  end module
  
negative.code:   ! public procedures
    public findIntersection
    public findUnion
    public applIntersection
    public applUnion
    
  contains
    
  