jay-compositor 1.15.0

The Jay compositor
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

use crate::criteria::CritUpstreamNode;
use crate::criteria::crit_graph::CritDownstream;
use crate::criteria::crit_graph::CritDownstreamData;
use crate::criteria::crit_graph::CritTarget;
use crate::criteria::crit_graph::CritUpstreamData;
use crate::criteria::crit_graph::crit_target::CritMgr;
use crate::criteria::crit_graph::crit_upstream::CritUpstreamNodeBase;
use crate::criteria::crit_graph::crit_upstream::CritUpstreamNodeData;
use crate::criteria::crit_per_target_data::CritDestroyListenerBase;
use crate::criteria::crit_per_target_data::CritPerTargetData;
use std::rc::Rc;

pub struct CritMiddle<Target, T>
where
    Target: CritTarget,
    T: CritMiddleCriterion<Target>,
{
    upstream: CritDownstreamData<Target>,
    downstream: CritUpstreamData<Target, CritMiddleData<T::Data>>,
    criterion: T,
}

#[derive(Default)]
pub struct CritMiddleData<T> {
    matches: usize,
    data: T,
}

pub trait CritMiddleCriterion<Target>: Sized + 'static {
    type Data: Default;
    type Not: CritMiddleCriterion<Target>;

    fn update_matched(&self, target: &Target, node: &mut Self::Data, matched: bool) -> bool;
    fn pull(&self, upstream: &[Rc<dyn CritUpstreamNode<Target>>], target: &Target) -> bool;
    fn not(&self) -> Self::Not;
}

impl<Target, T> CritMiddle<Target, T>
where
    Target: CritTarget,
    T: CritMiddleCriterion<Target>,
{
    pub fn new(
        mgr: &Target::Mgr,
        upstream: &[Rc<dyn CritUpstreamNode<Target>>],
        criterion: T,
    ) -> Rc<Self> {
        let id = mgr.id();
        let slf = Rc::new_cyclic(|slf| Self {
            upstream: CritDownstreamData::new(id, upstream),
            downstream: CritUpstreamData::new(slf, id),
            criterion,
        });
        slf.upstream.attach(&slf);
        slf
    }
}

impl<Target, T> CritDownstream<Target> for CritMiddle<Target, T>
where
    Target: CritTarget,
    T: CritMiddleCriterion<Target>,
{
    fn update_matched(self: Rc<Self>, target: &Target, matched: bool) {
        let mut node = self.downstream.get_or_create(target);
        let change = self
            .criterion
            .update_matched(target, &mut node.data, matched);
        let matches = match matched {
            true => node.matches + 1,
            false => node.matches - 1,
        };
        node.matches = matches;
        self.downstream
            .update_matched(target, node, change, matches == 0);
    }
}

impl<Target, T> CritUpstreamNodeBase<Target> for CritMiddle<Target, T>
where
    Target: CritTarget,
    T: CritMiddleCriterion<Target>,
{
    type Data = CritMiddleData<T::Data>;

    fn data(&self) -> &CritUpstreamData<Target, Self::Data> {
        &self.downstream
    }

    fn not(&self, mgr: &Target::Mgr) -> Rc<dyn CritUpstreamNode<Target>> {
        let upstream = self.upstream.not(mgr);
        CritMiddle::new(mgr, &upstream, self.criterion.not())
    }

    fn pull(&self, target: &Target) -> bool {
        self.criterion.pull(&self.upstream.upstream, target)
    }
}

impl<Target, T> CritDestroyListenerBase<Target> for CritMiddle<Target, T>
where
    Target: CritTarget,
    T: CritMiddleCriterion<Target>,
{
    type Data = CritUpstreamNodeData<Target, CritMiddleData<T::Data>>;

    fn data(&self) -> &CritPerTargetData<Target, Self::Data> {
        &self.downstream.nodes
    }
}