def intersects()

in algebird-core/src/main/scala/com/twitter/algebird/immutable/BitSet.scala [956:971]

• 16 lines of code
• 6 McCabe index (conditional complexity)

    def intersects(rhs: BitSet): Boolean =
      rhs match {
        case Leaf(o, values2) =>
          if (o != offset) {
            false
          } else {
            var i = 0
            while (i < 32) {
              if ((values(i) & values2(i)) != 0L) return true
              i += 1
            }
            false
          }
        case Branch(_, _, _) =>
          rhs.intersects(this)
      }