Binary Index Tree
Find the longest common subsequence.
Parse binary files with a schema into nicely readable objects
A series of functions to map a binary tree to a list
unist utility to recursively walk over nodes, with ancestral information
unist utility to check if a node passes a test
unist utility to visit nodes
TypeScript definitions for serve-index
Binary Search Trees
Knuth shuffle
A algorithm based on minimax search and alpha-beta prune to solve gomoku game.
Implement search on any static website.
Dancing link + Algorithm X
Typescript implementation of queues, such as priority queue and circular queue.
Tree or binary tree printer, print any tree to terminal or debug window
A efficient Sudoku solver and creator.
esast (and estree) utility to visit nodes
hast utility to check if a node is a (certain) element
unist utility to find a node after another node
High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)
Use sign and abs functions in CSS
Fast static spatial index for rectangles
Different binary search tree implementations, including a self-balancing one (AVL)
Rope-based persistent sequence type