Last Updated : 23 Jul, 2025
BitSet class methods in Set 3. / / | | | \ \ and notand flip isEmpty equal get intersectBitSet class methods in Java with Examples | Set 2 BitSet class methods are explained as follows :
Syntax: public void and(BitSet bitset) or public void andNot(BitSet bitste) Parameters: bitset - set to perform the operation
Syntax: public boolean equals(Object o) Parameters: o - the object to compare with Overrides: equals in class Object Return: if object are same then true; otherwise false
Syntax: public BitSet get(int from_Index, int to_Index) Parameters: from_Index - index of the first bit of given BitSet to include to_Index - index after the last bit of the BitSet to include Throws: IndexOutOfBoundsException - if from_Index is negative, or to_Index is negative, or from_Index is larger than to_Index
// Java program explaining BitSet class methods
// and(), notand(), equal(), get()
import java.util.*;
public class GFG
{
public static void main(String[] args)
{
BitSet bs1 = new BitSet();
BitSet bs2 = new BitSet();
// assign values to bs1 using set()
bs1.set(7);
bs1.set(1);
bs1.set(2);
bs1.set(4);
bs1.set(3);
bs1.set(6);
// assign values to bs2
bs2.set(4);
bs2.set(6);
bs2.set(3);
bs2.set(9);
bs2.set(2);
// Printing the Bitsets
System.out.println("bs1 : " + bs1);
System.out.println("bs2 : " + bs2);
// use of get() to get index 3 to 6 of bs1
System.out.println("\nUse of get() on bs1 : "
+ bs1.get(1,4));
// use of get() to get index 1 to 4 of bs2
System.out.println("Use of get() on bs2 : "
+ bs2.get(1,4));
// perform not operation in b/w the sets
bs1.andNot(bs2);
System.out.println("\nNot b/w bs1 and bs2 : " + bs1);
// perform and operation between two bitsets
bs1.and(bs2);
System.out.println("And b/w bs1 and bs2 : " + bs1);
// equal() method to compare the bs1 and bs2
if (bs1.equals(bs2))
System.out.println("\nUsing equal method : Equal");
else
System.out.println("\nUsing equal method : Not Equal");
}
}
Output:
bs1 : {1, 2, 3, 4, 6, 7} bs2 : {2, 3, 4, 6, 9} Use of get() on bs1 : {0, 1, 2} Use of get() on bs2 : {1, 2} Not b/w bs1 and bs2 : {1, 7} And b/w bs1 and bs2 : {} Using equal method : Not Equal
Syntax: public void flip(int from_Index, int to_Index) Parameters: from_Index - index of the first bit of the given BitSet to flip to_Index - index after the last bit of the given BitSet to flip Throws: IndexOutOfBoundsException - if from_Index is negative, or to_Index is negative, or from_Index is larger than to_Index
Syntax: public boolean intersects(BitSet set) Parameters: set - BitSet to intersect with Returns: true if the given BitSet intersects the target BitSet
Syntax: public boolean isEmpty() Return: boolean indicating whether the given BitSet is empty
// Java program explaining BitSet class methods
// intersect(), isEmpty(), flip() methods
import java.util.*;
public class NewClass
{
public static void main(String[] args)
{
BitSet bs1 = new BitSet();
BitSet bs2 = new BitSet();
// assign values to bs1 using set()
bs1.set(7);
bs1.set(1);
bs1.set(2);
bs1.set(4);
bs1.set(3);
bs1.set(6);
// assign values to bs2
bs2.set(4);
bs2.set(6);
bs2.set(3);
bs2.set(9);
bs2.set(2);
// Printing the Bitsets
System.out.println("bs1 : " + bs1);
System.out.println("bs2 : " + bs2);
System.out.println("");
// use of intersect() to check if the bitsets
// intersects
System.out.println("Using intersect() : "
+ bs2.intersects(bs1));
// use of flip() from_index - 1 to_index - 5
bs1.flip(1,5);
System.out.println("\nbs1 using flip : " + bs1);
// use of flip() from_index - 2 to_index - 4
bs2.flip(2,4);
System.out.println("bs2 using flip : " + bs2);
System.out.println("");
// use of isEmpty() to check if bitsets are empty
System.out.println("Use of isEmpty() : "
+ bs1.isEmpty());
System.out.println("Use of isEmpty() : "
+ bs2.isEmpty());
}
}
Output:
bs1 : {1, 2, 3, 4, 6, 7} bs2 : {2, 3, 4, 6, 9} Using intersect() : true bs1 using flip : {6, 7} bs2 using flip : {4, 6, 9} Use of isEmpty() : false Use of isEmpty() : falseReferences : https://docs.oracle.com/javase/7/docs/api/java/util/BitSet.html
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4