Struct ErrorGraphNode 

pub struct ErrorGraphNode {
    error_level: usize,
    config: ACSTAConfig,
    parents: Vec<ErrorGraphEdge>,
    self_loops: Vec<u32>,
    back_edges: Vec<ErrorGraphEdge>,
}

Node in the error graph

Fields

error_level: usize

Distance to an error configuration

config: ACSTAConfig

Configuration

parents: Vec<ErrorGraphEdge>

Parent nodes ErrorGraphEdges to nodes with a smaller distance to an error

self_loops: Vec<u32>

Rules that result in a self-loop

back_edges: Vec<ErrorGraphEdge>

ErrorGraphEdges to a equal or higher error level node, potentially part of a cycle

Implementations

impl ErrorGraphNode

pub fn parents(&self) -> impl Iterator<Item = &ErrorGraphEdge>

Get the error graph edges leading to the parents of the current node

The edges returned here will have an error level smaller than the current node

pub fn self_loops(&self) -> impl Iterator<Item = &u32>

Get all rules that can be self-loops

pub fn back_edges(&self) -> impl Iterator<Item = &ErrorGraphEdge>

Get rules that can lead to higher or equal error level

pub fn config(&self) -> &ACSTAConfig

Get the configuration of the current node

pub fn error_level(&self) -> usize

Get the error level of the current node

pub fn new_roots_from_spec( spec: &DisjunctionTargetConfig, ta: &ACSThresholdAutomaton, ) -> PartiallyOrderedConfigMap<Rc<RefCell<ErrorGraphNode>>>

Create new root error nodes from the specification

Note: This function only returns the root of the error graph, to construct the full graph ErrorGraphNode::compute_predecessors_and_insert_to_graph for all computed nodes until the to_explore_queue is empty

pub fn compute_predecessors_and_insert_to_graph( cfg_node_map: &mut PartiallyOrderedConfigMap<Rc<RefCell<ErrorGraphNode>>>, to_explore_queue: &mut VecDeque<Rc<RefCell<ErrorGraphNode>>>, node_to_explore: &Rc<RefCell<ErrorGraphNode>>, ta: &ACSThresholdAutomaton, )

Compute the predecessor of node_to_compute_succs in ta, adding nodes that still require exploration to to_explore_queue while checking that no smaller or equal node exists in cfg_node_map

This function corresponds to ComputePredBasis of Algorithm 1 in the paper

Safety: This function assumes that none of the nodes in the error graph still have an existing borrow

fn insert_existing_smaller_node( smaller_or_eq_node: &Rc<RefCell<ErrorGraphNode>>, node_to_explore: &Rc<RefCell<ErrorGraphNode>>, edge_to_insert: ErrorGraphEdge, rule_id: u32, )

Insert the new configuration and corresponding edge into the error graph, in case there exists an already inserted node with a smaller or equal configuration

This function corresponds to line 20-21 in Algorithm 1

fn insert_existing_bigger_node( bigger_node: &Rc<RefCell<ErrorGraphNode>>, cfg_to_insert: ACSTAConfig, edge_to_insert: ErrorGraphEdge, )

Insert the new configuration and corresponding edge into the error graph, in case there exists an already inserted node with a bigger configuration

This function corresponds to line 24-26 in Algorithm 1

Trait Implementations

impl Clone for ErrorGraphNode

fn clone(&self) -> ErrorGraphNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ErrorGraphNode

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

Formats the value using the given formatter.

impl From<ErrorGraphNode> for Rc<RefCell<ErrorGraphNode>>

fn from(value: ErrorGraphNode) -> Self

Converts to this type from the input type.

impl Ord for ErrorGraphNode

fn cmp(&self, other: &ErrorGraphNode) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for ErrorGraphNode

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for ErrorGraphNode

fn partial_cmp(&self, other: &ErrorGraphNode) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for ErrorGraphNode

impl StructuralPartialEq for ErrorGraphNode