Struct ErrorGraphEdge 

pub struct ErrorGraphEdge {
    rule_id: BTreeSet<u32>,
    cfg: ACSTAConfig,
    node: Rc<RefCell<ErrorGraphNode>>,
}

Edge in the error graph

An edge in the error graph consists of a rule id and a reference to a node. When inserted into a node a of the error graph, it means that we can derive the configuration of node by applying the rule with id rule_id to a.

Fields

rule_id: BTreeSet<u32>

Ids of the rules used to derive this edge

cfg: ACSTAConfig

Config of the successor node

node: Rc<RefCell<ErrorGraphNode>>

Successor node which configuration can be derived by applying the rule with id rule_id

Implementations

impl ErrorGraphEdge

pub fn new(rule: &CSRule, node: Rc<RefCell<ErrorGraphNode>>) -> Self

Create a new ErrorGraphEdge

Borrows node immutable during creation of the node

pub fn get_successor_configuration(&self) -> &ACSTAConfig

Returns the configuration of the successor node of this edge

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

Get the id of the rule that this edge has been derived from

pub fn node(&self) -> &Rc<RefCell<ErrorGraphNode>>

Get the node this edge leads to

pub fn insert_to_edge_collection(v: &mut Vec<ErrorGraphEdge>, e: ErrorGraphEdge)

Insert a new edge into a collection of error graph edges

Trait Implementations

impl Clone for ErrorGraphEdge

fn clone(&self) -> ErrorGraphEdge

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ErrorGraphEdge

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

Formats the value using the given formatter.

impl Ord for ErrorGraphEdge

fn cmp(&self, other: &ErrorGraphEdge) -> 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 ErrorGraphEdge

fn eq(&self, other: &ErrorGraphEdge) -> 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 ErrorGraphEdge

fn partial_cmp(&self, other: &ErrorGraphEdge) -> 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 ErrorGraphEdge

impl StructuralPartialEq for ErrorGraphEdge