- Java.util Package Classes
- 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 Package Extras
- Java.util - Interfaces
- Java.util - Exceptions
- Java.util - Enumerations
- Java.util Useful Resources
- Java.util - Useful Resources
- Java.util - Discussion
Java BitSet nextClearBit() Method
Description
The Java BitSet nextClearBit(int fromIndex) method returns the index of the first bit that is set to false that occurs on or after the specified starting index.
Declaration
Following is the declaration for java.util.BitSet.nextClearBit() method
public int nextClearBit(int fromIndex)
Parameters
fromIndex − the index to start checking from (inclusive).
Return Value
This method returns the index of the next clear bit.
Exception
IndexOutOfBoundsException − if the specified index is negative.
Example 1
The following example shows the usage of Java BitSet nextClearBit() method. We're creating two BitSets. We're setting true values in a BitSet object using set() method call and using nextClearBit() method we're printing the next clear bit of bitsets.
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 the next clear bit System.out.println(bitset1.nextClearBit(0)); System.out.println(bitset2.nextClearBit(5)); } }
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} 6 5
Example 2
The following example shows the usage of Java BitSet nextClearBit() method. We're creating two BitSets using byte[] and and using nextClearBit() method we're printing the next clear bit of bitsets.
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); // print the next clear bit System.out.println(bitset1.nextClearBit(0)); System.out.println(bitset2.nextClearBit(1)); } }
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} 0 2
Example 3
The following example shows the usage of Java BitSet nextClearBit() method. We're creating two BitSets using long[] and and using nextClearBit() method we're printing the next clear bit of bitsets.
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 the next clear bit System.out.println(bitset1.nextClearBit(0)); System.out.println(bitset2.nextClearBit(1)); } }
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} 0 2