JSPM

Standard data structure

javascript standard data structure library which benchmark against C++ STL

javascript standard data structure library which benchmark against C++ STL

Python's deque data structure for JavaScript

javascript standard data structure library which benchmark against C++ STL

javascript standard data structure library which benchmark against C++ STL

javascript standard data structure library which benchmark against C++ STL

javascript standard data structure library which benchmark against C++ STL

A collection of TypeScript data structure implementations

javascript standard data structure library which benchmark against C++ STL

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.

Curated collection of data structures for the JavaScript/TypeScript.

javascript data structure that User make fuctional method

Extremely fast double-ended queue implementation

Deques are a generalization of stacks and queues

javascript standard data structure library which benchmark against C++ STL

Double Ended Queue Data Structure - Vasile Sambor

javascript standard data structure library which benchmark against C++ STL

Deque

javascript data structure that User make fuctional method

javascript standard data structure library which benchmark against C++ STL

A performant double-ended queue (deque) implementation in javascript.

javascript standard data structure library which benchmark against C++ STL

Wrapper package for double-ended-queue

Modern, high-performance data structures for JavaScript & TypeScript - inspired by Python's collections module

Data Structures of Javascript & TypeScript. AVLTree, Binary Search Tree, Binary Tree, Tree Multiset, Graph, Heap, Priority Queue, Linked List.

A double-ended priority queue based on min-max heaps.

Double Ended Queue data structure

Simple utilities solution.

Commonly used data structures implemented in one place.

Data structures in JavaScript

Data Structures and Algorithms implemented

Event Collections

Just the cutest and tiniest queue/deque implementation!

STL data structures for JavaScript

A JavaScript package that implements the Double-ended Queue (Deque) data structure with various important methods for efficient data handling.

A slim and efficient in-memory Deque (doubly-ended queue) for Node.js projects, designed with Data-Oriented Design principles and implemented using a cyclic buffer to optimize memory layout through sequential item allocation. A notable real-world use case

spectrum of libraries for different needs

A spiral deque - high performance and dynamic queue size

A simple double-ended queue.

Neat JavaScript collections.

Deque implementation in JavaScript

Curated collection of data structures for the JavaScript language.

A suite of circular data structures, including deques, lists, maps, queues, sets and stacks.

deque datastructure

TypeScript implementations of algorithms and data structures

Collection of promise oriented functions and classes.

JavaScript Data Structures written for Node.js

Data structures and algorithms written in JavaScript with TypeScript types

A simple double-ended queue (deque) implementation in TypeScript

First in, first out data structures for JavaScript

yet another double-ended queue.

no duplicated value in an array

Deque implementation in Typescript/Javascript

Samchon Collection; Elements I/O detectable STL containers

Variable length TypedArray

jest accessibility matching utilities with deque axe