Struct air_ir::AlgebraicGraph

pub struct AlgebraicGraph { /* private fields */ }

The AlgebraicGraph is a directed acyclic graph used to represent integrity constraints. To store it compactly, it is represented as a vector of nodes where each node references other nodes by their index in the vector.

Within the graph, constraint expressions can overlap and share subgraphs, since new expressions reuse matching existing nodes when they are added, rather than creating new nodes.

• Leaf nodes (with no outgoing edges) are constants or references to trace cells (i.e. column 0 in the current row or column 5 in the next row).
• Tip nodes with no incoming edges (no parent nodes) always represent constraints, although they do not necessarily represent all constraints. There could be constraints which are also subgraphs of other constraints.

Implementations

impl AlgebraicGraph

pub const fn new(nodes: Vec<Node>) -> Self

Creates a new graph from a list of nodes.

pub fn node(&self, index: &NodeIndex) -> &Node

Returns the node with the specified index.

pub fn num_nodes(&self) -> usize

Returns the number of nodes in the graph.

pub fn degree(&self, index: &NodeIndex) -> IntegrityConstraintDegree

Returns the degree of the subgraph which has the specified node as its tip.

pub fn node_details( &self, index: &NodeIndex, default_domain: ConstraintDomain ) -> Result<(TraceSegmentId, ConstraintDomain), ConstraintError>

TODO: docs

Trait Implementations

impl Clone for AlgebraicGraph

fn clone(&self) -> AlgebraicGraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for AlgebraicGraph

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

Formats the value using the given formatter.

impl Default for AlgebraicGraph

fn default() -> AlgebraicGraph

Returns the “default value” for a type.