pub type RelationData = Vec<(u64, Vec<u32>)>;
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct QuiverData {
pub vertices: u32,
pub arrows: Vec<(u32, u32)>,
}
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct OriginTerm {
pub coeff: u64,
pub left: Vec<u32>,
pub input_index: usize,
pub right: Vec<u32>,
}
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct TraceStep {
pub word: Vec<u32>,
pub basis_index: usize,
pub left: Vec<u32>,
pub right: Vec<u32>,
pub coeff: u64,
}
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct Trace {
pub start: RelationData,
pub steps: Vec<TraceStep>,
}
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub enum AmbiguityKind {
Overlap,
Inclusion,
}
impl AmbiguityKind {
pub fn as_str(self) -> &'static str {
match self {
Self::Overlap => "overlap",
Self::Inclusion => "inclusion",
}
}
}
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct AmbiguityEntry {
pub i: usize,
pub j: usize,
pub kind: AmbiguityKind,
pub offset: usize,
pub trace: Trace,
}
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct AutomatonData {
pub states: Vec<Vec<u32>>,
pub transitions: Vec<(usize, u32, usize)>,
}
#[derive(Clone, Debug, PartialEq, Eq)]
pub enum FinitenessData {
Finite,
Infinite { prefix: Vec<u32>, cycle: Vec<u32> },
}
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct Certificate {
pub schema: String,
pub field: u64,
pub quiver: QuiverData,
pub order: String,
pub input_relations: Vec<RelationData>,
pub basis: Vec<RelationData>,
pub origin: Vec<Vec<OriginTerm>>,
pub membership: Vec<Trace>,
pub ambiguities: Vec<AmbiguityEntry>,
pub normal_words: Vec<Vec<u32>>,
pub automaton: AutomatonData,
pub finiteness: FinitenessData,
}