A JavaScript algorithm base class library.
Fastest, most accurate & effecient user agent string parser, uses Browserscope's research for parsing
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
JWA implementation (supports all JWS algorithms)
Implementation of JSON Web Signatures
Finite key-value map using the Least Recently Used (LRU) algorithm where the most recently used objects are keept in the map while less recently used items are evicted to make room for new ones.
LRU Queue
A spec-conformant JavaScript parser for the HTML5 srcset attribute
fast string hashing function
Compare alphanumeric strings the same way a human would, using a natural order algorithm
Detect the indentation of code
Simple “Least Recently Used” (LRU) cache
Sniff the encoding from a HTML byte stream
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
The lightest signal library.
TimSort: Fast Sorting for Node.js
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
An WebAssembly implementation of Speex audio resampler
Bresenham's line algorithm
Check and get file hashes
Password hashing and verification for node.js
An efficient equality algorithm for React Native inline styles
An implementation of the Unicode Line Breaking Algorithm (UAX #14)
Fast JavaScript array sorting by implementing Python's Timsort algorithm