cidr4_merger.py

@@ -105,7 +105,7 @@ def reduce_nodes(nodes: list[Node]) -> list[Node]:
     return sort_nodes(nodes)
 
 
-def merge_nodes(nodes: list[Node], required_len: int) -> list[Node]:
+def merge_nodes_deprecated(nodes: list[Node], required_len: int) -> list[Node]:
     while len(nodes) > required_len:
         nodes = reduce_nodes(nodes)
     return nodes

tests/test_cidr4_merger.py

@@ -13,7 +13,7 @@ from cidr4_merger import (
     make_groups,
     make_parent,
     merge_neighbors,
-    merge_nodes,
+    merge_nodes_deprecated,
     merge_nodes_recursion,
     reduce_nodes,
     sort_nodes,
@@ -183,8 +183,8 @@ def test_reduce_nodes():
     assert str(exc_info.value) == "The top of the tree has no parent!"
 
 
-def test_merge_nodes():
+def test_merge_nodes_deprecated():
-    assert merge_nodes(
+    assert merge_nodes_deprecated(
         [
             (0, 2, 12, 0),
             (2147483648, 2, 1, 2147483648),
@@ -197,7 +197,7 @@ def test_merge_nodes():
     ]
 
     with pytest.raises(Exception) as exc_info:
-        merge_nodes(
+        merge_nodes_deprecated(
             [
                 (0, 2, 12, 0),
                 (2147483648, 2, 1, 2147483648),