Struct BfsIndex 

pub struct BfsIndex { /* private fields */ }

Index that maps nodes to sequential IDs using BFS order.

This allows the diff algorithm to use run-length encoding for consecutive copies, as adjacent siblings will have sequential IDs.

Implementations

impl BfsIndex

pub fn new(root: &NodeRef) -> Self

Creates a new BFS index for the given tree.

pub fn get_id(&self, node: &NodeRef) -> Option<u64>

Gets the BFS index for a node.

pub fn lookup(&self, id: u64) -> Option<NodeRef>

Looks up a node by its BFS index.

pub fn lookup_str(&self, id: &str) -> Option<NodeRef>

Looks up a node by its string ID.

pub fn root_id(&self) -> u64

Returns the root node’s BFS ID.

pub fn appends(&self, tail: &NodeRef, next: &NodeRef) -> bool

Checks if two nodes are adjacent in BFS order.

Trait Implementations

impl Debug for BfsIndex

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.