Martinez polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Latin-script (natural language) parser
The SCANOSS JS package provides a simple, easy to consume module for interacting with SCANOSS APIs/Engine.
Find the longest common subsequence.
UnRS Resolver Node API
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
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)
Detect the direction of text: left-to-right, right-to-left, or neutral
get the shasum of a buffer or object
Checksum utility for node
Intl.LocaleMatcher ponyfill
Extends LRU base on hashlru
Generate hashes from javascript objects in node and the browser.
deterministic git-based versioning for applications
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>
node's assert.deepEqual algorithm except for NaN being equal to NaN
A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.
📦🐈 Fast, reliable, and secure dependency management.
Implements the WebIDL algorithms for converting to and from JavaScript values