Do you need to know if two strings are kind of the same? This package compares two string and tells you if they are similar enough.
small, standalone fuzzy search / fuzzy filter. browser or node
Fuzzy implementation of shallowEqual algoritm
Fast and tiny fuzzy-search utility
Tiny but powerful full-text search engine for browser and Node
Curated collection of data structures for the JavaScript/TypeScript.
Simple fuzzy search
A tiny, simple, fast fuzzy search library
PNG encoder/decoder in pure JS, supporting any bit size & interlace, async & sync with full test suite.
Fuzzy file/directory search and select prompt for inquirer.
A blazing-fast equality comparison utility for a variety of use-cases
small, standalone fuzzy search / fuzzy filter. browser or node
Fuzzy string matching algorithms and utilities, port of the TheFuzz Python library.
Support for representing 64-bit integers in JavaScript
Lightweight fuzzy-search
TypeScript definitions for fuzzy-search
Highly configurable, well-tested, JavaScript-based HTML minifier.
Blazing-fast pixel-by-pixel image comparison with block-based optimization. 1.5x times faster than pixelmatch
An RFC 3986/3987 compliant, scheme extendable URI/IRI parsing/validating/resolving library for JavaScript.
A library implementing different string similarity
A spring that solves your animation problems.
Typescript port of an accurate python Hijri-Gregorian dates converter based on the Umm al-Qura calendar: https://github.com/mhalshehri/hijri-converter
Web API compatible fetch implementation
A inter-process and inter-machine lockfile utility that works on a local or network file system
FFI bindings for the ssdeep library "libfuzzy" for fuzzy hash comparisons
tlsh is a fuzzy matching library, which hashes can be used for similarity comparison. Given a byte stream with a minimum length of 256 bytes, TLSH generates a hash value which can be used for similarity comparisons. Similar objects will have similar hash values which allow for the detection of similar objects by comparing their hash values. The computed hash is 35 bytes long (output as 70 hexadecimal characters). The first 3 bytes are used to capture the information about the file as a whole (length, ...), while the last 32 bytes are used to capture information about incremental parts of the file.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.