R6 Reference Class Based Data Structures
Provides reference classes implementing some useful data structures.
The package implements these data structures by using the reference class R6.
Therefore, the classes of the data structures are also reference classes which means that their instances are passed by reference.
The implemented data structures include stack, queue, double-ended queue, doubly linked list, set, dictionary and binary search tree.
See for example <https://en.wikipedia.org/wiki/Data_structure> for more information about the data structures.
R6DS version 1.1.0 (Red DS)
R6DS stands for R6 class based Data Structures. The package provides reference classes implementing some useful data stuctures.
How to install
You can install the development version from GitHub
provided that the package “devtools” has been installed beforehand.
After installing the package, you need to load (attach better say) it by running the code
You can first check the information and the current version number by running
version() #> R6DS version 1.1.0 (Red DS)
Then you can take a look at all the available functions and data in the package
ls( grep("R6DS", search()) ) #>  "RBST" "RDeque" "RDict" "RDLL" "RQueue" "RSet" "RStack" #>  "version"
Now you can dive deeply into the package by reading the manual
Functions in R6DS
|RSet||The RSet reference class|
|RStack||The RStack reference class|
|R6DS||R6DS: provides reference classes implementing some useful data stuctures.|
|RBST||The RBST reference class|
|version||Show the version number of some information.|
|RDict||The RDict reference class|
|RQueue||The RQueue reference class|
|RDLL||The RDLL reference class|
|RDeque||The RDeque reference class|
Last month downloads
|Packaged||2019-05-13 00:56:43 UTC; yyang|
|Date/Publication||2019-05-14 14:00:12 UTC|
Include our badge in your README