This repository has been archived by the owner on Dec 15, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 28
Fix scoring to favor exact substring matches #15
Closed
Closed
Changes from all commits
Commits
Show all changes
2 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -42,6 +42,22 @@ exports.basenameScore = (string, query, score) -> | |
score *= depth * 0.01 | ||
score | ||
|
||
exports.substringScore = (string, query, score) -> | ||
# Return a near perfect score if the query is a substring match | ||
substrIndex = string.indexOf(query) | ||
substrIndexi = string.toLowerCase().indexOf(query.toLowerCase()) | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. It looks like these two are calculated up front but there are cases where this method will return by only checking Could you then move the calculation of |
||
|
||
if substrIndex >= 0 | ||
return score + 1.155 if substrIndex == 0 | ||
return score + 1.145 if string[substrIndex - 1] == PathSeparator | ||
return score + 1.135 | ||
else if substrIndexi >= 0 | ||
return score + 1.15 if substrIndexi == 0 | ||
return score + 1.14 if string[substrIndexi - 1] == PathSeparator | ||
return score + 1.13 | ||
|
||
return score | ||
|
||
exports.score = (string, query) -> | ||
return 1 if string is query | ||
|
||
|
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
All the other examples pass in an array of candidates and then a search string. All you're passing in here are candidates?