Skip to content

Issue 10340: Document transience of elements in .permutations. #10835

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
thewilsonator merged 1 commit into from
Aug 1, 2025
Merged

Issue 10340: Document transience of elements in .permutations. #10835

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 7 additions & 0 deletions std/algorithm/iteration.d
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8161,6 +8161,13 @@ Returns:
A $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives)
of elements of which are an $(REF indexed, std,range) view into `r`.

Note:
The elements of the resulting range reuse the same internal buffer of
permutations, so each element is invalidated by `popFront`. If copies of
intermediate permutations are desired, they need to be individually copied,
such as using `.map!(e => e.array)` to save them in individual, independent
arrays.

See_Also:
$(REF nextPermutation, std,algorithm,sorting).
*/
Expand Down
Loading