Struct OidTree 

pub struct OidTree { /* private fields */ }

Arena-allocated OID tree.

Nodes are stored in a contiguous Vec indexed by NodeId. The tree is built during resolution and then accessed read-only through the Mib API.

Implementations

impl OidTree

pub fn new() -> Self

Create an empty tree with a synthetic root node.

pub fn root(&self) -> NodeId

Return the root node id.

pub fn len(&self) -> usize

Return the total number of nodes in the tree.

pub fn is_empty(&self) -> bool

Return true if the tree contains no nodes.

pub fn get(&self, id: NodeId) -> &NodeData

Look up a node by id.

Panics

Panics if id does not correspond to a node in this tree.

pub fn walk_oid(&self, start: NodeId, oid: &Oid) -> (NodeId, bool)

Walk the tree from start following arcs in oid.

Returns (last_matched_node, true) if all arcs matched, or (deepest_matched_node, false) if the walk stopped early.

pub fn oid_of(&self, id: NodeId) -> &Oid

Return the OID for a node, using the per-node cache.

pub fn subtree(&self, start: NodeId) -> SubtreeIter<'_>

Depth-first iterator over a subtree rooted at start.

pub fn all_nodes(&self) -> SubtreeIter<'_>

Depth-first iterator over all nodes (excluding root).

pub fn longest_prefix(&self, oid: &Oid) -> NodeId

Find the deepest node matching a prefix of oid, starting from root.

pub fn longest_prefix_from(&self, start: NodeId, oid: &Oid) -> NodeId

Find the deepest node matching a prefix of oid, starting from start.

Trait Implementations

impl Debug for OidTree

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

Formats the value using the given formatter.

impl Default for OidTree

fn default() -> Self

Returns the “default value” for a type.