shark/shark/HeapTraversalOutput

HeapTraversalOutput

interface HeapTraversalOutput : HeapTraversalInput

Inheritors

Types

Link copied to clipboard
object Companion

Properties

Link copied to clipboard
abstract 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.

Link copied to clipboard
abstract val shortestPathTree: ShortestPathObjectNode

A representation of the heap as a tree of shortest path from roots to each object in the heap, where:

Link copied to clipboard
abstract val traversalCount: Int