Replies: 4 comments 2 replies
|
I have heard you multiple time talking about async. And I want to share my two cents. Implementing live/async scanning/matching results into the search buffer isn't what I want. (And I agree with your note it isn't worth-it). However, having the UI displayed, and being able to type the query, before the (full) scanner return would 'feel' faster, without having to implement live/async scanning/matching. Pretty much opening the UI on :CommandT, than having it wait for the scanner the return in the background before calling the matcher on the user prompt. |
Yeah, that's good to hear. I tried to make it relatively modular, and with the Lua rewrite it got a bit cleaner overall because the C parts are "pure C" now as opposed to "C with references to Ruby VM types and functions sprinkled throughout".
I wouldn't mind seeing a PR if you care to send one (I skimmed your |
|
Thanks for your answers! |

Uh oh!
There was an error while loading. Please reload this page.
Uh oh!
There was an error while loading. Please reload this page.
Hi wincent!
I wanted to share my story about fuzzy finders, and how ultimately I'm using command-t.
Back in the days, I was a huge fan of: https://github.com/nixprime/cpsm because of it's results quality.
However, as it got harder and harder to install, to the point of now being impractical, so I got interested in other fuzzy file finder.
I tried many of them: fzf-lua,telescope,fff,LeaderF,command-t, but their matching algorithm never suited me.
Ultimately, my need might be too niche, so I decided to implement my own scoring algorithm.
Command-t is very simple to tinker with, because score.c is very much self contained.
So thanks for that!
As a bonus command-t being the fastest is a blast.
My modified score.c
In case you are interested I could open a PR, I'm just not sure it is something you want, the heuristics arn't as simplistic anymore.
And here are some cases that I my scoring algorithm boost more than the default one.
All reactions