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
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
extern crate rand;
use std::sync::Arc;
use std::hash::{Hash, Hasher};
use std::cmp::{PartialOrd, Ord, Ordering};
use std::collections::hash_map::DefaultHasher;
use std::sync::atomic::{self, AtomicU64};
use std::fmt;
pub mod pattern;
pub mod variable;
pub mod macros;
mod index;
pub use pattern::{Pattern, PatternKind, PatternLike, PatternLikeKind};
pub use variable::Var;
pub use index::*;
pub trait Ranked {
fn arity(&self) -> usize;
}
pub struct Term<F> {
f: F,
subs: Arc<Vec<Self>>,
hash: AtomicU64
}
impl<F: fmt::Debug> fmt::Debug for Term<F> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{:?}({:?})", self.f, self.subs)
}
}
impl<F: fmt::Display> fmt::Display for Term<F> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
self.f.fmt(f)?;
match self.subs.split_first() {
Some((head, tail)) => {
write!(f, "(")?;
head.fmt(f)?;
for e in tail.iter() {
write!(f, ", ")?;
e.fmt(f)?;
}
write!(f, ")")
},
None => Ok(())
}
}
}
impl<F> Term<F> {
pub fn new(f: F, subs: Vec<Self>) -> Self where F: Clone {
Term {
f: f,
subs: Arc::new(subs),
hash: AtomicU64::new(0)
}
}
pub fn from_slice(f: F, subs: &[Self]) -> Self where F: Clone {
Term {
f: f,
subs: Arc::new(subs.iter().map(|p| p.clone()).collect()),
hash: AtomicU64::new(0)
}
}
pub fn symbol(&self) -> &F {
&self.f
}
pub fn sub_terms(&self) -> &Vec<Self> {
&self.subs
}
pub fn depth(&self) -> u64 {
let mut depth = 0;
for sub in self.subs.iter() {
let d = sub.depth() + 1;
if d > depth {
depth = d
}
}
depth
}
fn random_with_zeros(zero_alphabet: &[F], alphabet: &[F], max_depth: u64) -> Term<F> where F: Clone + Ranked {
let i: usize = rand::random();
let (f, arity, next_depth) = if max_depth == 0 {
let f: &F = &zero_alphabet[i%zero_alphabet.len()];
(f.clone(), 0, 0)
} else {
let f: &F = &alphabet[i%alphabet.len()];
(f.clone(), f.arity(), max_depth-1)
};
let mut subs = Vec::with_capacity(arity);
for _ in 0..arity {
subs.push(Self::random_with_zeros(zero_alphabet, alphabet, next_depth))
}
Term {
f: f,
subs: Arc::new(subs),
hash: AtomicU64::new(0)
}
}
pub fn random(alphabet: &[F], max_depth: u64) -> Term<F> where F: Clone + Ranked {
let mut zeros = Vec::with_capacity(alphabet.len());
for f in alphabet.iter() {
if f.arity() == 0 {
zeros.push(f.clone())
}
}
assert!(!zeros.is_empty());
Self::random_with_zeros(&zeros, alphabet, max_depth)
}
}
impl<F, X> PatternLike<F, X> for Term<F> {
fn kind(&self) -> PatternLikeKind<F, X, Self> {
PatternLikeKind::Cons(&self.f, &self.subs)
}
}
impl<F: Clone> Clone for Term<F> {
fn clone(&self) -> Term<F> {
Term {
f: self.f.clone(),
subs: self.subs.clone(),
hash: AtomicU64::new(self.hash.load(atomic::Ordering::Relaxed)),
}
}
}
impl<F: PartialEq> PartialEq for Term<F> {
fn eq(&self, other: &Term<F>) -> bool {
self.f == other.f && self.subs == other.subs
}
}
impl<F: PartialEq + Eq> Eq for Term<F> {}
impl<F: Hash> Hash for Term<F> {
fn hash<H: Hasher>(&self, state: &mut H) {
let mut h = self.hash.load(atomic::Ordering::Relaxed);
if h == 1 {
loop {
h = self.hash.load(atomic::Ordering::Relaxed);
if h != 1 {
break;
}
}
}
if h == 0 {
self.hash.store(1, atomic::Ordering::Relaxed);
let mut hasher = DefaultHasher::new();
self.f.hash(&mut hasher);
for sub in self.subs.iter() {
Term::<F>::hash(sub, &mut hasher)
}
h = hasher.finish();
if h <= 1 {
h = 2;
}
self.hash.store(h, atomic::Ordering::Relaxed);
}
h.hash(state)
}
}
impl<F: Ord> PartialOrd for Term<F> {
fn partial_cmp(&self, other: &Term<F>) -> Option<Ordering> {
Some(self.cmp(other))
}
}
impl<F: Ord> Ord for Term<F> {
fn cmp(&self, other: &Term<F>) -> Ordering {
match self.depth().cmp(&other.depth()) {
Ordering::Equal => {
match self.f.cmp(&other.f) {
Ordering::Equal => {
match self.subs.len().cmp(&other.subs.len()) {
Ordering::Equal => {
for (i, a) in self.subs.iter().enumerate() {
let b = &other.subs[i];
match a.cmp(b) {
Ordering::Equal => (),
ord => return ord
}
}
Ordering::Equal
},
ord => ord
}
},
ord => ord
}
},
ord => ord
}
}
}