fix: add tests for unbalanced dags and very deep dags #299
Conversation
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
To ensure that blocks are emitted in the correct order while also not overflowing the stack, when we loop of the children of a node, use a separate queue for each child and wait for the queue to be idle before moving on to the next child.
github-actions bot
pushed a commit
that referenced
this pull request
Mar 16, 2023
## [ipfs-unixfs-exporter-v13.0.4](ipfs-unixfs-exporter-v13.0.3...ipfs-unixfs-exporter-v13.0.4) (2023-03-16) ### Bug Fixes * add tests for unbalanced dags and very deep dags ([#299](#299)) ([44e7792](44e7792))
|
🎉 This PR is included in version ipfs-unixfs-exporter-v13.0.4 🎉 The release is available on: Your semantic-release bot 📦🚀 |
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.
To ensure that blocks are emitted in the correct order while also not overflowing the stack, when we loop over the children of a node, use a separate queue for each child and wait for the queue to be idle before moving on to the next child.