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

SimpleQueue

v1.0.0

Published

a simple fifo queue

Downloads

124,816

Readme

SimpleQueue

A simple FIFO queue

npm install SimpleQueue

What is this?

There are plenty queues for node, but even those branded as FIFO (first in first out) usually destroy the order. Eg. when mapping over an RSS feeds & doing something with all of the pages, you need to know what element had what position - so I created this little helper.

API

Class: SimpleQueue<T, R>

A simple FIFO queue, delivering items in order.

Type parameters

| Name | Default | Description | | ---- | ------- | ---------------------------------------- | | T | - | Type that is pushed onto the stack. | | R | void | Type that the passed callback maps to. |

Constructors

constructor

+ new SimpleQueue(worker: (element: T, callback: (error: Error | null, result: R) => void) => void, callback: (error: Error | null, result: R, element: T) => void, done?: undefined | () => void, concurrent?: number): SimpleQueue

Defined in index.ts:16

Creates a new FIFO queue.

Parameters:

| Name | Type | Default value | Description | | ------------ | ------------------------------------------------------------------------- | ------------- | ---------------------------------------------------------- | | worker | (element: T, callback: (error: Error | null, result: R) => void) => void | - | Method to call for each child. Args: | | callback | (error: Error | null, result: R, element: T) => void | - | Method to call when an element was processed. | | done? | undefined | () => void | - | Method to call once the stack is cleared. | | concurrent | number | 20 | Number of elements to process in parallel. Defaults to 20. |

Returns: SimpleQueue

Properties

paused

paused: boolean = false

Defined in index.ts:16

Methods

abort

abort(): void

Defined in index.ts:48

Clears the queue (can't stop running processes).

Returns: void


pause

pause(): void

Defined in index.ts:57

Pause the queue execution. Will not stop already in-flight items.

Returns: void


push

push(props: T): void

Defined in index.ts:41

Adds an element to the queue.

Parameters:

| Name | Type | | ------- | ---- | | props | T |

Returns: void


resume

resume(): void

Defined in index.ts:64

Resume the queue execution, and catch up with remaining items.

Returns: void

Example

import SimpleQueue from "SimpleQueue";

const queue = new SimpleQueue(
    (element, callback) => {
        // Set
        setTimeout(() => callback(null, element / 1000), element);
    },
    (err, result, element) => {
        console.log(result);
    },
    () => {
        console.log("done");
    },
    4
);

queue.push(1000);
queue.push(5000);
queue.push(3000);
queue.push(4000);
queue.push(8000);
queue.push(2000);
queue.push(0);

Output:

1, 5, 3, 4, 8, 2, 0, "done"

This takes 9 seconds to run.