bimap-class: Bimap class

In datastructures: Implementation of Core Data Structures

Description

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

datastructures documentation built on Aug. 10, 2020, 5:08 p.m.