src/main/java/com/googlecode/javaewah/datastructure/ImmutableBitSet.java
public boolean intersects(BitSet bs) {
      for (int k = 0; k < Math.min(this.data.limit(), bs.data.length); ++k) {
          if ((this.data.get(k) & bs.data[k]) != 0) return true;
      }
      return false;
  }
public boolean intersects(BitSet bs) {
      for (int k = 0; k < Math.min(this.data.limit(), bs.data.length); ++k) {
          if ((this.data.get(k) & bs.data[k]) != 0) return true;
      }
      return false;
  }
Checks whether two bitsets intersect.

@param bs other bitset
@return true if they have a non-empty intersection (result of AND)