SOC Experts Community - Beta
0 like 0 dislike
in General Questions by (5.9k points)

1 Answer

1 like 0 dislike
by (5k points)

In that case you could use Identity HashMap, where different objects with same hash are considered as different based on their identities. 

When two unequal objects have the same hash value, this causes a collision in the hash table, because both objects want to be in the same slot

by (2k points)
Aren't hash values unique for every different file or message ?
by (5.9k points)
Yes they are unique, that's why it is mentioned "in case", and always there would be a exception

SOC Experts - No. 1 Job Oriented Cybersecurity Training Program

View our Courses