int add_interval(int n, int *switches, int start, int end) {
int f, g, k;
+ if(start == end) { return n; }
+
f = 0;
while(f < n && switches[f] <= start) { f++; }
g = f;
return n + 2;
}
- if(f%2) {
-
- if(f == g) {
- /* switches[f-1] start end switches[f] */
- /* |XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX| */
- return n;
- }
+ if(f % 2) {
- if(g%2) {
+ if(g % 2) {
/* switches[f-1] start switches[f] switches[g-1] end switches[g] */
/* |XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX| ... |XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX| */
- for(k = f; k < n; k++) { switches[k] = switches[(k - f) + g]; }
+ for(k = f; k < n; k++) { switches[k] = switches[k + (g - f)]; }
return n - (g - f);
} else {
/* switches[f-1] start switches[f] switches[g-1] end switches[g] */
/* |XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX| ... XXXXXXXXXXXX| |XXXXXXXXXX */
switches[g - 1] = end;
- for(k = f; k < n; k++) { switches[k] = switches[(k - f) + (g - 1)]; }
+ for(k = f; k < n; k++) { switches[k] = switches[k + ((g - 1) - f)]; }
return n - ((g - 1) - f);
}
if(f == g) {
/* switches[f-1] start end switches[f] */
/* XXXXXXXXXXXX| |XXXXXXXXXX */
- for(k = n; k >= f; k--) {
+ for(k = n - 1; k >= f; k--) {
switches[k + 2] = switches[k];
}
switches[f] = start;
return n + 2;
}
- if(g%2) {
+ if(g % 2) {
/* switches[f-1] start switches[f] switches[g-1] end switches[g] */
/* XXXXXXXXXXXX| |XXXXXXXXXX ... |XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX| */
switches[f] = start;
- for(k = f + 1; k < n; k++) { switches[k] = switches[(k - (f + 1)) + g]; }
+ for(k = f + 1; k < n; k++) { switches[k] = switches[k + (g - (f + 1))]; }
return n - (g - (f + 1));
} else {
/* switches[f-1] start switches[f] switches[g-1] end switches[g] */
/* XXXXXXXXXXXX| |XXXXXXXXXX ... XXXXXXXXXXXX| |XXXXXXXXXX */
switches[f] = start;
switches[g - 1] = end;
- for(k = f + 1; k < n; k++) { switches[k] = switches[(k - (f + 1)) + (g - 1)]; }
+ for(k = f + 1; k < n; k++) { switches[k] = switches[k + ((g - 1) - (f + 1))]; }
return n - ((g - 1) - (f + 1));
}
}
}
-int match(struct matcher *matcher, char *string, int *switches) {
- int n, nb_switches = 0;
+int match(struct matcher *matcher, char *string, int *nb_switches, int *switches) {
+ int n;
char *where;
+ regmatch_t matches;
+
+ if(nb_switches) { *nb_switches = 0; }
+
if(matcher->nb_patterns >= 0) {
if(matcher->case_sensitive) {
for(n = 0; n < matcher->nb_patterns; n++) {
if((where = strstr(string, matcher->patterns[n])) == 0) return 0;
if(switches) {
- nb_switches = add_interval(nb_switches, switches,
- (int) (where - string),
- (int) (where - string) + strlen(matcher->patterns[n]));
+ *nb_switches = add_interval(*nb_switches, switches,
+ (int) (where - string),
+ (int) (where - string) + strlen(matcher->patterns[n]));
}
}
} else {
for(n = 0; n < matcher->nb_patterns; n++) {
if((where = strcasestr(string, matcher->patterns[n])) == 0) return 0;
if(switches) {
- nb_switches = add_interval(nb_switches, switches,
- (int) (where - string),
- (int) (where - string) + strlen(matcher->patterns[n]));
+ *nb_switches = add_interval(*nb_switches, switches,
+ (int) (where - string),
+ (int) (where - string) + strlen(matcher->patterns[n]));
+ #warning CHECK THE INTERVALS
+ {
+ int k, i;
+ FILE *out = fopen("/tmp/intervals", "w");
+ for(k = 0; k < (*nb_switches)/2; k++) {
+ i = 0;
+ for(; i < switches[2 * k]; i++) fprintf(out, "-");
+ for(; i < switches[2 * k + 1]; i++) fprintf(out, "%c", string[i]);
+ for(; i < strlen(string); i++) fprintf(out, "-");
+ fprintf(out, "\n");
+ }
+ fclose(out);
+ for(k = 0; k < *nb_switches - 1; k++) {
+ if(switches[k] > switches[k+1]) {
+ abort();
+ }
+ }
+ }
}
}
}
return 1;
} else {
- return regexec(&matcher->preg, string, 0, 0, 0) == 0;
+ if(regexec(&matcher->preg, string, 1, &matches, 0) == 0) {
+ if(switches) {
+ *nb_switches = 2;
+ switches[0] = matches.rm_so;
+ switches[1] = matches.rm_eo;
+ }
+ return 1;
+ } else {
+ return 0;
+ }
}
}
int previous_visible(int current_line, char **lines, struct matcher *matcher) {
int line = current_line - 1;
- while(line >= 0 && !match(matcher, lines[line], 0)) line--;
+ while(line >= 0 && !match(matcher, lines[line], 0, 0)) line--;
return line;
}
int next_visible(int current_line, int nb_lines, char **lines,
struct matcher *matcher) {
int line = current_line + 1;
- while(line < nb_lines && !match(matcher, lines[line], 0)) line++;
+ while(line < nb_lines && !match(matcher, lines[line], 0, 0)) line++;
if(line < nb_lines)
return line;
if(switches[2 * w] < switches[2 * w + 1]) {
next = switches[2 * w];
if(next > line_width) { next = line_width; }
- addnstr(buffer + current, next - current);
+ if(next > current) { addnstr(buffer + current, next - current); }
attron(attr_hits);
current = next;
next = switches[2 * w + 1];
if(next > line_width) { next = line_width; }
- addnstr(buffer + current, next - current);
+ if(next > current) { addnstr(buffer + current, next - current); }
attroff(attr_hits);
current = next;
}
int console_width, console_height;
int nb_printed_lines = 0;
int cursor_x;
+ int nb_switches;
initialize_matcher(&matcher, use_regexp, case_sensitive, pattern);
- if(show_hits && matcher.nb_patterns > 0) {
+ if(show_hits && matcher.nb_patterns >= 0) {
switches = safe_malloc(sizeof(int) * matcher.nb_patterns * 2);
} else {
- switches = 0;
+ switches = safe_malloc(sizeof(int) * 2);
}
console_width = getmaxx(stdscr);
else if(nb_lines > 0) {
int new_focus_line;
- if(match(&matcher, lines[*current_focus_line], 0)) {
+ if(match(&matcher, lines[*current_focus_line], 0, 0)) {
new_focus_line = *current_focus_line;
} else {
new_focus_line = next_visible(*current_focus_line, nb_lines, lines,
if(first_line > 0) {
first_line--;
- while(first_line > 0 && !match(&matcher, lines[first_line], 0)) {
+ while(first_line > 0 && !match(&matcher, lines[first_line], 0, 0)) {
first_line--;
}
- if(match(&matcher, lines[first_line], 0)) {
+ if(match(&matcher, lines[first_line], 0, 0)) {
nb_match++;
}
}
if(nb_match < console_height - 1 && last_line < nb_lines - 1) {
last_line++;
- while(last_line < nb_lines - 1 && !match(&matcher, lines[last_line], 0)) {
+ while(last_line < nb_lines - 1 && !match(&matcher, lines[last_line], 0, 0)) {
last_line++;
}
- if(match(&matcher, lines[last_line], 0)) {
+ if(match(&matcher, lines[last_line], 0, 0)) {
nb_match++;
}
}
/* Now we display them */
for(l = first_line; l <= last_line; l++) {
- if(match(&matcher, lines[l], switches)) {
+ if(match(&matcher, lines[l], &nb_switches, switches)) {
int k = 0;
while(lines[l][k] && k < BUFFER_SIZE - 2 && k < console_width) {
}
attron(attr_focus_line);
print_string_with_switches(buffer, k, console_width,
- matcher.nb_patterns, switches);
+ nb_switches / 2, switches);
attroff(attr_focus_line);
} else {
if(show_long_lines && k >= console_width) {
buffer[k++] = '\n';
buffer[k++] = '\0';
}
+
print_string_with_switches(buffer, k, console_width,
- matcher.nb_patterns, switches);
+ nb_switches / 2, switches);
}
nb_printed_lines++;