/freebsd-10-stable/contrib/unbound/libunbound/python/examples/ |
H A D | dnssec_test.py | 16 print("RRSIGs from answer:", sorted(rrsigs)) 19 print("RRSIGs from authority:", sorted(rrsigs)) 22 print("NSECs:", sorted(nsecs)) 25 print("NSEC3s:", sorted(nsec3s))
|
H A D | idn-lookup.py | 49 for k in sorted(result.data.address_list): 56 for k in sorted(result.data.mx_list_idn): 62 for k in sorted(result.data.domain_list_idn):
|
H A D | example8-1.py | 46 for k in sorted(result.data.mx_list): 53 for k in sorted(result.data.address_list): 60 for k in sorted(result.data.domain_list):
|
H A D | mx-lookup.py | 46 for k in sorted(result.data.mx_list): 53 for k in sorted(result.data.address_list):
|
H A D | async-lookup.py | 43 print("Call_back:", sorted(my_data)) 45 print("Result:", sorted(result.data.address_list))
|
H A D | reverse-lookup.py | 43 print("Result.data:", result.data, sorted(result.data.domain_list))
|
H A D | ns-lookup.py | 46 for k in sorted(result.data.domain_list):
|
H A D | dns-lookup.py | 43 print("Result:", sorted(result.data.address_list))
|
H A D | dnssec-valid.py | 52 print("Result:", sorted(result.data.address_list))
|
/freebsd-10-stable/contrib/netbsd-tests/usr.bin/xlint/lint1/ |
H A D | d_typefun.c | 8 int sorted; member in struct:stack_st
|
/freebsd-10-stable/bin/sh/ |
H A D | alias.c | 181 struct alias **sorted, *ap; local 184 sorted = ckmalloc(aliases * sizeof(*sorted)); 189 sorted[j++] = ap; 190 qsort(sorted, aliases, sizeof(*sorted), comparealiases); 192 printalias(sorted[i]); 196 ckfree(sorted);
|
/freebsd-10-stable/crypto/openssl/crypto/stack/ |
H A D | stack.c | 86 sk->sorted = 0; 108 ret->sorted = sk->sorted; 137 ret->sorted = 0; 177 st->sorted = 0; 329 if (st && !st->sorted) { 341 st->sorted = 1; 349 return st->sorted;
|
H A D | stack.h | 69 int sorted; member in struct:stack_st
|
/freebsd-10-stable/usr.bin/sort/ |
H A D | radixsort.c | 64 struct sort_list_item **sorted; member in struct:sort_level 76 /* stack of sort levels ready to be sorted */ 330 sl->sorted[sl->start_position] = sl->tosort[0]; 336 sl->sorted[sl->start_position++] = sl->tosort[1]; 337 sl->sorted[sl->start_position] = sl->tosort[0]; 339 sl->sorted[sl->start_position++] = sl->tosort[0]; 340 sl->sorted[sl->start_position] = sl->tosort[1]; 373 memcpy(sl->sorted + sl->start_position, 425 memcpy(sl->sorted + sl->start_position, sl->leaves, 441 slc->sorted [all...] |
/freebsd-10-stable/contrib/subversion/subversion/libsvn_delta/ |
H A D | path_driver.c | 162 apr_array_header_t *sorted = apr_array_copy(subpool, paths); 163 svn_sort__array(sorted, svn_sort_compare_paths); 164 paths = sorted; 160 apr_array_header_t *sorted = apr_array_copy(subpool, paths); local
|
/freebsd-10-stable/contrib/llvm/tools/clang/utils/TableGen/ |
H A D | ClangSACheckersEmitter.cpp | 268 std::map<int, const Record *> sorted; local 271 sorted[(*I)->getID()] = *I; 274 I = sorted.begin(), E = sorted.end(); I != E; ++I) 283 std::map<int, const Record *> sorted; local 286 sorted[(*I)->getID()] = *I; 289 I = sorted.begin(), E = sorted.end(); I != E; ++I) {
|
/freebsd-10-stable/cddl/contrib/opensolaris/lib/pyzfs/common/ |
H A D | allow.py | 111 for (nwho, perms) in sorted(d.items()): 117 (nwho[1:], ",".join(sorted(perms))) 127 s += "\t%s\n" % ",".join(sorted(self.create)) 261 for (name, note) in sorted(perms_subcmd.iteritems()): 264 for (name, note) in sorted(perms_other.iteritems()): 267 for (name, prop) in sorted(zfs.dataset.proptable.iteritems()): 333 for fs in sorted(p.keys(), reverse=True):
|
/freebsd-10-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/pragma/ |
H A D | tst.temporal.ksh | 23 # temporal option causes output to be sorted 82 echo $tst: output is not sorted
|
/freebsd-10-stable/usr.bin/gprof/ |
H A D | printgprof.c | 411 arctype sorted; local 416 * then insertion sort back on to sorted's children. 418 * *detachedp the rest of the arcs to be sorted. 419 * sorted arc list onto which you insertion sort. 422 sorted.arc_childlist = 0; 428 * insert it into sorted 430 for ( prevp = &sorted ; 441 * reattach sorted children to parent 443 parentp -> children = sorted.arc_childlist; 451 arctype sorted; local [all...] |
/freebsd-10-stable/contrib/subversion/ |
H A D | gen-make.py | 80 gen_keys = sorted(generator.__dict__.keys()) 111 items = sorted(gen_modules.items())
|
/freebsd-10-stable/contrib/gcc/ |
H A D | unwind-dw2-fde.h | 59 unsigned long sorted : 1; member in struct:object::__anon1213::__anon1214
|
/freebsd-10-stable/usr.bin/col/ |
H A D | col.c | 436 static CHAR *sorted; local 445 if ((sorted = realloc(sorted, 470 sorted[count[c->c_column]++] = *c; 471 c = sorted;
|
/freebsd-10-stable/cddl/contrib/opensolaris/lib/libdtrace/common/ |
H A D | dt_aggregate.c | 1534 dt_ahashent_t *h, **sorted; local 1558 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *)); 1560 if (sorted == NULL) 1564 sorted[i++] = h; 1569 dt_aggregate_qsort(dtp, sorted, nentries, 1577 qsort(sorted, nentries, sizeof (dt_ahashent_t *), sfunc); 1583 h = sorted[i]; 1597 dt_free(dtp, sorted); 1677 dt_ahashent_t *h, **sorted = NULL, ***bundle, **nbundle; local 1956 * allocate our sorted arra [all...] |
/freebsd-10-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | sorts.c | 50 an "ordered list" of some kind -- in this case, a nicely sorted 155 svn_boolean_t sorted; 162 sorted = TRUE; 176 if (sorted) 178 sorted = (comparison_func(prev_item, item) < 0); 183 /* quicksort the array if it isn't already sorted. */ 184 if (!sorted) 195 The array must already be sorted in the ordering defined by COMPARE_FUNC. 153 svn_boolean_t sorted; local
|
H A D | mergeinfo.c | 295 svn_boolean_t sorted = FALSE; local 307 sorted = (svn_sort_compare_ranges(&lastrange, 315 sorted = TRUE; 323 sorted = (svn_sort_compare_ranges(&lastrange, 359 sorted = (svn_sort_compare_ranges(&lastrange, 362 if (sorted) 363 sorted = (svn_sort_compare_ranges(&r1, &r2) < 0); 428 sorted = (svn_sort_compare_ranges(&lastrange, &r1) < 0); 432 if (sorted) 433 sorted 1963 apr_array_header_t *sorted = local [all...] |