shark/shark/HeapDiff

HeapDiff

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

Constructors

constructor(traversalCount: Int, shortestPathTree: ShortestPathObjectNode, growingObjects: GrowingObjectNodes, previousTraversal: HeapTraversalInput)

Types

object Companion

Functions

open override fun toString(): String

Properties

val growingObjects: GrowingObjectNodes

Nodes that already existed in the previous traversal, still exist in this shortestPathTree, and have grown compared to the previous traversal.

val isGrowing: Boolean

scenarioLoopsPerGraph

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

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:

open override val traversalCount: Int