Simple FIFO queue implementation to avoid having to do shift() on an array, which is slow.
A simple FIFO queue implementation to avoid having to do shift()
on an array, which is slow. It's implemented in the straightforward root -> node1 -> node2 -> etc.
architecture that we all remember from CS 101.
This can typically be used as a drop-in replacement for an array, and it's only 38 lines of code.
npm install tiny-queue
Then:
var Queue = require('tiny-queue');
var queue = new Queue();
queue.push('foo');
queue.push('bar');
queue.shift(); // 'foo'
queue.shift(); //'bar'
queue.length; // 0
queue.shift(); // undefined
The returned Queue object, once instantiated, only supports
four operations:
queue.push()
queue.shift()
queue.slice() // returns a regular Array
queue.length
So it's basically a drop-in replacement for most naïve usages of an array as a queue.
FAQs
Simple FIFO queue implementation to avoid having to do shift() on an array, which is slow.
We found that tiny-queue demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Research
North Korean threat actors linked to the Contagious Interview campaign return with 35 new malicious npm packages using a stealthy multi-stage malware loader.
Research
Security News
The Socket Research Team investigates a malicious Python typosquat of a popular password library that forces Windows shutdowns when input is incorrect.
Product
We’ve redesigned the Socket dashboard with simpler navigation, less visual clutter, and a cleaner UI that highlights what really matters.