2 * selector is a simple shell command for selection of strings with a
3 * dynamic pattern-matching.
5 * Copyright (c) 2008 Francois Fleuret
6 * Written by Francois Fleuret <francois.fleuret@idiap.ch>
8 * This file is part of selector.
10 * selector is free software: you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License version 3 as
12 * published by the Free Software Foundation.
14 * selector is distributed in the hope that it will be useful, but
15 * WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with selector. If not, see <http://www.gnu.org/licenses/>.
26 Here is the magical shell script for a smart bash-history. Note that
27 the line remains in /tmp/selector.out, which may be a scurity concern.
29 ./selector -f ~/.bash_history
30 OLD_SETTINGS=`stty -g`
32 writevt `tty` "`cat /tmp/selector.out`"
43 #include <sys/types.h>
49 int buffer_size = 1024;
50 int nb_lines_max = 1000;
51 char pattern_separator = ';';
52 int output_to_vt_buffer = 0;
54 int match(char *string, int nb_patterns, char **patterns) {
55 for(int n = 0; n < nb_patterns; n++) {
56 if(strstr(string, patterns[n]) == 0) return 0;
61 void check_opt(int argc, char **argv, int n_opt, int n, const char *help) {
62 if(n_opt + n >= argc) {
63 cerr << "Missing argument for "
72 int previous_visible(int current_line, int nb_lines, char **lines, int nb_patterns, char **patterns) {
73 int line = current_line - 1;
74 while(line >= 0 && !match(lines[line], nb_patterns, patterns)) line--;
78 int next_visible(int current_line, int nb_lines, char **lines, int nb_patterns, char **patterns) {
79 int line = current_line + 1;
80 while(line < nb_lines && !match(lines[line], nb_patterns, patterns)) line++;
88 void update_screen(int *current_line, int *temporary_line, int motion,
89 int nb_lines, char **lines,
93 char buffer[buffer_size];
95 // We split the pattern list into individual patterns
99 for(char *s = pattern_list; *s; s++) {
100 if(*s == pattern_separator) {
105 char splitted_patterns[strlen(pattern_list) + 1];
106 char *patterns[nb_patterns];
108 strcpy(splitted_patterns, pattern_list);
111 char *last_pattern_start = splitted_patterns;
112 for(char *s = splitted_patterns; n < nb_patterns; s++) {
113 if(*s == pattern_separator || *s == '\0') {
115 patterns[n++] = last_pattern_start;
116 last_pattern_start = s + 1;
120 // We now take care of printing the lines per se
122 int console_width = getmaxx(stdscr);
123 int console_height = getmaxy(stdscr);
125 int nb_printed_lines = 1;
127 // First, we find a visible line. In priority: The current, or the
128 // first visible after it, or the first visible before it.
131 if(match(lines[*current_line], nb_patterns, patterns)) {
132 new_line = *current_line;
134 new_line = next_visible(*current_line, nb_lines, lines, nb_patterns, patterns);
136 new_line = previous_visible(*current_line, nb_lines, lines, nb_patterns, patterns);
140 // If we found a visible line and we should move, let's move
142 if(new_line >= 0 && motion != 0) {
147 // We want to go down, let's find the first visible line below
148 l = next_visible(new_line, nb_lines, lines, nb_patterns, patterns);
153 // We want to go up, let's find the first visible line above
154 l = previous_visible(new_line, nb_lines, lines, nb_patterns, patterns);
165 use_default_colors();
169 // Here new_line is either a line number matching the patterns, or -1
173 int first_line = new_line, last_line = new_line, nb_match = 1;
175 // We find the first and last line to show, so that the total of
176 // visible lines between them (them include) is console_height - 1
178 while(nb_match < console_height-1 && (first_line > 0 || last_line < nb_lines - 1)) {
182 while(first_line > 0 && !match(lines[first_line], nb_patterns, patterns)) {
185 if(match(lines[first_line], nb_patterns, patterns)) {
190 if(last_line < nb_lines - 1) {
192 while(last_line < nb_lines - 1 && !match(lines[last_line], nb_patterns, patterns)) {
196 if(match(lines[last_line], nb_patterns, patterns)) {
202 // Now we display them
204 for(int l = first_line; l <= last_line; l++) {
205 if(match(lines[l], nb_patterns, patterns)) {
208 while(lines[l][k] && k < buffer_size - 2 && k < console_width - 2) {
209 buffer[k] = lines[l][k];
213 if(noblink || l == new_line) {
214 while(k < console_width) {
223 attron(COLOR_PAIR(2));
224 addnstr(buffer, console_width);
225 attroff(COLOR_PAIR(2));
227 addnstr(buffer, console_width);
234 *temporary_line = new_line;
236 *current_line = new_line;
240 if(noblink) { // Erase the rest of the window. That's slightly ugly.
242 while(k < console_width) {
247 for(int l = nb_printed_lines; l < console_height; l++) {
248 addnstr(buffer, console_width);
254 sprintf(buffer, "%d/%d pattern: %s",
255 nb_printed_lines - 1,
259 for(int k = strlen(buffer); k < console_width; k++) buffer[k] = ' ';
260 buffer[console_width] = '\0';
263 attron(COLOR_PAIR(1));
264 addnstr(buffer, console_width);
265 attroff(COLOR_PAIR(1));
267 refresh(); // After doing something on the display, we refresh it
270 //////////////////////////////////////////////////////////////////////
272 int main(int argc, char **argv) {
273 char buffer[buffer_size];
274 char *lines[nb_lines_max];
277 char input_filename[buffer_size], output_filename[buffer_size];
278 strcpy(input_filename, "/dev/stdin");
279 strcpy(output_filename, "/tmp/selector.out");
283 if(strcmp(argv[i], "-o") == 0) {
284 check_opt(argc, argv, i, 1, "<output filename>");
285 strncpy(output_filename, argv[i+1], buffer_size);
289 else if(strcmp(argv[i], "-s") == 0) {
290 check_opt(argc, argv, i, 1, "<pattern separator>");
291 pattern_separator = argv[i+1][0];
295 else if(strcmp(argv[i], "-v") == 0) {
296 output_to_vt_buffer = 1;
300 else if(strcmp(argv[i], "-f") == 0) {
301 check_opt(argc, argv, i, 1, "<input filename>");
302 strncpy(input_filename, argv[i+1], buffer_size);
306 else if(strcmp(argv[i], "-b") == 0) {
311 else if(strcmp(argv[i], "-l") == 0) {
312 check_opt(argc, argv, i, 1, "<maximum number of lines>");
313 nb_lines_max = atoi(argv[i+1]);
318 cerr << argv[0] << " [-h] [-o <output filename>] [-b] [-l <max number of lines>] [-s <pattern separator>] [-v]" << endl;
319 if(strcmp(argv[i], "-h") == 0) {
327 ifstream file(input_filename);
330 cerr << "Can not open \"" << input_filename << "\"" << endl;
335 while(nb_lines < nb_lines_max && !file.eof()) {
336 file.getline(buffer, buffer_size);
337 lines[nb_lines] = new char[strlen(buffer) + 1];
338 strcpy(lines[nb_lines], buffer);
342 char patterns[buffer_size];
350 cerr << "No colors." << endl;
356 keypad(stdscr, TRUE);
359 // init_pair(1, COLOR_WHITE, COLOR_BLACK);
360 init_pair(1, COLOR_WHITE, COLOR_GREEN);
361 init_pair(2, COLOR_BLACK, COLOR_YELLOW);
365 int current_line = 0, temporary_line = 0;
367 update_screen(¤t_line, &temporary_line, 0, nb_lines, lines, patterns, noblink);
375 if(key >= ' ' && key <= 'z') {
376 patterns[patterns_point++] = key;
377 patterns[patterns_point] = '\0';
380 else if(key == KEY_BACKSPACE || key == KEY_DC || key == '
\b') {
381 if(patterns_point > 0) {
383 patterns[patterns_point] = '\0';
387 else if(key == KEY_UP || key == '
\10') {
391 else if(key == KEY_DOWN || key == '
\ e') {
395 update_screen(¤t_line, &temporary_line, motion,
396 nb_lines, lines, patterns, noblink);
397 } while(key != '\n' && key != KEY_ENTER && key != '
\a');
403 if(output_to_vt_buffer) {
404 if((key == KEY_ENTER || key == '\n') && temporary_line >= 0 && temporary_line < nb_lines) {
405 char *tty = ttyname (STDIN_FILENO);
406 int fd = open(tty, O_WRONLY);
407 write(fd, lines[temporary_line], strlen(lines[temporary_line]));
412 ofstream out(output_filename);
414 cerr << "Can not open " << output_filename << " for writing." << endl;
417 if((key == KEY_ENTER || key == '\n') && temporary_line >= 0 && temporary_line < nb_lines) {
418 out << lines[temporary_line] << endl;
426 for(int l = 0; l < nb_lines; l++) {