/netbsd-src/external/gpl3/gcc/dist/contrib/ |
H A D | analyze_brprob.py | 250 def print_group(self, sorting, group_name, heuristics, predict_def): argument 255 if sorting == 'branch-hitrate': 257 elif sorting == 'hitrate': 259 elif sorting == 'coverage': 261 elif sorting == 'name': 271 def dump(self, sorting): argument 287 self.print_group(sorting, 'HEURISTICS', normal, predict_def) 289 self.print_group(sorting, 'HEURISTIC AGGREGATES', special, predict_def) 332 profile.dump(args.sorting)
|
H A D | analyze_brprob_spec.py | 60 temp.name, '--sorting', args.sorting]
|
/netbsd-src/external/gpl3/gcc.old/dist/contrib/ |
H A D | analyze_brprob.py | 247 def print_group(self, sorting, group_name, heuristics, predict_def): argument 252 if sorting == 'branch-hitrate': 254 elif sorting == 'hitrate': 256 elif sorting == 'coverage': 258 elif sorting == 'name': 268 def dump(self, sorting): argument 284 self.print_group(sorting, 'HEURISTICS', normal, predict_def) 286 self.print_group(sorting, 'HEURISTIC AGGREGATES', special, predict_def) 329 profile.dump(args.sorting)
|
H A D | analyze_brprob_spec.py | 59 temp.name, '--sorting', args.sorting]
|
/netbsd-src/external/bsd/openldap/dist/doc/rfc/ |
H A D | rfc2891.txt | 33 sorting of search results. These controls allows a client to specify 42 sorting of the results that is independent of the result code 124 -- sorting was completed 155 1 - If the server does not support this sorting control and the 162 2 - If the server does not support this sorting control and the 175 3 - If the server supports this sorting control but for some reason 184 4 - If the server supports this sorting control but for some reason 191 5 - If the server supports this sorting control and can sort the 258 present that affect the sorting order, then the server SHOULD use the 289 Implementors and administrators should be aware that allowing sorting [all …]
|
H A D | rfc3876.txt | 199 side sorting [13] and duplicate entries [10]. However, there might 204 with server side sorting, if sorting is done first, and value return 207 upon which the ordering was done. (The sorting document specifies
|
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/ |
H A D | package.d | 196 public import std.algorithm.sorting;
|
H A D | setops.d | 58 import std.algorithm.sorting; // : Merge; 651 import std.algorithm.sorting : SortOutput; // FIXME 677 import std.algorithm.sorting : topNCopy; 1456 import std.algorithm.sorting : merge;
|
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/algorithm/ |
H A D | package.d | 199 public import std.algorithm.sorting;
|
H A D | setops.d | 56 import std.algorithm.sorting : Merge; 685 import std.algorithm.sorting : SortOutput; // FIXME 711 import std.algorithm.sorting : topNCopy; 1512 import std.algorithm.sorting : merge;
|
/netbsd-src/external/mpl/dhcp/dist/contrib/ms2isc/ |
H A D | readme.txt | 13 SMC 030129 Fixed inclusion range calculation by sorting exclusion before
|
/netbsd-src/tests/usr.sbin/mtree/ |
H A D | d_convert.in | 3 # changed to test sorting.
|
/netbsd-src/usr.bin/compress/doc/ |
H A D | revision.log | 59 * Implemented "-B" block compress. Implemented REVERSE sorting of tab_next. 96 * Sped up algorithm significantly by sorting the compress chain.
|
/netbsd-src/sys/arch/acorn32/stand/boot32/ |
H A D | version | 21 3.04: fixed physical memory blocks searching; it was a sorting error
|
/netbsd-src/external/bsd/bzip2/dist/ |
H A D | README.XML.STUFF | 3 lossless, block-sorting data compression.
|
H A D | Makefile-libbz2_so | 11 # lossless, block-sorting data compression.
|
H A D | CHANGES | 3 lossless, block-sorting data compression. 62 Major change: add a fallback sorting algorithm (blocksort.c) 146 * Minor sorting enhancements from my DCC2000 paper.
|
H A D | README.COMPILATION.PROBLEMS | 3 lossless, block-sorting data compression.
|
/netbsd-src/external/mit/isl/dist/doc/ |
H A D | manual.tex | 5 maxbibnames=99,style=authoryear,sortcites=true,sorting=nyt,backref=true,%
|
/netbsd-src/external/gpl3/binutils.old/dist/gprof/ |
H A D | ChangeLog-2019 | 39 * gprof.c (usage): Restore alphabetical sorting to short options
|
/netbsd-src/external/gpl3/binutils/dist/gprof/ |
H A D | ChangeLog-2019 | 39 * gprof.c (usage): Restore alphabetical sorting to short options
|
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/ |
H A D | typed.d | 125 import std.algorithm.sorting : isSorted; in TypedAllocator()
|
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/experimental/allocator/ |
H A D | typed.d | 128 import std.algorithm.sorting : isSorted; in TypedAllocator()
|
/netbsd-src/external/bsd/ipf/dist/tools/ |
H A D | ipfstat.c | 1300 int maxtsentries = 0, reverse = 0, sorting = STSORT_DEFAULT; local 1456 switch (sorting) 1551 switch (sorting) 1711 if (++sorting > STSORT_MAX) 1712 sorting = 0;
|
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/ |
H A D | csv.d | 910 import std.algorithm.sorting : sort; in this() 915 import std.algorithm.sorting : sort; in this() 921 import std.algorithm.sorting : isSorted; in this()
|