//leakcanary-repo/shark/JavaLocalReferenceReader
JavaLocalReferenceReader¶
[jvm]\ class JavaLocalReferenceReader(val graph: HeapGraph, referenceMatchers: List<ReferenceMatcher>) : ChainingInstanceReferenceReader.VirtualInstanceReferenceReader
Constructors¶
| JavaLocalReferenceReader | [jvm] constructor(graph: HeapGraph, referenceMatchers: List<ReferenceMatcher>) |
Functions¶
| Name | Summary |
|---|---|
| matches | [jvm] open override fun matches(instance: HeapObject.HeapInstance): Boolean |
| read | [jvm] 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¶
| Name | Summary |
|---|---|
| graph | [jvm] val graph: HeapGraph |
| readsCutSet | [jvm] 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. |