(file, tickIndex)
| 251 | } |
| 252 | |
| 253 | addStack(file, tickIndex) { |
| 254 | let stack = file.ticks[tickIndex].s; |
| 255 | let step = this.isBottomUp ? 2 : -2; |
| 256 | let start = this.isBottomUp ? 0 : stack.length - 2; |
| 257 | |
| 258 | let stackPos = findNextFrame(file, stack, start, step, this.filter); |
| 259 | addOrUpdateChildNode(this.tree, file, tickIndex, stackPos, this.isBottomUp); |
| 260 | |
| 261 | this.tree.ticks++; |
| 262 | } |
| 263 | } |
| 264 | |
| 265 | function buildCategoryTreeAndLookup() { |
nothing calls this directly
no test coverage detected