Update on "[inductor] dont reuse buffers if it affects peak (#145883)"

v0i0 · v0i0 · commit daa588c3da1a · 2025-08-15T12:00:45.000-07:00
cc voznesenskym penguinwu EikanWang jgong5 Guobing-Chen XiaobingSuper zhuhaozhe blzheng wenzhe-nrv jiayisunx ipiszy chenyang78 kadeng muchulee8 amjames chauhang aakhundov coconutruben

[ghstack-poisoned]
diff --git a/test/inductor/test_segmented_tree.py b/test/inductor/test_segmented_tree.py
@@ -1,9 +1,9 @@
 # Owner(s): ["module: inductor"]
 
-from torch._inductor.test_case import TestCase, run_tests
 from hypothesis import given, strategies as st
 
 from torch._inductor.codegen.segmented_tree import SegmentedTree
+from torch._inductor.test_case import run_tests, TestCase
 
 
 # Helper functions for operations
@@ -48,12 +48,10 @@ def test_basic_construction(self):
         tree = SegmentedTree(values, add_op, max_op, 0)
         assert tree.summarize_range(0, 4) == 9
 
-
     def test_empty_array(self):
         with self.assertRaises(ValueError):
             SegmentedTree([], add_op, max_op, 0)
 
-
     # Property-based tests
     @given(values=positive_integers)
     def test_max_query_matches_naive(self, values):
@@ -67,8 +65,9 @@ def test_max_query_matches_naive(self, values):
                     f"Range [{start}:{end}] expected {expected}, got {actual}"
                 )
 
-
-    @given(values=positive_integers, range_indices=st.data(), update_value=update_values)
+    @given(
+        values=positive_integers, range_indices=st.data(), update_value=update_values
+    )
     def test_range_update(self, values, range_indices, update_value):
         # Create a copy for naive implementation
         naive_values = values.copy()
@@ -92,7 +91,6 @@ def test_range_update(self, values, range_indices, update_value):
                     f"After update, range [{i}:{j}] expected {expected}, got {actual}"
                 )
 
-
     @given(values=positive_integers, range_data=st.data())
     def test_multiple_operations(self, values, range_data):
         # Create a copy for naive implementation
@@ -117,7 +115,6 @@ def test_multiple_operations(self, values, range_data):
                 tree.update_range(start, end, update_value)
                 naive_range_update(naive_values, start, end, update_value)
 
-
     def test_single_element_ranges(self):
         values = [1, 3, 5, 7, 9]
         tree = SegmentedTree(values, add_op, max_op, 0)
@@ -127,7 +124,6 @@ def test_single_element_ranges(self):
                 f"Single element range at index {i} failed"
             )
 
-
     def test_full_array_range(self):
         values = [1, 3, 5, 7, 9]
         tree = SegmentedTree(values, add_op, max_op, 0)
@@ -141,7 +137,6 @@ def test_full_array_range(self):
         expected = max([v + update_value for v in values])
         assert tree.summarize_range(0, len(values) - 1) == expected
 
-
     def test_boundary_conditions(self):
         values = [1, 3, 5, 7, 9]
         tree = SegmentedTree(values, add_op, max_op, 0)
@@ -156,8 +151,9 @@ def test_boundary_conditions(self):
         assert tree.summarize_range(0, 1) == max(values[0:2])
 
         # Test last two elements
-        assert tree.summarize_range(len(values) - 2, len(values) - 1) == max(values[-2:])
-
+        assert tree.summarize_range(len(values) - 2, len(values) - 1) == max(
+            values[-2:]
+        )
 
     def test_invalid_ranges(self):
         values = [1, 3, 5, 7, 9]
@@ -170,7 +166,6 @@ def test_invalid_ranges(self):
         with self.assertRaises(ValueError):
             tree.update_range(4, 2, 10)
 
-
     def test_out_of_bounds(self):
         values = [1, 3, 5, 7, 9]
         tree = SegmentedTree(values, add_op, max_op, 0)
@@ -196,7 +191,6 @@ def test_out_of_bounds(self):
         with self.assertRaises(ValueError):
             tree.update_range(0, len(values), 10)
 
-
     def test_overlapping_updates(self):
         values = [1, 3, 5, 7, 9]
         naive_values = values.copy()
@@ -218,7 +212,6 @@ def test_overlapping_updates(self):
                     f"After overlapping updates, range [{i}:{j}] expected {expected}, got {actual}"
                 )
 
-
     def test_sequential_updates_and_queries(self):
         values = [2, 4, 6, 8, 10, 12, 14]
         naive_values = values.copy()
