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

fifo

v2.4.1

Published

FIFO queue implemented using a double linked-list

Downloads

55,642

Readme

fifo

FIFO queue implemented using a double linked-list

npm install fifo

build status

Usage

var fifo = require('fifo')()

fifo.push('hello')
fifo.push('world')

console.log(fifo.first()) // prints hello
console.log(fifo.last())  // prints world

console.log(fifo.shift()) // prints hello
console.log(fifo.shift()) // prints world

var node = fifo.push('meh')

fifo.remove(node)     // remove 'meh' from the stack
fifo.unshift('hello') // insert at the beginning

fifo uses a linked list behind the scene so all list manipulation methods run in O(1)

API

fifo = FIFO()

Create a new instance

fifo.node

Contains the first node on the list.

fifo.length

Number of nodes in the list.

node = fifo.push(value)

Push a new value to the end of the list. Returns a node that contains this value. The value can be accessed by accessing node.value.

value = fifo.shift()

Removes the first node and returns the value

value = fifo.pop()

Removes the last node and returns the value

value = fifo.remove(node)

Removes the node and returns the value

fifo.add(node)

Readds a node. Should only be done with a node that has been removed.

value = fifo.first()

Peek at the first value

value = fifo.last()

Peek at the last value

node = fifo.unshift(value)

Inserts a value at the beginning of the list

node = fifo.next(node)

Returns the next node relative to the node you pass. If the node was the last node in the list null is returned.

node = fifo.prev(node)

Returns the previous node relative to the node you pass. If the node was the first node in the list null is returned.

fifo.bump(node)

Moves a node to the end of the list

fifo.clear()

Clears the list.

fifo.forEach(fn)

Iterate over all values in the list. Calls the function with value, node.

Iteration

To iterate the list simply use the following for loop

for (var node = fifo.node; node; node = fifo.next(node)) {
  console.log('value is', node.value)
}

Optionally you can call fifo.forEach(fn) which does the above internally.

License

MIT