Hi, well i am unable to understand that why it is mandatory
to have same hashcode, if two objects are same?
Thanks in advance.
Answers were Sorted based on User's Feedback
Answer / nalluri
Hi,
No. Never same hash code to 2 same objects. every object is
having it's own hash code.
Is This Answer Correct ? | 2 Yes | 0 No |
Answer / venkateswara reddy
NO No NO....
Check it once..
If there r two same objects, there must be a diffent
hashcode to them....
U never find same hashcode to any two objects
Is This Answer Correct ? | 1 Yes | 0 No |
Answer / rajshekaran pillai
As the JVM assigns the hashcode to an object value and not
the reference the hashcode for the same object will be same.
the equals() method of the object class uses this hashcode
to evaluate if the objects have same value. therefore
Object o1 = new String("ABC");
Object o2 = "ABC";
/**
* will have the same hashcode
* therefore when we do..
*/
if(o1 == o2){
System.out.println("The object reference is same");
}else if(o1.equals(o2)){
System.out.println("The object has same value");
}
/**
* The output is
* The object has same value
*/
Is This Answer Correct ? | 1 Yes | 0 No |
Answer / prasanna
If two objects are equal then there hashcode must same.
Is This Answer Correct ? | 1 Yes | 1 No |
Answer / nalluri
Hi,
No. Never same hash code to 2 same objects. every object is
having it's own hash code.
Is This Answer Correct ? | 0 Yes | 0 No |
what are the purposes of native, transiant key words?
How does system arraycopy work in java?
Which access specifier can be used with class ?
What is an empty string in css?
What is currentthread()?
What is boolean data type in java?
What are packages and name a few?
I want to persist data of objects for later use. What is the best approach to do so?
Is a boolean 1 bit?
difference between arraylist and linkedlist otherthan performance
How do you check if a string is lexicographically in java?
What is the argument in java?