/openbsd-current/sys/dev/pci/drm/include/linux/ |
H A D | sort.h | 8 void sort(void *, size_t, size_t, int (*)(const void *, const void *), void *);
|
/openbsd-current/gnu/usr.bin/perl/ext/XS-APItest/t/ |
H A D | sort.t | 9 is join("", sort xs_cmp split//, '1415926535'), '1135559246', 10 'sort treats XS cmp routines as having implicit ($$)'; 14 () = sort xs_cmp_undef 1,2; 15 like $w, qr/^Use of uninitialized value in sort at /, 16 'warning about undef retval from cmp routine mentions sort';
|
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/g++.dg/template/ |
H A D | qual1.C | 7 void sort (int (*compare) (T *const&,T *const&)); 13 Link_array<T>::sort (int (*compare) (T *const&,T *const&)) function in class:Link_array 20 clashes.sort (shift_compare);
|
/openbsd-current/gnu/usr.bin/perl/ext/B/t/ |
H A D | f_sort | 2 #examples poached from perldoc -f sort 4 # sort lexically 5 @articles = sort @files; 7 # same thing, but with explicit sort routine 8 @articles = sort {$a cmp $b} @files; 11 @articles = sort {uc($a) cmp uc($b)} @files; 14 @articles = sort {$b cmp $a} @files; 16 # sort numerically ascending 17 @articles = sort {$a <=> $b} @files; 19 # sort numericall [all...] |
H A D | f_sort.t | 21 #examples poached from perldoc -f sort 33 # chunk: # sort lexically 34 @articles = sort @files; 40 code => q{@articles = sort @files; }, 47 # 6 <@> sort lK 59 # 6 <@> sort lK 70 # chunk: # same thing, but with explicit sort routine 71 @articles = sort {$a cmp $b} @files; 77 code => q{@articles = sort {$a cmp $b} @files; }, 84 # 6 <@> sort l [all...] |
H A D | optree_sort.t | 16 checkOptree ( name => 'sub {sort @a}', 17 code => sub {sort @a}, 25 # 5 <@> sort K 32 # 5 <@> sort K 36 checkOptree ( name => 'sort @a', 37 prog => 'sort @a', 38 errs => [ 'Useless use of sort in void context at -e line 1.', 49 6 <@> sort vK 57 # 6 <@> sort vK 61 checkOptree ( name => 'sub {@a = sort [all...] |
/openbsd-current/usr.bin/tic/ |
H A D | MKtermsort.sh | 5 # MKtermsort.sh -- generate indirection vectors for the various sort methods 36 # The output of this script is C source for nine arrays that list three sort 57 * termsort.h --- sort order arrays for use by infocmp. 77 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; 86 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; 95 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; 104 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; 113 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; 122 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}'; 131 ' | sort | [all...] |
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.jason/ |
H A D | tempargs.C | 4 template<class T> struct Sort { static void sort (Vector<typename T::foo> &); }; 5 template<class T> void Sort<T>::sort (Vector<typename T::foo> &) { } function in class:Sort 8 void f (Vector<int> &vi) { Sort<whee>::sort (vi); }
|
/openbsd-current/gnu/gcc/gcc/ |
H A D | sort-protos | 3 # Invoke as `sort-protos sys-protos.h'. 7 sed 's/\(.*[ \*]\)\([a-zA-Z0-9_][a-zA-Z0-9_]*\)[ ]*\(([^\*].*\)$/\2%\1%\3/' $input | sort -u | awk -F% '{printf "%-30.30s%s%s\n", $2, $1, $3}' > tmp.$input
|
H A D | opt-gather.awk | 24 function sort(ARRAY, ELEMENTS) function 50 sort(record,numrec)
|
/openbsd-current/gnu/usr.bin/gcc/gcc/ |
H A D | sort-protos | 3 # Invoke as `sort-protos sys-protos.h'. 7 sed 's/\(.*[ \*]\)\([a-zA-Z0-9_][a-zA-Z0-9_]*\)[ ]*\(([^\*].*\)$/\2%\1%\3/' $input | sort -u | awk -F% '{printf "%-30.30s%s%s\n", $2, $1, $3}' > tmp.$input
|
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.robertl/ |
H A D | eb105.C | 3 void sort( T* t, int n ) function 12 sort(t, n, c, 0) ;
|
H A D | eb43.C | 25 sort( a.begin(), a.end(), 27 sort( a.begin(), a.end(), compare<int> ); 28 sort<vector<int>::iterator, 31 sort( a.begin(), a.end(), 33 sort( a.begin(), a.end(), 35 sort( a.begin(), a.end(), 37 sort( a.begin(), a.end(), 39 sort( a.begin(), a.end(),
|
/openbsd-current/gnu/usr.bin/perl/h2pl/ |
H A D | getioctlsizes | 11 foreach $key ( sort keys %need ) {
|
/openbsd-current/usr.bin/sort/ |
H A D | Makefile | 3 PROG= sort 5 SRCS= bwstring.c coll.c file.c mem.c radixsort.c sort.c vsort.c
|
/openbsd-current/gnu/usr.bin/perl/lib/Tie/ |
H A D | ExtraHash.t | 17 is_deeply([sort keys %hash], [sort keys %tied], "FIRSTKEY/NEXTKEY"); 18 is_deeply([sort values %hash], [sort values %tied], "FIRSTKEY/NEXTKEY");
|
/openbsd-current/gnu/usr.bin/perl/t/op/ |
H A D | sort.t | 16 sort { for ($_ = 0;; $_++) {} } @a; 17 sort { while(1) {} } @a; 18 sort { while(1) { last; } } @a; 19 sort { while(0) { last; } } @a; 22 map scalar(sort(+())), ('')x68; 48 $x = join('', sort @harry); 53 $x = join('', sort( Backwards @harry)); 58 $x = join('', sort( Backwards_stacked @harry)); 63 $x = join('', sort @george, 'to', @harry); 101 my @non_utf8_result = sort [all...] |
/openbsd-current/gnu/usr.bin/perl/lib/ |
H A D | sort.t | 3 # This tests the behavior of sort() under the different 'use sort' forms. 30 # Generate array of specified size for testing sort. 95 # Test sort on arrays of various sizes (set up in @TestSizes) 129 # Test with no pragma yet loaded. Stability is expected from default sort. 130 main(sub { sort {&{$_[0]}} @{$_[1]} }, 0); 133 # by invoking a sort as part of a comparison routine. 139 use sort qw( defaults stable ); 140 my @ignore = sort (5,4,3,2,1); 143 use sort q [all...] |
/openbsd-current/lib/libedit/ |
H A D | makelist | 127 sort | tr '[:lower:]' '[:upper:]' | $AWK ' 143 cat $FILES | $AWK '/el_action_t/ { print $3 }' | sort | $AWK '
|
/openbsd-current/gnu/llvm/clang/utils/ |
H A D | find-unused-diagnostics.sh | 15 comm -23 <(sort -u <<< "$ALL_DIAGS") <(sort -u <<< "$DIAGS_IN_SOURCES")
|
/openbsd-current/usr.bin/locate/locate/ |
H A D | mklocatedb.sh | 50 : ${sort=sort -H} 53 sortcmd="$sort" 69 $bigram < $filelist | $sort -nr |
|
/openbsd-current/gnu/lib/libstdc++/libstdc++/config/abi/ |
H A D | extract_symvers | 57 }' | sort | uniq > $tmp 2>&1
|
/openbsd-current/gnu/usr.bin/perl/dist/Text-Abbrev/t/ |
H A D | Abbrev.t | 13 my $r = join ':', sort keys %x; 35 my $s = join ':', sort keys %y; 39 $s = join ':', sort keys %$y; 45 $s = join ':', sort keys %y;
|
/openbsd-current/gnu/usr.bin/perl/t/porting/ |
H A D | re_context.t | 32 sort keys %::;
|
/openbsd-current/regress/sys/net/rtable/fullfeed/ |
H A D | Makefile | 13 sort $< > $@ 19 sort | diff -u ${.TARGET}-fullfeed.sorted /dev/stdin
|