Searched refs:sorted (Results 1 - 25 of 27) sorted by relevance

12

/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/
H A Dsort.t103 my ($ts, $unsorted, @sorted, $status);
111 @sorted = sort { substr($a, 0, $RootWidth)
114 $status = checkorder(\@sorted);
122 @sorted = sort { substr($a, $RootWidth)
124 substr($b, $RootWidth) } @sorted;
125 $status = checkequal(\@sorted, $unsorted);
H A Dsort.pm127 C<sort()> to merge several sorted arrays. On the other hand, quicksort
H A DBenchmark.t220 like ($got, qr/\bBar\b.*\bBaz\b.*\bFoo\b/s, 'check output is in sorted order');
H A DDigest.pm264 different algorithms. It is sorted by throughput based on a benchmark
H A DBenchmark.pm219 This chart is sorted from slowest to fastest, and shows the percent speed
/osnet-11/usr/src/grub/grub2/grub-core/fs/
H A Djfs.c122 /* The location of the sorted array of pointers to dirents. */
200 grub_uint8_t sorted[8]; member in struct:grub_jfs_inode::__anon404::__anon406::__anon407
231 grub_uint8_t sorted[0]; member in union:grub_jfs_diropen::__anon409
236 grub_uint8_t *sorted; member in struct:grub_jfs_diropen
422 diro->sorted = inode->dir.header.sorted;
435 blk = grub_le_to_cpu32 (de[inode->dir.header.sorted[0]].ex.blk2);
444 diro->dirpage->sorted))
452 index = diro->dirpage->sorted[diro->dirpage->header.sindex * 32];
460 diro->sorted
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/lib/
H A Drelocator.c669 /* Now events are nicely sorted. */
1472 struct grub_relocator_chunk *sorted; local
1510 from = grub_malloc (nchunks * sizeof (sorted[0]));
1511 to = grub_malloc (nchunks * sizeof (sorted[0]));
1541 sorted = from;
1547 grub_dprintf ("relocator", "sorted chunk %p->%p, 0x%lx\n",
1548 (void *) sorted[j].src, (void *) sorted[j].target,
1549 (unsigned long) sorted[j].size);
1550 if (sorted[
[all...]
/osnet-11/usr/src/lib/pyzfs/common/
H A Dallow.py109 for (nwho, perms) in sorted(d.items()):
115 (nwho[1:], ",".join(sorted(perms)))
125 s += "\t%s\n" % ",".join(sorted(self.create))
260 for (name, note) in sorted(perms_subcmd.iteritems()):
263 for (name, note) in sorted(perms_other.iteritems()):
333 for fs in sorted(p.keys(), reverse=True):
/osnet-11/usr/src/cmd/hal/hald/
H A Dids.c553 * Keep this sorted!
977 static gboolean sorted = FALSE; local
980 if (!sorted) {
984 sorted = TRUE;
/osnet-11/usr/src/lib/libdtrace/common/
H A Ddt_aggregate.c1326 dt_ahashent_t *h, **sorted; local
1333 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *));
1335 if (sorted == NULL)
1339 sorted[i++] = h;
1344 dt_aggregate_qsort(dtp, sorted, nentries,
1352 qsort(sorted, nentries, sizeof (dt_ahashent_t *), sfunc);
1358 h = sorted[i];
1361 dt_free(dtp, sorted);
1366 dt_free(dtp, sorted);
1446 dt_ahashent_t *h, **sorted local
[all...]
/osnet-11/usr/src/tools/onbld/hgext/
H A Dcdm.py145 return [(path, None) for path in sorted(files)]
148 return [(ws.filepath(e.name), e) for e in sorted(active)]
308 for chng in sorted(lst.keys()):
310 for elt in sorted(lst[chng]):
360 for entry in sorted(filter(lambda x: x.is_renamed(), act)):
978 for head in sorted(map(repo.changelog.rev, heads), reverse=True):
1043 for name, nd, rev, local in sorted(clearedtags,
1048 for ntag, nnode in sorted(repo.tags().items(),
1061 for path in sorted(files):
/osnet-11/usr/src/tools/onbld/Scm/
H A DWorkSpace.py516 ltip = sorted(localctxs or headctxs, key=lambda x: x.rev())[-1]
554 return sorted(ptips, key=lambda x: x.rev(), reverse=True)[0]
598 return sorted(wctx.files() + wctx.deleted()) or None
/osnet-11/usr/src/lib/libsqlite/tool/
H A Dlemon.c233 struct state **sorted; /* Table of states sorted by state number */ member in struct:lemon
729 /* Extract the sorted basis of the new state. The basis was constructed
828 stp = lemp->sorted[i];
837 stp = lemp->sorted[i];
862 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){
870 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){
903 stp = lemp->sorted[i];
927 Action_add(&lemp->sorted[0]->ap,ACCEPT,sp,0);
933 stp = lemp->sorted[
[all...]
/osnet-11/usr/src/lib/libuutil/common/
H A Duu_list.c317 int sorted = lp->ul_sorted; local
336 if (sorted && cmp > 0) {
/osnet-11/usr/src/grub/grub2/
H A Dgentpl.py88 for var in sorted(GVARS):
/osnet-11/usr/src/lib/libnsl/nss/
H A Dnetdir_inet.c1664 struct in_addr **sorted; local
1685 sorted = (struct in_addr **)sortbuf;
1750 * element for that class in the sorted address list. 'rc' is
1755 classnext[i] = &sorted[rc];
1765 /* Copy the sorted list to inaddrlist */
1766 (void) memcpy(inaddrlist, sorted,
2059 * in haddrlist, which have already been sorted by order_haddrlist_inet()
3040 * to determine if the addresses need to be sorted.
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Data/Dumper/
H A DDumper.pm967 sorted order. A true value will cause the keys of all hashes to be
977 are not sorted.
/osnet-11/usr/src/cmd/ldap/common/
H A Dldapsearch.c866 printf( gettext("Server indicated results sorted OK\n"));
1145 success (0), -- results are sorted
1149 strongAuthRequired (8), -- refused to return sorted
1159 insufficientAccessRights (50), -- refused to return sorted
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/File/Glob/
H A DGlob.pm268 By default, the pathnames are sorted in ascending ASCII order; this
/osnet-11/usr/src/lib/libast/common/comp/
H A Dconf.sh1580 * conf strings sorted in ascending order
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/utils/
H A Ddprofpp.PL246 Branches are sorted w.r.t. inclusive time.
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Storable/
H A DStorable.pm512 hashes with the elements sorted by their key. This allows you to
855 populated, sorted and freed. Some tests have shown a halving of the
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Unicode/
H A DCollate.pm738 ## list[strings] sorted = sort(list[strings] arg)
1082 @sorted = $Collator->sort(@not_sorted);
1475 =item C<@sorted = $Collator-E<gt>sort(@not_sorted)>
/osnet-11/usr/src/lib/rad/pyrad/common/
H A Dclient.py885 self._sortedkeys = sorted(kvs, key = lambda kv: kv[0])
/osnet-11/usr/src/grub/grub-0.97/docs/
H A Dtexinfo.tex3440 % sorted result.
3549 % Define the macros used in formatting output of the sorted index material.
3597 % These macros are used by the sorted index file itself.

Completed in 118 milliseconds

12