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
|
use std::{
fmt::{Display, Write},
hash::Hash,
};
use log::debug;
pub mod error;
pub mod map_tree;
#[derive(Clone, Debug, Eq)]
pub struct MapKey {
pub key: char,
resolution: usize,
/// Part of the path, used to derive the key
part_path: String,
}
impl Hash for MapKey {
fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
self.key.hash(state)
}
}
impl PartialEq for MapKey {
fn eq(&self, other: &Self) -> bool {
self.key == other.key
}
}
impl MapKey {
pub fn new_from_part_path(part_path: &str, resolution: usize) -> Vec<Self> {
let key = Self::part_path_to_key(&part_path, resolution);
key.chars()
.map(|ch| Self {
key: ch,
resolution,
part_path: part_path.to_owned(),
})
.collect()
}
pub fn new_ones_from_path(path: &str, number_of_chars: usize) -> Vec<Self> {
let key: Vec<MapKey> = path
.split('/')
.map(|part| Self::new_from_part_path(part, number_of_chars))
.flatten()
.collect();
debug!(
"Generated full MapKeys: '{}' -> '{}'",
path,
MapKey::display(&key)
);
key
}
pub fn increment(&self, target_resolution: usize) -> Vec<Self> {
let new_resolution = target_resolution;
// debug!("Incrementing: '{}' ('{}')", &self, &self.part_path);
let added_chars = if new_resolution < self.part_path.len() {
MapKey::part_path_to_key(&self.part_path, new_resolution)
} else {
let mut generated_chars =
MapKey::part_path_to_key(&self.part_path, self.part_path.len());
generated_chars.extend(
(0..(new_resolution - self.part_path.len()))
.into_iter()
.map(|_| self.part_path.chars().last().expect("This will exists")),
);
generated_chars
};
assert_eq!(added_chars.len(), new_resolution,);
let part_path = self.part_path.clone();
let output: Vec<Self> = added_chars
.chars()
.enumerate()
.map(|(res, ch)| MapKey {
key: ch,
resolution: res + 1,
part_path: part_path.clone(),
})
.collect();
// debug!("Finished increment: '{}' ('{}')", MapKey::display(&output), output[0].part_path);
output
}
pub fn display(values: &[Self]) -> String {
values.iter().map(|value| value.key.clone()).collect()
}
fn part_path_to_key(part: &str, number_of_chars: usize) -> String {
fn make(pat: char, part: &str, number_of_chars: usize) -> String {
let mut acc = String::new();
let mut last_working = None;
for i in 0..number_of_chars {
for str in part.split(pat) {
if acc.len() != number_of_chars {
acc.push(match str.chars().nth(i) {
Some(ch) => ch,
None => {
if let Some(last) = last_working {
str.chars().nth(last).expect("This should always exist")
} else {
last_working = Some(i - 1);
str.chars().nth(i - 1).expect("This should always exist")
}
}
})
}
}
}
acc
}
let value = if part.contains('_') {
make('_', part, number_of_chars)
} else if part.contains('-') {
make('-', part, number_of_chars)
} else {
part.chars().take(number_of_chars).collect::<String>()
};
assert_eq!(
value.len(),
number_of_chars,
"'{}' is not {}",
value,
number_of_chars
);
value
}
}
impl Display for MapKey {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
f.write_char(self.key)
}
}
|
