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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
use crate::{
crossword::{WordIterator, Direction},
fill::cache::CachedIsViable,
parse::WordBoundary,
trie::Trie,
Crossword, FxHashMap,
};
use core::hash::{BuildHasherDefault, Hash};
use rustc_hash::{FxHashSet, FxHasher};
use std::{collections, hash::Hasher};
pub mod cache;
pub mod filler;
pub trait Fill {
fn fill(&mut self, crossword: &Crossword) -> Result<Crossword, String>;
}
pub fn is_viable_reuse(
candidate: &Crossword,
word_boundaries: &[&WordBoundary],
trie: &Trie,
mut already_used: FxHashSet<u64>,
is_viable_cache: &mut CachedIsViable,
) -> (bool, FxHashSet<u64>) {
for word_boundary in word_boundaries {
let iter = WordIterator::new(candidate, word_boundary);
let mut hasher = FxHasher::default();
let mut full = true;
for c in iter.clone() {
c.hash(&mut hasher);
full = full && c != ' ';
}
let key = hasher.finish();
if full && already_used.contains(&key) {
return (false, already_used);
}
already_used.insert(key);
if !is_viable_cache.is_viable(iter, trie) {
return (false, already_used);
}
}
(true, already_used)
}
pub fn fill_one_word(
candidate: &Crossword,
iter: &WordIterator,
word: &str,
) -> Crossword {
let mut result_contents = String::with_capacity(iter.word_boundary.length);
let word_boundary = iter.word_boundary;
let mut word_iter = word.chars();
match word_boundary.direction {
Direction::Across => {
for (index, c) in candidate.contents.chars().enumerate() {
let row = index / candidate.width;
let col = index % candidate.width;
if row == word_boundary.start_row
&& col >= word_boundary.start_col
&& col < word_boundary.start_col + word_boundary.length
{
result_contents.push(word_iter.next().unwrap());
} else {
result_contents.push(c);
}
}
}
Direction::Down => {
for (index, c) in candidate.contents.chars().enumerate() {
let row = index / candidate.width;
let col = index % candidate.width;
if col == word_boundary.start_col
&& row >= word_boundary.start_row
&& row < word_boundary.start_row + word_boundary.length
{
result_contents.push(word_iter.next().unwrap());
} else {
result_contents.push(c);
}
}
}
}
Crossword {
contents: result_contents,
..*candidate
}
}
pub fn build_square_word_boundary_lookup<'s>(
word_boundaries: &'s[WordBoundary],
) -> FxHashMap<(Direction, usize, usize), &'s WordBoundary> {
let mut result = FxHashMap::default();
for word_boundary in word_boundaries {
match word_boundary.direction {
Direction::Across => {
for index in 0..word_boundary.length {
let col = word_boundary.start_col + index;
result.insert(
(Direction::Across, word_boundary.start_row, col),
word_boundary,
);
}
}
Direction::Down => {
for index in 0..word_boundary.length {
let row = word_boundary.start_row + index;
result.insert(
(Direction::Down, row, word_boundary.start_col),
word_boundary,
);
}
}
}
}
result
}
pub fn words_orthogonal_to_word<'s>(
to_fill: &'s WordBoundary,
word_boundary_lookup: &collections::HashMap<
(Direction, usize, usize),
&'s WordBoundary,
BuildHasherDefault<FxHasher>,
>,
) -> Vec<&'s WordBoundary> {
let mut result = Vec::with_capacity(to_fill.length);
match to_fill.direction {
Direction::Across => {
for index in 0..to_fill.length {
let col = to_fill.start_col + index;
result.push(
*word_boundary_lookup
.get(&(Direction::Down, to_fill.start_row, col))
.unwrap(),
);
}
}
Direction::Down => {
for index in 0..to_fill.length {
let row = to_fill.start_row + index;
result.push(
*word_boundary_lookup
.get(&(Direction::Across, row, to_fill.start_col))
.unwrap(),
);
}
}
}
result
}
#[cfg(test)]
mod tests {
use crate::{
crossword::Direction, fill::WordIterator, parse::WordBoundary, Crossword,
};
use super::fill_one_word;
#[test]
fn fill_one_word_works() {
let c = Crossword::square(String::from(
"
abc
def
ghi
",
))
.unwrap();
assert_eq!(
fill_one_word(
&c,
&WordIterator::new(
&c,
&WordBoundary {
start_col: 0,
start_row: 0,
length: 3,
direction: Direction::Across,
},
),
&String::from("cat")
),
Crossword::square(String::from(
"
cat
def
ghi
",
))
.unwrap()
);
assert_eq!(
fill_one_word(
&c,
&WordIterator::new(
&c,
&WordBoundary {
start_col: 0,
start_row: 0,
length: 3,
direction: Direction::Down,
}
),
&String::from("cat"),
),
Crossword::square(String::from(
"
cbc
aef
thi
",
))
.unwrap()
);
}
}