shark/shark/JavaLocalReferenceReader

JavaLocalReferenceReader

class JavaLocalReferenceReader(val graph: HeapGraph, referenceMatchers: List<ReferenceMatcher>) : ChainingInstanceReferenceReader.VirtualInstanceReferenceReader

Constructors

constructor(graph: HeapGraph, referenceMatchers: List<ReferenceMatcher>)

Functions

matches

open override fun matches(instance: HeapObject.HeapInstance): Boolean

read

open override fun read(source: HeapObject.HeapInstance): Sequence<Reference>

Returns the sequences of non null outgoing references from source. Outgoing refs can be actual JVM references or they can be virtual references when simplifying known data structures.

Properties

graph

val graph: HeapGraph

readsCutSet

open override val readsCutSet: Boolean = false

https://en.wikipedia.org/wiki/Cut_(graph_theory) A cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one endpoint in each subset of the partition. These edges are said to cross the cut.