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
use std::collections::HashSet;
use anyhow::Result;
use rand::Rng;
const SPECIALS: &[u8] = b"!@#%&*?=+:";
pub fn all(reference: Vec<String>, query: Vec<String>) -> bool {
let r = make_string_set(reference);
let q = make_string_set(query);
q.is_subset(&r)
}
pub fn any(reference: Vec<String>, query: Vec<String>) -> bool {
let r = make_string_set(reference);
let q = make_string_set(query);
if r.intersection(&q).count() == 0 {
return false;
}
true
}
pub fn bincode_cfg() -> bincode::config::Configuration<
bincode::config::LittleEndian,
bincode::config::Fixint,
bincode::config::WriteFixedArrayLength,
bincode::config::NoLimit,
> {
bincode::config::legacy()
}
pub fn display(text: &str) -> Result<()> {
println!("{text}");
Ok(())
}
pub fn make_string_set(input: Vec<String>) -> HashSet<String> {
input.into_iter().collect()
}
pub fn random_specials(count: usize) -> Vec<u8> {
let mut specials: Vec<u8> = Vec::new();
let mut rng = rand::thread_rng();
for _ in 1..count + 1 {
specials.push(SPECIALS[rng.gen_range(0..SPECIALS.len())])
}
specials
}
#[cfg(test)]
mod tests {
fn refset() -> Vec<String> {
vec!["a", "b", "c", "d", "e", "f"]
.iter()
.map(|e| e.to_string())
.collect()
}
fn query1() -> Vec<String> {
vec!["b".to_string(), "e".to_string()]
}
fn query2() -> Vec<String> {
vec!["b".to_string(), "g".to_string()]
}
fn query3() -> Vec<String> {
vec!["h".to_string(), "g".to_string()]
}
#[test]
fn all() {
assert!(super::all(refset(), query1()));
assert!(!super::all(refset(), query2()));
assert!(!super::all(refset(), query3()));
}
#[test]
fn any() {
assert!(super::any(refset(), query1()));
assert!(super::any(refset(), query2()));
assert!(!super::any(refset(), query3()));
}
}