dsjslib - A library implementing several standard data structures and utilities, in JavaScript

•    Javascript

---

This is a collection of different data structures and utilities, implemented in JavaScript. Its written and tested using Node.js which is also the target platform.CircularBuffer - A data structure that uses a single, fixed-size buffer as if it were connected end-to-end. When the buffer is filled, new data is written starting at the beginning of the buffer and overwriting the old.

algorithms datastructures ds sort-map data-structures avl avltree trie ternarysearchtrie multiwaytrie skiplist btree binarysearch binarysearchtree sortedmap lru cache eviction maximize least-recently-used loading guava async delay-queue delayqueue priorityqueue heap binaryheap bitset bitarray bitvector circularbuffer ringbuffer graph directed undirected shortest cycle path topological bloomfilter bloom filter

SwiftPriorityQueue - A Generic Priority Queue in Pure Swift

•    Swift

---

SwiftPriorityQueue is a pure Swift (no Cocoa) implementation of a generic priority queue data structure, appropriate for use on all platforms (macOS, iOS, Linux, etc.) where Swift is supported. It features a straightforward interface and can be used with any type that implements Comparable. It utilizes comparisons between elements rather than separate numeric priorities to determine order. Internally, SwiftPriorityQueue uses a classic binary heap, resulting in O(lg n) pushes and pops. It includes in-source documentation, an A* based example maze solving program (for macOS), and unit tests (pull requests are welcome for additional unit tests in particular).

data-structure priority-queue astar-algorithm priorityqueue priority-queues min-heap max-heap

p-queue - Promise queue with concurrency control

•    Javascript

---

Useful for rate-limiting async operations. For example, when interacting with a REST API or when doing CPU/memory intensive tasks.Here we run only one promise at the time. For example, set concurrency to 4 to run four promises at the time.

promise queue enqueue limit limited concurrency throttle throat rate batch ratelimit priority priorityqueue fifo job task async await promises bluebird

TypeScript-STL - The Standard TypeScript/JavaScript Library

•    HTML

---

The Standard JavaScript/TypeScript Library (STL) is a collection of interfaces and classes that are meant to solve common problems. STL provides a set of standard datastructures. They are grouped here by their underlying implementation which usually defines their general field of application.

typescript datastructures doublylinkedlist stack queue heap maxheap minheap priorityqueue

es-collections - An ES6/ES2015 (JavaScript) collections library including Stack, Queue, and PriorityQueue

•    Javascript

---

es-collections is an ES6/ES2015 (JavaScript) collections library including Stack, Queue, and PriorityQueue data structures. Map and Set were added in ES2015. This library adds other frequently used collections with an interface consistent with those additions.

es6 es2015 collection collections stack queue priorityqueue

timerqueue - A priority queue for timed events, written in go.

•    Go

---

The timerqueue package implements a priority queue for objects scheduled to perform actions at clock times. See http://godoc.org/github.com/beevik/timerqueue for godoc-formatted API documentation.

priorityqueue timerqueue timer-queue timer scheduler priority-queue scheduling scheduling-timers

super - Data structures, data types, and algorithms with superpowers! 💪😎

•    Javascript

---

Data structures, data types, and algorithms with superpowers! 💪

super map set string object superpowers data-structures math number array priorityqueue trie queue linkedlist binarytree sorting-algorithms data-types heap types algorithms avltree bubblesort insertionsort mergesort quicksort selectionsort