| /onnv/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/lib/ |
| sort.pm | 1 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
[all...] |
| /onnv/onnv-gate/usr/src/cmd/refer/ |
| refer0.c | 24 int sort = 0; variable
|
| /onnv/onnv-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/ |
| Aggregate.java | 158 * java.util.Collections#sort(List list, Comparator c)} provided any
208 * sortable using {@link java.util.Collections#sort(List list,
234 * Collections.sort(records, new Comparator <AggregationRecord> () {
251 Collections.sort(list, new Comparator <AggregationRecord> () {
366 Collections.sort(a, new Comparator <Aggregation> () {
|
| Aggregation.java | 196 * sortable using {@link java.util.Collections#sort(List list,
356 // Sort by tuple so that equal aggregations have equal strings
357 Collections.sort(recordList, new Comparator <AggregationRecord> () {
|
| /onnv/onnv-gate/usr/src/cmd/sgs/rtld/common/ |
| tsort.c | 63 int s_num; /* number of objects to sort */
65 } Sort;
91 sort_scc(Sort *sort, int fndx, int flag)
97 Lm_list *lml = LIST(sort->s_lmp);
108 if (sort->s_queue == NULL) {
112 lmp = sort->s_lmp;
115 if (aplist_append(&sort->s_queue, lmp, sort->s_num) == NULL)
120 for (APLIST_TRAVERSE(sort->s_queue, idx1, lmp2))
670 Sort sort = { 0 }; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libcmd/common/ |
| cksum.c | 134 int (*sort)(FTSENT* const*, FTSENT* const*); member in struct:State_s
497 state.sort = order;
590 else if (!(fts = fts_open(argv, flags, state.sort)))
|
| /onnv/onnv-gate/usr/src/cmd/cmd-inet/usr.bin/rdist/ |
| expand.c | 52 #define sort() qsort((char *)sortbase, &eargv[eargc] - sortbase, \ macro
178 sort();
226 sort();
234 sort();
416 sort();
|
| /onnv/onnv-gate/usr/src/cmd/cmd-inet/usr.sadm/dhcpmgr/com/sun/dhcpmgr/ui/ |
| TableSorter.java | 230 sort(this); method
240 public void sort(Object sender) { method in class:TableSorter
347 // Re-sort on this column, but don't change sort order
355 sort(this); method
362 * Add a mouse listener to the Table to trigger a table sort
397 * Notify listeners of sort events; we just use ActionEvent as it's a
|
| /onnv/onnv-gate/usr/src/cmd/cmd-inet/usr.sbin/in.ftpd/ |
| glob.c | 77 static void sort(void);
170 sort();
185 sort();
197 static void sort(void) function
380 sort();
|
| /onnv/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/lib/Unicode/ |
| Collate.pm | 59 # 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 key for each string, UTS #10
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/arn/ |
| arn_calib.c | 58 int16_t sort[ATH9K_NF_CAL_HIST_MAX]; local
62 sort[i] = nfCalBuffer[i];
66 if (sort[j] > sort[j - 1]) {
67 nfval = sort[j];
68 sort[j] = sort[j - 1];
69 sort[j - 1] = nfval;
73 nfval = sort[(ATH9K_NF_CAL_HIST_MAX - 1) >> 1];
|
| /onnv/onnv-gate/usr/src/cmd/cmd-inet/usr.bin/ftp/ |
| glob.c | 90 static void sort(void);
168 sort();
181 sort();
185 sort(void) function
373 sort();
|
| /onnv/onnv-gate/usr/src/cmd/csh/ |
| sh.glob.c | 54 #define sort() qsort((char *)sortbas, &gargv[gargc] - sortbas, \ macro
135 sort();
153 sort();
156 sort();
348 sort();
|
| /onnv/onnv-gate/usr/src/cmd/mailx/ |
| cmd3.c | 60 static void sort(char **list);
557 sort(ap);
624 sort(ap);
709 * Sort the passed string vecotor into ascending dictionary
714 sort(char **list) function
|
| /onnv/onnv-gate/usr/src/cmd/pools/poold/com/sun/solaris/domain/pools/ |
| SystemSolver.java | 624 Arrays.sort(scoresArray,
|
| /onnv/onnv-gate/usr/src/cmd/sgs/prof/common/ |
| prof.c | 44 * -n Sort by symbol name.
45 * -t Sort by decreasing time.
46 * -c Sort by decreasing number of calls.
47 * -a Sort by increasing symbol address.
218 int (*sort)() = NULL; /* Compare routine for sorting output */ variable
253 * Sort flags. Mutually exclusive. These need to be identical to the ones
261 extern unsigned char sort_flag; /* what type of sort ? */
370 int (*fcn)(); /* For function to sort results. */
382 case 'n': /* Sort by symbol name. */
387 case 't': /* Sort by decreasing time. *
[all...] |
| /onnv/onnv-gate/usr/src/cmd/sgs/libld/common/ |
| syms.c | 2527 static Sym_desc **sort; local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/diff/ |
| diff.c | 154 static void sort(struct line *, int);
470 sort(sfile[0], slen[0]);
471 sort(sfile[1], slen[1]);
1810 sort(struct line *a, int n) \/* shellsort CACM #201 *\/ function
[all...] |
| /onnv/onnv-gate/usr/src/cmd/sort/common/ |
| types.h | 224 * sort(1) has, for debugging purposes, a primitive compile-time option to
250 typedef struct sort { struct
|
