Implementation of Core Data Structures

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.


Version 0.2.6

  • Allows to use arbitray data objects for classes
  • Adds lifecycle badge

Version 0.2.5

  • Adds multimap

Version 0.2.4

  • Removes binomial_heap and fibonacci_heap implementations and replaces with heap template class.
  • Adds value method for heaps.
  • Replaces hashs for storing value in heaps with linear search (to make it conformab;e with introduction of data frame and other data structures).

Version 0.2.3

  • Adds handles_value functions for heaps.

Version 0.2.2

  • Adds decrease_key and handle methods for heap.
  • Adds tests for these two methods.
  • Updates vignette.

Version 0.2.1

  • Adds vectorial values for hashmap, fibonacci_heap, binomial_heap, stack and queue
  • Adds more unit tests and examples

Version 0.2

  • Adds binomial_heap and bimap
  • Overhaul to testing suite
  • Introduced abstract super classes: heap, map and deque
  • Constructor methods for classes to replace call to new
  • Removed initialize methods that broke copy construction contract
  • Several fixes

Version 0.1.1

  • Fixes typos in vignette

Version 0.1

  • Basic setup with required files
  • Implementation of hashmap, fibonacci_heap, stack and queue
  • Registration
  • Vignette

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.2.9 by Simon Dirmeier, a year ago

Report a bug at

Browse source code at

Authors: Simon Dirmeier [aut, cre]

Documentation:   PDF Manual  

GPL-3 license

Imports methods, purrr

Depends on Rcpp

Suggests testthat, knitr, styler, rmarkdown, lintr

Linking to Rcpp, BH

System requirements: C++11

See at CRAN