a Hashmap is a Map data structure. Like a list each item that is stored in a hashmap is stored at a particular index. This index is called a hash and it is generated using a hash function.

Hash functions accept the object to be stored as an argument and generate a number that is unique to it. different hashing functions have different trade-offs. a function that is too sparse will use up more space than required. while one that is not sparse enough will suffer from collisions where objects use the same hash.

External Links Edit

Ad blocker interference detected!

Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.