Removed the atrocious -n option.

[selector.git] / selector.c

diff --git a/selector.c b/selector.c
index 4746d01..da3bc4a 100644 (file)
--- a/selector.c
+++ b/selector.c
@@ -65,7 +65,6 @@ int use_regexp = 0;
 int case_sensitive = 0;
 char *title = 0;
 int error_flash = 0;
-int exclamation_negates = 0;
 int upper_caps_makes_case_sensitive = 0;
 
 int attr_modeline, attr_focus_line, attr_error;
@@ -76,7 +75,7 @@ int attr_modeline, attr_focus_line, attr_error;
 
 void *safe_malloc(size_t n) {
   void *p = malloc(n);
-  if (!p && n != 0) {
+  if(!p && n != 0) {
     fprintf(stderr,
             "selector: can not allocate memory: %s\n", strerror(errno));
     exit(EXIT_FAILURE);
@@ -192,8 +191,6 @@ void usage(FILE *out) {
   fprintf(out, " -u, --upper-case-makes-case-sensitive\n");
   fprintf(out, "         using an upper case character in the matching string makes\n");
   fprintf(out, "         the matching case-sensitive\n");
-  fprintf(out, " -n, --exclamation-negates\n");
-  fprintf(out, "         substrings starting with an exclamation mark have to be absent\n");
   fprintf(out, " -m, --monochrome\n");
   fprintf(out, "         monochrome mode\n");
   fprintf(out, " -q, --no-beep\n");
@@ -291,7 +288,8 @@ int add_and_get_previous_index(struct hash_table_t *hash_table,
     /* We came back to our original code, which means that the table
        is full */
     if(code == start) {
-      printf("Full hash table (that should not happen)\n");
+      fprintf(stderr,
+              "Full hash table (that should not happen)\n");
       exit(EXIT_FAILURE);
    }
   }
@@ -319,32 +317,12 @@ int match(struct matcher *matcher, char *string) {
   int n;
   if(matcher->nb_patterns >= 0) {
     if(matcher->case_sensitive) {
-      if(exclamation_negates) {
-        for(n = 0; n < matcher->nb_patterns; n++) {
-          if(matcher->patterns[n][0] == '!') {
-            if(strstr(string, matcher->patterns[n] + 1) != 0) return 0;
-          } else {
-            if(strstr(string, matcher->patterns[n]) == 0) return 0;
-          }
-        }
-      } else {
-        for(n = 0; n < matcher->nb_patterns; n++) {
-          if(strstr(string, matcher->patterns[n]) == 0) return 0;
-        }
+      for(n = 0; n < matcher->nb_patterns; n++) {
+        if(strstr(string, matcher->patterns[n]) == 0) return 0;
       }
     } else {
-      if(exclamation_negates) {
-        for(n = 0; n < matcher->nb_patterns; n++) {
-          if(matcher->patterns[n][0] == '!') {
-            if(strcasestr(string, matcher->patterns[n] + 1) != 0) return 0;
-          } else {
-            if(strcasestr(string, matcher->patterns[n]) == 0) return 0;
-          }
-        }
-      } else {
-        for(n = 0; n < matcher->nb_patterns; n++) {
-          if(strcasestr(string, matcher->patterns[n]) == 0) return 0;
-        }
+      for(n = 0; n < matcher->nb_patterns; n++) {
+        if(strcasestr(string, matcher->patterns[n]) == 0) return 0;
       }
     }
     return 1;
@@ -928,10 +906,6 @@ int main(int argc, char **argv) {
       upper_caps_makes_case_sensitive = 1;
       break;
 
-    case 'n':
-      exclamation_negates = 1;
-      break;
-
     case 't':
       free(title);
       title = safe_malloc((strlen(optarg) + 1) * sizeof(char));
@@ -1222,7 +1196,7 @@ int main(int argc, char **argv) {
 
   /* Here we come back to standard display */
 
-  if((key == KEY_ENTER || key == '\n')) {
+  if(key == KEY_ENTER || key == '\n') {
 
     char *t;