| /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/ |
| package.d | 93 $(TDNW $(SUBMODULE Sorting, sorting))
95 $(SUBREF sorting, completeSort)
96 $(SUBREF sorting, isPartitioned)
97 $(SUBREF sorting, isSorted)
98 $(SUBREF sorting, isStrictlyMonotonic)
99 $(SUBREF sorting, ordered)
100 $(SUBREF sorting, strictlyOrdered)
101 $(SUBREF sorting, makeIndex)
102 $(SUBREF sorting, merge
[all...] |
| setops.d | 56 import std.algorithm.sorting : Merge;
685 import std.algorithm.sorting : SortOutput; // FIXME
711 import std.algorithm.sorting : topNCopy;
868 See_Also: $(REF merge, std,algorithm,sorting) for an analogous function that
1506 $(REF merge, std,algorithm,sorting)
1512 import std.algorithm.sorting : merge;
|
| mutation.d | 1723 and `"aBc"`. That does not affect the sorting since both
1778 import std.algorithm.sorting : partition;
2399 import std.algorithm.sorting : isStrictlyMonotonic;
|
| sorting.d | 4 It contains generic sorting algorithms.
73 Source: $(PHOBOSSRC std/algorithm/sorting.d)
78 module std.algorithm.sorting;
932 range. This technique is similar to sorting, but it is more flexible
933 because (1) it allows "sorting" of immutable collections, (2) allows
938 extra indirection, and is always larger than a sorting-based solution
1306 std,algorithm,sorting), or $(REF assumeSorted, std,range) to merge ranges
1522 static assert(false, "No sorting predicate provided for multiSort");
1674 Sorting routine that is optimized for short ranges. Note: uses insertion sort
1881 Stable sorting requires `hasAssignableElements!Range` to be true
[all...] |
| /src/external/gpl3/gcc/dist/contrib/ |
| analyze_brprob.py | 252 def print_group(self, sorting, group_name, heuristics, predict_def):
257 if sorting == 'branch-hitrate':
259 elif sorting == 'hitrate':
261 elif sorting == 'coverage':
263 elif sorting == 'name':
273 def dump(self, sorting):
289 self.print_group(sorting, 'HEURISTICS', normal, predict_def)
291 self.print_group(sorting, 'HEURISTIC AGGREGATES', special, predict_def)
305 parser.add_argument('-s', '--sorting', dest = 'sorting',
[all...] |
| analyze_brprob_spec.py | 32 parser.add_argument('-s', '--sorting', dest = 'sorting',
62 temp.name, '--sorting', args.sorting]
|
| /src/external/gpl3/gcc.old/dist/contrib/ |
| analyze_brprob.py | 250 def print_group(self, sorting, group_name, heuristics, predict_def):
255 if sorting == 'branch-hitrate':
257 elif sorting == 'hitrate':
259 elif sorting == 'coverage':
261 elif sorting == 'name':
271 def dump(self, sorting):
287 self.print_group(sorting, 'HEURISTICS', normal, predict_def)
289 self.print_group(sorting, 'HEURISTIC AGGREGATES', special, predict_def)
303 parser.add_argument('-s', '--sorting', dest = 'sorting',
[all...] |
| analyze_brprob_spec.py | 30 parser.add_argument('-s', '--sorting', dest = 'sorting',
60 temp.name, '--sorting', args.sorting]
|
| /src/usr.bin/make/unit-tests/ |
| varmod-order.mk | 63 # Repeating the 'n' is not supported. In the typical use cases, the sorting
|
| /src/external/mit/isl/dist/doc/ |
| manual.tex | 5 maxbibnames=99,style=authoryear,sortcites=true,sorting=nyt,backref=true,%
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/ |
| typed.d | 128 import std.algorithm.sorting : isSorted;
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/ |
| csv.d | 1044 import std.algorithm.sorting : sort;
1049 import std.algorithm.sorting : sort;
1055 import std.algorithm.sorting : isSorted;
|
| meta.d | 1000 import std.algorithm.sorting : sort;
|
| zip.d | 613 import std.algorithm.sorting : sort;
|
| base64.d | 1773 import std.algorithm.sorting : sort;
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/building_blocks/ |
| ascending_page_allocator.d | 928 import std.algorithm.sorting : sort;
968 import std.algorithm.sorting : sort;
|
| aligned_block_list.d | 588 import std.algorithm.sorting : sort;
|
| region.d | 1277 import std.algorithm.sorting : sort;
1342 import std.algorithm.sorting : sort;
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/ |
| Makefile.am | 91 std/algorithm/sorting.d std/array.d std/ascii.d std/base64.d \
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/container/ |
| binaryheap.d | 70 import std.algorithm.sorting : HeapOps;
|
| /src/external/bsd/ipf/dist/tools/ |
| 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;
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/datetime/ |
| timezone.d | 2072 import std.algorithm.sorting : sort;
2423 import std.algorithm.sorting : sort;
2964 import std.algorithm.sorting : sort;
3404 import std.algorithm.sorting : sort;
3460 import std.algorithm.sorting : isSorted;
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/range/ |
| package.d | 217 sort, std, algorithm, sorting) function also conveniently
1229 import std.algorithm.sorting : sort;
1235 // in-place sorting across all of the arrays
4845 import std.algorithm.sorting : sort;
4852 // b is sorted according to a's sorting
5208 import std.algorithm.sorting : sort;
5337 import std.algorithm.sorting : sort;
10754 $(REF sort, std,algorithm,sorting) which sorts `r` in place and returns the
10805 import std.algorithm.sorting : isSorted;
10829 import std.algorithm.sorting : isSorted
[all...] |
| /src/external/historical/nawk/dist/ |
| FIXES.1e | 638 the issue appears to be that strcoll is meant for sorting, where
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/uni/ |
| package.d | 2878 import std.algorithm.sorting : sort;
4343 // TODO: expose index sorting functions for Trie
4503 import std.algorithm.sorting : multiSort;
5629 import std.algorithm.sorting : sort;
8080 import std.algorithm.sorting : sort;
8122 import std.algorithm.sorting : sort;
8570 import std.algorithm.sorting : sort;
|
