GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing www.tutorialspoint.com — Java BitSet hashcode() Method
Selected Reading
Java BitSet hashcode() MethodDescriptionThe Java BitSet hashcode() method returns a hash code value for this bit set. The hash code depends only on which bits have been set within this BitSet. DeclarationFollowing is the declaration for java.util.BitSet.hashcode() method public int hashCode() ParametersNA Return ValueThis method returns a hash code value for this bit set. ExceptionNA Getting HashCode of a BitSet ExampleThe following example shows the usage of Java BitSet hashCode() 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 hashCode() method we're printing the hashcode of the 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 hashcode
System.out.println(bitset1.hashCode());
System.out.println(bitset2.hashCode());
}
}
OutputLet 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}
1261
390
Getting HashCode of a BitSet of Bytes ExampleThe following example shows the usage of Java BitSet hashCode() method. We're creating two BitSets using byte[] and using hashCode() method we're printing the hashcode of the 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 hashcode
System.out.println(bitset1.hashCode());
System.out.println(bitset2.hashCode());
}
}
OutputLet 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}
50462934
134611162
Getting HashCode of a BitSet of Longs ExampleThe following example shows the usage of Java BitSet hashCode() method. We're creating two BitSets using long[] and using hashCode() method we're printing the hashcode of the 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 hashcode
System.out.println(bitset1.hashCode());
System.out.println(bitset2.hashCode());
}
}
OutputLet 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}
1232
1240
java_util_bitset.htm
Advertisements
|
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |