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
use std::any::{Any, TypeId};
use std::cell::{BorrowError, BorrowMutError, Ref, RefCell, RefMut};
use std::collections::HashMap;
pub struct CtxMap {
map: HashMap<TypeId, RefCell<Box<dyn Any>>>,
}
impl CtxMap {
pub fn clear(&mut self) {
self.map.clear();
}
pub fn contains<T: Any>(&self) -> bool {
self.map.contains_key(&TypeId::of::<T>())
}
pub fn try_get<T: Any>(&self) -> Option<Result<Ref<'_, T>, BorrowError>> {
self.map.get(&TypeId::of::<T>()).map(|x| {
x.try_borrow().map(|r| {
Ref::map(r, |b| {
b.downcast_ref::<T>()
.expect("value stored with TypeId::of::<T> is always type T")
})
})
})
}
pub fn try_get_mut<T: Any>(&mut self) -> Option<Result<RefMut<'_, T>, BorrowMutError>> {
self.map.get_mut(&TypeId::of::<T>()).map(|x| {
x.try_borrow_mut().map(|r| {
RefMut::map(r, |b| {
b.downcast_mut::<T>()
.expect("value stored with TypeId::of::<T> is always type T")
})
})
})
}
pub fn insert<T: Any>(&mut self, x: T) -> Option<T> {
self.map
.insert(TypeId::of::<T>(), RefCell::new(Box::new(x) as Box<dyn Any>))
.map(|x_prev| {
*(x_prev.into_inner())
.downcast::<T>()
.expect("value stored with TypeId::of::<T> is always type T")
})
}
pub fn new() -> Self {
CtxMap {
map: HashMap::new(),
}
}
pub fn remove<T: Any>(&mut self) -> Option<T> {
self.map.remove(&TypeId::of::<T>()).map(|x| {
*(x.into_inner())
.downcast::<T>()
.expect("value stored with TypeId::of::<T> is always type T")
})
}
}