Demonstrating BitSet for convert into AND, OR and XOR

Here is a Java Program to Demonstrating the BitSet

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34

import java.util.BitSet;   class BitSetDemo {   public static void main(String args[]) {     BitSet bits1 = new BitSet(16);     BitSet bits2 = new BitSet(16);       // set some bits     for(int i=0; i<16; i++) {       if((i%2) == 0) bits1.set(i);       if((i%5) != 0) 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);   } }

Output of Above Java Program
Initial pattern in bits1:
{0, 2, 4, 6, 8, 10, 12, 14}

Initial pattern in bits2:
{1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14}

bits2 AND bits1:
{2, 4, 6, 8, 12, 14}

bits2 OR bits1:
{0, 2, 4, 6, 8, 10, 12, 14}

bits2 XOR bits1:
{}