Display the source code in std/algorithm/sorting.d from which this page was generated on github.

If you spot a problem with this page, click here to create a Bugzilla issue.

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.

Function `std.algorithm.sorting.nthPermutationImpl`


						
				bool nthPermutationImpl(Range)
				(
				

				  auto ref Range range,
				

				  ulong perm
				

				)
				

				if (isRandomAccessRange!Range && hasLength!Range);

Returns

true in case the permutation worked, false in case perm had more digits in the factorial number system than range had elements. This case must not occur as this would lead to out of range accesses.

Example

auto src = [0, 1, 2, 3, 4, 5, 6];
auto rslt = [4, 0, 6, 2, 1, 3, 5];

bool worked = nthPermutationImpl(src, 2982);
assert(worked);
writeln(src); // rslt

Authors

Andrei Alexandrescu

License

Boost License 1.0.