Map
(Redirected from Hash Table)
Introduction
A Map is a Set of key-value Pairs. Maps are intended to be used to store and retrieve values by keys.
There are three principle implementations:
- Hash Map: Uses a special algorithm to arrange the values in a vector for constant lookup.
- Tree Map: Stores the key-value pairs in a sorted tree for logarithmic lookup.
- Sequence Map: Stores the key-value pairs in a sequence for linear lookup