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, 1 insertions, 2 deletions

diff --git a/src/main.c b/src/main.c
index 448c164..9d9f4d9 100644
--- a/src/main.c
+++ b/src/main.c
@@ -1351,9 +1351,8 @@ int main(int argc, char *argv[])
 			if (tofi.history_file[0] == 0) {
 				tofi.use_history = false;
 			} else {
-				string_vec_sort(&tofi.window.entry.commands);
 				tofi.window.entry.history = history_load(tofi.history_file);
-				compgen_history_sort(&tofi.window.entry.commands, &tofi.window.entry.history);
+				string_vec_history_sort(&tofi.window.entry.commands, &tofi.window.entry.history);
 			}
 		}
 	}