npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

simple-in-memory-queue

v1.1.7

Published

A simple in-memory queue, for nodejs and the browser, with consumers for common usecases.

Downloads

260

Readme

simple-in-memory-queue

easily create and consume in-memory queues

install

npm install --save simple-in-memory-queue

use

this library makes it easy to create and use a queue reliably in memory

create a queue

const queue = createQueue({
  order: QueueOrder.FIRST_IN_FIRST_OUT
});

push, peek, and pop

queue.push('a');
queue.push(['b', 'c']);
queue.push(['d', 'e']);

// peek, to view items in the queue without dequeueing them
queue.peek() // ['a']
queue.peek(2) // ['a', 'b']
queue.peek(queue.length) // ['a', 'b', 'c', 'd', 'e]
queue.peek(2, queue.length) // ['c', 'd', 'e]

// pop, to get and dequeue items from the queue
queue.pop() // ['a']
queue.pop() // ['b']
queue.pop(2) // ['c', 'd']

listen to events

queue.on.push.subscribe(({ item }) => console.log(item))
queue.on.peek.subscribe(({ item }) => console.log(item))
queue.on.pop.subscribe(({ item }) => console.log(item))

use with consumers

this library makes it easy to implement common patterns of consuming from queues

debounce consumer

create a queue with a consumer which gets called as soon as

  • the gap between subsequent events is more than gap.milliseconds

usecases

  • consuming sequences of user input
const queue = createQueueWithDebounceConsumer<string>({
  gap: { milliseconds: 100 },
  consumer: ({ items }) => console.log(items),
});

batch consumer

create a queue with a consumer which gets called when either

  • an item in the queue older than threshold.milliseconds milliseconds
  • the number of the items in the queue exceeds a size of threshold.size

usecases

  • consuming queued items in bulk, balancing consumption speed and invocation count
const queue = createQueueWithBatchConsumer<string>({
  threshold: { milliseconds: 100, size: 5 },
  consumer: ({ items }) => console.log(items),
});

resilient remote consumer

create a queue with a consumer which

  • gets called as soon as an item is available, with one item at a time, under a max concurrency specified by threshold.concurrency
  • resiliently handles failures
    • retries errors from the consumer up to threshold.retry times, with a delay.retry delay between retries
    • dequeues items that failed more than the threshold.retry times
  • intelligently handles failures
    • consumes non-delayed items while there are items delayed due to retry
    • pauses consumption of items from the queue when the number of failures in a row exceeds threshold.pause times

usecases

  • resiliently sending requests to remote apis
const queue = createQueueWithResilientRemoteConsumer<string>({
  consumer: ({ item }) => console.log(item),
  threshold: {
    concurrency: 1,
    retry: 3,
    pause: 5,
  },
  delay: {
    retry: 100,
  },
});