Find the longest common subsequence.
UnRS Resolver Node API
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`
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)
Node.js final http responder
get the shasum of a buffer or object
Node.js compression middleware
Intl.LocaleMatcher ponyfill
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>
Simple “Least Recently Used” (LRU) cache
node's assert.deepEqual algorithm except for NaN being equal to NaN
<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.
Drizzle Lab CLI
Implements the WebIDL algorithms for converting to and from JavaScript values
Universal bundle analyzer and visualizer that works with most popular bundlers and frameworks.
Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).
JSON Web Token implementation (symmetric and asymmetric)