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
use itertools::Itertools;
use std::{
any::{Any, TypeId},
collections::BTreeMap,
fmt::{Debug, Formatter, Result},
rc::Rc,
};
#[derive(Default, Clone)]
pub struct Annotations {
map: BTreeMap<TypeId, Data>,
}
struct Data {
value: Box<dyn Any>,
clone_fun: Rc<dyn Fn(&Box<dyn Any>) -> Box<dyn Any>>,
}
impl Data {
fn new<T: Any + Clone>(x: T) -> Self {
let clone_fun = Rc::new(|x: &Box<dyn Any>| -> Box<dyn Any> {
Box::new(x.downcast_ref::<T>().unwrap().clone())
});
Self {
value: Box::new(x),
clone_fun,
}
}
}
impl Clone for Data {
fn clone(&self) -> Self {
Self {
value: (self.clone_fun)(&self.value),
clone_fun: self.clone_fun.clone(),
}
}
}
impl Debug for Annotations {
fn fmt(&self, f: &mut Formatter<'_>) -> Result {
write!(
f,
"annotations{{{}}}",
self.map.keys().map(|t| format!("{:?}", t)).join(", ")
)
}
}
impl Annotations {
pub fn has<T: Any>(&self) -> bool {
let id = TypeId::of::<T>();
self.map.contains_key(&id)
}
pub fn get<T: Any>(&self) -> Option<&T> {
let id = TypeId::of::<T>();
self.map.get(&id).and_then(|d| d.value.downcast_ref::<T>())
}
pub fn get_or_default_mut<T: Any + Default + Clone>(&mut self) -> &mut T {
let id = TypeId::of::<T>();
self.map
.entry(id)
.or_insert_with(|| Data::new(T::default()))
.value
.downcast_mut::<T>()
.expect("cast successful")
}
pub fn set<T: Any + Clone>(&mut self, x: T) {
let id = TypeId::of::<T>();
self.map.insert(id, Data::new(x));
}
pub fn remove<T: Any>(&mut self) -> Option<Box<T>> {
let id = TypeId::of::<T>();
self.map
.remove(&id)
.and_then(|d| d.value.downcast::<T>().ok())
}
}