JSPM

Found 17 results for LIFO

stack-lifo

Javascript implementation of a stack (LIFO) data structure

  • v0.1.6
  • 64.59
  • Published

ts-data.stack

The Stack (LIFO) data structure in TypeScript.

  • v1.0.6
  • 45.80
  • Published

queue-typed

Queue data structure

  • v2.0.4
  • 41.47
  • Published

peela

Peela a tiny (LIFO) stack.

  • v1.3.3
  • 40.02
  • Published

in-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

  • v1.2.3
  • 21.94
  • Published

@suptxt/quickset

A fast and performant *Least Frequently Used* (LFU) sorted set implementation for working with reasonably sized integers (unsigned). Trades memory for performance, optimised for frequently updating and counting a relatively small set of integers (integer

  • v0.4.6
  • 15.82
  • Published

fixed-size-lifo

A trivial fixed size LIFO (stack) data structure in Javascript that can (optionally) be plugged to overflow in some other data structure.

  • v0.0.12
  • 15.06
  • Published

pique

Promise Queue Library

  • v1.0.0
  • 13.56
  • Published

simple-node-memory-cache

In-memory object cache written in typescript for Node that supports multiple eviction strategies.

  • v1.0.4
  • 12.44
  • Published

ng-datastorage

HTML5 LocalStorage Manager and Data Structures for Angular 2

  • v0.0.1
  • 9.02
  • Published

ts-data.queue

The Queue (FIFO) data structure in TypeScript.

  • v1.0.1
  • 8.64
  • Published

basic-stack

A lightweight, generic stack library designed for efficiency and clarity.

  • v1.0.1
  • 0.00
  • Published

@behrad/stack

A simple javascript stack

    • v1.1.1
    • 0.00
    • Published

    @caelus-dts/stack

    A TypeScript implementation of a stack data structure following the LIFO (Last-In, First-Out) principle

    • v0.1.0
    • 0.00
    • Published