Bitset int cardinality() Method Example Program


Returns the number of bits set to true in this BitSet.

Program

package com.Candidjava;

import java.util.BitSet;

/**
 * @author : vinod kumar v
 * @description :The jBitSet.cardinality() method returns the number of bits set
 *              to true in this BitSet.
 * */

public final class BitSetCardinality {
	public static void main(String[] args) {

		BitSet obj = new BitSet(8);
		BitSet obj1 = new BitSet(8);

		obj.set(0);
		obj.set(1);
		obj.set(2);
		obj.set(3);

		obj1.set(2);
		obj1.set(4);
		obj1.set(6);
		obj1.set(8);

		System.out.println("The Value in obj:" + obj);
		System.out.println("The Value in obj1" + obj1);

		System.out.println("" + obj.cardinality());
		System.out.println("" + obj1.cardinality());
	}
}

Output

The Value in obj:{0, 1, 2, 3}
The Value in obj1{2, 4, 6, 8}
4
4

Explanation

public int cardinality()
Returns the number of bits set to true in this BitSet.
Returns:
the number of bits set to true in this BitSet


Related Post

Comments


©candidjava.com