X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=selector.cc;h=668323e0ea387419a0f9946a234084fd5d1d2bbe;hb=58c7fdbb05978456149eab289490b6779aa23874;hp=e119fc6db121bd36f3c9a44812b753c7be7e1f4a;hpb=7b78746dc81a4654942ae17a4604d7443fbde929;p=selector.git diff --git a/selector.cc b/selector.cc index e119fc6..668323e 100644 --- a/selector.cc +++ b/selector.cc @@ -61,29 +61,17 @@ int remove_duplicates = 0; // This looks severely Linux-only ... void inject_into_tty_buffer(char *line) { - char *tty = ttyname(STDIN_FILENO); - int fd = open(tty, O_RDWR); - struct termios oldtio, newtio; - - if (fd >= 0) { - // Save current port settings - tcgetattr(fd,&oldtio); - memset(&newtio, 0, sizeof(newtio)); - // Set input mode (non-canonical, *no echo*,...) - tcflush(fd, TCIFLUSH); - tcsetattr(fd,TCSANOW, &newtio); - // Put the selected line in the tty input buffer - for(char *k = line; *k; k++) { - ioctl(fd, TIOCSTI, k); - } - // Restore the old settings - tcsetattr(fd,TCSANOW, &oldtio); - close(fd); - } else { - cerr << "Can not open " << tty << "." << endl; - exit(1); + 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++) { + ioctl(STDIN_FILENO, TIOCSTI, k); } + // Restore the old settings + tcsetattr(STDIN_FILENO, TCSANOW, &oldtio); } ////////////////////////////////////////////////////////////////////// @@ -107,6 +95,38 @@ void check_opt(int argc, char **argv, int n_opt, int n, const char *help) { } } +////////////////////////////////////////////////////////////////////// +// A quick and dirty hash table + +int *new_hash_table(int hash_table_size) { + int *result; + result = new int[hash_table_size]; + for(int k = 0; k < hash_table_size; k++) { + result[k] = -1; + } + return result; +} + +int test_and_add(char *new_string, int new_index, + char **strings, int *hash_table, int hash_table_size) { + unsigned int code = 0; + + for(int k = 0; new_string[k]; k++) { + code += int(new_string[k]) << (8 * k%4); + } + + code = code % hash_table_size; + + while(hash_table[code] >= 0) { + if(strcmp(new_string, strings[hash_table[code]]) == 0) return 1; + code = (code + 1) % hash_table_size; + } + + hash_table[code] = new_index; + + return 0; +} + ////////////////////////////////////////////////////////////////////// int previous_visible(int current_line, int nb_lines, char **lines, int nb_patterns, char **patterns) { @@ -203,7 +223,7 @@ void update_screen(int *current_line, int *temporary_line, int motion, addstr("\n"); - int nb_printed_lines = 1; + int nb_printed_lines = 0; // Here new_line is either a line number matching the patterns, or -1 @@ -226,7 +246,7 @@ void update_screen(int *current_line, int *temporary_line, int motion, } } - if(last_line < nb_lines - 1) { + if(nb_match < console_height - 1 && last_line < nb_lines - 1) { last_line++; while(last_line < nb_lines - 1 && !match(lines[last_line], nb_patterns, patterns)) { last_line++; @@ -288,15 +308,14 @@ void update_screen(int *current_line, int *temporary_line, int motion, *temporary_line = new_line; - if(nb_printed_lines == 1) { + if(nb_printed_lines == 0) { addnstr("[no selection]\n", console_width); - nb_printed_lines++; } // Draw the modeline sprintf(buffer, "%d/%d pattern: %s", - nb_printed_lines - 1, + nb_printed_lines, nb_lines, pattern_list); @@ -446,10 +465,18 @@ int main(int argc, char **argv) { return 1; } + int hash_table_size = nb_lines_max * 10; + int *hash_table = 0; + + if(remove_duplicates) { + hash_table = new_hash_table(hash_table_size); + } + while(nb_lines < nb_lines_max && !file.eof()) { file.getline(buffer, buffer_size); if(strcmp(buffer, "") != 0) { char *s = buffer; + if(zsh_history && *s == ':') { while(*s && *s != ';') s++; if(*s == ';') s++; @@ -459,29 +486,7 @@ int main(int argc, char **argv) { while(*s == ' ' || (*s >= '0' && *s <= '9')) s++; } - /* - - // This is supposed to remove any duplicates, not only - // successive ones. However, it is O(N^2), we should use - // hash-codes - - int keep = 1; - - if(remove_duplicates) { - for(int k = 0; keep && k < nb_lines; k++) { - keep &= strcmp(lines[k], s); - } - } - - if(keep) { - lines[nb_lines] = new char[strlen(s) + 1]; - strcpy(lines[nb_lines], s); - nb_lines++; - } - - */ - - if(!remove_duplicates || nb_lines == 0 || strcmp(lines[nb_lines - 1], s)) { + if(!hash_table || !test_and_add(s, nb_lines, lines, hash_table, hash_table_size)) { lines[nb_lines] = new char[strlen(s) + 1]; strcpy(lines[nb_lines], s); nb_lines++; @@ -489,6 +494,8 @@ int main(int argc, char **argv) { } } + delete[] hash_table; + if(inverse_order) { for(int i = 0; i < nb_lines/2; i++) { char *s = lines[nb_lines - 1 - i]; @@ -544,7 +551,7 @@ int main(int argc, char **argv) { patterns[patterns_point] = '\0'; } - else if(key == KEY_BACKSPACE || key == '' || + else if(key == KEY_BACKSPACE || key == '' || key == '' || key == KEY_DC || key == '') { if(patterns_point > 0) { patterns_point--;