7cc5c4f330d47060/geode
1
0
Fork 0
mirror of https://github.com/geode-sdk/geode.git synced 2024-11-23 16:07:52 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions 2

fix fuzzy search

Browse source
This commit is contained in:
altalk23 2023-04-27 11:28:39 +03:00
parent f7edc81df4
commit 7af062f35d
1 changed files with 17 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

23
loader/src/ui/internal/list/ModListLayer.cpp
View file

@ -38,6 +38,12 @@ static std::optional<int> fuzzyMatch(std::string const& kw, std::string const& s
someMatched = true; \ someMatched = true; \
} }
#define WEIGHTED_MATCH_MAX(str_, weight_) \
if (auto match = fuzzyMatch(query.keywords.value(), str_)) { \
weighted = std::max<double>(match.value() * weight_, weighted); \
someMatched = true; \
}
#define WEIGHTED_MATCH_ADD(str_, weight_) \ #define WEIGHTED_MATCH_ADD(str_, weight_) \
if (auto match = fuzzyMatch(query.keywords.value(), str_)) {\ if (auto match = fuzzyMatch(query.keywords.value(), str_)) {\
weighted += match.value() * weight_; \ weighted += match.value() * weight_; \
@ -52,11 +58,11 @@ static std::optional<int> queryMatchKeywords(
// fuzzy match keywords // fuzzy match keywords
if (query.keywords) { if (query.keywords) {
bool someMatched = false; bool someMatched = false;
WEIGHTED_MATCH(info.name(), 2); WEIGHTED_MATCH_MAX(info.name(), 2);
WEIGHTED_MATCH(info.id(), 1.5); WEIGHTED_MATCH_MAX(info.id(), 1);
WEIGHTED_MATCH(info.developer(), 1); WEIGHTED_MATCH_MAX(info.developer(), 0.5);
WEIGHTED_MATCH(info.details().value_or(""), 2); WEIGHTED_MATCH_MAX(info.details().value_or(""), 0.05);
WEIGHTED_MATCH(info.description().value_or(""), 1); WEIGHTED_MATCH_MAX(info.description().value_or(""), 0.2);
if (!someMatched) { if (!someMatched) {
return std::nullopt; return std::nullopt;
} }
@ -67,7 +73,12 @@ static std::optional<int> queryMatchKeywords(
// sorted, at least enough so that if you're scrolling it based on // sorted, at least enough so that if you're scrolling it based on
// alphabetical order you will find the part you're looking for easily // alphabetical order you will find the part you're looking for easily
// so it's fine // so it's fine
weighted = -tolower(info.name()[0]); return static_cast<int>(-tolower(info.name()[0]));
}
// if the weight is relatively small we can ignore it
if (weighted < 2) {
return std::nullopt;
} }
// empty keywords always match // empty keywords always match