Measure the difference between two strings using the fastest JS implementation of the Levenshtein distance algorithm
TimSort: Fast Sorting for Node.js
Tiny queue data structure
Fastest Levenshtein distance implementation in JS.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Hash a stream of data, then validate
binary heap (priority queue) algorithms (ported from Python's heapq module)
The Fisher-Yates (aka Knuth) shuffle for Node.js, with seeding support
turf simplify module
Incremental n-dimensional convex hull algorithm
An algorithm for resolving imports in Sass
A fast polyline and polygon clipping library.
Organize and layout items based on various algorithms
Test for deep equality - Node.js `assert.deepStrictEqual()` algorithm as a standalone module
Provides boundary functions, (upper-bound and lower-bound).
FNV-1a non-cryptographic hash function