Searched refs:nsort (Results 1 - 7 of 7) sorted by relevance
/macosx-10.9.5/zsh-60/zsh/Src/ |
H A D | sort.c | 210 int oldsortdir, oldsortnumeric, nsort; local 212 nsort = arrlen(array); 213 if (nsort < 2) 218 sortptrarr = (SortElt *) zhalloc(nsort * sizeof(SortElt)); 219 sortarr = (SortElt) zhalloc(nsort * sizeof(struct sortelt)); 371 qsort(sortptrarr, nsort, sizeof(SortElt *), eltpcmp); 375 for (arrptr = array, sortptrarrptr = sortptrarr; nsort--; ) {
|
/macosx-10.9.5/CPANInternal-140/Template-Toolkit/bin/ |
H A D | tt-bench.pl | 233 0) size: [% primes.size %] ([% primes.nsort.first %]..[% primes.nsort.last %]) 245 1) [% r.e.c.u.r.s.e.primes.nsort.first %]...[% recurse.primes.nsort.last %] 275 3) [% FOREACH n = groceries.nsort.reverse -%] I got [% groceries.$n %] kilos of [% n %]! [% END %]
|
/macosx-10.9.5/CPANInternal-140/Template-Toolkit-2.24/bin/ |
H A D | tt-bench.pl | 233 0) size: [% primes.size %] ([% primes.nsort.first %]..[% primes.nsort.last %]) 245 1) [% r.e.c.u.r.s.e.primes.nsort.first %]...[% recurse.primes.nsort.last %] 275 3) [% FOREACH n = groceries.nsort.reverse -%] I got [% groceries.$n %] kilos of [% n %]! [% END %]
|
/macosx-10.9.5/libresolv-54/ |
H A D | res_init.c | 217 n = res->nsort; 223 res->nsort = n; 536 int nsort = 0; local 604 statp->nsort = 0; 870 while (nsort < MAXRESOLVSORT) 881 statp->sort_list[nsort].addr = a; 891 statp->sort_list[nsort].mask = a.s_addr; 895 statp->sort_list[nsort].mask = net_mask(statp->sort_list[nsort].addr); 900 statp->sort_list[nsort] [all...] |
H A D | resolv.h | 196 unsigned nsort:4; /* number of elements in sort_list[] */ member in struct:__res_state
|
/macosx-10.9.5/CPANInternal-140/Template-Toolkit/lib/Template/ |
H A D | VMethods.pm | 81 nsort => \&hash_nsort, 101 nsort => \&list_nsort,
|
/macosx-10.9.5/CPANInternal-140/Template-Toolkit-2.24/lib/Template/ |
H A D | VMethods.pm | 81 nsort => \&hash_nsort, 101 nsort => \&list_nsort,
|
Completed in 145 milliseconds