Uses Levenshtein Distance to find the closest string match or matches in an array

Forked from mozilla/source-map. Parse and consume source maps using a closest match algorithm where exact mappings between generated and original are not found.

Like Array.prototype.find, but for finding the closest match.

Supercharged multi-handler event system with closest-match DOM resolution and QuantumType docs. The most advanced event delegation architecture available.

Return the closest element matching a selector up the DOM tree

Match human-quality input to potential matches by edit distance.

Utilities for finding the closest package.json file

A minimal dom utility toolbelt

A minimal polyfill for Element.closest

Fast and tiny fuzzy-search utility

Find the closest ancestor matching a selector string

A simple fuzzy search algorithm that uses the Levenshtein distance algorithm to find the closest match to a given string.

Compare your item to items in an array and get the closest one.

Find the closest parent that matches a selector.

Read the closest package.json file

Implemets the CIEDE2000 color difference algorithm, conversion between RGB and LAB color and mapping all colors in palette X to the closest or most different color in palette Y based on the CIEDE2000 difference.

Fastest Levenshtein distance implementation in JS.

For a given DOM element, find the first ancestor that matches a given CSS selector.

Match balanced character pairs, like "{" and "}"

Match a Unicode property or property alias to its canonical property name per the algorithm used for RegExp Unicode property escapes in ECMAScript.