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

12345

/haiku-fatelf/src/bin/coreutils/man/
H A Dsort.x2 sort \- sort lines of text files
H A Dtsort.x2 tsort \- perform topological sort
/haiku-fatelf/src/libs/ncurses/progs/
H A DMKtermsort.sh4 # MKtermsort.sh -- generate indirection vectors for the various sort methods
34 # The output of this script is C source for nine arrays that list three sort
54 echo " * termsort.c --- sort order arrays for use by infocmp.";
64 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
73 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
82 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
91 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
100 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
109 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
118 ' | sort |
[all...]
/haiku-fatelf/src/libs/ncurses/misc/
H A Dcsort31 # override anything that might cause 'sort' to do the wrong thing...
36 sort $*
/haiku-fatelf/src/libs/edit/
H A Dmakelist144 sort | LC_ALL=C tr 'a-z' 'A-Z' | $AWK '
165 cat $FILES | $AWK '/el_action_t/ { print $3 }' | sort | $AWK '
/haiku-fatelf/src/libs/ncurses/include/
H A DMKkey_defs.sh49 if sort -k 6 $DATA >$data 2>/dev/null
52 sed -e 's/[ ][ ]*/ /g' < $DATA |sort -n -k 6 >$data
53 elif sort -n +5 $DATA >$data 2>/dev/null
56 sed -e 's/[ ][ ]*/ /g' < $DATA |sort -n +5 >$data
58 echo "Your sort utility is broken. Please install one that works." >&2
/haiku-fatelf/src/add-ons/kernel/bus_managers/scsi/
H A Dqueuing.cpp19 which uses elevator sort.
40 are added to a device-specific request queue in an elevator-sort style,
52 // add request to device queue, using evelvator sort
59 new_request->sort );
70 first, first->sort, device->last_sort );
79 if( new_request->sort < 0 ) {
86 // - sort request accendingly according to head position
108 if( (device->last_sort <= new_request->sort &&
109 new_request->sort <= first->sort) ||
[all...]
H A Ddevice_scan.cpp43 worker_req->sort = -1;
87 worker_req->sort = -1;
H A Dccb.cpp44 ccb->sort = -1;
/haiku-fatelf/src/libs/print/libgutenprint/src/foomatic/
H A Dmk_printerlist.in30 print sort @printer_names;
/haiku-fatelf/src/add-ons/kernel/generic/scsi_periph/
H A Dsync.cpp32 request->sort = -1;
H A Dscsi_periph.cpp36 ccb->sort = -1;
80 backup_sort = request->sort;
94 request->sort = backup_sort;
H A Dremovable.cpp47 backup_sort = request->sort;
60 request->sort = backup_sort;
98 request->sort = -1;
213 request->sort = -1;
H A Dblock.cpp38 request->sort = -1;
/haiku-fatelf/3rdparty/pulkomandy/
H A Dcatmerge.sh25 # Sort-merge old and new, inserting lines from NEW into OLD (sort);
28 sort -u -t"$TAB" -k 1,2 <(tail -n +2 $OLD) <(tail -n +2 $NEW)|\
/haiku-fatelf/src/tests/kits/midi/synth_file_reader/
H A DTList.h106 sort_func sort = (sort_func)comp; local
107 fList.SortItems(sort);
/haiku-fatelf/src/bin/findutils/locate/
H A Dupdatedb.sh61 sort="@SORT@"
67 sort="@SORT@ -z"
71 sort="@SORT@"
190 # FIXME figure out how to sort null-terminated strings, and use -print0.
221 } | $sort -f | $frcode $frcode_options > $LOCATE_DB.n
291 } | tr / '\001' | $sort -f | tr '\001' / > $filelist
294 $bigram $bigram_opts < $filelist | sort | uniq -c | sort -nr |
/haiku-fatelf/src/bin/gdb/libiberty/
H A Dmaint-tool70 for $f (sort keys %have) {
76 for $f (sort keys %listed) {
127 # $out = join(' ', sort keys %documented);
172 for $k (sort keys %saw) {
177 for $f (sort keys %fromfile) {
250 for $f (sort readdir S) {
266 @deps = sort { &locals_first($a,$b) } keys %scanned;
H A Dgather-docs115 for $key (sort keys %name) {
/haiku-fatelf/src/libs/ncurses/test/
H A Dlistused.sh31 for name in `(echo "test:";sort modules; echo "progs:";sort ../progs/modules) |sed -e 's/[ ].*//' -e '/^[#@]/d'`
71 sort -u`
/haiku-fatelf/src/bin/debug/time_stats/
H A Dtiming_analysis.cpp103 // sort the infos, so we can compare them better
104 std::sort(initialUsage, initialUsage + initialUsageCount,
106 std::sort(finalUsage, finalUsage + finalUsageCount,
161 // sort results
162 std::sort(sortedThreads, sortedThreads + sortedThreadCount,
H A Dscheduling_analysis.cpp168 // sort the thread by run time
169 std::sort(analysis.threads, analysis.threads + analysis.thread_count,
186 // sort the wait objects by type + name
187 std::sort(waitObjects, waitObjects + waitObjectCount,
216 // sort the groups by wait time
217 std::sort(waitObjectGroups, waitObjectGroups + groupCount,
245 // sort the wait objects by wait time
246 std::sort(group.objects, group.objects + group.count,
/haiku-fatelf/headers/libs/print/libprint/
H A DPrintUtils.h130 sort_func sort = (sort_func)comp; local
131 fList.SortItems(sort);
/haiku-fatelf/src/bin/sharutils/src/
H A Dremsync379 foreach (sort keys %signature)
539 foreach (sort keys %scan)
601 foreach (sort keys %ignore)
708 foreach (sort keys %scan)
712 foreach (sort keys %ignore)
724 foreach $file (sort keys %signature)
919 foreach $file (sort keys %signature)
1133 foreach $remote (sort keys %remote)
1152 foreach $remote (sort keys %remote_received)
1167 foreach $scan (sort key
[all...]
H A Dremsync.in379 foreach (sort keys %signature)
539 foreach (sort keys %scan)
601 foreach (sort keys %ignore)
708 foreach (sort keys %scan)
712 foreach (sort keys %ignore)
724 foreach $file (sort keys %signature)
919 foreach $file (sort keys %signature)
1133 foreach $remote (sort keys %remote)
1152 foreach $remote (sort keys %remote_received)
1167 foreach $scan (sort key
[all...]

Completed in 209 milliseconds

12345