Bimap class

Implementation of a bimap data structure, i.e. an unordered collection of key-value pairs. The notable difference to hashmap is that the mapping is not only $$f: keys -> values,$$ but also $$f: values -> keys.$$ Inserting and accessing is amortized in O(1). bimap wraps a boost::bimap using Rcpp modules.

Slots

.map

C++ object representing a mapping

.key.class

the class of the keys

.value.class

the class of the values

See also

bimap for creating a new bimap object