IntenseFinance/neovim
3
0
Fork 0
mirror of https://github.com/neovim/neovim.git synced 2025-02-25 18:55:25 -06:00
Code Issues Packages Projects Releases Wiki Activity

fix(search): avoid quadratic time complexity when computing fuzzy score (#32153)

Browse Source
This commit is contained in:
zeertzjq 2025-01-22 09:28:27 +08:00 committed by GitHub
parent 3a25995f30
commit a8b6fa07c4
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/nvim/search.c
View File

@ -2993,6 +2993,8 @@ static int fuzzy_match_compute_score(const char *const str, const int strSz,
FUNC_ATTR_NONNULL_ALL FUNC_ATTR_WARN_UNUSED_RESULT FUNC_ATTR_PURE FUNC_ATTR_NONNULL_ALL FUNC_ATTR_WARN_UNUSED_RESULT FUNC_ATTR_PURE
{ {
assert(numMatches > 0); // suppress clang "result of operation is garbage" assert(numMatches > 0); // suppress clang "result of operation is garbage"
const char *p = str;
uint32_t sidx = 0;
// Initialize score // Initialize score
int score = 100; int score = 100;
bool is_exact_match = true; bool is_exact_match = true;
@ -3026,12 +3028,12 @@ static int fuzzy_match_compute_score(const char *const str, const int strSz,
// Check for bonuses based on neighbor character value // Check for bonuses based on neighbor character value
if (currIdx > 0) { if (currIdx > 0) {
// Camel case // Camel case
const char *p = str;
int neighbor = ' '; int neighbor = ' ';
for (uint32_t sidx = 0; sidx < currIdx; sidx++) { while (sidx < currIdx) {
neighbor = utf_ptr2char(p); neighbor = utf_ptr2char(p);
MB_PTR_ADV(p); MB_PTR_ADV(p);
sidx++;
} }
const int curr = utf_ptr2char(p); const int curr = utf_ptr2char(p);