@undercut/node-10
Lazy data processing, pipelines, and language utilities built around native JS features and protocols. Precompiled for Node.js >= 10.13.
Lazy data processing, pipelines, and language utilities built around native JS features and protocols. Precompiled for Node.js >= 10.13.
Lazy data processing, pipelines, and language utilities built around native JS features and protocols. Precompiled for browsers.
Map, but extended to be bidirectional. Values will stay unique by deleting previous keys. Also a 'strict' version, which throws on duplicates instead, and a 'silent' version, which ignores assignments of existing values.
An implementation of a two or three-dimensional Vector.
An implementation of LinkedList data structure.
An implementation of MaxHeap data structure.
An implementation of MinHeap data structure.
An implementation of PriorityQueue data structure.
An implementation of Queue data structure.
An implementation of Stack data structure.
An implementation of DisjointSet data structure.
An implementation of Graph data structure.
An implementation of abstract Heap class.
算法第4版 代码Typescript实现
Data Structure & Algorithm library written with Typescript
Standard AVL tree
Simple and Efficient Cache Implementation for TypeScript
A fixed-size auto-overwriting stack.
Standard data structure
Helper for working with data structures as Map, Set and Object in JavaScript