Mirrors/eepp
1
0
Fork 0
mirror of https://github.com/SpartanJ/eepp.git synced 2026-07-15 23:42:52 +03:00
Code Issues Packages Projects Releases Wiki Activity

Added a new fuzzy matching algorithm, it should be better than the previous version, it's similar to what most editors have (implementation is inspired in the sublime_text fuzzy matcher).

Browse Source
This commit is contained in:
Martín Lucas Golini
2025-03-08 18:33:25 -03:00
parent 0dba4a222b
commit dfb0820d0f
12 changed files with 305 additions and 59 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
src/tools/ecode/projectdirectorytree.cpp
View File

@@ -118,9 +118,11 @@ ProjectDirectoryTree::fuzzyMatchTree( const std::vector<std::string>& matches, c
std::vector<std::string> names;
for ( const auto& match : matches ) {
for ( size_t i = 0; i < mNames.size(); i++ ) {
int matchName = String::fuzzyMatch( match, mNames[i], true );
int matchPath = String::fuzzyMatch( match, mFiles[i], true );
matchesMap.insert( { std::max( matchName, matchPath ), i } );
int matchName = String::fuzzyMatch( match, mNames[i] );
int matchPath = String::fuzzyMatch( match, mFiles[i] );
int matchScore = std::max( matchName, matchPath );
if ( matchScore > std::numeric_limits<int>::min() )
matchesMap.insert( { matchScore, i } );
}
}
for ( auto& res : matchesMap ) {
@@ -144,12 +146,14 @@ ProjectDirectoryTree::fuzzyMatchTree( const std::string& match, const size_t& ma
std::vector<std::string> files;
std::vector<std::string> names;
for ( size_t i = 0; i < mNames.size(); i++ ) {
int matchName = String::fuzzyMatch( match, mNames[i], true );
int matchPath = String::fuzzyMatch( match, mFiles[i], true );
matchesMap.insert( { std::max( matchName, matchPath ), i } );
int matchName = String::fuzzyMatch( match, mNames[i] );
int matchPath = String::fuzzyMatch( match, mFiles[i] );
int matchScore = std::max( matchName, matchPath );
if ( matchScore > std::numeric_limits<int>::min() )
matchesMap.insert( { matchScore, i } );
}
for ( auto& res : matchesMap ) {
if ( names.size() < max ) {
if ( names.size() < max && res.first > std::numeric_limits<int>::min() ) {
names.emplace_back( mNames[res.second] );
files.emplace_back( mFiles[res.second] );
} else {
@@ -627,7 +631,7 @@ PluginRequestHandle ProjectDirectoryTree::processMessage( const PluginMessage& m
std::string closestDataPath;
int max{ std::numeric_limits<int>::min() };
for ( const auto& paths : tentativePaths ) {
int res = String::fuzzyMatch( filePath.c_str(), paths.c_str(), true );
int res = String::fuzzyMatch( filePath.c_str(), paths.c_str() );
if ( res > max ) {
closestDataPath = filePath;
max = res;