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,
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
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.