Java BitSet | intersects()

BitSet is a class defined in the java.util package. It creates an array of bits represented by 0s and 1s.


public boolean intersects(BitSet set)

Parameter: The method accepts a mandatory parameter set, which is the BitSet to be checked for intersection.

Returns: The method returns a boolean indicating whether this BitSet intersects the specified BitSet

Explanation: The method returns true if the specified BitSet has any bits set to true that are also set to true in this BitSet, otherwise false is returned.


Input : 
set1 : {1, 2, 4}
set2 : {}

Output : 




// Java program illustrating Bitset Class functions.
import java.util.*;
public class GFG {
    public static void main(String[] args)
        // Constructors of BitSet class
        BitSet bs1 = new BitSet();
        BitSet bs2 = new BitSet();
        BitSet bs3 = new BitSet();
        /* set is BitSet class method
        expalined in next articles */
        // assign values to bs2
        // Printing the 2 Bitsets
        System.out.println("bs1 : " + bs1);
        System.out.println("bs2 : " + bs2);
        System.out.println("bs3 : " + bs3);
        // Performing intersects on two bitset
        System.out.println("bs1 intersection bs3 = "
                           + bs1.intersects(bs2));
        System.out.println("bs3 intersection bs1 = "
                           + bs3.intersects(bs1));



bs1 : {0, 1, 2, 4}
bs2 : {1, 2, 3, 4, 5, 6}
bs3 : {}
bs1 intersection bs3 = true
bs3 intersection bs1 = false

Related Articles :

  1. Bitset Class Examples Set 1
  2. Bitset Class Examples Set 2
  3. Bitset Class Examples Set 3

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.