use super::*;
use crate::certificate::{CERT_SCHEMA, QuiverData};
#[test]
fn monomial_x_cubed_is_a_no_op() {
let c = completed(&x_cubed());
assert_eq!(c.schema, CERT_SCHEMA);
assert_eq!(c.field, 5);
assert_eq!(c.order, ORDER_ID);
assert_eq!(
c.quiver,
QuiverData {
vertices: 1,
arrows: vec![(0, 0)],
}
);
assert_eq!(c.input_relations, vec![vec![(1, vec![0, 0, 0])]]);
assert_eq!(c.basis, vec![vec![(1, vec![0, 0, 0])]]);
assert_eq!(
c.origin,
vec![vec![OriginTerm {
coeff: 1,
left: vec![],
input_index: 0,
right: vec![],
}]]
);
assert_eq!(
c.membership,
vec![Trace {
start: vec![(1, vec![0, 0, 0])],
steps: vec![TraceStep {
word: vec![0, 0, 0],
basis_index: 0,
left: vec![],
right: vec![],
coeff: 1,
}],
}]
);
assert_eq!(c.ambiguities.len(), 2);
for (entry, offset) in c.ambiguities.iter().zip([1usize, 2]) {
assert_eq!(
(entry.i, entry.j, entry.kind, entry.offset),
(0, 0, AmbiguityKind::Overlap, offset)
);
assert_eq!(
entry.trace,
Trace {
start: vec![],
steps: vec![],
}
);
}
assert_eq!(c.normal_words, vec![vec![], vec![0], vec![0, 0]]);
assert_eq!(
c.automaton,
AutomatonData {
states: vec![vec![], vec![0], vec![0, 0]],
transitions: vec![(0, 0, 1), (1, 0, 2)],
}
);
assert_eq!(c.finiteness, FinitenessData::Finite);
}
#[test]
fn commutative_square_rewrites_cd_to_ab() {
let c = completed(&commutative_square());
assert_eq!(
c.input_relations,
vec![vec![(4, vec![2, 3]), (1, vec![0, 1])]]
);
assert_eq!(c.basis, vec![vec![(1, vec![2, 3]), (4, vec![0, 1])]]);
assert_eq!(
c.origin,
vec![vec![OriginTerm {
coeff: 4,
left: vec![],
input_index: 0,
right: vec![],
}]]
);
assert_eq!(
c.membership,
vec![Trace {
start: vec![(4, vec![2, 3]), (1, vec![0, 1])],
steps: vec![TraceStep {
word: vec![2, 3],
basis_index: 0,
left: vec![],
right: vec![],
coeff: 4,
}],
}]
);
assert!(c.ambiguities.is_empty());
assert_eq!(
c.normal_words,
vec![
vec![],
vec![],
vec![],
vec![],
vec![0],
vec![2],
vec![1],
vec![3],
vec![0, 1],
]
);
assert_eq!(c.normal_words.len(), 9);
}
#[test]
fn overlap_completion_adds_xxx() {
let c = completed(&overlap_example());
assert_eq!(
c.basis,
vec![
vec![(1, vec![1, 0]), (1, vec![0, 0])],
vec![(1, vec![1, 1])],
vec![(1, vec![0, 0, 0])],
]
);
assert_eq!(
c.origin[0],
vec![OriginTerm {
coeff: 1,
left: vec![],
input_index: 0,
right: vec![],
}]
);
assert_eq!(
c.origin[1],
vec![OriginTerm {
coeff: 1,
left: vec![],
input_index: 1,
right: vec![],
}]
);
assert_eq!(
c.origin[2],
vec![
OriginTerm {
coeff: 1,
left: vec![],
input_index: 0,
right: vec![0],
},
OriginTerm {
coeff: 1,
left: vec![1],
input_index: 0,
right: vec![],
},
OriginTerm {
coeff: 1,
left: vec![],
input_index: 1,
right: vec![0],
},
]
);
let keys: Vec<_> = c
.ambiguities
.iter()
.map(|e| (e.i, e.j, e.kind, e.offset))
.collect();
assert_eq!(
keys,
vec![
(0, 2, AmbiguityKind::Overlap, 1),
(1, 0, AmbiguityKind::Overlap, 1),
(1, 1, AmbiguityKind::Overlap, 1),
(2, 2, AmbiguityKind::Overlap, 1),
(2, 2, AmbiguityKind::Overlap, 2),
]
);
assert_eq!(c.ambiguities[0].trace.start, vec![(1, vec![0, 0, 0, 0])]);
assert_eq!(
c.ambiguities[0].trace.steps,
vec![TraceStep {
word: vec![0, 0, 0, 0],
basis_index: 2,
left: vec![],
right: vec![0],
coeff: 1,
}]
);
assert_eq!(c.ambiguities[1].trace.start, vec![(1, vec![1, 0, 0])]);
assert_eq!(
c.ambiguities[1].trace.steps,
vec![
TraceStep {
word: vec![1, 0, 0],
basis_index: 0,
left: vec![],
right: vec![0],
coeff: 1,
},
TraceStep {
word: vec![0, 0, 0],
basis_index: 2,
left: vec![],
right: vec![],
coeff: 1,
},
]
);
for entry in &c.ambiguities[2..] {
assert_eq!(
entry.trace,
Trace {
start: vec![],
steps: vec![],
}
);
}
assert_eq!(
c.normal_words,
vec![
vec![],
vec![0],
vec![1],
vec![0, 0],
vec![0, 1],
vec![0, 0, 1],
]
);
}
#[test]
fn inclusion_collapses_to_x_squared() {
let c = completed(&inclusion_example());
assert_eq!(c.basis, vec![vec![(1, vec![0, 0])]]);
assert_eq!(c.normal_words, vec![vec![], vec![0]]);
let keys: Vec<_> = c
.ambiguities
.iter()
.map(|e| (e.i, e.j, e.kind, e.offset))
.collect();
assert_eq!(keys, vec![(0, 0, AmbiguityKind::Overlap, 1)]);
assert_eq!(
c.ambiguities[0].trace,
Trace {
start: vec![],
steps: vec![],
}
);
assert_eq!(
c.membership,
vec![
Trace {
start: vec![(1, vec![0, 0, 0, 0, 0])],
steps: vec![TraceStep {
word: vec![0, 0, 0, 0, 0],
basis_index: 0,
left: vec![],
right: vec![0, 0, 0],
coeff: 1,
}],
},
Trace {
start: vec![(1, vec![0, 0, 0, 0]), (1, vec![0, 0])],
steps: vec![
TraceStep {
word: vec![0, 0, 0, 0],
basis_index: 0,
left: vec![],
right: vec![0, 0],
coeff: 1,
},
TraceStep {
word: vec![0, 0],
basis_index: 0,
left: vec![],
right: vec![],
coeff: 1,
},
],
},
]
);
}
#[test]
fn inhomogeneous_relation_completes_without_ambiguities() {
let c = completed(&inhomogeneous());
assert_eq!(
c.input_relations,
vec![vec![(1, vec![2, 3, 4]), (4, vec![0, 1])]]
);
assert_eq!(c.basis, vec![vec![(1, vec![2, 3, 4]), (4, vec![0, 1])]]);
assert!(c.ambiguities.is_empty());
assert_eq!(
c.membership,
vec![Trace {
start: vec![(1, vec![2, 3, 4]), (4, vec![0, 1])],
steps: vec![TraceStep {
word: vec![2, 3, 4],
basis_index: 0,
left: vec![],
right: vec![],
coeff: 1,
}],
}]
);
assert_eq!(
c.normal_words,
vec![
vec![],
vec![],
vec![],
vec![],
vec![],
vec![0],
vec![2],
vec![1],
vec![3],
vec![4],
vec![0, 1],
vec![2, 3],
vec![3, 4],
]
);
assert_eq!(c.normal_words.len(), 13);
}