X-Git-Url: https://www.fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=selector.cc;h=27225b9cec383205e5ffa3808c7f85f12bf8681b;hb=9356c8c8659b8f8b39524901790bd899e9b63709;hp=ebbd0214f7d068926bfc0ef6389ca370dc62b4d1;hpb=f5a9d933f1272364e11c93589903e711b05bcbe5;p=selector.git diff --git a/selector.cc b/selector.cc index ebbd021..27225b9 100644 --- a/selector.cc +++ b/selector.cc @@ -1,7 +1,7 @@ /* - * selector is a simple shell command for selection of strings with a - * dynamic pattern-matching. + * selector is a simple command line utility for selection of strings + * with a dynamic pattern-matching. * * Copyright (c) 2009 Francois Fleuret * Written by Francois Fleuret @@ -23,12 +23,8 @@ */ // To use it as a super-history-search for bash: -// // alias h='selector -d -i -b -v -f <(history)' -// This software is highly Linux-specific, but I would be glad to get -// patches to make it work on other OS - #include #include @@ -45,31 +41,42 @@ using namespace std; #define VERSION "1.0" -const int buffer_size = 1024; +const int buffer_size = 4096; // Yeah, global variables! int nb_lines_max = 1000; char pattern_separator = ';'; +char label_separator = '\0'; int output_to_vt_buffer = 0; +int add_control_qs = 0; int with_colors = 1; int zsh_history = 0, bash_history = 0; int inverse_order = 0; int remove_duplicates = 0; int use_regexp = 0; +int case_sensitive = 0; +char *title = 0; +int error_flash = 0; -////////////////////////////////////////////////////////////////////// +#define COLOR_MODELINE 1 +#define COLOR_HIGHLIGHTED_LINE 2 -// This looks severely Linux-only ... +////////////////////////////////////////////////////////////////////// -void inject_into_tty_buffer(char *line) { +void inject_into_tty_buffer(char *string) { struct termios oldtio, newtio; - tcgetattr(STDIN_FILENO,&oldtio); + tcgetattr(STDIN_FILENO, &oldtio); memset(&newtio, 0, sizeof(newtio)); // Set input mode (non-canonical, *no echo*,...) tcsetattr(STDIN_FILENO, TCSANOW, &newtio); - // Put the selected line in the tty input buffer - for(char *k = line; *k; k++) { + const char control_q = '\021'; + // Put the selected string in the tty input buffer + for(const char *k = string; *k; k++) { + if(add_control_qs && !(*k >= ' ' && *k <= '~')) { + // Add ^Q to quote control characters + ioctl(STDIN_FILENO, TIOCSTI, &control_q); + } ioctl(STDIN_FILENO, TIOCSTI, k); } // Restore the old settings @@ -88,9 +95,41 @@ void check_opt(int argc, char **argv, int n_opt, int n, const char *help) { } } +int string_to_positive_integer(char *string) { + int error = 0; + int result = 0; + + if(*string) { + for(char *s = string; *s; s++) { + if(*s >= '0' && *s <= '9') { + result = result * 10 + int(*s - '0'); + } else error = 1; + } + } else error = 1; + + if(error) { + cerr << "Value `" << string << "' is not a positive integer." << endl; + exit(1); + } + + return result; +} + +void error_feedback() { + if(error_flash) { + flash(); + } else { + beep(); + } +} + ////////////////////////////////////////////////////////////////////// // A quick and dirty hash table +// The table itself stores index of the strings in a char +// **table. When a string is added, if it was already in the table, +// the new index replaces the previous one. + int *new_hash_table(int hash_table_size) { int *result; result = new int[hash_table_size]; @@ -100,8 +139,13 @@ int *new_hash_table(int hash_table_size) { return result; } +// Adds new_string in the table, associated to new_index. If this +// string was not already in the table, returns -1. Otherwise, returns +// the previous index it had. + int test_and_add(char *new_string, int new_index, char **strings, int *hash_table, int hash_table_size) { + unsigned int code = 0; // This is my recipe. I checked, it seems to work (as long as @@ -114,13 +158,24 @@ int test_and_add(char *new_string, int new_index, code = code % hash_table_size; while(hash_table[code] >= 0) { - if(strcmp(new_string, strings[hash_table[code]]) == 0) return 1; + // There is a string with that code + if(strcmp(new_string, strings[hash_table[code]]) == 0) { + // It is the same string, we keep a copy of the stored index + int result = hash_table[code]; + // Put the new one + hash_table[code] = new_index; + // And return the previous one + return result; + } + // This collision was not the same string, let's move to the next + // in the table code = (code + 1) % hash_table_size; } + // This string was not already in there, store the index in the + // table and return -1 hash_table[code] = new_index; - - return 0; + return -1; } ////////////////////////////////////////////////////////////////////// @@ -131,13 +186,20 @@ struct matcher_t { regex_t preg; int regexp_error; int nb_patterns; + int case_sensitive; char *splitted_patterns, **patterns; }; int match(char *string, matcher_t *matcher) { if(matcher->nb_patterns >= 0) { - for(int n = 0; n < matcher->nb_patterns; n++) { - if(strstr(string, matcher->patterns[n]) == 0) return 0; + if(matcher->case_sensitive) { + for(int n = 0; n < matcher->nb_patterns; n++) { + if(strstr(string, matcher->patterns[n]) == 0) return 0; + } + } else { + for(int n = 0; n < matcher->nb_patterns; n++) { + if(strcasestr(string, matcher->patterns[n]) == 0) return 0; + } } return 1; } else { @@ -146,21 +208,24 @@ int match(char *string, matcher_t *matcher) { } void free_matcher(matcher_t *matcher) { - if(matcher->nb_patterns >= 0) { + if(matcher->nb_patterns < 0) { + if(!matcher->regexp_error) regfree(&matcher->preg); + } else { delete[] matcher->splitted_patterns; delete[] matcher->patterns; - } else { - if(!matcher->regexp_error) regfree(&matcher->preg); } } -void initialize_matcher(int use_regexp, matcher_t *matcher, const char *pattern) { +void initialize_matcher(int use_regexp, int case_sensitive, + matcher_t *matcher, const char *pattern) { + if(use_regexp) { matcher->nb_patterns = -1; - matcher->regexp_error = regcomp(&matcher->preg, pattern, REG_ICASE); + matcher->regexp_error = regcomp(&matcher->preg, pattern, case_sensitive ? 0 : REG_ICASE); } else { matcher->regexp_error = 0; matcher->nb_patterns = 1; + matcher->case_sensitive = case_sensitive; for(const char *s = pattern; *s; s++) { if(*s == pattern_separator) { @@ -185,6 +250,65 @@ void initialize_matcher(int use_regexp, matcher_t *matcher, const char *pattern) } } +////////////////////////////////////////////////////////////////////// +// Buffer edition + +void delete_char(char *buffer, int *position) { + if(buffer[*position]) { + int c = *position; + while(c < buffer_size && buffer[c]) { + buffer[c] = buffer[c+1]; + c++; + } + } else error_feedback(); +} + +void backspace_char(char *buffer, int *position) { + if(*position > 0) { + if(buffer[*position]) { + int c = *position - 1; + while(buffer[c]) { + buffer[c] = buffer[c+1]; + c++; + } + } else { + buffer[*position - 1] = '\0'; + } + + (*position)--; + } else error_feedback(); +} + +void insert_char(char *buffer, int *position, char character) { + if(strlen(buffer) < buffer_size - 1) { + int c = *position; + char t = buffer[c], u; + while(t) { + c++; + u = buffer[c]; + buffer[c] = t; + t = u; + } + c++; + buffer[c] = '\0'; + buffer[(*position)++] = character; + } else error_feedback(); +} + +void kill_before_cursor(char *buffer, int *position) { + int s = 0; + while(buffer[*position + s]) { + buffer[s] = buffer[*position + s]; + s++; + } + buffer[s] = '\0'; + *position = 0; +} + +void kill_after_cursor(char *buffer, int *position) { + buffer[*position] = '\0'; +} + ////////////////////////////////////////////////////////////////////// int previous_visible(int current_line, int nb_lines, char **lines, matcher_t *matcher) { @@ -207,12 +331,13 @@ int next_visible(int current_line, int nb_lines, char **lines, matcher_t *matche void update_screen(int *current_line, int *temporary_line, int motion, int nb_lines, char **lines, + int cursor_position, char *pattern) { char buffer[buffer_size]; matcher_t matcher; - initialize_matcher(use_regexp, &matcher, pattern); + initialize_matcher(use_regexp, case_sensitive, &matcher, pattern); // We now take care of printing the lines per se @@ -230,8 +355,7 @@ void update_screen(int *current_line, int *temporary_line, int motion, if(matcher.regexp_error) { addstr("[regexp error]"); - } else { - + } else if(nb_lines > 0) { int new_line; if(match(lines[*current_line], &matcher)) { new_line = *current_line; @@ -272,7 +396,7 @@ void update_screen(int *current_line, int *temporary_line, int motion, int first_line = new_line, last_line = new_line, nb_match = 1; // We find the first and last line to show, so that the total of - // visible lines between them (them include) is console_height - 1 + // visible lines between them (them included) is console_height-1 while(nb_match < console_height-1 && (first_line > 0 || last_line < nb_lines - 1)) { @@ -309,8 +433,8 @@ void update_screen(int *current_line, int *temporary_line, int motion, k++; } - // We fill the rest of the line with blanks if either we did - // not clear() or if this is the highlighted line + // We fill the rest of the line with blanks if this is the + // highlighted line if(l == new_line) { while(k < console_width) { @@ -325,9 +449,9 @@ void update_screen(int *current_line, int *temporary_line, int motion, if(l == new_line) { if(with_colors) { - attron(COLOR_PAIR(2)); + attron(COLOR_PAIR(COLOR_HIGHLIGHTED_LINE)); addnstr(buffer, console_width); - attroff(COLOR_PAIR(2)); + attroff(COLOR_PAIR(COLOR_HIGHLIGHTED_LINE)); } else { attron(A_STANDOUT); addnstr(buffer, console_width); @@ -351,27 +475,70 @@ void update_screen(int *current_line, int *temporary_line, int motion, if(nb_printed_lines == 0) { addnstr("[no selection]\n", console_width); } + } else { + addnstr("[empty choice]\n", console_width); } // Draw the modeline - sprintf(buffer, "%d/%d pattern: %s%s", - nb_printed_lines, - nb_lines, - pattern, - use_regexp ? " [regexp]" : ""); + move(0, 0); - for(int k = strlen(buffer); k < console_width; k++) buffer[k] = ' '; + if(with_colors) { + attron(COLOR_PAIR(COLOR_MODELINE)); + } else { + attron(A_REVERSE); + } + + for(int k = 0; k < console_width; k++) buffer[k] = ' '; buffer[console_width] = '\0'; + addnstr(buffer, console_width); move(0, 0); + + // There must be a more elegant way of moving the cursor at a + // location met during display + + int cursor_x = 0; + + if(title) { + addstr(title); + addstr(" "); + cursor_x += strlen(title) + 1; + } + + sprintf(buffer, "%d/%d ", nb_printed_lines, nb_lines); + addstr(buffer); + cursor_x += strlen(buffer); + + addnstr(pattern, cursor_position); + cursor_x += cursor_position; + + if(pattern[cursor_position]) { + addstr(pattern + cursor_position); + } else { + addstr(" "); + } + + if(use_regexp || case_sensitive) { + addstr(" ["); + if(use_regexp) { + addstr("regexp"); + } + + if(case_sensitive) { + if(use_regexp) { + addstr(","); + } + addstr("case"); + } + addstr("]"); + } + + move(0, cursor_x); + if(with_colors) { - attron(COLOR_PAIR(1)); - addnstr(buffer, console_width); - attroff(COLOR_PAIR(1)); + attroff(COLOR_PAIR(COLOR_MODELINE)); } else { - attron(A_REVERSE); - addnstr(buffer, console_width); attroff(A_REVERSE); } @@ -383,8 +550,85 @@ void update_screen(int *current_line, int *temporary_line, int motion, ////////////////////////////////////////////////////////////////////// +void read_file(const char *input_filename, + int nb_lines_max, int *nb_lines, char **lines, + int hash_table_size, int *hash_table) { + + char raw_line[buffer_size];; + + ifstream file(input_filename); + + if(file.fail()) { + cerr << "Can not open " << input_filename << endl; + exit(1); + } + + while(*nb_lines < nb_lines_max && !file.eof()) { + + file.getline(raw_line, buffer_size); + + if(raw_line[0]) { + + if(file.fail()) { + cerr << "Line too long:" << endl; + cerr << raw_line << endl; + exit(1); + } + + char *t; + + t = raw_line; + + // Remove the zsh history prefix + + if(zsh_history && *t == ':') { + while(*t && *t != ';') t++; + if(*t == ';') t++; + } + + // Remove the bash history prefix + + if(bash_history) { + while(*t == ' ') t++; + while(*t >= '0' && *t <= '9') t++; + while(*t == ' ') t++; + } + + // Check for duplicates with the hash table and insert the line + // in the list if necessary + + int dup; + + if(hash_table) { + dup = test_and_add(t, *nb_lines, lines, hash_table, hash_table_size); + } else { + dup = -1; + } + + if(dup < 0) { + lines[*nb_lines] = new char[strlen(t) + 1]; + strcpy(lines[*nb_lines], t); + } else { + // The string was already in there, so we do not allocate a + // new string but use the pointer to the first occurence of it + lines[*nb_lines] = lines[dup]; + lines[dup] = 0; + } + + (*nb_lines)++; + } + } +} + +////////////////////////////////////////////////////////////////////// + int main(int argc, char **argv) { - char buffer[buffer_size]; + + if(!ttyname(STDIN_FILENO)) { + cerr << "The standard input is not a tty." << endl; + exit(1); + } + int color_fg_modeline, color_bg_modeline; int color_fg_highlight, color_bg_highlight; @@ -402,8 +646,9 @@ int main(int argc, char **argv) { int i = 1; int error = 0, show_help = 0; + int rest_are_files = 0; - while(!error && !show_help && i < argc) { + while(!error && !show_help && i < argc && argv[i][0] == '-' && !rest_are_files) { if(strcmp(argv[i], "-o") == 0) { check_opt(argc, argv, i, 1, ""); @@ -417,16 +662,32 @@ int main(int argc, char **argv) { i += 2; } + else if(strcmp(argv[i], "-x") == 0) { + check_opt(argc, argv, i, 1, "