npm 包搜索

An implementation of the Unicode grapheme cluster breaking algorithm (UAX #29)

Implementation of the HTML encoding sniffer algo, with stream support

An implementation of the Unicode Line Breaking Algorithm (UAX #14)

Measure the difference between two strings using the Levenshtein distance algorithm

Do fuzzy matching using FZF algorithm in JavaScript

An env-agnostic serializer and deserializer with recursion ability and types beyond JSON, based on the HTML structured clone algorithm.

A port of the Brotli compression algorithm as used in WOFF2

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

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

Basic sort algorithm that has similar behavior to Array.prototype.sort for null and undefined, but also allows sorting by an object property.

JWA implementation (supports all JWS algorithms)

A cross-browser, numerically stable algorithm to add floats accurately

**Note:** while this plugin doesn’t shorten the output in any way, it does optimize it for repetition-based compression algorithms such as gzip.

Algorithms to help you parse CSS from an array of tokens.

node's assert.deepEqual algorithm except for NaN being equal to NaN

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.

Compare alphanumeric strings the same way a human would, using a natural order algorithm

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

A tiny implementation of the Levenshtein edit distance algorithm.

Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).

ASN.1 schema for RSA keys and algorithms defined in RFC 8017.

A fully-featured and blazing-fast JavaScript API client to interact with Algolia API.

Layout algorithms for visualizing hierarchical data.

Locate modules using the Node resolution algorithm, for using third party modules in node_modules

A minimal algorithm for computing Levenshtein distance in JavaScript.

The "Levenshtein Distance" algorithm

Fuzzy implementation of shallowEqual algoritm

LZ-based compression algorithm

Compare objects and return whether they are equal according to a recursive equality algorithm. This module is around 6 - 9% faster then similiar modules. Works for both NodejS and the browser.

Finite key-value map using the Least Recently Used (LRU) algorithm where the most recently used objects are keept in the map while less recently used items are evicted to make room for new ones.