Home
last modified time | relevance | path

Searched refs:Sorting (Results 1 – 6 of 6) sorted by relevance

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalTree.h260 enum class Sorting { Ascending, Descending }; enum
627 static void sortIntervals(IntervalReferences &IntervalSet, Sorting Sort) { in sortIntervals()
630 return Sort == Sorting::Ascending in sortIntervals()
/freebsd-14.2/usr.sbin/bsdconfig/share/
H A Dkeymap.subr218 f_dprintf "%s: Sorting keymap entries by description..." $fname
/freebsd-14.2/contrib/one-true-awk/testdir/
H A Dfunstack.ok108 Efficient Algorithm for Sorting with
131 B. Jones A Variation on Sorting by Address
323 E. S. Mankin Sorting in a Paging Environment . . . . 483--494
407 Efficient Algorithm for Sorting with
606 J. M. Chambers ACM Algorithm 410: Partial Sorting [M1] 357--358
640 D. E. Ferguson Buffer Allocation in Merge-Sorting . . . 476--478
973 I. Pohl A Sorting Problem and Its Complexity . . 462--464
1144 C. K. Wong Sorting by Natural Selection . . . . . . 910--913
1731 Shimon Even Parallelism in Tape-Sorting . . . . . . 202--204
2658 H. T. Kung Sorting on a Mesh-Connected Parallel
[all …]
H A Dfunstack.in782 title = "A Variation on Sorting by Address Calculation",
2278 title = "Sorting in a Paging Environment",
4279 title = "{ACM} Algorithm 410: Partial Sorting [{M1}]",
4572 title = "Buffer Allocation in Merge-Sorting",
6860 title = "A Sorting Problem and Its Complexity",
8357 title = "Sorting by Natural Selection",
12994 title = "Parallelism in Tape-Sorting",
16494 title = "Sorting {$X + Y$}",
20234 title = "Sorting on a Mesh-Connected Parallel Computer",
21895 title = "An Encoding Method for Multifield Sorting and Indexing",
[all …]
/freebsd-14.2/contrib/ldns/
H A DChangelog951 megabytes. Sorting such zone is still difficult.
/freebsd-14.2/contrib/sendmail/
H A DRELEASE_NOTES6330 Sorting for QueueSortOrder=host is now case insensitive. Patch