| Author |
hashCode() used for searching is right?
|
nagaraj raja
Ranch Hand
Joined: Aug 06, 2005
Posts: 36
|
|
|
hai i am thinking Hashtable,HashMap,HashSet are implemented hashing mechanisem ie it will generate hashCode this is useful searching the elements in a collection this is my openion os hashing is it right??
|
 |
marc weber
Sheriff
Joined: Aug 31, 2004
Posts: 11343
|
|
Yes, the primary benefit of hashCode is fast lookup.
Imagine a library with numerous rows of bookshelves. If you're looking for a particular book, it would be a lot faster if you knew what particular row of shelves to look in, rather than searching through the entire library. Of course, when you've found the correct shelves (indicated by hashCode), there might be other books on those shelves (because different objects might return the same hashCode), but you've narrowed your search to a much smaller region.
|
"We're kind of on the level of crossword puzzle writers... And no one ever goes to them and gives them an award." ~Joe Strummer
sscce.org
|
|
Philip Heller
author
Ranch Hand
Joined: Oct 24, 2000
Posts: 119
|
|
You're right, hash codes are used for efficient storage in collections. But as for sorting, only collections whose names begin with "Tree" sort their elements. See Chapter 8 of "Complete Java 2 Certification" for more.
-- Phil
|
Consultant to SCJP team.<br />Co-designer of SCJD exam.<br />Co-author of "Complete Java 2 Certification Study Guide".<br />Author of "Ground-Up Java".
|
|
Arulkumar Gopalan
Ranch Hand
Joined: Oct 13, 2003
Posts: 104
|
|
|
boolean equals(Object o) method also uses the hashing mechanism to compare object references.
|
Anbudan & Mahalo,<br />Arul<br /> <br />-Not a sun certified Java professional :-)
|
|
 |
|
|
subject: hashCode() used for searching is right?
|
|
|
0
