Struct DissectionNode 

pub struct DissectionNode {
    pub field: String,
    pub label: String,
    pub offset: u32,
    pub length: u32,
    pub children: Vec<DissectionNode>,
}

One field of a dissected message.

field is a stable machine-readable identifier using dotted paths, e.g. bgp.header.marker, bgp.update.path_attributes, or bgp.attr.32 (the attribute type code suffix identifies which path attribute the node covers). label is a human-readable rendering that frontends can display directly. Offsets are relative to the start of the dissected buffer: for a bare BGP message the message itself, and for an MRT record the whole record (common header + message body).

Best-effort contract: when the input is truncated or malformed, the tree simply stops at the last field that could be walked; a dissector never fails.

Fields

field: String

label: String

offset: u32

length: u32

children: Vec<DissectionNode>

Implementations

impl DissectionNode

pub fn new( field: impl Into<String>, label: impl Into<String>, offset: u32, length: u32, ) -> Self

pub const fn span(&self) -> Span

Byte range covered by this node.

pub fn find(&self, field: &str) -> Option<&DissectionNode>

Depth-first search for the first node with an exact field match.

pub fn find_all<'a>(&'a self, field: &str, out: &mut Vec<&'a DissectionNode>)

Collect all nodes with an exact field match, in tree order.

Trait Implementations

impl Clone for DissectionNode

fn clone(&self) -> DissectionNode

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DissectionNode

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

Formats the value using the given formatter.

impl Eq for DissectionNode

impl PartialEq for DissectionNode

fn eq(&self, other: &DissectionNode) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for DissectionNode