/freebsd/contrib/netbsd-tests/usr.bin/sort/ |
H A D | t_sort.sh | 28 # The -S flag in NetBSD sort enables non-stable sorting order. This flag 29 # doesn't exist in FreeBSD sort, and instead indicates buffer size, so all 56 atf_check -o file:expout sort in 67 atf_check -o empty sort empty 68 atf_check sort -c empty 69 atf_check sort -c -u empty 80 atf_check -o file:-k -x "sort -- -k </dev/null" 81 atf_check -s not-exit:1 -e ignore -x "sort - -c </dev/null" 92 atf_check -o inline:'x\n' sort in 103 atf_check -o inline:'\0a\n\0b\n' sort in [all …]
|
/freebsd/usr.bin/sort/ |
H A D | sort.1.in | 1 .\" $OpenBSD: sort.1,v 1.45 2015/03/19 13:51:10 jmc Exp $ 37 .Nm sort 38 .Nd sort or merge records (lines) of text and binary files 63 Comparisons are based on one or more sort keys extracted from 123 implies a stable sort. 131 Stable sort. 143 specifications, they apply globally to all sort keys. 156 .It Fl g , Fl Fl general-numeric-sort , Fl Fl sort=general-numeric 157 Sort by general numerical value. 165 .It Fl h , Fl Fl human-numeric-sort , Fl Fl sort=human-numeric [all …]
|
H A D | coll.h | 35 #include "sort.h" 38 * Sort hint data for -n 49 * Sort hint data for -g 59 * Sort hint data for -M 67 * Sort hint data for -R 78 * Status of a sort hint object 86 * Sort hint object 106 struct key_hint hint[0]; /* key sort hint */ 132 * Single entry in sort list.
|
H A D | Makefile | 4 PROG= sort 5 SRCS= bwstring.c coll.c file.c mem.c radixsort.c sort.c vsort.c 7 sort.1: sort.1.in 10 CLEANFILES+= sort.1
|
/freebsd/tools/test/sort/bigtest/ |
H A D | si | 55 sort.h 56 sort.c 57 sort.1 58 sort.o 59 sort 60 sort.1.gz 61 sort.gmon 66 sort.c.orig 67 sort.hsort.csort.1sort.osortsort.1.gzsort.gmonbigtest/sibigtest/siksbigtest/siks/sik1big…
|
/freebsd/tools/test/sort/bigtest/siks/ |
H A D | sik1 | 55 sort.h 56 sort.c 57 sort.1 58 sort.o 59 sort 60 sort.1.gz 61 sort.gmon 66 sort.c.orig 67 sort.hsort.csort.1sort.osortsort.1.gzsort.gmonbigtest/sibigtest/siksbigtest/siks/sik1big…
|
H A D | sik2 | 55 sort.h 56 sort.c 57 sort.1 58 sort.o 59 sort 60 sort.1.gz 61 sort.gmon 66 sort.c.orig 67 sort.hsort.csort.1sort.osortsort.1.gzsort.gmonbigtest/sibigtest/siksbigtest/siks/sik1big…
|
/freebsd/tools/tools/sortbench/ |
H A D | sort_bench.c | 59 enum test { RAND, SORT, PART, REV, INVALID_TEST }; enumerator 62 enum sort { MERGE, WIKI, QUICK, HEAP, INVALID_ALG }; enum 64 enum sort { MERGE, QUICK, HEAP, INVALID_ALG }; enum 68 * Sort an array with the given algorithm 71 sort(int *testarray, int elts, enum sort s) in sort() function 95 * Sort an array of randomly generated integers 98 rand_bench(int elts, enum sort s) in rand_bench() 103 sort(array, elts, s); in rand_bench() 108 * Sort an array of increasing integers 111 sort_bench(int elts, enum sort s) in sort_bench() [all …]
|
/freebsd/share/examples/sunrpc/sort/ |
H A D | Makefile | 2 FILESDIR=${SHAREDIR}/examples/sunrpc/sort 4 GEN = sort_clnt.c sort_svc.c sort_xdr.c sort.h 13 rsort.o: rsort.c sort.h 16 $(RPCCOM) -l sort.x >$@ 21 sort_proc.o: sort_proc.c sort.h 24 $(RPCCOM) -s udp sort.x >$@ 27 $(RPCCOM) -c sort.x >$@ 29 sort.h: 30 $(RPCCOM) -h sort.x >$@
|
/freebsd/contrib/llvm-project/llvm/lib/Support/ |
H A D | Z3Solver.cpp | 73 /// Wrapper for Z3 Sort 79 Z3_sort Sort; member in __anona2cc94240111::Z3Sort 83 Z3Sort(Z3Context &C, Z3_sort ZS) : Context(C), Sort(ZS) { in Z3Sort() 84 Z3_inc_ref(Context.Context, reinterpret_cast<Z3_ast>(Sort)); in Z3Sort() 88 Z3Sort(const Z3Sort &Other) : Context(Other.Context), Sort(Other.Sort) { in Z3Sort() 89 Z3_inc_ref(Context.Context, reinterpret_cast<Z3_ast>(Sort)); in Z3Sort() 95 Z3_inc_ref(Context.Context, reinterpret_cast<Z3_ast>(Other.Sort)); in operator =() 96 Z3_dec_ref(Context.Context, reinterpret_cast<Z3_ast>(Sort)); in operator =() 97 Sort = Other.Sort; in operator =() 105 if (Sort) in ~Z3Sort() [all …]
|
/freebsd/contrib/elftoolchain/nm/ |
H A D | nm.1 | 43 .Op Fl -no-sort 44 .Op Fl -numeric-sort 49 .Op Fl -reverse-sort 50 .Op Fl -size-sort 136 .It Fl -no-sort 137 Do not sort symbols. 138 .It Fl -numeric-sort 139 Sort symbols numerically by address instead of alphabetically by name. 164 .It Fl -reverse-sort 165 Reverse the order of the sort. [all …]
|
/freebsd/lib/libc/stdlib/ |
H A D | radixsort.3 | 33 .Nd radix sort 49 are implementations of radix sort. 51 These functions sort an array of pointers to byte strings, the initial 58 Applications may specify a sort order by providing the 66 + 1 bytes which contains the sort 68 The end-of-string byte must have a sort weight of 0 or 255 70 More than one byte may have the same sort weight. 74 is useful for applications which wish to sort different characters 76 for A-Z as for a-z will result in a case-insensitive sort. 126 .Xr sort 1 , [all …]
|
/freebsd/contrib/libfido2/man/ |
H A D | check.sh | 12 awk '/^.Nm/ { print $2 }' | sort -u > "$T/Nm" 13 xargs -0 awk '/^.Fn/ { print $2 }' < "$T/files" | sort -u > "$T/Fn" 16 cut -c2- ../src/export.llvm | sort > "$T/exports" 20 awk '/.3$/ { print $1 }' | sort > "$T/listed_sources" 21 xargs -0 -n1 basename < "$T/files" | sort > "$T/actual_sources" 25 sed '1d;$d' | awk '{ print $1, $2 }' | sort > "$T/listed_aliases" 28 sort > "$T/actual_aliases" 33 paste -d " " - - | sed 's/\* /\*/' | sort > "$T/documented_prototypes" 38 done < "$T/exports" | sort > "$T/actual_prototypes"
|
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_user/zfs_list/ |
H A D | zfs_list_002_pos.ksh | 36 # The sort functionality in 'zfs list' works as expected. 40 # 2. Sort the datasets by name, checksum options, creation date. 90 log_assert "The sort functionality in 'zfs list' works as expected." 94 # will make zfs use that locale's sort order. 98 # sort by creation 111 # sort by checksum 127 # sort by name 140 # reverse sort by creation 153 # reverse sort by checksum 163 # reverse sort by name [all …]
|
H A D | zfs_list.kshlib | 34 # A function that verifies sort order. It takes as input 36 # comparing that the sort order passed in via the list 51 # Now check the sort order 62 log_fail "ERROR: Sort by $name fails." 77 # A function that verifies reverse sort order. It takes as input 79 # comparing that the sort order passed in via the list 90 log_note "Checking reverse sort by '$name'," \ 105 log_fail "ERROR: Reverse sort by '$name' fails."
|
/freebsd/crypto/openssl/test/ |
H A D | ssl_test.tmpl | 28 foreach my $key (sort keys %server) { 35 foreach my $key (sort keys %server2) { 42 foreach my $key (sort keys %resume_server) { 50 foreach my $key (sort keys %client) { 56 foreach my $key (sort keys %resume_client) { 64 foreach my $key (sort keys %test) { 93 foreach my $key (sort keys %{$server{"extra"}}) { 100 foreach my $key (sort keys %{$server2{"extra"}}) { 107 foreach my $key (sort keys %{$resume_server{"extra"}}) { 114 foreach my $key (sort keys %{$client{"extra"}}) { [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | SMTAPI.h | 31 /// Returns true if the sort is a bitvector, calls isBitvectorSortImpl(). 34 /// Returns true if the sort is a floating-point, calls isFloatSortImpl(). 37 /// Returns true if the sort is a boolean, calls isBooleanSortImpl(). 40 /// Returns the bitvector size, fails if the sort is not a bitvector 43 assert(isBitvectorSort() && "Not a bitvector sort!"); in getBitvectorSortSize() 49 /// Returns the floating-point size, fails if the sort is not a floating-point 52 assert(isFloatSort() && "Not a floating-point sort!"); in getFloatSortSize() 80 /// Query the SMT solver and checks if a sort is bitvector. 83 /// Query the SMT solver and checks if a sort is floating-point. 86 /// Query the SMT solver and checks if a sort is boolean. [all …]
|
/freebsd/tests/sys/cddl/zfs/tests/cli_user/zfs_list/ |
H A D | zfs_list.kshlib | 30 # A function that verifies sort order. It takes as input 32 # comparing that the sort order passed in via the list 47 # Now check the sort order 58 log_fail "ERROR: Sort by $name fails." 73 # A function that verifies reverse sort order. It takes as input 75 # comparing that the sort order passed in via the list 86 log_note "Checking reverse sort by '$name'," \ 101 log_fail "ERROR: Reverse sort by '$name' fails."
|
H A D | zfs_list_002_pos.ksh | 36 # The sort functionality in 'zfs list' works as expected. 40 # 2. Sort the datasets by name, checksum options, creation date. 99 log_assert "The sort functionality in 'zfs list' works as expected." 103 # will make zfs use that locale's sort order. 107 # sort by creation 120 # sort by checksum 136 # sort by name 149 # reverse sort by creation 162 # reverse sort by checksum 172 # reverse sort by name [all …]
|
/freebsd/tools/test/sort/regression/ |
H A D | Makefile | 7 #SORT?= /usr/local/bin/bsdsort 8 GNUSORT?=~/coreutils/bin/sort 9 SORT?= ../sort macro 15 @LANG=C;${SORT} data/${f} >output/${f} 21 @LANG=C;${SORT} -${opt} data/${f} >output/${f}${opt}
|
/freebsd/contrib/llvm-project/llvm/tools/llvm-nm/ |
H A D | Opts.td | 27 def no_sort : FF<"no-sort", "Show symbols in order encountered">; 29 def numeric_sort : FF<"numeric-sort", "Sort symbols by address">; 35 def reverse_sort : FF<"reverse-sort", "Sort in reverse order">; 36 def size_sort : FF<"size-sort", "Sort symbols by size">; 74 def : F<"n", "Alias for --numeric-sort">, Alias<numeric_sort>; 76 def : F<"p", "Alias for --no-sort">, Alias<no_sort>; 78 def : F<"r", "Alias for --reverse-sort">, Alia [all...] |
/freebsd/tools/test/stress2/misc/ |
H A D | swapoff6.sh | 9 # A swap test scenario, using swapoff(8) and sort(1) for VM pressure 22 timeout -k 2m 1m sort /dev/zero & 31 ncur=`pgrep sort | wc -l` 33 echo "Starting $((nmax - ncur)) sort" 35 timeout -k 2m 1m sort /dev/zero & 40 pkill -9 sort
|
/freebsd/contrib/one-true-awk/bugs-fixed/ |
H A D | space.awk | 11 sort = "LC_ALL=C sort" 15 i ~ /[[:space:]]/ ? "~" : "!~") | sort 19 i ~ /[[:blank:]]/ ? "~" : "!~") | sort 21 close(sort)
|
/freebsd/contrib/ncurses/progs/ |
H A D | MKtermsort.sh | 4 # MKtermsort.sh -- generate indirection vectors for the various sort methods 35 # The output of this script is C source for nine arrays that list three sort 56 * termsort.h --- sort order arrays for use by infocmp. 76 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; 85 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; 94 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; 103 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; 112 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; 121 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; 130 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; [all …]
|
/freebsd/contrib/nvi/catalog/ |
H A D | Makefile | 10 sort -u $@.base | \ 47 awk '{print $$1}' < $$f.base | sort -u > __ck1; \ 48 awk '{print $$1}' < english.base | sort -u > __ck2; \ 56 `sed '/^$$/d' < $$f.base | sort -u | \ 62 sed '/^$$/d' < $$f.base | sort | uniq -c | \ 63 awk '$$1 != 1 { print $$0 }' | sort -n; \ 71 sort -nu > $@
|