Search results
6000 packages found
PostgreSQL-based pub-sub and workqueues. Supports AMQP-like wildcard topics.
Add rxjs observables to the queue and let them be executed sequentially.
a simple ring buffer data structure
Queue dispatcher that sequentially processes incoming items
[![Build Status](https://travis-ci.org/mrmalhotra/@juigorg/reimagined-fishstick.svg?branch=master)](https://travis-ci.org/mrmalhotra/@juigorg/reimagined-fishstick) [![GitHub package version](https://img.shields.io/github/package-json/v/mrmalhotra/@juigorg
- Array.prototype.flat
- jsdiff
- String.prototype.matchAll
- wordwrap
- child
- helpers
- drag
- executable
- variables
- tape
- weakset
- electron
- regular
- Uint8Array
- View more
Deques are a generalization of stacks and queues
ForrestJS service which helps setting up a Fetchq node.
A heap-based implementation of priority queue in javascript with typescript support.
Mutex lock implemented using redis
A TypeScript library providing classic, strongly-typed data structures.
Heap queue algorithm implementation for Typescript based on heapq.py module from CPython
Turn any collection of objects into its own efficient tree or linked list using Symbol
Job processing for AdonisJS
Async queue abstraction build on NodeJS
[![npm version](https://badge.fury.io/js/@zitterorg/aspernatur-pariatur-occaecati.svg)](https://badge.fury.io/js/@zitterorg/aspernatur-pariatur-occaecati) [![downloads count](https://img.shields.io/npm/dt/@zitterorg/aspernatur-pariatur-occaecati.svg)](htt
- speed
- includes
- hash
- getopt
- throat
- copy
- fullwidth
- folder
- Symbol.toStringTag
- sns
- getOwnPropertyDescriptor
- every
- Array
- Iterator
- View more
an opinionated implementation of resque in node
A lightweight and flexible queue management library written in TypeScript. It provides a simple way to create and manage queues, with built-in error recovery and support for custom recovery strategies. Event-driven with event subscriptions.
A lightweight queue package supporting both FIFO (First In First Out) and LIFO (Last In First Out) operations. Features include asynchronous iteration, event emission, and batch processing. The queue dynamically resizes, handles push and get timeouts, and
- queue
- wait
- task
- lineup
- line
- fifo
- lifo
- data-structure
- simple-queue
- in-queue
- batch queue
- data structure
- FIFO
- LIFO
- View more
a simple priority queue data structure
Extend "Axios"; add concurrency limits, retry, etc.