Lifo Packages

Deques are a generalization of stacks and queues

A simple and fast redis based 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.

Implementation of an append-only, capped circular buffer using Redis

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!

Implementation of stack data structure

Last-In First-Out feature tracking Ledger

Last In First Out data structures for JavaScript

A queue, for promises.

LIFO stack with finite history

Basic Data structures for javascript (and nodejs)

Multifunctional asynchronous concurrent queue

Stack data structure implementation

literally just a LIFO stack

Lifo utils

Multifunctional Asynchronous Concurrent Queue

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

Just the cutest and tiniest queue/deque implementation!

Queue data structure implementation

Queue, ArrayQueue. Javascript & Typescript Data Structure.