yrik 2fd3c19a01 提交 %!s(int64=4) %!d(string=hai) anos
..
test eec7f449c9 first commit %!s(int64=4) %!d(string=hai) anos
.editorconfig eec7f449c9 first commit %!s(int64=4) %!d(string=hai) anos
.jshintignore eec7f449c9 first commit %!s(int64=4) %!d(string=hai) anos
.jshintrc eec7f449c9 first commit %!s(int64=4) %!d(string=hai) anos
.npmignore eec7f449c9 first commit %!s(int64=4) %!d(string=hai) anos
CHANGELOG.md eec7f449c9 first commit %!s(int64=4) %!d(string=hai) anos
LICENSE eec7f449c9 first commit %!s(int64=4) %!d(string=hai) anos
README.md eec7f449c9 first commit %!s(int64=4) %!d(string=hai) anos
index.js eec7f449c9 first commit %!s(int64=4) %!d(string=hai) anos
package.json 2fd3c19a01 提交 %!s(int64=4) %!d(string=hai) anos

README.md

fuzzysearch

Tiny and blazing-fast fuzzy search in JavaScript

Fuzzy searching allows for flexibly matching a string with partial input, useful for filtering data very quickly based on lightweight user input.

Demo

To see fuzzysearch in action, head over to bevacqua.github.io/horsey, which is a demo of an autocomplete component that uses fuzzysearch to filter out results based on user input.

Install

From npm

npm install --save fuzzysearch

fuzzysearch(needle, haystack)

Returns true if needle matches haystack using a fuzzy-searching algorithm. Note that this program doesn't implement levenshtein distance, but rather a simplified version where there's no approximation. The method will return true only if each character in the needle can be found in the haystack and occurs after the preceding character.

fuzzysearch('twl', 'cartwheel') // <- true
fuzzysearch('cart', 'cartwheel') // <- true
fuzzysearch('cw', 'cartwheel') // <- true
fuzzysearch('ee', 'cartwheel') // <- true
fuzzysearch('art', 'cartwheel') // <- true
fuzzysearch('eeel', 'cartwheel') // <- false
fuzzysearch('dog', 'cartwheel') // <- false

An exciting application for this kind of algorithm is to filter options from an autocomplete menu, check out horsey for an example on how that might look like.

But! RegExps...!

chart showing abysmal performance for regexp-based implementation

License

MIT