titaniumtown/YTBN-Graphing-Software
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

sort autocompletes from smallest to largest

Browse Source
This commit is contained in:
Simon Gardling 2022-04-04 10:26:05 -04:00
parent 58ff53fa60
commit 3774d280bd
1 changed files with 14 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/autocomplete_helper.rs
View File

@ -1,5 +1,17 @@
use core::cmp::Ordering;
use std::collections::HashSet; use std::collections::HashSet;
/// https://www.dotnetperls.com/sort-rust
fn compare_len_reverse_alpha(a: &String, b: &String) -> Ordering {
// Sort by length from short to long first.
let length_test = a.len().cmp(&b.len());
if length_test == Ordering::Equal {
// If same length, sort in reverse alphabetical order.
return b.cmp(&a);
}
return length_test;
}
/// Generates hashmap (well really a vector of tuple of strings that are then /// Generates hashmap (well really a vector of tuple of strings that are then
/// turned into a hashmap by phf) /// turned into a hashmap by phf)
#[allow(dead_code)] #[allow(dead_code)]
@ -28,11 +40,12 @@ pub fn compile_hashmap(data: Vec<String>) -> Vec<(String, String)> {
if keys.iter().filter(|a| a == &&key).count() == 1 { if keys.iter().filter(|a| a == &&key).count() == 1 {
output.push((key.clone(), format!(r#"HintEnum::Single("{}")"#, value))); output.push((key.clone(), format!(r#"HintEnum::Single("{}")"#, value)));
} else { } else {
let multi_data = tuple_list_1 let mut multi_data = tuple_list_1
.iter() .iter()
.filter(|(a, _)| a == key) .filter(|(a, _)| a == key)
.map(|(_, b)| b) .map(|(_, b)| b)
.collect::<Vec<&String>>(); .collect::<Vec<&String>>();
multi_data.sort_unstable_by(|a, b| compare_len_reverse_alpha(a, b));
output.push((key.clone(), format!("HintEnum::Many(&{:?})", multi_data))); output.push((key.clone(), format!("HintEnum::Many(&{:?})", multi_data)));
} }
} }