Finite map - sellout/data-structure-zoo GitHub Wiki

Also known as an associative array, dictionary, hash, or just “map”, a finite map is an ADT that does exactly what it sounds like – it maps a set of keys to corresponding values. A set can be seen as a finite map where the values are ignored.

A finite map is an associative container it adds the operations [bind](/sellout/data-structure-zoo/wiki/bind), [lookup](/sellout/data-structure-zoo/wiki/lookup), [rebind](/sellout/data-structure-zoo/wiki/rebind), and [unbind](/sellout/data-structure-zoo/wiki/unbind).

implementations