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-you-js

v2.0.0

Published

This library has a Queue with the following methods: enqueue and dequeue. Enqueue adds item(s) to end of the Queue. Dequeue removes and returns the first item from the beginning of the queue.

Downloads

4

Readme

Queue You JS

Build Status

What is Queue JS?

This library has a Queue with the following methods: enqueue and dequeue. Enqueue adds item(s) to end of the Queue. Dequeue removes and returns the first item from the beginning of the queue.

Why?

Many algorithms use FIFO queues. Although javascript has build in methods for FIFO, the terms seem somewhat cryptic to me. Whenever I needed to add a queue, I found myself searching MDN for the correct array methods. As a result, I decided to write a very simple library / adapter to make working with queues a little easier. Now when I want to use a queue, I can simple install this package.

How to install

Import the package from npm

npm install queue-you-js

Import the package into your project.

Use the Queue

var Queue = require("queue-you-js")
var queue = new Queue();
queue.enqueue("hi");
queue.getItems();

OR

import Queue from 'queue-you-js';
const queue = new Queue();
queue.enqueue("hi");
queue.getItems();

To make a new, empty queue:

const queue = new Queue();

To create a new queue with multiple items:

const queue = new Queue(["item", "item", "more items"]);

Dequeue item:

queue.dequeu();

Peek first item--returns first item without removing it:

queue.peek();

Dequeue item and get it's value:

const firstItem = queue.dequeu();

Enqueue single item (Code below returns array: ["item"]):

queue.enqueue("item")

Enqueue multiple items:

queue.enqueue(["item1", "item2"])

Get items in the queue

queue.getItems()

Also:

queue.items