graph algorithm
Martinez polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Keep require and import consistent after bundling or transpiling
Text hyphenation in Javascript.
Find the longest common subsequence.
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.
oidc-token-hash validates (and generates) ID Token `_hash` claims such as `at_hash` or `c_hash`
UnRS Resolver Node API
LL(*) lookahead strategy for the Chevrotain parser library
Fast and almost Gaussian blur by Mario Klingemann
css-line-break ==============
An implementation of the Unicode Line Breaking Algorithm (UAX #14)
Primus is a simple abstraction around real-time frameworks. It allows you to easily switch between different frameworks without any code changes.
get the shasum of a buffer or object
Real native events for cypress. Dispatched via CDP.
Extends LRU base on hashlru
Generate hashes from javascript objects in node and the browser.
<div align="center"> <img width="200" height="200" src="https://s3.amazonaws.com/pix.iemoji.com/images/emoji/apple/ios-11/256/crayon.png"> <h1>@jimp/plugin-blur</h1> <p>Blur an image.</p> </div>
node's assert.deepEqual algorithm except for NaN being equal to NaN
Simple “Least Recently Used” (LRU) cache
<div align="center"> <img width="200" height="200" src="https://s3.amazonaws.com/pix.iemoji.com/images/emoji/apple/ios-11/256/crayon.png"> <h1>@jimp/plugin-resize</h1> <p>Resize an image.</p> </div>
A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.
Implements the WebIDL algorithms for converting to and from JavaScript values
Binary Mac OS X Plist (property list) creator.