View source code
Display the source code in std/algorithm/sorting.d from which this page was generated on github.
Report a bug
If you spot a problem with this page, click here to create a Bugzilla issue.
Improve this page
Quickly fork, edit online, and submit a pull request for this page. Requires a signed-in GitHub account. This works well for small changes. If you'd like to make larger changes you may want to consider using local clone.
TRange topNCopy(alias less, SRange, TRange) (
SortOutput sorted = No
if (isInputRange!SRange && isRandomAccessRange!TRange && hasLength!TRange && hasSlicing!TRange);
|less||The predicate to sort by.|
|source||The source range.|
|target||The target range.|
|sorted|| Whether to sort the elements copied into |
The slice of
target containing the copied elements.