Avinash Tiwari wrote:1. Why need hashing.
Because some collection classes, such as HashMap and HashSet, need this.
Avinash Tiwari wrote:2. If not implemented hashing , what is pitfall. What will be size of hashmap.
I don't understand exactly what you mean here. HashMap needs a hashing mechanism, without it, you just couldn't have a HashMap. The size of the HashMap specifically doesn't have anything to do with it.
Avinash Tiwari wrote:3. If implemented hashcode and not equals and vice versa.
If the hashCode() and equals() method do not work together the way they should, then you can get unpredictable results when you put objects in a HashSet or use them as keys in a HashMap. For example, you put the object in a HashSet, then check if it is in the set, and you could get
false, even though you just put it in.
Avinash Tiwari wrote:4. What is underlying implementation storing hashcode and how does it work in retrieving the object
You can lookup the source code of HashMap in the JDK source code, which you can find on your own computer, in the file
src.zip in your JDK installation directory.
Avinash Tiwari wrote:5. How does hashing works best with immutable object
You will get into trouble when you put objects in for example a HashSet and then change the member variables in a way so that the hash code of the object would change. HashSet stores the object in a bucket that corresponds to its hash code. If you change the content of the object, then its hash code will be different, and it would be in the wrong bucket in the HashSet. This can't happen with immutable objects, because you can't change the content of an immutable object.
Avinash Tiwari wrote:6. What is same type of objects and put. What will be size of map then.
I don't understand what you mean with this. The size of the map (number of objects in the map) doesn't have anything to do with the type of objects.
Avinash Tiwari wrote:7. What exactly is bucket. We talk of bucket but what is actual implementation of same and how does it handle the same.
This has to do with how HashMap works internally. It stores elements (key-value pairs) in a collection of "buckets". In which bucket a key-value pair goes, is determined by the hash code of the key. The reason for this is that it makes it very efficient to lookup elements by key later: you supply the key, the HashMap gets the hash code, and then it knows in which bucket to look for the key-value pair. Imagine that you have a HashMap with 1000 elements, distributed evenly over 100 buckets (each bucket contains 10 elements). To lookup an element, the HashMap only needs to look in one bucket, so it has to compare the key that you provide with just 10 elements. Compare this to how it would work in a list, where the 1000 elements: there, it would need to compare it to all 1000 objects.
Avinash Tiwari wrote:9 Do we provide implementation of bucket or provided by java.
It's part of how HashMap is implemented internally. You don't provide this yourself, and you don't even have to know about this when you're just using HashMap.
1
