||This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. (April 2015)|
In computer science, a bidirectional map, or hash bag, is an associative data structure in which the pairs form a one-to-one correspondence. Thus the binary relation is functional in each direction: can also act as a key to . A pair thus provides a unique coupling between and so that can be found when is used as a key and can be found when is used as a key.
|This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.|