GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Python Technologies
  • Databases
  • Computer Programming
  • Web Development
  • Java Technologies
  • Computer Science
  • Mobile Development
  • Big Data & Analytics
  • Microsoft Technologies
  • DevOps
  • Latest Technologies
  • Machine Learning
  • Digital Marketing
  • Software Quality

This view

  • Original page
  • New address

GeezerVison is showing www.tutorialspoint.com — Java BitSet hashcode() Method

Java.util package tutorial
  • 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
Selected Reading
  • UPSC IAS Exams Notes
  • Developer's Best Practices
  • Questions and Answers
  • Online Resume Builder
  • HR Interview Questions
  • Computer Glossary
  • Who is Who

Java BitSet hashcode() Method



Previous
Quiz
Next

Description

The 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.

Declaration

Following is the declaration for java.util.BitSet.hashcode() method

public int hashCode()

Parameters

NA

Return Value

This method returns a hash code value for this bit set.

Exception

NA

Getting HashCode of a BitSet Example

The 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());
   }
}

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}
1261
390

Getting HashCode of a BitSet of Bytes Example

The 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());
   }
}

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}
50462934
134611162

Getting HashCode of a BitSet of Longs Example

The 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());
   }
}

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}
1232
1240
java_util_bitset.htm
Tutorix - AI Tutor
Previous Quiz Next
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.