Container Class and its equals(), hashCode() methods

本文介绍了Java中使用容器的优点,并详细解释了equals方法和hashCode方法的重要性。通过实例演示了如何重写equals方法来确保对象的有效比较,从而实现从容器中正确移除对象。

1.Why we need Container

For example, if we need to manage the employees' names of an company, if we don't know Container, we can only use an Array to store all the names of the employees. But it's not convenient, since the name may change alot. Sometime we need delete the name since the employee will leave the company, sometimes we need to add some names when we hire some new employees. It's difficult to delete a particular field in an Array and we can't add several fields in the array to store new names when the array is full. In java we have Container to solve these problems.

(important containers)


2. it's equals() and hashCode() methods

Like its name, a Container is a container to store Object. we can store different kinds of object in one contaion (not like array which can only store one kind of object). As we all know, in the Object class, the equals() method compare the reference of two objects. But in some other types the method is overwrited to compare their values, such as String, Integer objects.

If we want to add an object to an Container, we can use add(Object) method, and if we want to remove a object from the Container, we should use remove(Object) method. the remove(Object) realize its function by calling the equals() method.it compare two objects' reference by default which is meaningless. we need to rewrite the equals() method of our objects that need to be added into containerto compaare their values not reference, so does the hashCode() method. Because, two objects' hash Code must be the same if they equals to each other.

For example:

package com.test;

import java.util.Collection;
import java.util.HashSet;

public class BasicContainer {

	public static void main(String[] args) {
		Collection c = new HashSet();
		c.add("hello");
		c.add(new Name("nick","lau"));
		c.add(new Integer(100));
		
		c.remove("hello");
		c.remove(new Integer(100));
		System.out.println(c.remove(new Name("nick","lau")));
		System.out.println(c);

	}

}
the result: false 

                   nick lau

Since the String and Integer object has already overwrited the equals() method. they comapre the value of each object. c.remove("hello") compare all the value in Contaioner c to see which object's value is equals "hello", if find then delete the object in c. so dose the c.remove(new Integer(100)). Since in the Name object, we didn't overwrite the equals() method. it compare the reference of all the objects in c to see if there is one whose reference is the same with the new created Name("nick","lau"). Obviously, there is not. So the object can't be deleted from the conatainer c and it is printed out at last.

if we rewrite Name's equals() function:

package com.test;

import java.util.Collection;
import java.util.HashSet;

public class BasicContainer {

	public static void main(String[] args) {
		Collection c = new HashSet();
		c.add("hello");
		c.add(new Name("nick","lau"));
		c.add(new Integer(100));
		
		c.remove("hello");
		c.remove(new Integer(100));
		System.out.println(c.remove(new Name("nick","lau")));
		System.out.println(c);

	}

}

class Name{
	private String firstName,lastName;
	public Name(String _firstName, String _lastName){
		this.firstName = _firstName;
		this.lastName = _lastName;
	}

	//rewrite the equals method
	public boolean equals(Object obj){
		if(obj instanceof Name){
			Name name = (Name)obj;
			return(firstName.equals(name.firstName))&&(lastName.equals(name.lastName));
                 //since firstName is a String, so we are using String's equals() function.
                }
		return super.equals(obj);
	}
	
	//rewrite the hashCode() method
	public int hashCode(){
		return firstName.hashCode();
		// it means use "String"'s hashCode()function which is already rewritten.
	}

}

Since the class Name is now rewrited, when

c.remove(new Name("nick","lau"))
it will go through the container to compair this Name( nick, lau) and the new Name(nick, lau), since we are using the rewritted equals() function, the two objects are the same, so the container will delete this object. So there will not be any object at last in the container.

### 关系概述 在 Java 中,`equals()` 方法用于判断两个对象是否相等,而 `hashCode()` 方法返回一个整数形式的哈希码。这两个方法之间存在紧密的关系:如果两个对象通过 `equals()` 判断为相等,则它们必须具有相同的 `hashCode()` 值[^2]。 当对象被存储在基于散列的数据结构(如 HashMap 或 HashSet)中时,这些数据结构依赖于 `hashCode()` 来快速定位对象的位置。因此,为了确保程序逻辑的一致性正确性,在重写 `equals()` 方法的同时也应当相应地重写 `hashCode()` 方法[^3]。 ### 实现原则 对于任何有效的 `equals(Object)` 定义来说: - 自反性:对于任意非空引用值 x,`x.equals(x)` 应该返回 true。 - 对称性:对于任意非空引用值 x y,`x.equals(y)` 返回 true 当且仅当 `y.equals(x)` 也同样返回 true。 - 传递性:对于任意非空引用值 x、y z,如果 `x.equals(y)` 返回 true 并且 `y.equals(z)` 返回 true,则 `x.equals(z)` 也应该返回 true。 - 一致性:多次调用 `x.equals(y)` 总是返回相同的结果,前提是没有任何信息影响比较操作发生了变化。 - 非空性:对于任一非空引用值 x,`x.equals(null)` 必须返回 false。 同样地,对于 `hashCode()` 的实现也需要遵循一些基本原则来保持与 `equals()` 的兼容性: - 如果两个对象根据 `equals(java.lang.Object)` 方法被认为是相等的,那么在这两个对象上调用 `hashCode()` 方法应该得到同样的结果。 - 反之则不一定成立;即不同但不等于的对象可以有相同的哈希码。 ### 示例代码 下面是一个简单的例子展示了如何正确地覆盖 `equals()` `hashCode()` 方法: ```java public class Person { private final String name; private final int age; public Person(String name, int age) { this.name = name; this.age = age; } @Override public boolean equals(Object o) { if (this == o) return true; // Check self-reference if (!(o instanceof Person)) return false; // Type check Person person = (Person) o; return age == person.age && Objects.equals(name, person.name); } @Override public int hashCode() { return Objects.hash(name, age); // Use standard utility function from java.util.Objects } } ``` 此示例中的 `Person` 类实现了自定义版本的 `equals()` `hashCode()` 方法,以确保即使是在集合类中也能正常工作。
评论 1
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值