Searched defs:sort (Results 1 - 5 of 5) sorted by relevance

/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/
H A Dsort.pm1 package sort; package
6 # $sort::hints. An improvement would be to store them in $^H{SORT} and have
12 $sort::quicksort_bit = 0x00000001;
13 $sort::mergesort_bit = 0x00000002;
14 $sort::sort_bits = 0x000000FF; # allow 256 different ones
15 $sort::stable_bit = 0x00000100;
23 Carp::croak("sort pragma requires arguments");
28 if (/^_q(?:uick)?sort$/) {
29 $hints &= ~$sort::sort_bits;
30 $hints |= $sort
[all...]
/osnet-11/usr/src/lib/libcmd/common/
H A Dcksum.c134 int (*sort)(FTSENT* const*, FTSENT* const*); member in struct:State_s
496 state.sort = order;
592 else if (!(fts = fts_open(argv, flags, state.sort)))
H A Dfind.c463 "Reverse the \b-sort\b sense.",
470 "sort", SORT, Str, 0, "option", 0,
471 "Search each directory in \a-option\a sort order, e.g., \b-name\b"
1185 error(2, "%s: invalid sort key", b);
1691 error(1, "invalid sort key -- name assumed");
1711 find(State_t* state, char** paths, int flags, Sort_f sort) argument
1718 if (fts = fts_open(paths, flags, sort))
1740 Sort_f sort; local
1757 sort = 0;
1811 error(1, "-sort ignore
[all...]
/osnet-11/usr/src/cmd/ldap/ns_ldap/
H A Dldaplist.c205 const char *sort = NULL; local
211 sort = databaselist[i].sortattr;
218 sort = databaselist[i].sortattr;
227 sort, merge_SSD_filter, (const char **)ldapattribute, NULL,
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Unicode/
H A DCollate.pm59 # A sort key: 16-bit weights
63 # Level separator in a sort key:
226 for my $v (sort keys %level) {
676 # make sort key
738 ## list[strings] sorted = sort(list[strings] arg)
740 sub sort { subroutine
744 sort{ $a->[0] cmp $b->[0] }
1081 #sort
1082 @sorted = $Collator->sort(@not_sorted);
1232 -- see 4.3 Form a sort ke
[all...]

Completed in 32 milliseconds