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

queue-jobs

v1.0.0

Published

Queue jobs and execute them in parallel or sequentially.

Downloads

12

Readme

Queue-Jobs

A simple in-memory job queue with arbitrary concurrency.

Queue any number of jobs, execute n of them at a time, and by notified when the queue is empty.

Quick usage


const Queue = require('queue-jobs');

const q = new Queue(3); // execute at most 3 jobs concurrently;

for (let i = 0; i < 100; i++ ) {
	q.do( () =>  // make sure your job returns a promise.
		doSomethingSlow(i)
		.then( () => { console.log('slow job done!') })
	);
}

q.whenDone()
.then( () => {
	console.log('all jobs completed!');
})

API

constructor()

new Queue(concurrency: number): Queue

Returns a new job queue that will run jobs with the specified concurrency.

Queue#do()

queue.do( job: () => Promise ): Promise

Schedules a job on the queue. Your job should return a promise; this is how the queue knows when it is finished.

Returns a promise that resolves when your job has been dispatched. This is useful for using in the _write method of a WritableStream implementation.

Queue#doSync()

queue.doAsync( job: () => any ): Promise

Schedules a job on the queue. Your job will be considered to be finished as soon as it returns (the queue won't wait for a returned promise to resolve).

Returns a promise that resolves when your job has been dispatched.

Queue#whenEmpty()

queue.whenEmpty(): Promise

Returns a promise that resolves when the queue has finished all jobs and no jobs remain to process. This only waits for the queue to be completely empty, it does not keep track of the jobs that were schedules when whenEmpty was called. To illustrate:


t = 0;

for (let i = 0; i < 50; i++ ) {
	queue.do( () =>
		doSomethingSlow(i)
		.then( () => {
			t++;
		})
	);
}

queue.whenEmpty()
.then( () => console.log(`t is ${t}`));

for (let i = 50; i < 100; i++ ) {
	queue.do( () =>
		doSomethingSlow(i)
		.then( () => {
			t++;
		})
	);
}

// prints 't is 100';