feat: refactor processing time tree sum method to summarize_tree

Signed-off-by: Taekjin LEE <[email protected]>

common/autoware_debug_tools/autoware_debug_tools/processing_time_visualizer/node.py

@@ -103,7 +103,7 @@ def callback(self, msg: ProcessingTimeTreeMsg):
         if tree.name not in self.total_tree:
             self.total_tree[tree.name] = tree
         else:
-            self.total_tree[tree.name].sum(tree)
+            self.total_tree[tree.name].summarize_tree(tree)
 
 
 def main(args=None):

common/autoware_debug_tools/autoware_debug_tools/processing_time_visualizer/tree.py

@@ -171,15 +171,15 @@ def construct_string(
     # sum up the processing tree time
     # if the incoming tree has new nodes, add them to the current tree
     # count the number of times the tree has been updated
-    def sum(self, other: "ProcessingTimeTree") -> None:
+    def summarize_tree(self, other: "ProcessingTimeTree") -> None:
         self.processing_time += other.processing_time
         self.run_count += other.run_count
 
         for other_child in other.children:
             found = False
             for child in self.children:
                 if child == other_child:
-                    child.sum(other_child)
+                    child.summarize_tree(other_child)
                     found = True
                     break
             if not found: