hash tables the keys associated with values in map are typically thought of as "addressesfor those values examples of such applications include compiler' symbol table and registry of environment variables both of these structures consist of collection of symbolic names where each name serves as the "addressfor properties about variable' type and value one of the most efficient ways to implement map in such circumstances is to use hash table althoughas we will seethe worst-case running