yocto-queue

What is yocto-queue?

The yocto-queue npm package is a minimalistic queue with an array-like interface. It is designed to be a tiny, performant FIFO (First In, First Out) queue implementation for managing a list of items in a sequential order.

What are yocto-queue's main functionalities?

Enqueue

Adds elements to the end of the queue.

const Queue = require('yocto-queue');
const queue = new Queue();
queue.enqueue('unicorn');
queue.enqueue('rainbow');

Dequeue

Removes and returns the first element from the queue.

const Queue = require('yocto-queue');
const queue = new Queue();
queue.enqueue('unicorn');
queue.enqueue('rainbow');
const firstItem = queue.dequeue();

Clear

Clears the queue.

const Queue = require('yocto-queue');
const queue = new Queue();
queue.enqueue('unicorn');
queue.enqueue('rainbow');
queue.clear();

Size

Returns the number of elements in the queue.

const Queue = require('yocto-queue');
const queue = new Queue();
queue.enqueue('unicorn');
queue.enqueue('rainbow');
const size = queue.size;

Peek

Returns the first element in the queue without removing it.

const Queue = require('yocto-queue');
const queue = new Queue();
queue.enqueue('unicorn');
queue.enqueue('rainbow');
const firstItem = queue.peek();

Other packages similar to yocto-queue

p-queue

A promise queue with concurrency control, useful for rate-limiting asynchronous (Promise-returning) functions. It is more feature-rich than yocto-queue, offering concurrency control, task prioritization, and more.

fastq

A fast, in-memory work queue. This package is similar to yocto-queue but is tailored for asynchronous task processing and supports worker functions and concurrency.

bee-queue

A simple, fast, robust job/task queue for Node.js, backed by Redis. It is designed for high-performance and reliability, and it is more complex than yocto-queue, supporting job events, retries, and more.

bottleneck

A powerful rate limiter that makes throttling easy. This package is more advanced than yocto-queue, providing features like clustering, Redis support, and priority jobs.

async.queue

Part of the async utility module, async.queue provides a queue implementation that works with asynchronous tasks. It is more versatile than yocto-queue, as it can handle concurrency and has a callback interface.

README

yocto-queue

Tiny queue data structure

You should use this package instead of an array if you do a lot of Array#push() and Array#shift() on large arrays, since Array#shift() has linear time complexity O(n) while Queue#dequeue() has constant time complexity O(1). That makes a huge difference for large arrays.

A queue is an ordered list of elements where an element is inserted at the end of the queue and is removed from the front of the queue. A queue works based on the first-in, first-out (FIFO) principle.

Install

npm install yocto-queue

Usage

import Queue from 'yocto-queue';

const queue = new Queue();

queue.enqueue('🦄');
queue.enqueue('🌈');

console.log(queue.size);
//=> 2

console.log(...queue);
//=> '🦄 🌈'

console.log(queue.dequeue());
//=> '🦄'

console.log(queue.dequeue());
//=> '🌈'

API

queue = new Queue()

The instance is an Iterable, which means you can iterate over the queue front to back with a “for…of” loop. Using the iterator will not remove the items from the queue. If you want that, use drain() instead.

You can also use spreading to convert the queue to an array. Don't do this unless you really need to though, since it's slow.

.enqueue(value)

Add a value to the queue.

.dequeue()

Remove the next value in the queue.

Returns the removed value or undefined if the queue is empty.

.peek()

Get the next value in the queue without removing it.

Returns the value or undefined if the queue is empty.

.drain()

Returns an iterator that dequeues items as you consume it.

This allows you to empty the queue while processing its items.

If you want to not remove items as you consume it, use the Queue object as an iterator.

.clear()

Clear the queue.

.size

The size of the queue.

Related

• quick-lru - Simple “Least Recently Used” (LRU) cache