Equals in Hashtable

Question

I have a Hashtable which maps int[] to an array of objects called cell.
Declared like this Hastable<int[], cell[]> tableMy problem is this. The hashtable uses Object.equals - but I want to use Arrays.equals. For instance:
int[] keyLookup = new int[] {0,1,2,3};
if(table.containsKey(keyLookup)){
}However this doesn't work because:
int[] one = new int[] {0,1,2,3};
int[] two = new int[] {0,1,2,3};one.equals(two) is false;
I want the behaviour of Arrays.equals(one, two) is true.
Is it possible to achieve this? Because I don't want to have to enumerate over all the keys performing Array.equals!

Answer 1

This has not entirely solved my problem.
I now have what I've called a Signature, which models the int[] and have overridden the equals method to use the Arrays.equals method. e.g.:
int[] one = new int[] {0,1,2,3};
int[] two = new int[] {0,1,2,3};
System.out.println("Object equals = " + one.equals(two));
System.out.println("Arrays equals = " + Arrays.equals(one, two));
Signature sOne = new Signature(one);
Signature sTwo = new Signature(two);
System.out.println("Signature equals = " + sOne.equals(sTwo));Which is great and now gives me the desired behaviour, here's the output
Object equals = false
Arrays.equals = true
Signature equals = true
But the problem is I have not overridden the hashCode method; and so two objects which are now equal return different hashCodes - resulting in Hashtable.get/containsKey being incorrect.
I could write an implementation of this based on the values in the integer array of the Signaure but I am wary of doing this because it could be easy to make a mistake.
Any suggestions on either how to safely override hashCode or an alternative approach?