formatting

Author: ericvergnaud

src/databricks/labs/ucx/sequencing/sequencing.py

@@ -181,7 +181,7 @@ def register_cluster(self, cluster_id: str) -> MigrationNode:
         return cluster_node
 
     def generate_steps(self) -> Iterable[MigrationStep]:
-        """ The below algo is adapted from Kahn's topological sort.
+        """The below algo is adapted from Kahn's topological sort.
         The main differences are as follows:
         1) we want the same step number for all nodes with same dependency depth
             so instead of pushing 'leaf' nodes to a queue, we fetch them again once all current 'leaf' nodes are processed
@@ -190,7 +190,7 @@ def generate_steps(self) -> Iterable[MigrationStep]:
             so when fetching 'leaf' nodes, we relax the 0-incoming-vertex rule in order
             to avoid an infinite loop. We also avoid side effects (such as negative counts).
             This algo works correctly for simple cases, but is not tested on large trees.
-         """
+        """
         incoming_counts = self._populate_incoming_counts()
         step_number = 1
         sorted_steps: list[MigrationStep] = []

tests/unit/sequencing/test_sequencing.py

@@ -96,9 +96,13 @@ def test_sequencer_supports_cyclic_dependencies(ws, simple_dependency_resolver,
     root = Dependency(FileLoader(), Path("root.py"))
     root_graph = _DependencyGraph(root, None, simple_dependency_resolver, mock_path_lookup, CurrentSessionState())
     child_a = Dependency(FileLoader(), Path("a.py"))
-    child_graph_a = _DependencyGraph(child_a, root_graph, simple_dependency_resolver, mock_path_lookup, CurrentSessionState())
+    child_graph_a = _DependencyGraph(
+        child_a, root_graph, simple_dependency_resolver, mock_path_lookup, CurrentSessionState()
+    )
     child_b = Dependency(FileLoader(), Path("b.py"))
-    child_graph_b = _DependencyGraph(child_b, root_graph, simple_dependency_resolver, mock_path_lookup, CurrentSessionState())
+    child_graph_b = _DependencyGraph(
+        child_b, root_graph, simple_dependency_resolver, mock_path_lookup, CurrentSessionState()
+    )
     # root imports a and b
     root_graph.add_dependency(child_graph_a)
     root_graph.add_dependency(child_graph_b)
@@ -112,4 +116,3 @@ def test_sequencer_supports_cyclic_dependencies(ws, simple_dependency_resolver,
     steps = list(sequencer.generate_steps())
     assert len(steps) == 3
     assert steps[2].object_id == "root.py"
-