1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
use terms::{
Term,
Pattern,
variable::Family
};
use ta::{
Symbol,
State,
NoLabel,
Ranked,
Rank,
bottom_up::{
Automaton,
Configuration,
width_search::{LanguageState, Killed}
}
};
use crate::{
Convoluted,
MaybeBottom
};
pub mod automaton;
mod search;
pub use search::{search, multi_search};
pub struct Convolution {
}
pub struct ConvolutedPatternBuilder<F: Symbol, X: Clone> {
sub_patterns_to_convolute: Vec<Convoluted<Pattern<F, X>>>,
arity: usize
}
impl<F: Symbol, X: Clone> ConvolutedPatternBuilder<F, X> {
pub fn new() -> ConvolutedPatternBuilder<F, X> {
ConvolutedPatternBuilder {
sub_patterns_to_convolute: Vec::new(),
arity: 0
}
}
pub fn set(&mut self, k: usize, i: usize, pattern: Pattern<F, X>) {
if self.sub_patterns_to_convolute.len() <= i {
let mut list = Vec::new();
list.resize(self.arity+1, MaybeBottom::Bottom);
self.sub_patterns_to_convolute.resize(i+1, Convoluted(list));
}
if self.arity <= k {
for sub_pattern in self.sub_patterns_to_convolute.iter_mut() {
sub_pattern.0.resize(k+1, MaybeBottom::Bottom);
}
self.arity = k;
}
self.sub_patterns_to_convolute[i].0[k] = MaybeBottom::Some(pattern)
}
pub fn unwrap(self) -> Vec<Convoluted<Pattern<F, X>>> {
self.sub_patterns_to_convolute
}
}
impl<F: Symbol + Ranked> crate::Convolution<F> for Convolution {
fn convolute<T: AsRef<[Option<Term<F>>]>>(terms: T) -> Term<Rank<Convoluted<F>>> {
let terms = terms.as_ref();
let mut convoluted_symbol = Vec::with_capacity(terms.len());
let mut sub_terms_to_convolute = Vec::new();
for (k, term) in terms.iter().enumerate() {
if let Some(term) = term {
convoluted_symbol.push(MaybeBottom::Some(term.symbol().clone()));
for (i, sub_term) in term.sub_terms().iter().enumerate() {
if sub_terms_to_convolute.len() <= i {
let mut vec = Vec::with_capacity(k);
vec.resize(k, None);
sub_terms_to_convolute.resize(i+1, vec);
}
sub_terms_to_convolute[i].push(Some(sub_term.clone()));
}
for i in term.sub_terms().len()..sub_terms_to_convolute.len() {
sub_terms_to_convolute[i].push(None);
}
} else {
convoluted_symbol.push(MaybeBottom::Bottom);
for i in 0..sub_terms_to_convolute.len() {
sub_terms_to_convolute[i].push(None);
}
}
}
let convoluted_sub_terms = sub_terms_to_convolute.iter().map(|sub_terms| {
Self::convolute(&sub_terms)
}).collect();
Term::new(Rank(Convoluted(convoluted_symbol), sub_terms_to_convolute.len()), convoluted_sub_terms)
}
fn deconvolute(_term: Term<Rank<Convoluted<F>>>) -> Vec<Option<Term<F>>> {
panic!("TODO deconvolution");
}
fn equality<Q: State>(aut: &Automaton<F, Q, NoLabel>, n: usize) -> Automaton<Rank<Convoluted<F>>, Q, NoLabel> {
let mut eq_aut = Automaton::new();
for (Configuration(f, sub_states), _, q) in aut.transitions() {
let mut convoluted_f = Vec::with_capacity(n);
convoluted_f.resize(n, MaybeBottom::Some(f.clone()));
eq_aut.add(Configuration(Rank(Convoluted(convoluted_f), sub_states.len()), sub_states.clone()), NoLabel, q.clone());
}
for final_q in aut.final_states() {
eq_aut.set_final(final_q.clone());
}
eq_aut
}
fn generic_automaton<Q: State>(aut: &Automaton<Rank<Convoluted<F>>, Q, NoLabel>) -> ta::alternating::Automaton<Convoluted<F>, Q, Convoluted<u32>> {
let mut alt = ta::alternating::Automaton::new();
for (Configuration(convoluted_f, subs), _, convoluted_q) in aut.transitions() {
let conjunction = subs.iter().enumerate().map(|(i, convoluted_sub)| {
let indexes = convoluted_f.0.iter().map(|f| {
if let MaybeBottom::Some(f) = f {
if i < f.arity() {
MaybeBottom::Some(i as u32)
} else {
MaybeBottom::Bottom
}
} else {
MaybeBottom::Bottom
}
}).collect();
(Convoluted(indexes), convoluted_sub.clone())
}).collect();
alt.add(convoluted_q, &convoluted_f.0, conjunction);
}
for convoluted_q in aut.final_states() {
alt.set_initial(convoluted_q.clone());
}
alt
}
fn state_convolution<E, Q: LanguageState<F, E>>(initial_state: Convoluted<Q>, env: &E) -> Automaton<Rank<Convoluted<F>>, Convoluted<Q>, NoLabel> {
automaton::state_convolution(initial_state, env)
}
fn search<'a, 'e, Q: State, X: 'a + Family + Ord>(automata: &'a [&'e Automaton<Rank<Convoluted<F>>, Q, NoLabel>], patterns: Vec<Convoluted<Pattern<F, X>>>, kill_signal: Option<crossbeam_channel::Receiver<()>>) -> Box<dyn Iterator<Item = Result<Vec<Term<Rank<Convoluted<F>>>>, Killed>> + 'a> {
Box::new(multi_search(automata, patterns, kill_signal))
}
}