Add grouped parallel I/O for graph placements of interleaved reads - #95
Draft
Sagorikanag wants to merge 4 commits into
Draft
Add grouped parallel I/O for graph placements of interleaved reads#95Sagorikanag wants to merge 4 commits into
Sagorikanag wants to merge 4 commits into
Conversation
Sagorikanag
marked this pull request as draft
August 12, 2026 17:40
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.
Changelog Entry
Description
This adds grouped interleaved input helpers for callers that need all alternative paired placements of a fragment together.
For GAM and GAF input, consecutive interleaved pairs with the same fragment identity are collected into:
and passed to the caller as one unit. An unmatched final alignment in interleaved input is reported as an error.
The grouped iterator also supports processing groups serially until a caller-provided readiness condition becomes true, after which processing continues in parallel. This allows callers to safely learn shared state, such as a fragment-length distribution, before dispatching groups across worker threads.
Existing unpaired, paired, and grouped APIs retain their previous behavior through compatibility wrappers.