Closed jojojames closed 2 years ago
You may want to take a look at the Vertico history hashing and the sort functions there https://github.com/minad/vertico/blob/e5935b5bbfc0d820c54ed1ad52e36e8c48248fd7/vertico.el#L182-L241.
Thanks this looks awesome! @minad
I'll have to pull it out so I can apply in a manner similar to (< CANDIDATE_1 CANDIDATE_2).
Implemented a simple version of the hash table.
Might be more performant to write a cache for the history compare functions.
Have something like this already but need some benchmark tests to show it's actually an improvement over the previous 'loop over all elements of the list to find a match' version.