155         if (bits.length < other.bits.length) {

   155         if (bits.length < other.bits.length) {

   156             bits = Arrays.copyOf(bits, other.bits.length);

   156             bits = Arrays.copyOf(bits, other.bits.length);

   157         }

   157         }

   158         for (int i = 0; i < Math.min(bits.length, other.bits.length); i++) {

   158         for (int i = 0; i < Math.min(bits.length, other.bits.length); i++) {

   159             bits[i] |= other.bits[i];

   159             bits[i] |= other.bits[i];

   160         }

   166         }

   161     }

   167     }

   162 

   168 

   163     public void grow() {

   169     public void grow() {

   164         nodeCount = Math.max(nodeCount, graph().nodeIdCount());

   170         nodeCount = Math.max(nodeCount, graph().nodeIdCount());