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
|
//! Deduplicating maps and keys for argument parsing.
use std::collections::HashMap;
use std::hash::Hash;
use crate::layout::{LayoutAxes, SpecificAxis, GenericAxis};
use crate::size::{PSize, ValueBox};
use super::*;
/// A deduplicating map type useful for storing possibly redundant arguments.
#[derive(Debug, Clone, PartialEq)]
pub struct DedupMap<K, V> where K: Eq {
map: Vec<Spanned<(K, V)>>,
}
impl<K, V> DedupMap<K, V> where K: Eq {
pub fn new() -> DedupMap<K, V> {
DedupMap { map: vec![] }
}
pub fn from_iter<I>(errors: &mut Errors, iter: I) -> DedupMap<K, V>
where I: IntoIterator<Item=Spanned<(K, V)>> {
let mut map = DedupMap::new();
for Spanned { v: (key, value), span } in iter.into_iter() {
map.insert(errors, key, value, span);
}
map
}
/// Add a key-value pair.
pub fn insert(&mut self, errors: &mut Errors, key: K, value: V, span: Span) {
if self.map.iter().any(|e| e.v.0 == key) {
errors.push(err!(span; "duplicate argument"));
} else {
self.map.push(Spanned { v: (key, value), span });
}
}
/// Add multiple key-value pairs.
pub fn extend<I>(&mut self, errors: &mut Errors, items: I)
where I: IntoIterator<Item=Spanned<(K, V)>> {
for Spanned { v: (k, v), span } in items.into_iter() {
self.insert(errors, k, v, span);
}
}
/// Get the value corresponding to a key if it is present.
pub fn get(&self, key: K) -> Option<&V> {
self.map.iter().find(|e| e.v.0 == key).map(|e| &e.v.1)
}
/// Get the value and its span corresponding to a key if it is present.
pub fn get_spanned(&self, key: K) -> Option<Spanned<&V>> {
self.map.iter().find(|e| e.v.0 == key)
.map(|e| Spanned { v: &e.v.1, span: e.span })
}
/// Call a function with the value if the key is present.
pub fn with<F>(&self, key: K, callback: F) where F: FnOnce(&V) {
if let Some(value) = self.get(key) {
callback(value);
}
}
/// Create a new map where keys and values are mapped to new keys and
/// values.
///
/// Returns an error if a new key is duplicate.
pub fn dedup<F, K2, V2>(&self, errors: &mut Errors, mut f: F) -> DedupMap<K2, V2>
where F: FnMut(&K, &V) -> (K2, V2), K2: Eq {
let mut map = DedupMap::new();
for Spanned { v: (key, value), span } in self.map.iter() {
let (key, value) = f(key, value);
map.insert(errors, key, value, *span);
}
map
}
/// Iterate over the (key, value) pairs.
pub fn iter(&self) -> impl Iterator<Item=&(K, V)> {
self.map.iter().map(|e| &e.v)
}
}
/// A map for storing a value for two axes given by keyword arguments.
#[derive(Debug, Clone, PartialEq)]
pub struct AxisMap<V>(DedupMap<AxisKey, V>);
impl<V: Clone> AxisMap<V> {
pub fn parse<KT: Key<Output=AxisKey>, VT: Value<Output=V>>(
errors: &mut Errors,
object: &mut Object,
) -> AxisMap<V> {
let values: Vec<_> = object.get_all_spanned::<KT, VT>(errors).collect();
AxisMap(DedupMap::from_iter(errors, values))
}
/// Deduplicate from specific or generic to just specific axes.
pub fn dedup(&self, errors: &mut Errors, axes: LayoutAxes) -> DedupMap<SpecificAxis, V> {
self.0.dedup(errors, |key, val| (key.to_specific(axes), val.clone()))
}
}
/// A map for extracting values for two axes that are given through two
/// positional or keyword arguments.
#[derive(Debug, Clone, PartialEq)]
pub struct PosAxisMap<V>(DedupMap<PosAxisKey, V>);
impl<V: Clone> PosAxisMap<V> {
pub fn parse<KT: Key<Output=AxisKey>, VT: Value<Output=V>>(
errors: &mut Errors,
args: &mut FuncArgs,
) -> PosAxisMap<V> {
let mut map = DedupMap::new();
for &key in &[PosAxisKey::First, PosAxisKey::Second] {
if let Some(value) = args.pos.get::<Spanned<VT>>(errors) {
map.insert(errors, key, value.v, value.span);
}
}
let keywords: Vec<_> = args.key
.get_all_spanned::<KT, VT>(errors)
.map(|s| s.map(|(k, v)| (PosAxisKey::Keyword(k), v)))
.collect();
map.extend(errors, keywords);
PosAxisMap(map)
}
/// Deduplicate from positional or specific to generic axes.
pub fn dedup<F>(
&self,
errors: &mut Errors,
axes: LayoutAxes,
mut f: F,
) -> DedupMap<GenericAxis, V> where F: FnMut(&V) -> Option<GenericAxis> {
self.0.dedup(errors, |key, val| {
(match key {
PosAxisKey::First => f(val).unwrap_or(GenericAxis::Primary),
PosAxisKey::Second => f(val).unwrap_or(GenericAxis::Secondary),
PosAxisKey::Keyword(AxisKey::Specific(axis)) => axis.to_generic(axes),
PosAxisKey::Keyword(AxisKey::Generic(axis)) => *axis,
}, val.clone())
})
}
}
/// A map for extracting padding for a set of specifications given for all
/// sides, opposing sides or single sides.
#[derive(Debug, Clone, PartialEq)]
pub struct PaddingMap(DedupMap<PaddingKey<AxisKey>, Option<PSize>>);
impl PaddingMap {
pub fn parse(errors: &mut Errors, args: &mut FuncArgs) -> PaddingMap {
let mut map = DedupMap::new();
if let Some(psize) = args.pos.get::<Spanned<Defaultable<PSize>>>(errors) {
map.insert(errors, PaddingKey::All, psize.v, psize.span);
}
let paddings: Vec<_> = args.key
.get_all_spanned::<PaddingKey<AxisKey>, Defaultable<PSize>>(errors)
.collect();
map.extend(errors, paddings);
PaddingMap(map)
}
/// Apply the specified padding on a value box of optional, scalable sizes.
pub fn apply(
&self,
errors: &mut Errors,
axes: LayoutAxes,
padding: &mut ValueBox<Option<PSize>>
) {
use PaddingKey::*;
use SpecificAxis::*;
let map = self.0.dedup(errors, |key, &val| {
(match key {
All => All,
Both(axis) => Both(axis.to_specific(axes)),
Side(axis, alignment) => {
let axis = axis.to_specific(axes);
Side(axis, alignment.to_specific(axes, axis))
}
}, val)
});
map.with(All, |&val| padding.set_all(val));
map.with(Both(Horizontal), |&val| padding.set_horizontal(val));
map.with(Both(Vertical), |&val| padding.set_vertical(val));
for &(key, val) in map.iter() {
if let Side(_, alignment) = key {
match alignment {
AlignmentValue::Left => padding.left = val,
AlignmentValue::Right => padding.right = val,
AlignmentValue::Top => padding.top = val,
AlignmentValue::Bottom => padding.bottom = val,
_ => {},
}
}
}
}
}
|