Showing 41-60 of 229 packages
javascript priority-queue
🧬 Collection of JavaScript helper functions and structures
Javascript / Typescript priority queue ( max / min heap )
A priority queue and consumer
with comparator and delete element functionality
JS PriorityQueue
A curated set of essential algorithms and data structures for TypeScript
Priority queue implemented using a heap
Pomelo-collection is the module for basic data structure in Node.JS. The prefix 'pomelo' means the module is build for the open source game server framework [pomelo](http://pomelo.netease.com/).
A priority queue implemented with a binary heap
High-performance d-ary heap priority queue with O(1) item lookup, configurable arity, and min/max heap support
Simple implementation of basic algorithms.
cp-data is a JavaScript library for some common data structures
Exports useful data structures for TypeScript.
Standard Library for Typescript
low level components for transport and scheduling
AssemblyScript-STL (Standard Template Library, migrated from the C++)
Foundation data structures and utilities for spot market trading bookkeeping, backtesting, and algorithmic trading
Promise queue with concurrency control
