aboutsummaryrefslogtreecommitdiff
path: root/helix-term
diff options
context:
space:
mode:
authorMichael Jones2022-07-01 09:33:52 +0000
committerGitHub2022-07-01 09:33:52 +0000
commitd8abd1eaf398f462122efbc937cda9d8178a5754 (patch)
treef871faff20aa42b7a1896887f79ca8b528d5ca1e /helix-term
parentf10b6f6ee2bbf4d6d9356e27be25b25bdb85b9cd (diff)
Sort themes, language & files by score & then name (#2675)
* Sort themes by score & then name Previously the themes were appearing unordered after typing ':theme '. This sorts them first by fuzzy score and then by name so that they generally appear in a more ordered fashion in the initial list. The sort by name does not really pay off when there is a score so an alternative approach would be to sort by name if there is string to fuzzy match against and otherwise sort by score. I've lowercased the names as that avoids lower case & upper case letters being sorted into separate groups. There might be a preferable approach to that though. * Sort language & files by score then name And change to use sort_unstable_by instead of sort_unstable_by_key as it allows us to avoid some allocations. I don't fully understand the flow of the 'filename_impl' function but this seems to deliver the desired results. * Remove unnecessary reference Co-authored-by: Michael Davis <mcarsondavis@gmail.com> Co-authored-by: Michael Davis <mcarsondavis@gmail.com>
Diffstat (limited to 'helix-term')
-rw-r--r--helix-term/src/ui/mod.rs15
1 files changed, 12 insertions, 3 deletions
diff --git a/helix-term/src/ui/mod.rs b/helix-term/src/ui/mod.rs
index c1e5c988..948a5f2b 100644
--- a/helix-term/src/ui/mod.rs
+++ b/helix-term/src/ui/mod.rs
@@ -257,7 +257,9 @@ pub mod completers {
})
.collect();
- matches.sort_unstable_by_key(|(_file, score)| Reverse(*score));
+ matches.sort_unstable_by(|(name1, score1), (name2, score2)| {
+ (Reverse(*score1), name1).cmp(&(Reverse(*score2), name2))
+ });
names = matches.into_iter().map(|(name, _)| ((0..), name)).collect();
names
@@ -312,7 +314,9 @@ pub mod completers {
})
.collect();
- matches.sort_unstable_by_key(|(_language, score)| Reverse(*score));
+ matches.sort_unstable_by(|(language1, score1), (language2, score2)| {
+ (Reverse(*score1), language1).cmp(&(Reverse(*score2), language2))
+ });
matches
.into_iter()
@@ -428,13 +432,18 @@ pub mod completers {
let range = (input.len().saturating_sub(file_name.len()))..;
- matches.sort_unstable_by_key(|(_file, score)| Reverse(*score));
+ matches.sort_unstable_by(|(file1, score1), (file2, score2)| {
+ (Reverse(*score1), file1).cmp(&(Reverse(*score2), file2))
+ });
+
files = matches
.into_iter()
.map(|(file, _)| (range.clone(), file))
.collect();
// TODO: complete to longest common match
+ } else {
+ files.sort_unstable_by(|(_, path1), (_, path2)| path1.cmp(path2));
}
files