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.

1 files changed, 3 insertions, 0 deletions

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 <stddef.h>
 #include <stdint.h>
 #include <stdio.h>
+#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);