Skip to content
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.

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

Reorder the nodes in the graph to match the dim expansion order #156

Closed
wants to merge 1 commit into from

Conversation

harsh-nod
Copy link
Contributor

This PR modifies the order in which nodes are inserted into the graph to follow the canonical Cartesian product. This is especially important for the iter args inside a for loop that (without this PR) are not in the same order as the init args and outputs. By reordering the nodes, we ensure that the init args, iter args and outputs are all in the same order and map 1-1.

@harsh-nod harsh-nod force-pushed the riorder2 branch 4 times, most recently from 4aba25f to 48ac9f6 Compare September 21, 2024 00:34
This PR modifies the order in which nodes are inserted into
the graph to follow the canonical Cartesian product. This
is especially important for the iter args inside a for loop
that (without this PR) are not in the same order as the
init args and outputs. By reordering the nodes, we ensure
that the init args, iter args and outputs are all in the
same order and map 1-1.

Signed-off-by: Harsh Menon <[email protected]>
@harsh-nod
Copy link
Contributor Author

No longer needed.

@harsh-nod harsh-nod closed this Sep 24, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant