Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/mrc-ide/ring

:ring: Ring buffers
https://github.com/mrc-ide/ring

Last synced: about 2 months ago
JSON representation

:ring: Ring buffers

Awesome Lists containing this project

README 

        
# ring



[![Project Status: Active - The project has reached a stable, usable state and is being actively developed.](https://www.repostatus.org/badges/latest/active.svg)](https://www.repostatus.org/#active)

[![R-CMD-check](https://github.com/mrc-ide/ring/actions/workflows/R-CMD-check.yaml/badge.svg)](https://github.com/mrc-ide/ring/actions/workflows/R-CMD-check.yaml)

[![codecov.io](https://codecov.io/github/mrc-ide/ring/coverage.svg?branch=master)](https://app.codecov.io/github/mrc-ide/ring?branch=master)



> Ring buffers in R and C



Ring buffers (or circular buffers) are like arrays that seem circular; data is written and read in a first-in-first-out (FIFO) style, but once allocated subsequent writes do not cause memory allocations.  Circular buffers are useful for collecting and processing data streams or for queues (with a fixed maximum size).  I use them to implement a solver for delay differential equations in [dde](https://github.com/mrc-ide/dde).



This package provides two implementations of ring buffers:



1. `ring_buffer_env`: a pure R ring buffer implemented as double linked list (using environments) that is genuinely a ring.

2. `ring_buffer_bytes`: a ring buffer implemented as an array of bytes with a pair of pointers (in C).  Each "element" of the array can be one or more bytes, but each must have a fixed size.  There are two convenience interfaces:

  * `ring_buffer_bytes_translate`: for cases where a raw->R and R->raw translation functions are provided

  * `ring_buffer_bytes_typed` for cases where each element should correspond to a fixed-length vector of one of R's core numeric-ish types (`logical`, `integer`, `numeric`, `complex`)



Both buffer types can be used from R, and the code underlying `ring_buffer_bytes` can also be used compiled code in other packages using R's `LinkingTo:` support.  A common set of methods is provided, though these do differ in some details.



Both buffer types will refuse to underflow (return elements beyond those that have been written).  The behaviour on overflow can be controlled:



* overwrite old data: (the default), for a fixed-memory FIFO buffer

* grow buffer: expand the buffer geometrically to fit required elements (which will require additional memory allocations and copies)

* throw error: refuse to overflow



Depending on your application, these ring buffers may or may not be faster than manually copying data around in vectors.  The benefit of this package rather than doing it by hand is abstracting away a lot of subtle bookkeeping and keeping an interface that is fairly high level.  However, for C applications, using `ring_buffer_bytes` via the C interface (using `LinkingTo`) is likely to be very fast as it avoids all copies.



See the [reference documentation](https://mrc-ide.github.io/ring/) for details.



## Usage



The main package vignette (`vignette("ring")`) contains an introduction and basic usage.



A second vignette (`vignette("ring_applications")`) describes possible data structures using a ring buffer.



The reference documentation is also available [online](https://mrc-ide.github.io/ring/), or from the package.



## License



MIT © Imperial College of Science, Technology and Medicine



Please note that this project is released with a [Contributor Code of Conduct](https://mrc-ide.github.io/ring/CONDUCT.html). By participating in this project you agree to abide by its terms.