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
use std::collections::HashMap;
use std::cmp::min;
use crate::types::*;
pub fn levenshtein(a: &[CharIndexType], b: &[CharIndexType], max_distance: CharIndexType) -> Option<CharIndexType> {
if a == b {
return Some(0);
}
let length_a = a.len();
let length_b = b.len();
if length_a == 0 {
if length_b > max_distance as usize {
return None;
} else {
return Some(length_b as CharIndexType);
}
} else if length_a > length_b {
if length_a - length_b > max_distance as usize {
return None;
}
}
if length_b == 0 {
if length_a > max_distance as usize {
return None;
} else {
return Some(length_a as CharIndexType);
}
} else if length_b > length_a {
if length_b - length_a > max_distance as usize {
return None;
}
}
let mut cache: Vec<usize> = (1..).take(length_a).collect();
let mut distance_a;
let mut distance_b;
let mut result = 0;
for (index_b, elem_b) in b.iter().enumerate() {
result = index_b;
distance_a = index_b;
for (index_a, elem_a) in a.iter().enumerate() {
distance_b = if elem_a == elem_b {
distance_a
} else {
distance_a + 1
};
distance_a = cache[index_a];
result = if distance_a > result {
if distance_b > result {
result + 1
} else {
distance_b
}
} else if distance_b > distance_a {
distance_a + 1
} else {
distance_b
};
cache[index_a] = result;
}
}
if result > max_distance as usize {
None
} else {
Some(result as CharIndexType)
}
}
pub fn damerau_levenshtein(s: &[CharIndexType], t: &[CharIndexType], max_distance: CharIndexType) -> Option<CharIndexType> {
let len_s = s.len();
let len_t = t.len();
if len_s == 0 {
if len_t > max_distance as usize {
return None;
} else {
return Some(len_t as CharIndexType);
}
} else if len_s > len_t {
if len_s - len_t > max_distance as usize {
return None;
}
}
if len_t == 0 {
if len_s > max_distance as usize {
return None;
} else {
return Some(len_s as CharIndexType);
}
} else if len_t > len_s {
if len_t - len_s > max_distance as usize {
return None;
}
}
let distance_upper_bound = len_t + len_s;
let mut mat: Vec<Vec<usize>> = vec![vec![0; len_t + 2]; len_s + 2];
mat[0][0] = distance_upper_bound;
for i in 0..(len_s + 1) {
mat[i+1][0] = distance_upper_bound;
mat[i+1][1] = i;
}
for i in 0..(len_t + 1) {
mat[0][i+1] = distance_upper_bound;
mat[1][i+1] = i;
}
let mut char_map: HashMap<CharIndexType, CharIndexType> = HashMap::new();
for (i, s_char) in s.iter().enumerate() {
let mut db = 0;
let i = i + 1;
for (j, t_char) in t.iter().enumerate() {
let j = j + 1;
let last: usize = *char_map.get(&t_char).unwrap_or(&0) as usize;
let cost = if s_char == t_char { 0 } else { 1 };
mat[i+1][j+1] = min4(
mat[i+1][j] + 1,
mat[i][j+1] + 1,
mat[i][j] + cost,
mat[last][db] + (i - last - 1) + 1 + (j - db - 1)
);
if cost == 0 {
db = j;
}
}
char_map.insert(*s_char, i as CharIndexType);
}
let result = mat[len_s + 1][len_t + 1];
if result > max_distance.into() {
None
} else {
Some(mat[len_s + 1][len_t + 1] as CharIndexType)
}
}
pub fn longest_common_substring_length(s1: &[CharIndexType], s2: &[CharIndexType]) -> u16 {
let mut lcs = 0;
for i in 0..s1.len() {
for j in 0..s2.len() {
if s1[i] == s2[j] {
let mut tmp_lcs = 1;
let mut tmp_i = i + 1;
let mut tmp_j = j + 1;
while tmp_i < s1.len() && tmp_j < s2.len() && s1[tmp_i] == s2[tmp_j] {
tmp_lcs += 1;
tmp_i += 1;
tmp_j += 1;
}
if tmp_lcs > lcs {
lcs = tmp_lcs;
}
}
}
}
lcs
}
pub fn common_prefix_length(s1: &[CharIndexType], s2: &[CharIndexType]) -> u16 {
let mut prefixlen = 0;
for i in 0..min(s1.len(),s2.len()) {
if s1[i] == s2[i] {
prefixlen += 1;
} else {
break;
}
}
prefixlen
}
pub fn common_suffix_length(s1: &[CharIndexType], s2: &[CharIndexType]) -> u16 {
let mut suffixlen = 0;
for i in 0..min(s1.len(),s2.len()) {
if s1[s1.len() - i - 1] == s2[s2.len() - i - 1] {
suffixlen += 1;
} else {
break;
}
}
suffixlen
}
#[inline(always)]
pub fn min4(a: usize, b: usize, c: usize, d: usize) -> usize {
return min(min(min(a, b), c), d);
}