- Java.util - Home
- Java.util - ArrayDeque
- Java.util - ArrayList
- Java.util - Arrays
- Java.util - BitSet
- Java.util - Calendar
- Java.util - Collections
- Java.util - Currency
- Java.util - Date
- Java.util - Dictionary
- Java.util - EnumMap
- Java.util - EnumSet
- Java.util - Formatter
- Java.util - GregorianCalendar
- Java.util - HashMap
- Java.util - HashSet
- Java.util - Hashtable
- Java.util - IdentityHashMap
- Java.util - LinkedHashMap
- Java.util - LinkedHashSet
- Java.util - LinkedList
- Java.util - ListResourceBundle
- Java.util - Locale
- Java.util - Observable
- Java.util - PriorityQueue
- Java.util - Properties
- Java.util - PropertyPermission
- Java.util - PropertyResourceBundle
- Java.util - Random
- Java.util - ResourceBundle
- Java.util - ResourceBundle.Control
- Java.util - Scanner
- Java.util - ServiceLoader
- Java.util - SimpleTimeZone
- Java.util - Stack
- Java.util - StringTokenizer
- Java.util - Timer
- Java.util - TimerTask
- Java.util - TimeZone
- Java.util - TreeMap
- Java.util - TreeSet
- Java.util - UUID
- Java.util - Vector
- Java.util - WeakHashMap
- Java.util - Interfaces
- Java.util - Exceptions
- Java.util - Enumerations
- Java.util Useful Resources
- Java.util - Useful Resources
- Java.util - Discussion
Java BitSet intersects() Method
Description
The Java BitSet intersects(BitSet set) method returns true if the specified BitSet has any bits set to true that are also set to true in this BitSet.
Declaration
Following is the declaration for java.util.BitSet.intersects() method
public boolean intersects(BitSet set)
Parameters
set − BitSet to intersect with
Return Value
This method returns boolean indicating whether this BitSet intersects the specified BitSet.
Exception
NA
Checking Intersection of Two BitSets Example
The following example shows the usage of Java BitSet intersects() method. We're creating two BitSets. We're setting true values at given indexes to the BitSet objects using set() method calls per index and using intersects() method we're performing intersects opearation and printing the result.
package com.tutorialspoint;
import java.util.BitSet;
public class BitSetDemo {
public static void main(String[] args) {
// create 2 bitsets
BitSet bitset1 = new BitSet();
BitSet bitset2 = new BitSet();
// assign values to bitset1
bitset1.set(0, 6, true);
// 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 if bitset1 intersects with bitset2
System.out.println(bitset1.intersects(bitset2));
}
}
Output
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}
true
Checking Intersection of Two BitSets of Bytes Example
The following example shows the usage of Java BitSet intersects() method. We're creating two BitSets using byte[] and using intersects() method we're performing intersects opearation and printing the result.
package com.tutorialspoint;
import java.util.BitSet;
public class BitSetDemo {
public static void main(String[] args) {
// create 2 bitsets
BitSet bitset1 = BitSet.valueOf(new byte[] { 0, 1, 2, 3, 4, 5 });
BitSet bitset2 = BitSet.valueOf(new byte[] { 2, 4, 6, 8, 10 });
// print the sets
System.out.println("Bitset1:" + bitset1);
System.out.println("Bitset2:" + bitset2);
// perform and operation between two bitsets
bitset1.and(bitset2);
// print if bitset1 intersects with bitset2
System.out.println(bitset1.intersects(bitset2));
}
}
Output
Let us compile and run the above program, this will produce the following result −
Bitset1:{8, 17, 24, 25, 34, 40, 42}
Bitset2:{1, 10, 17, 18, 27, 33, 35}
true
Checking Intersection of Two BitSets of Longs Example
The following example shows the usage of Java BitSet intersects() method. We're creating two BitSets using long[] and using intersects() method we're performing intersects opearation and printing the result.
package com.tutorialspoint;
import java.util.BitSet;
public class BitSetDemo {
public static void main(String[] args) {
// create 2 bitsets
BitSet bitset1 = BitSet.valueOf(new long[] { 0, 1, 2, 3, 4, 5 });
BitSet bitset2 = BitSet.valueOf(new long[] { 2, 4, 6, 8, 10 });
// print the sets
System.out.println("Bitset1:" + bitset1);
System.out.println("Bitset2:" + bitset2);
// print if bitset1 intersects with bitset2
System.out.println(bitset1.intersects(bitset2));
}
}
Output
Let us compile and run the above program, this will produce the following result −
Bitset1:{64, 129, 192, 193, 258, 320, 322}
Bitset2:{1, 66, 129, 130, 195, 257, 259}
true