Installations

npm install queue-lit

Pull Requests

Open

0

Total

10

Closed

9

Merged

1

Issues

Open

0

Total

0

Closed

0

Releases

21

v3.0.0

Published on 15 May 2024

v2.0.0

Published on 05 Oct 2023

v1.5.2

Published on 05 Oct 2023

v1.5.1

Published on 03 Oct 2023

v1.5.0

Published on 06 Nov 2022

v1.4.0

Published on 05 Sept 2022

View all 21 releases

Developer

joelvoss

Developer Guide

BETA

Module System

ESM

Min. Node Version

>=18

Typescript Support

Yes

Node Version

20.12.2

NPM Version

10.5.0 Statistics

2 Stars

62 Commits

3 Watching

1 Branches

1 Contributors

Updated on 15 May 2024

Languages

TypeScript (72.64%)

Shell (25.42%)

JavaScript (1.94%)

Total Downloads

Cumulative downloads

Total Downloads

40,110,695

Last day

-5.4%

114,532

Compared to previous day

Last week

2.4%

658,393

Compared to previous week

Last month

8.5%

2,740,365

Compared to previous month

Last year

102.7%

25,193,839

Compared to previous year

Daily Downloads

Weekly Downloads

Monthly Downloads

Yearly Downloads

Dev Dependencies

8

@jvdx/eslint-config @jvdx/prettier-config @types/node prettier typescript vite vite-plugin-dts vitest

Versions

queue-lit

This package is a tiny queue data structure in case you Array#push() or Array#shift() on large arrays very often.
Array#shift() has linear time complexity O(n) while Queue#push() has constant time complexity O(1).

Installation

1$ npm i queue-lit
2# or
3$ yarn add queue-lit

Usage

1import { Queue } from 'queue-lit';
2
3const queue = new Queue();
4
5queue.push('Hello');
6queue.push('World');
7
8console.log(queue.size);
9// => 2
10
11console.log(...queue);
12// => 'Hello World'
13
14console.log(queue.pop());
15//=> 'Hello'
16
17console.log(queue.pop());
18//=> 'World'

API

`queue = new Queue()`

The instance is an Iterable, which means you can iterate over the queue front to back with a for...of loop, or use spreading to convert the queue to an array.

`.push(value)`

Adds one element to the end of the queue and returns the new length of the queue.
This method changes the size of the queue.

`.pop()`

Pop removes the last element from the queue and returns that element.
This method changes the size of the queue.

Returns undefined if the queue is empty.

`.clear()`

Clears the queue and removes all elements.
This method changes the size of the queue.

`.size`

Static method that returns the size of the queue.

Development

(1) Install dependencies

1$ npm i

(2) Run initial validation

1$ ./Taskfile.sh validate

(3) Start developing. See ./Taskfile.sh for more tasks to help you develop.

No vulnerabilities found.

10

Binary-Artifacts

Determines if the project has generated executable (binary) artifacts in the source repository.

10

Dangerous-Workflow

Determines if the project's GitHub Action workflows avoid dangerous patterns.

10

License

Determines if the project has defined a license.

4

Pinned-Dependencies

Determines if the project has declared and pinned the dependencies of its build process.

3

Vulnerabilities

Determines if the project has open, known unfixed vulnerabilities.

0

Maintained

Determines if the project is "actively maintained".

0

Token-Permissions

Determines if the project's workflows follow the principle of least privilege.

0

Code-Review

Determines if the project requires human code review before pull requests (aka merge requests) are merged.

0

CII-Best-Practices

Determines if the project has an OpenSSF (formerly CII) Best Practices Badge.

0

Security-Policy

Determines if the project has published a security policy.

0

Fuzzing

Determines if the project uses fuzzing.

0

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

3

/10

Last Scanned on 2024-11-25

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