Displaying 1 to 14 from 14 results

Tape - A lightning fast, transactional, file-based FIFO for Android and Java.

  •    Java

A lightning fast, transactional, file-based FIFO for Android and Java. QueueFile is a lightning-fast, transactional, file-based FIFO. Addition and removal from an instance is an O(1) operation and is atomic. Writes are synchronous; data will be written to disk before an operation returns. The underlying file is structured to survive process and even system crashes and if an I/O exception is thrown during a mutating change, the change is aborted.

goque - Persistent stacks and queues for Go backed by LevelDB

  •    Go

Goque provides embedded, disk-based implementations of stack and queue data structures. Motivation for creating this project was the need for a persistent priority queue that remained performant while growing well beyond the available memory of a given machine. While there are many packages for Go offering queues, they all seem to be memory based and/or standalone solutions that are not embeddable within an application.




tinyqueue - The smallest and simplest priority queue in JavaScript.

  •    Javascript

The smallest and simplest binary heap priority queue in JavaScript. Inspired by js-priority-queue by Adam Hooper.

priorityqueuejs - A simple priority queue data structure for Node.js and the browser

  •    Javascript

A simple priority queue data structure for Node.js and the browser. If you just want a pre-built file for using in the web, check the releases section.


ringbufferjs - A simple ring buffer data structure for Node.js and the browser

  •    Javascript

A simple ring buffer data structure for Node.js and the browser. Initializes a new empty RingBuffer with the default capacity (50).

js-symbol-tree - Turn any collection of objects into its own efficient tree or linked list using Symbol

  •    Javascript

Turn any collection of objects into its own efficient tree or linked list using Symbol. This library has been designed to provide an efficient backing data structure for DOM trees. You can also use this library as an efficient linked list. Any meta data is stored on your objects directly, which ensures any kind of insertion or deletion is performed in constant time. Because an ES6 Symbol is used, the meta data does not interfere with your object in any way.

queue-fifo - Javascript implementation of a queue data structure.

  •    Javascript

This is a javascript implementation of a queue data structure. A queue data structure models the notion of 'First in First Out', or FIFO— image the line at the grocery store. The first item to be removed from a queue is the first item placed in the queue. Basically, the order in which items are placed in the queue matters.

data-structures - Fast, light and hassle-free JavaScript data structures, written in CoffeeScript.

  •    Javascript

Fast, light and hassle-free JavaScript data structures, written in CoffeeScript. Alternatively, you can directly use the compiled JavaScript version in the "distribution" folder. It's always in sync with the CoffeeScript one.

limited-request-queue - Interactively manage concurrency for outbound requests.

  •    Javascript

Interactively manage concurrency for outbound requests. Note: for use in a web browser, you will likely need an ES2015/ES6 transpiler for maximum coverage.