🤔 Documentation issue? Report it

//leakcanary-repo/shark/HeapDiff

HeapDiff

[jvm]\ class HeapDiff(val traversalCount: Int, val shortestPathTree: ShortestPathObjectNode, val growingObjects: GrowingObjectNodes, previousTraversal: HeapTraversalInput) : HeapTraversalOutput

Constructors

HeapDiff	[jvm] constructor(traversalCount: Int, shortestPathTree: ShortestPathObjectNode, growingObjects: GrowingObjectNodes, previousTraversal: HeapTraversalInput)

Types

Name	Summary
Companion	[jvm] object Companion

Functions

Name	Summary
toString	[jvm] open override fun toString(): String

Properties

Name	Summary
growingObjects	[jvm] val growingObjects: GrowingObjectNodes Nodes that already existed in the previous traversal, still exist in this shortestPathTree, and have grown compared to the previous traversal.
isGrowing	[jvm] val isGrowing: Boolean
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