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.
Fast and almost Gaussian blur by Mario Klingemann
css-line-break ==============
An implementation of the Unicode Line Breaking Algorithm (UAX #14)
get the shasum of a buffer or object
Intl.LocaleMatcher ponyfill
Extends LRU base on hashlru
Generate hashes from javascript objects in node and the browser.
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-blur</h1> <p>Blur 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
<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>
JSON Web Token implementation (symmetric and asymmetric)
Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).
Module version of UZIP.js
Find the first config file matching a given name in the current directory or the nearest ancestor directory.
Types and schema that specs of the Markup languages for markuplint
Resolve package.json exports & imports maps
A JavaScript text diff implementation.
An implementation of the RDF Dataset Canonicalization algorithm in JavaScript
Serialize (encode) HTML character references
Wordcloud layout transform for Vega dataflows.