Feat fill and generate#783
Merged
tsung-wei-huang merged 7 commits intotaskflow:masterfrom Apr 14, 2026
Merged
Conversation
Contributor
Author
|
@tsung-wei-huang is there a reason to use different types for the begin and end iterators. Also I think it would be helpful to add a ticket to track parallel algorithms implemented and perhaps priority for the unimplemented onse |
Member
|
The reason is to enable stateful iterator passing so one task can initialize data structure needed while its successor can launch the algorithm. See capture iterator by reference. In reality, we may have something like: taskflow.for_each_index(std::ref(beg), end, 1, [](auto i) {}); |
Contributor
Author
|
Thanks for the explanation. I edited my implementation to support this and added new tests accordingly |
Member
|
Thank you for the contributions! |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Added fill and generate algorithms and their bounded versions.