From: "mame (Yusuke Endoh)" <mame@...>
Date: 2012-07-14T18:35:54+09:00
Subject: [ruby-core:46459] [ruby-trunk - Feature #6588][Assigned] Set#intersect?


Issue #6588 has been updated by mame (Yusuke Endoh).

Status changed from Open to Assigned


----------------------------------------
Feature #6588: Set#intersect?
https://bugs.ruby-lang.org/issues/6588#change-28085

Author: marcandre (Marc-Andre Lafortune)
Status: Assigned
Priority: Normal
Assignee: knu (Akinori MUSHA)
Category: lib
Target version: 2.0.0


There is `Set#superset?`, `Set#subset?` with their `proper` variants, but there is no `Set#intersect?` nor `Set#disjoint?`

To check if two sets intersect, one can do

  set.intersection(other).empty?

This cycles through all elements, though. To be efficient, one can instead do the iteration manually:

  other.any? { |x| set.include?(x) }

I think it would be natural to add `Set#intersect?` and its reverse `Set#disjoint?`

  class Set
    def intersect?(enum)
      enum.any? { |x| include?(x) }
    end
  end

Maybe it would be worth it to optimize it if enum is a larger Set by starting it with

      return any? { |x| enum.include?(x) } if enum.is_a?(Set) && enum.size > size



-- 
http://bugs.ruby-lang.org/