In this lab, we will learn about the hashCode() method in Java. Hashing is a technique used to generate a unique value for a given key. Hashing is used to implement Hash Tables and these data structures provide a faster and more efficient way to lookup data. The hashCode() method returns an integer value for a given key. We will learn how to use the hashCode() method and the importance of writing a strong hashCode() method.
First, let's create a Student class with fields like name, registration number, and GPA.
class Student {
String name;
int regNo;
double gpa;
Student(String name, int regNo, double gpa) {
this.name = name;
this.regNo = regNo;
this.gpa = gpa;
}
}The equals() method is used to check whether two objects are equal or not. In this case, we will compare two Student objects based on their name, registration number, and GPA.
@Override
public boolean equals(Object obj) {
if (this == obj) {
return true;
}
if (obj == null || getClass() != obj.getClass()) {
return false;
}
Student student = (Student) obj;
return regNo == student.regNo &&
Double.compare(student.gpa, gpa) == 0 &&
Objects.equals(name, student.name);
}The hashCode() method returns an integer value for a given key. We will implement a basic hashCode() method that just returns an integer based on the first letter of the student's name.
@Override
public int hashCode() {
return (int) this.name.charAt(0) - 64;
}We can now use the hashCode() method to generate hash codes for the Student objects.
Student s1 = new Student("Alice", 1, 3.7);
Student s2 = new Student("Bob", 2, 3.9);
System.out.println("s1's hash code: " + s1.hashCode());
System.out.println("s2's hash code: " + s2.hashCode());The previous hashCode() method is not very strong, as different students with the same first letter of their name will be assigned the same hash value. Let's use the other fields of the class to write a stronger hashCode() method.
@Override
public int hashCode() {
return ((int) this.name.charAt(0) - 64) * this.regNo * (int) this.gpa;
}We can also use the built-in hashCode() method for the String class to generate hash codes for the Student class.
@Override
public int hashCode() {
return Objects.hash(name, regNo, gpa);
}Now, let's test the equality of two Student objects using the equals() method.
Student s1 = new Student("Alice", 1, 3.7);
Student s2 = new Student("Bob", 2, 3.9);
Student s3 = new Student("Alice", 1, 3.7);
System.out.println("s1 equals s2: " + s1.equals(s2));
System.out.println("s1 equals s3: " + s1.equals(s3));We can use the Student class in a HashSet. We need to override both the equals() and hashCode() methods in order for the HashSet to work properly.
Set<Student> studentSet = new HashSet<>();
studentSet.add(new Student("Alice", 1, 3.7));
studentSet.add(new Student("Bob", 2, 3.9));
studentSet.add(new Student("Alice", 1, 3.7));
System.out.println(studentSet.size()); // Output: 2We can also use the Student class in a HashMap. We need to override both the equals() and hashCode() methods in order for the HashMap to work properly.
Map<Student, String> studentMap = new HashMap<>();
studentMap.put(new Student("Alice", 1, 3.7), "Good");
studentMap.put(new Student("Bob", 2, 3.9), "Excellent");
studentMap.put(new Student("Alice", 1, 3.7), "Very Good");
System.out.println(studentMap.size()); // Output: 2To run the code, first, navigate to the directory where the code is saved using the cd command. Then use the javac command to compile the code and the java command to run the code.
cd ~/project
javac HashCodeDemo.java
java HashCodeDemoIn this lab, we learned about the hashCode() method in Java, which is used to generate a unique value for a given key. We implemented the hashCode() and equals() methods for the Student class and learned how to write a strong hashCode() method. We also learned how to use the hashCode() and equals() methods in HashSet and HashMap.
