bimap-class: Bimap class

Description Slots


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.



C++ object representing a mapping


the class of the keys


the class of the values

datastructures documentation built on May 2, 2018, 5:05 p.m.