Results for double-ended-queue

Extremely fast double-ended queue implementation

TypeScript definitions for double-ended-queue

A simple double ended queue datastructure

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

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.

Wrapper package for double-ended-queue

very fast double-ended queue, stack and circular buffer

Double Ended Queue Datastructure - ordered collection with optimized access from its endpoints

Double Ended Queue data structure

yet another double-ended queue.

A simple double-ended queue.

Double Ended Queue Data Structure - Vasile Sambor

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.

Deques are a generalization of stacks and queues (the name is pronounced “deck” and is short for “double-ended queue”).

High-performance Deque (Double-Ended Queue) for DSA practice with O(1) operations

STL-style data structures and algorithms for TypeScript: Vector, Stack, Queue, Deque (double-ended queue), List, PriorityQueue, Map, Set, sort, binarySearch, graph utilities. Use like C++ STL.

Double Ended Queue with O(1) performance and array-like api

An autotracked implementation of a double-ended queue, implemented as a ring-buffer backed by a native JavaScript array.

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

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

Check if a stream has ended

High-performance Deque (Double-Ended Queue) for DSA practice with O(1) operations

High-performance Deque (Double-Ended Queue) for DSA practice with O(1) operations

Tiny queue data structure