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
use std::collections::HashSet;
use std::hash::Hash;
use std::fmt::{self, Formatter, Debug};
use ::rand::seq::SliceRandom;
#[derive(PartialEq, Eq)]
pub enum HostError<T: Eq + Hash + Clone> {
LettersEmpty,
AnswerLengthIncorrect,
AnswerContainsIncorrectLetter(T),
AnswerContainsDuplicatedLetter(T),
}
impl<T: Eq + Hash + Clone> Debug for HostError<T> {
fn fmt(&self, f: &mut Formatter) -> Result<(), fmt::Error> {
impl_debug_for_enum!(HostError::{LettersEmpty, AnswerLengthIncorrect, (AnswerContainsIncorrectLetter(_): ((._, "AnswerContainsIncorrectLetter"))), (AnswerContainsDuplicatedLetter(_): ((._, "AnswerContainsDuplicatedLetter")))}, f, self);
}
}
pub struct Host<T: Eq + Hash + Clone> {
letters: HashSet<T>,
answer: Vec<T>,
}
impl<T: Debug + Eq + Hash + Clone> Debug for Host<T> {
#[inline]
fn fmt(&self, f: &mut Formatter) -> Result<(), fmt::Error> {
impl_debug_for_struct!(Host, f, self, .letters, .answer);
}
}
impl<T: Eq + Hash + Clone> Host<T> {
pub fn get_letters(&self) -> &HashSet<T> {
&self.letters
}
pub fn get_answer_length(&self) -> usize {
self.answer.len()
}
pub fn get_answer(&self) -> &[T] {
&self.answer
}
}
impl<T: Eq + Hash + Clone> Host<T> {
pub fn build(letters: HashSet<T>, answer_length: usize) -> Result<Host<T>, HostError<T>> {
if letters.is_empty() {
Err(HostError::LettersEmpty)
} else {
let letters_len = letters.len();
if answer_length == 0 || answer_length > letters_len {
Err(HostError::AnswerLengthIncorrect)
} else {
let answer: Vec<T> = letters.iter().take(answer_length).map(|e| e.clone()).collect();
Ok(Host {
letters,
answer,
})
}
}
}
pub fn build_with_random_answer(letters: HashSet<T>, answer_length: usize) -> Result<Host<T>, HostError<T>> {
if letters.is_empty() {
Err(HostError::LettersEmpty)
} else {
let mut host = Host {
letters,
answer: Vec::new(),
};
host.renew_with_random_answer(answer_length)?;
Ok(host)
}
}
pub fn build_with_known_answer(letters: HashSet<T>, answer: Vec<T>) -> Result<Host<T>, HostError<T>> {
if letters.is_empty() {
Err(HostError::LettersEmpty)
} else {
let mut host = Host {
letters,
answer: Vec::new(),
};
host.renew_with_known_answer(answer)?;
Ok(host)
}
}
pub unsafe fn build_with_known_answer_unsafe(letters: HashSet<T>, answer: Vec<T>) -> Host<T> {
Host {
letters,
answer,
}
}
pub fn renew_with_random_answer(&mut self, answer_length: usize) -> Result<(), HostError<T>> {
let letters = &self.letters;
let letters_len = letters.len();
if answer_length == 0 || answer_length > letters_len {
Err(HostError::AnswerLengthIncorrect)
} else {
let mut answer: Vec<T> = Vec::with_capacity(answer_length);
{
let letters_vec: Vec<&T> = letters.iter().collect();
let mut indices: Vec<usize> = Vec::with_capacity(answer_length);
for i in 0..answer_length {
indices.push(i);
}
let mut rng = &mut rand::thread_rng();
indices.shuffle(&mut rng);
for i in indices {
answer.push(letters_vec[i].clone());
}
}
self.answer = answer;
Ok(())
}
}
pub fn renew_with_known_answer(&mut self, answer: Vec<T>) -> Result<(), HostError<T>> {
let letters = &self.letters;
let letters_len = letters.len();
let answer_length = answer.len();
if answer_length == 0 || answer_length > letters_len {
Err(HostError::AnswerLengthIncorrect)
} else {
let mut answer_2: Vec<T> = Vec::with_capacity(answer_length);
for letter in answer {
if !letters.contains(&letter) {
return Err(HostError::AnswerContainsIncorrectLetter(letter));
}
if answer_2.contains(&letter) {
return Err(HostError::AnswerContainsDuplicatedLetter(letter));
}
answer_2.push(letter);
}
self.answer = answer_2;
Ok(())
}
}
pub unsafe fn renew_with_known_answer_unsafe(&mut self, answer: Vec<T>) {
self.answer = answer;
}
}
impl<T: Eq + Hash + Clone> Host<T> {
pub fn answer(&self, answer: &[T]) -> Result<(usize, usize), HostError<T>> {
let answer_length = answer.len();
if answer_length != self.get_answer_length() {
Err(HostError::AnswerLengthIncorrect)
} else {
let mut answer_2: Vec<&T> = Vec::with_capacity(answer_length);
let mut bulls = 0;
let mut cows = 0;
for (i, letter) in answer.iter().enumerate() {
if !self.letters.contains(&letter) {
return Err(HostError::AnswerContainsIncorrectLetter(letter.clone()));
}
if answer_2.contains(&letter) {
return Err(HostError::AnswerContainsDuplicatedLetter(letter.clone()));
}
if self.answer[i].eq(letter) {
bulls += 1;
} else if self.answer.contains(letter) {
cows += 1;
}
answer_2.push(letter);
}
Ok((bulls, cows))
}
}
}