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
mod load;
mod popup;
pub(crate) mod screenshot;
mod url;
pub(crate) mod warper;
pub use load::{FileLoader, FutureLoader, RawBytes};
pub use popup::PopupMsg;
pub use url::URLManager;
pub struct Cached<K: PartialEq + Clone, V> {
contents: Option<(K, V)>,
}
impl<K: PartialEq + Clone, V> Cached<K, V> {
pub fn new() -> Cached<K, V> {
Cached { contents: None }
}
pub fn key(&self) -> Option<K> {
self.contents.as_ref().map(|(k, _)| k.clone())
}
pub fn value(&self) -> Option<&V> {
self.contents.as_ref().map(|(_, v)| v)
}
pub fn value_mut(&mut self) -> Option<&mut V> {
self.contents.as_mut().map(|(_, v)| v)
}
pub fn update<F: FnMut(K) -> V>(&mut self, key: Option<K>, mut produce_value: F) {
if let Some(new_key) = key {
if self.key() != Some(new_key.clone()) {
self.contents = Some((new_key.clone(), produce_value(new_key)));
}
} else {
self.contents = None;
}
}
pub fn set(&mut self, key: K, value: V) {
self.contents = Some((key, value));
}
pub fn clear(&mut self) {
self.contents = None;
}
pub fn take(&mut self) -> Option<(K, V)> {
self.contents.take()
}
}
impl<K: PartialEq + Clone, V> Default for Cached<K, V> {
fn default() -> Self {
Cached::new()
}
}