Low-level module resolution algorithm for Bare

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`

Fast and almost Gaussian blur by Mario Klingemann

Martinez polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor

css-line-break ==============

An implementation of the Unicode Line Breaking Algorithm (UAX #14)

LL(*) lookahead strategy for the Chevrotain parser library

Intl.LocaleMatcher ponyfill

A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.

get the shasum of a buffer or object

Types and schema that specs of the Markup languages for markuplint

node's assert.deepEqual algorithm except for NaN being equal to NaN

Extends LRU base on hashlru

Generate hashes from javascript objects in node and the browser.

Pure JavaScript crypto implementation using noble-hashes for otplib

Implements the WebIDL algorithms for converting to and from JavaScript values

JSON Web Token implementation (symmetric and asymmetric)