Keep a tree trimmed from longer-than-necessary branches
A fast, minimal, memory-efficient diff algorithm on strings, arrays, and typed arrays.
Pure JavaScript crypto implementation using noble-hashes for otplib
Node.js implementation of Valve's crypto
Operation with random numbers for ngraph.*
Path finding in a graph
Import a module lazily
TypeScript definitions for d3-random
Typical random-related functions for JavaScript.
Implementation of the Graham Scan algorithm to calculate a convex hull from a given array of x, y coordinates.
Lazy lists for node
Javascript FNV-1a Hashing Algorithm up to 1024 bits, with highly optimized 32bit and 52bit implementations.
TypeScript definitions for knuth-shuffle-seeded
Fill a polygon with lines
React Component to lazy load images using a HOC to track window scroll position.
Yjs encoding protocols
Constructor for creating arrays filled with pseudorandom values drawn from a nullary PRNG.
Build chainable fluent interfaces the easy way... with a freakin' chainsaw!
Constructor for creating arrays filled with pseudorandom values drawn from a binary PRNG.
Open Node Streams on demand.
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Detect the indentation of code
URL and cookie safe UIDs
Simple “Least Recently Used” (LRU) cache