hashmap-class

Implementation of a hashmap data structure, i.e. an unordered
collection of key-value pairs:
$$f: keys -&gt; values.$$
Hashmaps only to store unique keys-value pairs. For a data structure
where multiple identical keys can be stores see <code><a rd-options="" href="/link/multimap?package=datastructures&version=0.2.9" data-mini-rdoc="datastructures::multimap">multimap</a></code>.
Inserting and accessing is amortized in O(1).
<code>hashmap</code> wraps a C++ <code>unordered_map</code> using Rcpp modules.
Also see <code><a href="/link/?package=datastructures&version=0.2.9" bimap'="" data-mini-rdoc="datastructures::"></a>'>bimap</code> for mappings in both ways.

Implementation of advanced data structures such as hashmaps,
heaps, or queues. Advanced data structures are essential
in many computer science and statistics problems, for example graph
algorithms or string analysis. The package uses 'Boost' and 'STL' data
types and extends these to R with 'Rcpp' modules.

Simon Dirmeier

datastructures

Implementation of Core Data Structures

hashmap-class function

<dl class="dl-horizontal">
<dt><code>.map</code></dt><dd><code>C++</code> object representing a mapping</dd></dl><dt><code>.key.class</code></dt><dd>the class of the keys</dd>

Slots

Implementation of a hashmap data structure, i.e. an unordered
collection of key-value pairs:
$$f: keys -&gt; values.$$
Hashmaps only to store unique keys-value pairs. For a data structure
where multiple identical keys can be stores see <code><a rd-options='' href='multimap'>multimap</a></code>.
Inserting and accessing is amortized in O(1).
<code>hashmap</code> wraps a C++ <code>unordered_map</code> using Rcpp modules.
Also see <code><a href='<a href='bimap'></a>'>bimap</a></code> for mappings in both ways.

hashmap-class: Hashmap class

Description

Arguments

Slots

See Also