120     const [trace, trees] = value;  constant
126       curr.push(...trees);
128       this.currentHierarchyTrees.set(trace, trees);
138     for (let i = 0; i < trees.length; i++) {
139       const tree = trees[i];
242         const trees = this.currentHierarchyTrees?.get(trace);  constant
243         if (trees) {
246             trees.map((tree) =>
282     for (const [trace, trees] of this.currentHierarchyTrees) {  constant
284       trees.find((t) => {
305       for (const [trace, trees] of this.currentHierarchyTrees) {  constant
306         const hasTree = trees.find((t) => t.findDfs(idMatchFilter));
362     for (const [trace, trees] of hierarchyTrees.entries()) {  constant
364       for (let i = 0; i < trees.length; i++) {
365         const tree = trees[i];