//leakcanary-repo/shark/ShortestPathObjectNode
ShortestPathObjectNode¶
[jvm]\ class ShortestPathObjectNode(val name: String, val parent: ShortestPathObjectNode?)
Constructors¶
ShortestPathObjectNode | [jvm] constructor(name: String, parent: ShortestPathObjectNode?) |
Types¶
Name | Summary |
---|---|
GrowingChildNode | [jvm] data class GrowingChildNode(val child: ShortestPathObjectNode, val objectCountIncrease: Int) |
Functions¶
Name | Summary |
---|---|
copyResettingAsInitialTree | [jvm] fun copyResettingAsInitialTree(): ShortestPathObjectNode |
pathFromRootAsString | [jvm] fun pathFromRootAsString(): String |
toString | [jvm] open override fun toString(): String |
Properties¶
Name | Summary |
---|---|
children | [jvm] val children: List<ShortestPathObjectNode> |
growingChildren | [jvm] val growingChildren: List<ShortestPathObjectNode.GrowingChildNode> Returns a list of pair of child ShortestPathObjectNode and associated object count increase, filtered to only the children nodes that were marked as growing, i.e. children that had an object count increase greater or equal to the scenario loop count. |
name | [jvm] val name: String |
parent | [jvm] val parent: ShortestPathObjectNode? |
retained | [jvm] var retained: Retained Set for growing nodes if the traversal requested the computation of retained sizes, otherwise null. |
retainedIncrease | [jvm] var retainedIncrease: Retained Set for growing nodes if retainedOrNull is not null. Non 0 if the previous traversal also computed retained size. |
selfObjectCount | [jvm] var selfObjectCount: Int |