Implementation of the hash function in a HashMap
-
Hi, I was wondering if anyone knew whether the implementation of the hash function in a hash map is the same as in a hash table, i.e. are the same options available for a hash map. In a hash table, there are several different ways to implement the hash function such as the multiplicative method, the division method, univeral hashing, double-hashing etc. Also, I understand that Hash tables were deprecated in Java 5 and are succeeded by ConcurrentHashMap . ConcurrentHashMap introduces multiple locks but are the hash functions implemented the same way as a HashMap or a HashTable. This is likely a question for Oracle or for a university professor or someone who has worked at companies like Microsoft or Oracle. If anyone knows please share. Thanks, Saad