Bresenham line drawing algorithm
Bresenham's line algorithm
Bresenham rasterisation algorithms by Alois Zingl
An implementation of the Unicode Line Breaking Algorithm (UAX #14)
css-line-break ==============
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.
An implementation of the Unicode Line Breaking Algorithm (UAX #14)
Fast JavaScript array sorting by implementing Python's Timsort algorithm
LRU Queue
An implementation of the Unicode Line Breaking Algorithm (UAX #14)
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
Determines whether a Node file is a Module (`import`) or a Script (`require`)
The lightest signal library.
A JavaScript text diff implementation.
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
Compare alphanumeric strings the same way a human would, using a natural order algorithm
TimSort: Fast Sorting for Node.js
Parse a JSON string that has git merge conflicts, resolving if possible