> For the complete documentation index, see [llms.txt](https://zedive.gitbook.io/project-l/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://zedive.gitbook.io/project-l/part-1/basic_data_structure/hashing.md).

# Hashing

Hashing requires space. Hash is fast. Like really fast.

## Map

Map is an abstract data type (ADT).

## HashMap

The java.util.HashMap is a popular implementation of Map interface which holds the data as key-value pairs. HashMap extends AbstractMap class and implements Cloneable and Serializable interfaces. -- pramodbablad

Hash function, compression function, collision handling, load factor and rehashing

## HashSet

In java, it is internally implemented as a HashMap in which the keys are the elements and values are constants.

## SortedMap

TreeMap

## Reference

* Data Structures & Algorithms in Java (Wiley) - Chapter 10
* [How HashMap Works Internally In Java?](http://javaconceptoftheday.com/how-hashmap-works-internally-in-java/) by pramodbablad