First
class FirstHeapTraversal(val shortestPathTree: ShortestPathObjectNode, previousTraversal: InitialState) : HeapTraversalOutput
Properties
Link copied to clipboard
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.
Link copied to clipboard
A representation of the heap as a tree of shortest path from roots to each object in the heap, where:
Link copied to clipboard