Skip to content

Commit bdedacf

Browse files
committed
resolve precommit check
Signed-off-by: Will Guo <willg@nvidia.com>
1 parent f67d957 commit bdedacf

1 file changed

Lines changed: 2 additions & 2 deletions

File tree

modelopt/onnx/quantization/autotune/region_search.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -192,7 +192,7 @@ def _build_forward_reachable_nodes_map(self, max_steps: int) -> dict[int, dict[i
192192

193193
def _find_common_reachable_nodes(
194194
self, node_idx: int, branches: list[int]
195-
) -> tuple[list[dict], set[int]] | None:
195+
) -> tuple[list[dict], set[int]]:
196196
"""Find common reachable nodes from all branches (potential convergence points).
197197
198198
Used as STEP 1 of convergence detection in _find_converge_nodes.
@@ -202,7 +202,7 @@ def _find_common_reachable_nodes(
202202
branches: List of branch head node indices.
203203
204204
Returns:
205-
(branch_reachable, common_nodes) if valid; None if no convergence candidates.
205+
(branch_reachable, common_nodes)
206206
"""
207207
branch_reachable = [self.forward_reachable_nodes_map.get(b, {}) for b in branches]
208208

0 commit comments

Comments
 (0)