hashCode() doubt

[vinod ns]

class ValuePair
{
public int a,b;
public boolean equals(Object other)
{
try
{
ValuePair o=(ValuePair)other;
return(a==o.a && b==o.b) || a==o.b && b==o.a);
}
catch(ClassCastException e)
{
return false;
}
}
public int hashCode()
{
//implementation here.
}
}
I cant understand the logic of this question
plz help me.

*** For a non negative operand >> and >>> produce the samw result ***

[j zaal]

What is the question?
greetings Jos

[Ajay Ajay]

Hi dude,
I'll try to complete the remaining code and I'll give explanation for it.
V1 is a reference variable to Object Valuepair.
V2 is a Object class(Root for all the classes)reference variable pointing to object valuepair.
equals is a method of object class and we are overriding here to check whether the contents of both objects are equal.Whenever we r overriding equals() method,we have to implement hashcode().

class ValuePair
{
public int a,b;
public boolean equals(Object other)
{
try
{
/* Object Casting should take place because the Object class reference variable points to the Object of valuepair*/
ValuePair o=(ValuePair)other;
return(a==o.a && b==o.b) || a==o.b && b==o.a);
}
catch(ClassCastException e)
{
return false;
}
}
public int hashCode()
{
//implementation here.
}
}
public class AppClass
{
public static void main(String []args)
{
valuepair v1 = new valuepair();
Object v2 = new valuepair();
if (V1.equals(v2))
System.out.println("Both object are equal");
else
System.out.println("Both object are not equal");
}
}

[Jeroen Wenting]

I think the question was to implement public int hashCode() ???
Any implementation that provides a "reasonably unique" number AND will always provide the same number for identical data will do.
Many implementations will do something with prime numbers.

public int hashCode()
{
  int magic = 13;
  int result = magic + a;
  result = b * magic + result;
  return result;
}

might work as an example (I've not tested this for being "unique enough"....).