logicsim 0.1.7

composable, modular, digital logic simulation
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

use super::super::{gate::*, graph_builder::GateGraphBuilder};

/// Replaces all not gates with the same dependency with a single one.
pub fn not_deduplication_pass(g: &mut GateGraphBuilder) {
    let mut nots = Vec::new();
    let mut temp_deps = Vec::new();
    struct WorkItem {
        gate: GateIndex,
        first_not: GateIndex,
    }
    let mut work: Vec<WorkItem> = g
        .nodes
        .iter()
        .filter_map(|(i, gate)| {
            let mut first_not = None;
            for dependent in &gate.dependents {
                let dependent_gate = g.get(*dependent);
                match (first_not, dependent_gate.ty.is_not()) {
                    (Some(first_not), true) => {
                        return WorkItem {
                            gate: i.into(),
                            first_not,
                        }
                        .into()
                    }
                    (None, true) => first_not = Some(*dependent),
                    _ => {}
                }
            }
            None
        })
        .collect();

    while let Some(WorkItem { gate, first_not }) = work.pop() {
        nots.extend(
            g.nodes
                .get(gate.into())
                .unwrap()
                .dependents
                .iter()
                .copied()
                .filter(|dependent| {
                    *dependent != first_not
                        && *dependent != gate
                        && !g.is_observable(*dependent)
                        && g.get(*dependent).ty.is_not()
                }),
        );
        for not in nots.drain(0..nots.len()) {
            temp_deps.extend(g.get(not).dependents.iter().copied());

            for dependent in temp_deps.drain(0..temp_deps.len()) {
                for dependent_dependency in &mut g.get_mut(dependent).dependencies {
                    if *dependent_dependency == not {
                        *dependent_dependency = first_not
                    }
                }
                g.nodes
                    .get_mut(first_not.into())
                    .unwrap()
                    .dependents
                    .insert(dependent);
            }

            g.nodes.remove(not.into());
            g.get_mut(gate).dependents.remove(&not);
        }
    }
}