Proposal: s1.intersects(s2)

[David Abrahams]

Here's an implementation of the functionality I propose, as a
free-standing function:

        def intersects(s1,s2):
            if len(s1) < len(s2):
                for x in s1:
                    if x in s2: return True
            else:
                for x in s2:
                    if x in s1 return True
            return False

Right now, the only convenient thing to do is 

      if s1 & s2 ...

but that builds a whole new set.  IMO that query should be available
as a method of set itself.

-- 
Dave Abrahams
Boost Consulting
http://www.boost-consulting.com

The Astoria Seminar ==> http://www.astoriaseminar.com