Lines Matching defs:tree
128 // position within the call-tree.
162 // If we are doing top-down call tree, update own ticks.
186 // This expands a tree node (direct children only).
221 this.tree = createEmptyNode("root");
222 this.tree.delayedExpansion = { frameList : [], ascending : false };
226 this.tree.ticks++;
240 addOrUpdateChildNode(this.tree, file, tickIndex, i, false);
247 this.tree = createEmptyNode("root");
248 this.tree.delayedExpansion = { frameList : [], ascending : isBottomUp };
258 addOrUpdateChildNode(this.tree, file, tickIndex, stackPos, this.isBottomUp);
260 this.tree.ticks++;
298 this.tree = root;
312 this.tree.ticks++;
327 this.tree = root;
330 this.tree = createEmptyNode("root");
342 this.tree.ticks++;
344 let tree = null;
358 tree = this.categories[kind];
360 tree = this.tree;
362 child = tree.children[childId];
365 child.children[0] = createEmptyNode("Top-down tree");
368 child.children[1] = createEmptyNode("Bottom-up tree");
371 tree.children[childId] = child;
384 console.assert(tree !== null);
385 tree.ticks++;
386 console.assert(tree.type === "CAT");
500 // Generates a tree out of a ticks sequence.
503 // {tree} is the processor of stacks.
505 file, startTime, endTime, tree) {
514 tree.addStack(file, i);