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
Request history uses show_quick_panel from ST's API to allow the user to fuzzy match requests on (method, url).
However, this doesn't take recency into account, which means that often requests from months ago are preferred over much more recent matches.
show_quick_panel has no API for custom weighting or ordering of matches. One way around this might be to reduce the match strength for older requests, for example by right-padding them with a random character.
The more we pad a request with some character, the weaker the match will be compared with an identical request with less padding.
The perfect character for doing this is probably the zero-width space, because it is invisible and takes up no space, which means it won't make the quick panel any wider.
The other challenge will be to create a function N = f(age), where N is the number of ZWS chars added and age is the age of the request in second.
This function should be monotonically increasing but non-linear, so it can distinguish between recent matches, perhaps those separated by only 10 minutes, but doesn't add thousands of ZWS chars to matches that are months old.
Request history uses
show_quick_panel
from ST's API to allow the user to fuzzy match requests on (method, url).However, this doesn't take recency into account, which means that often requests from months ago are preferred over much more recent matches.
show_quick_panel
has no API for custom weighting or ordering of matches. One way around this might be to reduce the match strength for older requests, for example by right-padding them with a random character.The more we pad a request with some character, the weaker the match will be compared with an identical request with less padding.
The perfect character for doing this is probably the zero-width space, because it is invisible and takes up no space, which means it won't make the quick panel any wider.
The other challenge will be to create a function
N = f(age)
, where N is the number of ZWS chars added and age is the age of the request in second.This function should be monotonically increasing but non-linear, so it can distinguish between recent matches, perhaps those separated by only 10 minutes, but doesn't add thousands of ZWS chars to matches that are months old.
Closed by dda554a.
The text was updated successfully, but these errors were encountered: