Java BitSet | cardinality()
Last Updated :
31 Jul, 2021
BitSet is a class defined in the java.util package. It creates an array of bits represented by 0s and 1s.
Syntax
public int cardinality()
Explanation:
The method returns the number of 1s in this BitSet.
Examples:
Input :
set1 : {1, 2, 4}
set2 : {}
Output :
3
0
Java
import java.util.*;
public class GFG {
public static void main(String[] args)
{
BitSet bs1 = new BitSet();
BitSet bs2 = new BitSet();
BitSet bs3 = new BitSet();
bs1.set( 0 );
bs1.set( 1 );
bs1.set( 2 );
bs1.set( 4 );
bs2.set( 4 );
bs2.set( 6 );
bs2.set( 5 );
bs2.set( 1 );
bs2.set( 2 );
bs2.set( 3 );
System.out.println( "bs1 : " + bs1);
System.out.println( "bs2 : " + bs2);
System.out.println( "bs3 : " + bs3);
System.out.println(bs1.cardinality());
System.out.println(bs2.cardinality());
System.out.println(bs3.cardinality());
}
}
|
Output:
bs1 : {0, 1, 2, 4}
bs2 : {1, 2, 3, 4, 5, 6}
bs3 : {}
4
6
0
Related Articles :
- Bitset Class Examples Set 1
- Bitset Class Examples Set 2
- Bitset Class Examples Set 3
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...