Struct SequenceGraph 

pub struct SequenceGraph {
    pub nodes: HashMap<u64, SequenceNode>,
    pub edges: Vec<SequenceEdge>,
    pub start_node: u64,
    pub current: u64,
    pub flags: HashSet<String>,
    /* private fields */
}

Fields

nodes: HashMap<u64, SequenceNode>

edges: Vec<SequenceEdge>

start_node: u64

current: u64

flags: HashSet<String>

Implementations

impl SequenceGraph

pub fn new() -> Self

pub fn add_node(&mut self, name: &str, sequence: &str, duration: f64) -> u64

pub fn add_edge( &mut self, from_id: u64, to_id: u64, condition: &str, weight: f32, )

pub fn set_flag(&mut self, flag: &str)

pub fn clear_flag(&mut self, flag: &str)

pub fn condition_met(&self, condition: &str) -> bool

Evaluate condition string against current flag set.

pub fn next_nodes(&self) -> Vec<u64>

Get all reachable next nodes from current.

pub fn advance(&mut self) -> Option<&SequenceNode>

Advance to best-matching next node.

pub fn current_node(&self) -> Option<&SequenceNode>