Skip to content

⚡ Optimize dictionary reverse iteration in PyTorch Tracer #2

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

Open
harshithluc073 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

⚡ Optimize dictionary reverse iteration in PyTorch Tracer #2

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
2 changes: 1 addition & 1 deletion neuroscope/tracers/pytorch.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -379,7 +379,7 @@ def _get_parent_node_id(self, name: str) -> str | None:
return None

# Find the most recent node with that parent name
for node_id, node in reversed(list(self._graph.nodes.items())):
for node_id, node in reversed(self._graph.nodes.items()):
if node.label == parent_name:
return node_id
return None
Expand Down