+ int nb_patterns = 1;
+
+ for(char *s = pattern_list; *s; s++) {
+ if(*s == pattern_separator) {
+ nb_patterns++;
+ }
+ }
+
+ char splitted_patterns[strlen(pattern_list) + 1];
+ char *patterns[nb_patterns];
+
+ strcpy(splitted_patterns, pattern_list);
+
+ int n = 0;
+ char *last_pattern_start = splitted_patterns;
+ for(char *s = splitted_patterns; n < nb_patterns; s++) {
+ if(*s == pattern_separator || *s == '\0') {
+ *s = '\0';
+ patterns[n++] = last_pattern_start;
+ last_pattern_start = s + 1;
+ }
+ }
+
+ // We now take care of printing the lines per se
+
+ int console_width = getmaxx(stdscr);
+ int console_height = getmaxy(stdscr);
+
+ int nb_printed_lines = 1;
+
+ // First, we find a visible line. In priority: The current, or the
+ // first visible after it, or the first visible before it.
+
+ int new_line;
+ if(match(lines[*current_line], nb_patterns, patterns)) {
+ new_line = *current_line;
+ } else {
+ new_line = next_visible(*current_line, nb_lines, lines, nb_patterns, patterns);
+ if(new_line < 0) {
+ new_line = previous_visible(*current_line, nb_lines, lines, nb_patterns, patterns);
+ }
+ }
+
+ // If we found a visible line and we should move, let's move
+
+ if(new_line >= 0 && motion != 0) {
+ int l = new_line;
+ if(motion > 0) {
+ // We want to go down, let's find the first visible line below
+ for(int m = 0; l >= 0 && m < motion; m++) {
+ l = next_visible(l, nb_lines, lines, nb_patterns, patterns);
+ if(l >= 0) {
+ new_line = l;
+ }
+ }
+ } else {
+ // We want to go up, let's find the first visible line above
+ for(int m = 0; l >= 0 && m < -motion; m++) {
+ l = previous_visible(l, nb_lines, lines, nb_patterns, patterns);
+ if(l >= 0) {
+ new_line = l;
+ }
+ }
+ }
+ }
+
+ if(!no_blink) {
+ clear();
+ }