Find the longest common subsequence.
UnRS Resolver Node API
Fast and almost Gaussian blur by Mario Klingemann
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.
LL(*) lookahead strategy for the Chevrotain parser library
A collection of algorithms and utilities for analyzing and selecting maximally distinct colors. Now includes a unified pickDistinctColors API for easy color selection.
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.
<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
A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.
Implements the WebIDL algorithms for converting to and from JavaScript values
Advanced genetic and evolutionary algorithm library (no web workers fork)
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
<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>
GA Framework
Find the first config file matching a given name in the current directory or the nearest ancestor directory.