mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-09-20 17:58:18 +03:00
aa8b40dce6
This patch reduces the O(n) tab completion to something like O(log(n)). The cache is just a sorted vector of strings and we binary search it to get a string matching our input, and then check the surrounding strings to see if we need to remove any characters. Also we no longer stat each file every time. Also added an #include in BinarySearch since it was using size_t. Oops. If `export` is called, we recache. Need to implement the `hash` builtin for when an executable has been added to a directory in PATH.
50 lines
1.1 KiB
C++
50 lines
1.1 KiB
C++
#pragma once
|
|
|
|
#include <AK/BinarySearch.h>
|
|
#include <AK/QuickSort.h>
|
|
#include <AK/String.h>
|
|
#include <AK/StringBuilder.h>
|
|
#include <AK/Vector.h>
|
|
#include <LibCore/CDirIterator.h>
|
|
#include <sys/stat.h>
|
|
|
|
class LineEditor {
|
|
public:
|
|
LineEditor();
|
|
~LineEditor();
|
|
|
|
String get_line(const String& prompt);
|
|
|
|
void add_to_history(const String&);
|
|
const Vector<String>& history() const { return m_history; }
|
|
|
|
void cache_path();
|
|
|
|
private:
|
|
void clear_line();
|
|
void append(const String&);
|
|
void cut_mismatching_chars(String& completion, const String& program, int token_length);
|
|
void tab_complete_first_token();
|
|
void vt_save_cursor();
|
|
void vt_restore_cursor();
|
|
void vt_clear_to_end_of_line();
|
|
|
|
Vector<char, 1024> m_buffer;
|
|
int m_cursor { 0 };
|
|
|
|
// FIXME: This should be something more take_first()-friendly.
|
|
Vector<String> m_history;
|
|
int m_history_cursor { 0 };
|
|
int m_history_capacity { 100 };
|
|
|
|
Vector<String, 256> m_path;
|
|
|
|
enum class InputState {
|
|
Free,
|
|
ExpectBracket,
|
|
ExpectFinal,
|
|
ExpectTerminator,
|
|
};
|
|
InputState m_state { InputState::Free };
|
|
};
|