CRAN
dequer 2.0-1
Stacks, Queues, and 'Deques' for R
Released Nov 16, 2017 by Drew Schmidt
Queues, stacks, and 'deques' are list-like, abstract data types. These are meant to be very cheap to "grow", or insert new objects into. A typical use case involves storing data in a list in a streaming fashion, when you do not necessarily know how may elements need to be stored. Unlike R's lists, the new data structures provided here are not necessarily stored contiguously, making insertions and deletions at the front/end of the structure much faster. The underlying implementation is new and uses a head/tail doubly linked list; thus, we do not rely on R's environments or hashing. To avoid unnecessary data copying, most operations on these data structures are performed via side-effects.
Installation
Maven
This package can be included as a dependency from a Java or Scala project by including
the following your project's pom.xml file.
Read more
about embedding Renjin in JVM-based projects.
<dependencies>
<dependency>
<groupId>org.renjin.cran</groupId>
<artifactId>dequer</artifactId>
<version>2.0-1-b8</version>
</dependency>
</dependencies>
<repositories>
<repository>
<id>bedatadriven</id>
<name>bedatadriven public repo</name>
<url>https://nexus.bedatadriven.com/content/groups/public/</url>
</repository>
</repositories>
Renjin CLI
If you're using Renjin from the command line, you load this library by invoking:
library('org.renjin.cran:dequer')
Test Results
This package was last tested against Renjin 0.9.2644 on Jun 1, 2018.