Java.util.BitSet.cardinality() Method

Description

The java.util.BitSet.cardinality() method returns the number of bits set to true in this BitSet.

Declaration

Following is the declaration for java.util.BitSet.cardinality() method

public int cardinality()

Parameters

• NA

Return Value

This method returns the number of bits set to true in this BitSet.

Exception

• NA

Example

The following example shows the usage of java.util.BitSet.cardinality() method.

package com.tutorialspoint;

import java.util.*;

public class BitSetDemo {

   public static void main(String[] args) {

      // create 2 bitsets
      BitSet bitset1 = new BitSet(8);
      BitSet bitset2 = new BitSet(8);

      // assign values to bitset1
      bitset1.set(0);
      bitset1.set(1);
      bitset1.set(2);
      bitset1.set(3);
      bitset1.set(4);
      bitset1.set(5);

      // assign values to bitset2
      bitset2.set(2);
      bitset2.set(4);
      bitset2.set(6);
      bitset2.set(8);
      bitset2.set(10);
	  
	  // print the sets
      System.out.println("Bitset1:" + bitset1);
      System.out.println("Bitset2:" + bitset2);

      // print cardinality for bitset1
      System.out.println("" + bitset1.cardinality());

      // print cardinality for bitset2
      System.out.println("" + bitset2.cardinality());

   }
}

Let us compile and run the above program, this will produce the following result:

Bitset1:{0, 1, 2, 3, 4, 5}
Bitset2:{2, 4, 6, 8, 10}
6
5