def &()

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

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

    def &(rhs: BitSet): BitSet =
      rhs match {
        case Leaf(o, values2) =>
          if (this eq rhs) {
            this
          } else if (o != offset) {
            Empty
          } else {
            val vs = new Array[Long](32)
            var i = 0
            while (i < 32) {
              vs(i) = values(i) & values2(i)
              i += 1
            }
            Leaf(offset, vs)
          }
        case Branch(_, _, _) =>
          rhs & this
      }