multimap-class: Multimap class

Description Slots See Also


Implementation of a multimap data structure, i.e. an unordered collection of key-value pairs:

f: keys -> values.

Multimaps are able to store several identical keys. For a data structure which unique keys, see hashmap. Inserting and accessing is amortized in O(1). hashmap wraps a C++ unordered_multimap using Rcpp modules. Also see bimap for mappings in both ways.



C++ object representing a mapping


the class of the keys

See Also

multimap for creating a new multimap object

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