Compute the euclidean distance between two vectors
Compute the gcd and solve Bezout's identity using the extended Euclidean algorithm.
fast openSSL-compatible implementation of the Elliptic Curve Digital Signature Algorithm (ECDSA)
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
JWA implementation (supports all JWS algorithms)
Implementation of JSON Web Signatures
Image Quantization Library in **TypeScript** *(MIT Licensed)*
Additional Jest matchers
a glob matcher in javascript
Type safe mocking extensions for jest
extended POSIX-style sprintf
Calculate the influence or weight of points over an area based on their distances.
Type safe mocking extensions for vitest, forked from jest-mock-extended
Detect the indentation of code
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
Extended iterable class, providing lazy array-like methods with automatic async and return/throw forwarding
Simple “Least Recently Used” (LRU) cache
Regular expression to detect an extended-length path.
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Sniff the encoding from a HTML byte stream
The lightest signal library.
Takes a complex (i.e. self-intersecting) geojson polygon, and breaks it down into its composite simple, non-self-intersecting one-ring polygons.
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
Eslint Airbnb Config Extended