From 5da0579864a13b11bf0808f7f69f7b22f18054b1 Mon Sep 17 00:00:00 2001 From: Phil Jones Date: Sat, 19 Nov 2022 19:28:52 +0000 Subject: Fix sorting in normal tofi mode with history. By using a hash table rather than binary search to find existing items, we can avoid the need to sort the input. --- src/string_vec.h | 3 +++ 1 file changed, 3 insertions(+) (limited to 'src/string_vec.h') diff --git a/src/string_vec.h b/src/string_vec.h index f3e840c..f8ca3e0 100644 --- a/src/string_vec.h +++ b/src/string_vec.h @@ -5,6 +5,7 @@ #include #include #include +#include "history.h" struct scored_string { char *string; @@ -30,6 +31,8 @@ void string_vec_add(struct string_vec *restrict vec, const char *restrict str); void string_vec_sort(struct string_vec *restrict vec); +void string_vec_history_sort(struct string_vec *restrict vec, struct history *history); + void string_vec_uniq(struct string_vec *restrict vec); struct scored_string *string_vec_find(struct string_vec *restrict vec, const char *str); -- cgit v1.2.3