lazy-observer 0.3.0

Observe data change lazily, for building data stores and data observers (a helper crate for maomi)
Documentation 
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

use std::cell::{Ref, RefCell};
use std::cmp::*;
use std::fmt;
use std::hash::*;
use std::ops::*;
use std::pin::Pin;
use std::rc::Rc;

use super::dirty_marker::DirtyMarker;
use super::{exec_updater, notify_updater};

pub struct Lazy<T> {
    data: RefCell<Option<T>>,
    updater: Rc<dyn Fn() -> T>,
    dirty: Pin<Rc<DirtyMarker>>,
}

impl<T> Lazy<T> {
    #[inline]
    pub fn new<F: 'static + Fn() -> T>(updater: F) -> Self {
        let updater = Rc::new(updater);
        let dirty = Rc::pin(DirtyMarker::new(true));
        Self {
            data: RefCell::new(None),
            updater,
            dirty,
        }
    }
    #[inline]
    pub fn check_update(&self) {
        if self.dirty.clear_dirty() {
            match self.data.try_borrow_mut() {
                Ok(mut x) => *x = Some(exec_updater(&self.dirty, &self.updater)),
                Err(_) => {}
            }
        }
    }
    #[inline]
    pub fn get_ref(&self) -> Ref<T> {
        self.check_update();
        notify_updater(&self.dirty);
        Ref::map(self.data.borrow(), |x| x.as_ref().unwrap())
    }
}

impl<T: Clone> Lazy<T> {
    #[inline]
    pub fn get(&self) -> T {
        self.check_update();
        notify_updater(&self.dirty);
        self.data.borrow().as_ref().unwrap().clone()
    }
}

impl<T> Drop for Lazy<T> {
    fn drop(&mut self) {
        self.dirty.destroy();
    }
}

impl<T: PartialEq> PartialEq for Lazy<T> {
    fn eq(&self, other: &Self) -> bool {
        *self.get_ref() == *other.get_ref()
    }
}

impl<T: Eq> Eq for Lazy<T> {}

impl<T: PartialOrd> PartialOrd for Lazy<T> {
    #[inline]
    fn partial_cmp(&self, other: &Lazy<T>) -> Option<Ordering> {
        PartialOrd::partial_cmp(&*self.get_ref(), &*other.get_ref())
    }
    #[inline]
    fn lt(&self, other: &Lazy<T>) -> bool {
        PartialOrd::lt(&*self.get_ref(), &*other.get_ref())
    }
    #[inline]
    fn le(&self, other: &Lazy<T>) -> bool {
        PartialOrd::le(&*self.get_ref(), &*other.get_ref())
    }
    #[inline]
    fn ge(&self, other: &Lazy<T>) -> bool {
        PartialOrd::ge(&*self.get_ref(), &*other.get_ref())
    }
    #[inline]
    fn gt(&self, other: &Lazy<T>) -> bool {
        PartialOrd::gt(&*self.get_ref(), &*other.get_ref())
    }
}

impl<T: Ord> Ord for Lazy<T> {
    #[inline]
    fn cmp(&self, other: &Lazy<T>) -> Ordering {
        Ord::cmp(&*self.get_ref(), &*other.get_ref())
    }
}

impl<T: Hash> Hash for Lazy<T> {
    fn hash<H: Hasher>(&self, state: &mut H) {
        (*self.get_ref()).hash(state);
    }
}

impl<T: Clone> Clone for Lazy<T> {
    #[inline]
    fn clone(&self) -> Lazy<T> {
        let updater = self.updater.clone();
        let dirty = Rc::pin(DirtyMarker::new(false));
        Self {
            data: RefCell::new(None),
            updater,
            dirty,
        }
    }
}

impl<T: fmt::Display> fmt::Display for Lazy<T> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        fmt::Display::fmt(&*self.get_ref(), f)
    }
}

impl<T: fmt::Debug> fmt::Debug for Lazy<T> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        fmt::Debug::fmt(&*self.get_ref(), f)
    }
}