The fastest javascript implementation of a double-ended queue. Maintains compatability with deque. 

The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.

salakar

denque

The fastest javascript implementation of a double-ended queue. Maintains compatability with deque.

Error

Ignore

Warn

License

Maintenance

Miscellaneous

Quality

Supply chain risk

Vulnerability

Admins only

Organization members

Dashboard

<upgradeLink>Upgrade</upgradeLink> to access this feature

About

Blog

Socket CLI

Customers

Socket Dependency Search

Docs

Socket for GitHub

Love

Impersonation Mode Active

Update your browser to the latest version for the best experience.

Your web browser is outdated

Use another browser for the best experience.

Your web browser is unsupported

{{count, number}} commits last two months

{{count, number}} critical severity alert

{{count, number}} critical severity alerts

{{count, number}} dependency vulnerability

{{count, number}} dependency vulnerabilities

{{count, number}} development dependencies

{{count, number}} transitive dependencies

{{count, number}} version published last month

{{count, number}} versions published last month

{{count, number}} version published in last two months

{{count, number}} versions published in last two months

{{count, number}} version published last week

{{count, number}} versions published last week

{{count, number}} version published last year

{{count, number}} versions published last year

Socket undergoes annual SOC2 Type II audits. Socket customers can request a copy of the full SOC2 Type II report.

Allows organization owners and admins to access detailed records of actions taken by members of their organization, complete with timestamps.

Prevent compromised packages from infiltrating your supply chain by monitoring for changes in real-time.

Join our Discord community to get help from Socket engineers and other Socket users.

Compare millions of open source packages on socket.dev

Detect malicious code and risky behavior (e.g. network) in your dependencies using "deep package inspection"

All data is encrypted in transit and at rest using industry standard encryption algorithms.

Get a dedicated Socket account manager and access to Socket’s Customer Success team.

Get dedicated support from Socket engineers via email and Slack.

"Shift left" with the Socket Chrome extension and give intervene early, before developers choose risky or low quality dependencies.

Catch developers using risky dependencies and give them a "speed bump" to encourage good behavior

Install the Socket GitHub app to receive real-time dependency scanning and reports with every pull request.

Integrate Socket into your GitHub SCM to prevent risky dependencies from being installed.

Socket scans for vulnerabilities in your dependencies, including CVEs, security advisories, and more.

Socket supports dependencies in many languages, with most popular ecosystems coming in 2024. We've got you covered no matter what languages you use.

Enforce license policies across your organization

Receive a Microsoft Teams message to the channel of your choice anytime Socket runs a new analysis, has a new finding, or a policy has changed.

Get help migrating from Socket's free plan to Socket's paid plans.

Run Socket on-premises or in your own cloud environment.

Query for any dependency (at any version) across your entire organization

Integrate Socket into your CI/CD pipeline to prevent risky dependencies from being deployed to production.

Analyze an entire project to find supply chain risks

Tag projects to organize and filter your projects

Restrict access based on the roles of individual users within an organization.

Receive a Slack message to the channel of your choice anytime Socket runs a new analysis, has a new finding, or a policy has changed.

Socket is SOC2 Type II compliant and undergoes annual audits.

The Socket CLI allows teams to prevent risky dependencies from being installed, and to get dependency insights from the command line.

Socket supports SAML SSO for single sign-on and identity management.

Integrate Socket into your VS Code IDE to prevent risky dependencies from being installed.

Get a POST request anytime Socket runs a new analysis, has a new finding, or a policy has changed.

Socket will analyzed your SBOMs up to a maximum number of dependencies.

API that allows you to analyze a project, lookup package scores and alerts, and more.

Create API tokens to authenticate with the Socket API and CLI.

The number of developers in your team. A developer is someone who made a commit to your organization's repositories scanned by Socket in the past month.

Use Socket to protect your private repositories.

Socket is always free for open source projects.

Socket retains all reporting data for 3 months, 1 year, or a custom term of your choice.

Access the threat feed that powers Socket.

Unlimited scale, self-hosting, and priority support for large teams.

For open-source projects, individuals, and small teams.

For growing teams with enhanced scale, security, and support.

There is a package with a similar name that is downloaded much more often.

There are packages with similar names that are downloaded much more often.

This may not be the package you want!

Instance

Alert Locations

Package

The {{ecosystem}} package {{- packageName}} receives a total of <strong>{{numWeeklyDownloadCount, number}}</strong> weekly downloads. As such, {{- packageName}} popularity was classified as <strong>{{popularity}}</strong>.

Is {{- packageName}} popular?

Is {{- packageName}} safe to use?

Is {{- packageName}} well maintained?

What is {{- packageName}}?

{{packageDescription}}Version: {{versionString}} was published by {{publisherName}}. Start using Socket to analyze {{- packageName}} and its {{dependencyCount, number}} dependencies to secure your app from supply chain attacks.

Sorry, it seems this package was removed from the registry

Package was removed

This package version has been unpublished, mostly likely due to security reasons

Package version was removed

Provide a detailed description of the malware...

Socket fights vulnerabilities and provides visibility, defense-in-depth, and proactive supply chain protection for JavaScript, Python, and Go dependencies.

Socket - Secure your dependencies. Ship with confidence.

Compare versions

{{- packageName}} - npm Package Compare versions

 * Custom implementation of a double ended queue.

 * This is almost double the performance of petkaantonov's double-ended-queue lib. ¯\_(ツ)_/¯

   * Returns the item at the specified index from the list.

   * 0 is the first element, 1 is the second, and so on...

   * Elements at negative values are that many from the end: -1 is one before the end

   * (the last element), -2 is two before the end (one before last), etc.

    // expect a number or return undefined

    if (i >= len || i < -len) return undefined;

    i = (this._head + i) & this._capacityMask;

   * Returns the first item in the list without removing it.

    if (this._head === this._tail) return undefined;

   * Returns the item that is at the back of the queue without removing it.

   * Return the number of items on the list, or 0 if empty.

    if (this._head === this._tail) return 0;

    if (this._head < this._tail) return this._tail - this._head;

    else return this._capacityMask + 1 - (this._head - this._tail);

   * Add an item at the beginning of the list.

    // const list = this._list = new Array(0);

    // while (list.length < array.length) this._growArray();

    for (let i = 0; i < array.length; i++) this.push(array[i]);

    // this._tail = array.length & this._capacityMask;

    if (fullCopy || this._head > this._tail) {

      for (i = this._head; i < len; i++) newArray.push(list[i]);

      for (i = 0; i < this._tail; i++) newArray.push(list[i]);

      for (i = this._head; i < this._tail; i++) newArray.push(list[i]);

      // copy existing data, head to end, then beginning to tail.

      this._list = this._copyArray(true);

    // head is at 0 and array is now full, safe to extend

    this._capacityMask = (this._capacityMask << 1) | 1;

Object.defineProperty(QueueList.prototype, 'length', {

  "description": "The fastest javascript implementation of a double-ended queue. Maintains compatability with deque.",

    "test": "istanbul cover --report lcov _mocha",

    "coveralls": "cat ./coverage/lcov.info | coveralls",

    "benchmark_thousand": "node benchmark/thousand",

    "benchmark_two_million": "node benchmark/two_million"

    "url": "git+https://github.com/Salakar/denque.git"

    "url": "https://github.com/Salakar/denque/issues"

  "homepage": "https://github.com/Salakar/denque#readme",

[![Coverage Status](https://coveralls.io/repos/github/Salakar/denque/badge.svg?branch=master)](https://coveralls.io/github/Salakar/denque?branch=master)

![Downloads](https://img.shields.io/npm/dt/denque.svg)

[![npm version](https://img.shields.io/npm/v/denque.svg)](https://www.npmjs.com/package/denque)

[![dependencies](https://img.shields.io/david/Salakar/denque.svg)](https://david-dm.org/Salakar/denque)

[![build](https://travis-ci.org/Salakar/denque.svg)](https://travis-ci.org/Salakar/denque)

[![License](https://img.shields.io/npm/l/denque.svg)](/LICENSE)

Extremely fast [double-ended queue](http://en.wikipedia.org/wiki/Double-ended_queue) implementation. Double-ended queues can also be used as a:

- [Stack](http://en.wikipedia.org/wiki/Stack_\(abstract_data_type\))

- [Queue](http://en.wikipedia.org/wiki/Queue_\(data_structure\))

This implementation is currently the fastest available, even faster than `double-ended-queue`, see the [benchmarks](#benchmarks)

Every queue operation is done in constant `O(1)` - including random access from `.peekAt(index)`.

Every queue operation is done at a constant `O(1)` - including random access from `.peekAt(index)`.

- [`new Denque(Array items)`](#new-denquearray-items---denque)

- [`peekAt(int index)`](#peekAtint-index---dynamic)

Creates an empty double-ended queue with initial capacity of 4.

#####`new Denque(Array items)` -> `Denque`

Creates a double-ended queue from `items`.

Push an item to the back of this queue. Returns the amount of items currently in the queue after the operation.

Unshift an item to the front of this queue. Returns the amount of items currently in the queue after the operation.

Pop off the item at the back of this queue.

Note: The item will be removed from the queue. If you simply want to see what's at the back of the queue use [`peekBack()`](#peekback---dynamic) or [`.peekAt(-1)`](#peekAtint-index---dynamic).

If the queue is empty, `undefined` is returned. If you need to differentiate between `undefined` values in the queue and `pop()` return value -

check the queue `.length` before popping.

		@@ -193,7 +193,3 @@ 'use strict';
		_fromArray(array) {
		// const list = this._list = new Array(0);
		// while (list.length < array.length) this._growArray();
		for (let i = 0; i < array.length; i++) this.push(array[i]);
		// console.log(this._list);
		// this._tail = array.length & this._capacityMask;
		}
		@@ -234,3 +230,3 @@
		this._tail = this._list.length;
		// console.log(this._list.length);

		this._list.length *= 2;
		@@ -237,0 +233,0 @@ this._capacityMask = (this._capacityMask << 1) \| 1;

		{
		"name": "denque",
		"version": "1.0.0",
		"version": "1.0.1",
		"description": "The fastest javascript implementation of a double-ended queue. Maintains compatability with deque.",
		@@ -5,0 +5,0 @@ "main": "index.js",

		# DENQUE

		[![Coverage Status](https://coveralls.io/repos/github/Salakar/denque/badge.svg?branch=master)](https://coveralls.io/github/Salakar/denque?branch=master)
		![Downloads](https://img.shields.io/npm/dt/denque.svg)
		[![npm version](https://img.shields.io/npm/v/denque.svg)](https://www.npmjs.com/package/denque)
		[![dependencies](https://img.shields.io/david/Salakar/denque.svg)](https://david-dm.org/Salakar/denque)
		[![build](https://travis-ci.org/Salakar/denque.svg)](https://travis-ci.org/Salakar/denque)
		[![npm version](https://img.shields.io/npm/v/denque.svg)](https://www.npmjs.com/package/denque)
		[![License](https://img.shields.io/npm/l/denque.svg)](/LICENSE)
		@@ -17,3 +16,3 @@

		Every queue operation is done in constant `O(1)` - including random access from `.peekAt(index)`.
		Every queue operation is done at a constant `O(1)` - including random access from `.peekAt(index)`.

		@@ -20,0 +19,0 @@ # Quick Start

Worsened metrics