java 集合运算

package testjavapro;
import java.util.BitSet;

public class testjavaa {

  public static void main(String args[]) {
     BitSet bits1 = new BitSet();
     BitSet bits2 = new BitSet();

     // set some bits
     for(int i=; i<; i++) {
        if((i%) == ) bits1.set(i);
        if((i%) != ) bits2.set(i);
     }
     System.out.println("Initial pattern in bits1: ");
     System.out.println(bits1);
     System.out.println("\nInitial pattern in bits2: ");
     System.out.println(bits2);

     // AND bits
     bits2.and(bits1);
     System.out.println("\nbits2 AND bits1: ");
     System.out.println(bits2);

     // OR bits
     bits2.or(bits1);
     System.out.println("\nbits2 OR bits1: ");
     System.out.println(bits2);

     // XOR bits
     bits2.xor(bits1);
     System.out.println("\nbits2 XOR bits1: ");
     System.out.println(bits2);
  }
}

输出

Initial pattern in bits1:
{, , , , , , , }

Initial pattern in bits2:
{, , , , , , , , , , , }

bits2 AND bits1:
{, , , , , }

bits2 OR bits1:
{, , , , , , , }

bits2 XOR bits1:
{}