java – 维护特定条件的hashCode契约,equals()取决于两个整数

class Employee {
int eId;
String eName;

Employee(int id,String name) {
    this.eId= id;
    this.eName= name;
}

如果满足以下任何条件,则equals()应返回true：

> eId是一样的.
> eName是相同的.
> eName的长度相同.

我在覆盖equals()时没有问题,但是,为了维护哈希代码契约,我也应该覆盖hashCode().因此,hashCode应该依赖于eId和eName.length()(如果eNames相等,它们的长度也将相等).所以有四种情况：

Employee e1 = new Employee(4,"John");
Employee e2 = new Employee(3,"Jane");
Employee e3 = new Employee(4,"Jim");
Employee e4 = new Employee(7,"Random");

hashCode()应返回e1,e2和e3的相同值以及e4的不同值.我无法想出满足这一要求的逻辑.

这是确切的问题：

Create a class (having parameters name,id etc). Show that if 2 objects of this class will be compared then they should return true in any of below case :

A. Id of both are same.

B. Name of both are same.

C. Length of name’s of both are same.

Make sure HashCode contract should not violate.