Pārlūkot izejas kodu

Omit sorting if no matches/entries

master
Arun Prakash Jana pirms 6 gadiem
vecāks
revīzija
5624905803
Šim parakstam datu bāzē netika atrasta zināma atslēga GPG atslēgas ID: A75979F35C080412
1 mainītis faili ar 8 papildinājumiem un 2 dzēšanām
  1. +8
    -2
      nnn.c

+ 8
- 2
nnn.c Parādīt failu

@@ -1050,7 +1050,7 @@ nextsel(char **run, char **env, int *presel)
/*
* Move non-matching entries to the end
*/
static void
static int
fill(struct entry **dents, int (*filter)(regex_t *, char *), regex_t *re)
{
static int count;
@@ -1071,6 +1071,8 @@ fill(struct entry **dents, int (*filter)(regex_t *, char *), regex_t *re)
continue;
}
}

return ndents;
}

static int
@@ -1082,8 +1084,10 @@ matches(char *fltr)
if (setfilter(&re, fltr) != 0)
return -1;

fill(&dents, visible, &re);
ndents = fill(&dents, visible, &re);
regfree(&re);
if (ndents == 0)
return 0;

qsort(dents, ndents, sizeof(*dents), entrycmp);

@@ -2224,6 +2228,8 @@ populate(char *path, char *oldname, char *fltr)

ndents = dentfill(path, &dents, visible, &re);
regfree(&re);
if (ndents == 0)
return 0;

qsort(dents, ndents, sizeof(*dents), entrycmp);



Notiek ielāde…
Atcelt
Saglabāt