//leakcanary-repo/shark/FirstHeapTraversal
FirstHeapTraversal¶
[jvm]\ class FirstHeapTraversal(val shortestPathTree: ShortestPathObjectNode, previousTraversal: InitialState) : HeapTraversalOutput
Constructors¶
| FirstHeapTraversal | [jvm] constructor(shortestPathTree: ShortestPathObjectNode, previousTraversal: InitialState) |
Properties¶
| Name | Summary |
|---|---|
| scenarioLoopsPerGraph | [jvm] open override val scenarioLoopsPerGraph: Int How many times a scenario that might cause heap growth is repeated in between each dump and traversal. This leads the traversal algorithm to only look at objects that are growing at least scenarioLoopsPerGraph times since the previous traversal. |
| shortestPathTree | [jvm] open override val shortestPathTree: ShortestPathObjectNode A representation of the heap as a tree of shortest path from roots to each object in the heap, where: |
| traversalCount | [jvm] open override val traversalCount: Int = 1 |