Search results
1000+ packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
Tiny queue data structure
Measure the difference between two strings using the Levenshtein distance algorithm
- leven
- levenshtein
- distance
- algorithm
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
A structuredClone polyfill
A tiny and fast selection algorithm in JavaScript.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
Fast JavaScript array sorting by implementing Python's Timsort algorithm
TimSort: Fast Sorting for Node.js
The Fisher-Yates (aka Knuth) shuffle for Node.js, with seeding support
binary heap (priority queue) algorithms (ported from Python's heapq module)
Hash a stream of data, then validate
A deterministic object hashing algorithm for Node.js.
turf simplify module
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
[](https://www.npmjs.com/package/levenary) [](https://github.com/tanhauhau/levenary/actions)
- leven
- levenshtein
- distance
- array
- string
- algorithm
- algo
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
A utility library for JavaScript and Typescript.
- algo
- algorithm
- curried
- fp
- functional
- generics
- lodash
- ramda
- stdlib
- toolkit
- ts
- types
- typescript
- underscore
- View more
A fast polyline and polygon clipping library.
Provides boundary functions, (upper-bound and lower-bound).
A JS library for finding optimal label position inside a polygon