hashmap-class: Hashmap class

Description Slots See Also


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

f: keys -> values.

Hashmaps only to store unique keys-value pairs. For a data structure where multiple identical keys can be stores see multimap. Inserting and accessing is amortized in O(1). hashmap wraps a C++ unordered_map using Rcpp modules. Also see bimap for mappings in both ways.



C++ object representing a mapping


the class of the keys

See Also

hashmap for creating a new hashmap object

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