Search results

362 packages found

Glob matching for javascript/node.js. A replacement and faster alternative to minimatch and multimatch.

published 4.0.7 2 months ago
M
Q
P

Bash-like brace expansion, implemented in JavaScript. Safer than other brace expansion libs, with complete support for the Bash 4.3 braces specification, without sacrificing speed.

published 3.0.3 2 months ago
M
Q
P

Fill in a range of numbers or letters, optionally passing an increment or `step` to use, or create a regex-compatible range with `options.toRegex`

published 7.1.1 2 months ago
M
Q
P

Find semver versions in a string: `unicorn v1.2.3` → `1.2.3`

published 6.0.0 3 months ago
M
Q
P

Fastest Levenshtein distance implementation in JS.

published 1.0.16 2 years ago
M
Q
P

The exhaustive Pattern Matching library for TypeScript.

published 5.2.0 a month ago
M
Q
P

Pass two numbers, get a regex-compatible source string for matching ranges. Validated against more than 2.78 million test assertions.

published 5.0.1 5 years ago
M
Q
P

Measure the difference between two strings using the Levenshtein distance algorithm

published 4.0.0 3 years ago
M
Q
P

Fast, minimal glob matcher for node.js. Similar to micromatch, minimatch and multimatch, but complete Bash 4.3 wildcard support only (no support for exglobs, posix brackets or braces)

published 1.2.13 6 years ago
M
Q
P

Traverse object hierarchies using matching and callbacks.

published 19.0.5 9 months ago
M
Q
P

Returns true if a filepath is a windows UNC file path.

published 1.0.0 7 years ago
M
Q
P

Regular expression for matching semver versions

published 4.0.5 2 years ago
M
Q
P

a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm

published 6.0.1 10 months ago
M
Q
P

Regular expression for testing if a file path is a windows UNC file path. Can also be used as a component of another regexp via the `.source` property.

published 0.1.2 8 years ago
M
Q
P

Supersonic reverse matching engine

published 4.3.0 10 months ago
M
Q
P

Matches a given phrase to the best match in a database and determines the wildcards using a slot filler. This is like a regex, but much more flexible for phrase matching and alignment.

published 1.0.18 5 years ago
M
Q
P

Simple wildcard matching

published 5.0.0 3 years ago
M
Q
P

Patient Identification and Matching based on Blue Button data

published 2.2.6 3 months ago
M
Q
P

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

published 1.1.6 6 years ago
M
Q
P

Node.js bindings for faiss

published 0.5.1 9 months ago
M
Q
P