JSPM

Deques are a generalization of stacks and queues

Deque

Queue data structure

General purpose and generic read/write buffer implementations with different behaviors/orderings

Javascript utilities

Multifunctional Asynchronous Concurrent Queue

This is an interactive swipeable view stack similar to what we see in Tinder or Quick Pay Cards in BookMyShow. Users can pan left or right on the frontmost view to naviagte to the next view. Data set is looped by defaut.

A lightweight queue package supporting both FIFO (First In First Out) and LIFO (Last In First Out) operations. Features include asynchronous iteration, event emission, and batch processing. The queue dynamically resizes, handles push and get timeouts, and

Build stacks. FIFO and LIFO.

Just the cutest and tiniest queue/deque implementation!

Register a subscription in LIFO stack.

Detect clicks outside of elements

A simple and fast redis based queue

Implementation of stack data structure

Stack.

A queue, for promises.

Stack data structure implementation

``` Stack data structure as npm package This package helps you to simulate the behaviour of a stack. If you are familiar with c++ stacks this has exactly same methods. ```

Last In First Out data structures for JavaScript

Basic Data structures for javascript (and nodejs)

I am a simple man. I don’t need any insane magic stack with thousands of lines of never used methods. I just need a light, easy to use and reliable stack. Do you want the same think? Well nice, because I made one!

LIFO stack with finite history

Last-In First-Out feature tracking Ledger

A stack (LIFO) implementation written in TypeScript.

A Simple Job Manager

A LIFO stack implementation where popping requires a specific counterweight element.

Lifo utils

A native JavaScript implementation of the Stack data structure

Queue data structure implementation

literally just a LIFO stack

Providing limited size stack for JS (& TypeScript).