A Comparison of Dictionary Implementations
Mark P Neyer · 2009
A common problem in computer science is the representation of a mapping between two sets. A mapping f: A → B is a function taking as input a member a ∈ A, and returning b, an element of B. A mapping is also sometimes referred to as a dictionary, because dictionaries map words to their definitions. Knuth [?] explores the