Struct v8_heap_parser::Graph

pub struct Graph {
    pub root_index: usize,
    /* private fields */
}

Fields

root_index: usize

Implementations

impl Graph

pub fn nodes(&self) -> &[Node<Node>]

Gets a list of all nodes in the graph.

pub fn get_node(&self, index: usize) -> Option<&Node>

Gets a node by its index.

pub fn get_indexed_string(&self, index: usize) -> Option<&str>

Gets a string by its index. Indexed strings are exposed in the ‘Other’ type in Node and Edge types.

pub fn iter(&self) -> NodeIterator<'_>

Gets an iterator over the graph nodes.

pub fn children(&self, parent: usize) -> Vec<usize>

Gets a list children of the node at the given index.

pub fn retained_size(&self, node_index: usize) -> u64

Gets the retained size of a node in the graph. This is the size this node specifically requires the program to retain., i.e. the nodes the given node dominates https://en.wikipedia.org/wiki/Dominator_(graph_theory)

pub fn get_class_groups(&self, no_retained: bool) -> &[ClassGroup]

Gets top-level groups for classes to show in a summary view. Sorted by retained size descending by default.