![]() For very long strings (notes, comments), fuzzy-searching may not be the right strategy - consider Full-Text Search (with indexing) instead.įeel free to contribute improvements to sorting heuristics or alternative search strategies (provided that the “fast, simple, tiny” criteria don’t suffer too much). If you have much larger lists to fuzzy-search, you may find the performance unsatisfactory - consider implementations with simpler heuristics or indexing. More than fast enough to search on every keystroke without any lag. But it’s tiny, simple, and fast enough, while providing fuzzy search heuristics and sorting that I found to work reasonably well in Nozbe, a project management app, where it’s used to filter down or autocomplete lists of short labels - names of projects, sections, tasks, user names, etc.īy “fast” I mean that on my computer, with a list of ~4500 labels, the first search (one-letter search query) takes ~7ms, while subsequent searches take less than 1.5ms - all in-memory, without indexing. It’s not the tiniest, the simplest, or the fastest implementation you can find. I wrote microfuzz simply because I didn’t quite like how other fuzzy search libraries I found worked, for my use case.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |