APPLE 40fd72a105 wesmiler 抢表商城 %!s(int64=3) %!d(string=hai) anos
..
test 40fd72a105 wesmiler 抢表商城 %!s(int64=3) %!d(string=hai) anos
.editorconfig 40fd72a105 wesmiler 抢表商城 %!s(int64=3) %!d(string=hai) anos
.jshintignore 40fd72a105 wesmiler 抢表商城 %!s(int64=3) %!d(string=hai) anos
.jshintrc 40fd72a105 wesmiler 抢表商城 %!s(int64=3) %!d(string=hai) anos
.npmignore 40fd72a105 wesmiler 抢表商城 %!s(int64=3) %!d(string=hai) anos
CHANGELOG.md 40fd72a105 wesmiler 抢表商城 %!s(int64=3) %!d(string=hai) anos
LICENSE 40fd72a105 wesmiler 抢表商城 %!s(int64=3) %!d(string=hai) anos
README.md 40fd72a105 wesmiler 抢表商城 %!s(int64=3) %!d(string=hai) anos
index.js 40fd72a105 wesmiler 抢表商城 %!s(int64=3) %!d(string=hai) anos
package.json 40fd72a105 wesmiler 抢表商城 %!s(int64=3) %!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