You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
So this is a suggestion/question. The readme indicates that
The matched character is adjacent to a previous match.
This works in the following case - search string of blog
However, if I now type rpy so that the search string is blogrpy then
In this case, the first match has all the characters - but its obvious that it's of lesser quality.
I'm not sure how the adjacency scoring is implemented but could do something with sum of number of letters between matches? Something which has a higher number of letters between matched chars gets a lower score.
The text was updated successfully, but these errors were encountered:
So this is a suggestion/question. The readme indicates that
This works in the following case - search string of
![image](https://user-images.githubusercontent.com/516267/39968890-b454185c-56f1-11e8-9037-9bb53345b6c8.png)
blog
However, if I now type
![image](https://user-images.githubusercontent.com/516267/39968898-e9816a70-56f1-11e8-9629-e45c71a3666b.png)
rpy
so that the search string isblogrpy
thenIn this case, the first match has all the characters - but its obvious that it's of lesser quality.
I'm not sure how the adjacency scoring is implemented but could do something with sum of number of letters between matches? Something which has a higher number of letters between matched chars gets a lower score.
The text was updated successfully, but these errors were encountered: