final public class Person implements Comparable{ private String name; private int born; public Person(String name, int born){ this.name = name; this.born = born; } public int age(){ return 2004-born; } public int compareTo(Object o){ Person other = (Person) o; return this.name.compareTo(other.name); } public String toString(){ return name + " of age " + age(); } public boolean equals(Object other){ if ( other == null) return false; if ( other == this ) return true; if ( ! (other instanceof Person ) ) return false; Person otherPerson = (Person) other; return otherPerson.name.equals(this.name) && otherPerson.born == this.born; } /* The hashCode returns an integer which is used * in connection with hashtables. The documentation * of the hashCode method states that: " The general contract of hashCode is: - Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application. - If two objects are equal according to the equals(Object) method, then calling the hashCode method on each of the two objects must produce the same integer result. - It is not required that if two objects are unequal according to the equals(java.lang.Object) method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hashtables. " */ public int hashCode(){ return this.name.hashCode() + born; } public final static Person[] testPersons = { new Person("Lars Jensen", 1988), new Person("Mette von Mosenberg", 1974), new Person("Didrich Hesselholm", 1937), new Person("Signe Johansen", 1981), new Person("Mumbassa Swanson", 1972)}; }