Improve performance of expanding and collapsing spans (#2722)

## Which problem is this PR solving?
closes #2179

## Description of the changes
Use Set and Map to make lookups faster.

This changes makes collapsing and expanding spans with large (10k)
amount of children 200-500ms faster.

## Before


![image](https://github.com/user-attachments/assets/df33f50f-cc13-4a4f-ba98-bcd1005816ef)


## After


![image](https://github.com/user-attachments/assets/9345d6c5-afb8-4aa1-bda2-47a9b4328821)


## How to test

1. Generate data - `go run cmd/tracegen/main.go -service abcd -traces 1
-spans 10000`
1. Collapse root span



![firefox_4ekX2LDxUX](https://github.com/user-attachments/assets/4e42ebae-e81a-4343-aa11-0c6f459c1678)

Signed-off-by: Damian Maslanka <[email protected]>
Co-authored-by: Yuri Shkuro <[email protected]>

Author: DamianMaslanka5

packages/jaeger-ui/src/components/TracePage/TraceTimelineViewer/VirtualizedTraceView.tsx

@@ -159,6 +159,8 @@ function getCssClasses(currentViewRange: [number, number]) {
   });
 }
 
+const memoizedSpanByID = memoizeOne((spans: Span[]) => new Map(spans.map(x => [x.spanID, x])));
+
 function mergeChildrenCriticalPath(
   trace: Trace,
   spanID: string,
@@ -168,23 +170,23 @@ function mergeChildrenCriticalPath(
     return [];
   }
   // Define an array to store the IDs of the span and its descendants (if the span is collapsed)
-  const allRequiredSpanIds = [spanID];
+  const allRequiredSpanIds = new Set<string>([spanID]);
 
   // If the span is collapsed, recursively find all of its descendants.
-  const findAllDescendants = (currentChildSpanIds: string[]) => {
+  const findAllDescendants = (currentChildSpanIds: Set<string>) => {
     currentChildSpanIds.forEach(eachId => {
-      const currentChildSpan = trace.spans.find(a => a.spanID === eachId)!;
+      const currentChildSpan = memoizedSpanByID(trace.spans).get(eachId)!;
       if (currentChildSpan.hasChildren) {
-        allRequiredSpanIds.push(...currentChildSpan.childSpanIds);
-        findAllDescendants(currentChildSpan.childSpanIds);
+        currentChildSpan.childSpanIds.forEach(x => allRequiredSpanIds.add(x));
+        findAllDescendants(new Set<string>(currentChildSpan.childSpanIds));
       }
     });
   };
   findAllDescendants(allRequiredSpanIds);
 
   const criticalPathSections: criticalPathSection[] = [];
   criticalPath.forEach(each => {
-    if (allRequiredSpanIds.includes(each.spanId)) {
+    if (allRequiredSpanIds.has(each.spanId)) {
       if (criticalPathSections.length !== 0 && each.section_end === criticalPathSections[0].section_start) {
         // Merge Critical Paths if they are consecutive
         criticalPathSections[0].section_start = each.section_start;