A different approach to fuzzy finding
nathancraddock.com
nathancraddock.com
The reason for prioritizing word boundaries is so that you can type "sln" to match "SomeLongName". So while you are improving one use case you are probably breaking another one. I'm not sure how VSCode ranks GNUmakefile first, maybe they prioritize exact substring matches. It's still a heuristic that can fail. The ugly part is that it's not part of the "best match" algorithm that finds a global optimum.
> It first attempts a match on the filename. If there is no match, it retries on the full candidate string
Kakoune does the same, see https://github.com/mawww/kakoune/blob/019fbc5439ad884f172c32...
> Strict path matching means that the path segments of the query token cannot overlap between path segments in the candidate.
nice
Great! I’m glad I’m not the only one to have thought of this simple idea :)
If they had left quoted the word makefile, GNUmakefile would have been the first result.
Maybe there's some nuance of "fuzzy finding" as a phrase that I'm missing, but that seems questionable. I'd agree with "commonly used", but not "most commonly used".
Aren't things like address matching "fuzzy finding"?
Edit: Perhaps "fuzzing finding" is analogous to "command line based fuzzy finding", in which case it makes more sense to me.
Are there other integrations that do this?
I don’t quite remember what I tried, maybe fzf and skim?