Struct bcmp::treematch::Node

pub struct Node {
    pub start: usize,
    pub end: usize,
    pub edges: [Option<usize>; 257],
    pub suffix_link: Option<usize>,
}

A node in the SuffixTree

Fields

start: usize

The index in the data where the edge leading to this node starts.

end: usize

The index in the data where the edge leading to this node ends.

edges: [Option<usize>; 257]

The potential sub nodes under this one. Each index in the array represent on of the possible byte value. The index 256 is reserved for the end of data. Each element value is an index in the SuffixTree::nodes(struct.SuffixTree.html#nodes.v) vector.

suffix_link: Option<usize>

Suffix link (see Ukkonen's algorithm).

Methods

impl Node

fn new(start: usize, end: usize) -> Node

Allocate a new node with a leading edge [start..end].

fn edge_length(&self) -> usize

Returns this node leading edge length.