npmpackage.info

Gathering detailed insights and metrics for fast-fifo

Other packages similar to fast-fifo

@types/fast-fifo

1.3.0

TypeScript definitions for fast-fifo

@tsdotnet/queue

1.2.8

A simple and fast FIFO collection for enqueuing and dequeuing items.

@joakimstai/q

0.1.2

A tiny, simple and fast FIFO queue.

train

4.4.1

Train a fast (FIFO) queue with a rollback mechanism. Behind the scenes it uses 2 arrays to simulate and perform fast shifting and popping operations without using the Array#shift() method..

Gathering detailed insights and metrics for fast-fifo

fast-fifo

A fast fifo implementation similar to the one powering nextTick in Node.js core

1.3.2

MIT

JavaScript

394,250,789 4.1

Installations

npm install fast-fifo

Pull Requests

Open

0

Total

2

Closed

1

Merged

1

Issues

Open

1

Total

2

Closed

1

Releases

Unable to fetch releases

Developer

mafintosh

Developer Guide

BETA

Module System

CommonJS

Min. Node Version

Typescript Support

No

Node Version

18.16.0

NPM Version

9.5.1 Statistics

62 Stars

17 Commits

4 Forks

3 Watching

1 Branches

2 Contributors

Updated on 01 Nov 2024

Languages

JavaScript (100%)

Total Downloads

Cumulative downloads

Total Downloads

394,250,789

Last day

3.1%

1,660,431

Compared to previous day

Last week

6.6%

8,747,608

Compared to previous week

Last month

11%

35,681,016

Compared to previous month

Last year

431.2%

325,734,851

Compared to previous year

Daily Downloads

Weekly Downloads

Monthly Downloads

Yearly Downloads

Dev Dependencies

standard brittle

Versions

fast-fifo

A fast fifo implementation similar to the one powering nextTick in Node.js core

npm install fast-fifo

Uses a linked list of growing fixed sized arrays to implement the FIFO to avoid allocating a wrapper object for each item.

Usage

1const FIFO = require('fast-fifo')
2
3const q = new FIFO()
4
5q.push('hello')
6q.push('world')
7
8q.shift() // returns hello
9q.shift() // returns world

API

`q = new FIFO()`

Create a new FIFO.

`q.push(value)`

Push a value to the FIFO. value can be anything other than undefined.

`value = q.shift()`

Return the oldest value from the FIFO.

`q.clear()`

Remove all values from the FIFO.

`bool = q.isEmpty()`

Returns true if the FIFO is empty and false otherwise.

`value = q.peek()`

Return the oldest value from the FIFO without shifting it out.

`len = q.length`

Get the number of entries remaining in the FIFO.

Benchmarks

Included in bench.js is a simple benchmark that benchmarks this against a simple linked list based FIFO.

On my machine the benchmark looks like this:

fifo bulk push and shift: 2881.508ms
fifo individual push and shift: 3248.437ms
fast-fifo bulk push and shift: 1606.972ms
fast-fifo individual push and shift: 1328.064ms
fifo bulk push and shift: 3266.902ms
fifo individual push and shift: 3320.944ms
fast-fifo bulk push and shift: 1858.307ms
fast-fifo individual push and shift: 1516.983ms

YMMV

License

MIT

Branch-Protection

Determines if the default and release branches are protected with GitHub's branch protection settings.

0

SAST

Determines if the project uses static code analysis.

Score

4.1

/10

Last Scanned on 2024-11-18

The Open Source Security Foundation is a cross-industry collaboration to improve the security of open source software (OSS). The Scorecard provides security health metrics for open source projects.

Learn More