logic-mesh 1.0.0

Control logic engine using event based and reactive blocks written in Rust.
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

// Copyright (c) 2022-2026, Radu Racariu.

use uuid::Uuid;

use crate::base::{
    block::{Block, BlockDesc, BlockProps, BlockState},
    input::{InputProps, input_reader::InputReader},
    output::Output,
};

use libhaystack::val::{Value, kind::HaystackKind};

use crate::{blocks::InputImpl, blocks::OutputImpl};

/// Counts rising edges on `in`. Useful for tracking equipment start
/// counts for maintenance and wear tracking. A rising edge on `reset`
/// zeros the counter.
#[block]
#[derive(BlockProps, Debug)]
#[category = "timers"]
pub struct CycleCount {
    #[input(name = "in", kind = "Bool")]
    pub input: InputImpl,
    #[input(kind = "Bool")]
    pub reset: InputImpl,
    #[output(kind = "Number")]
    pub out: OutputImpl,
    count: u64,
    prev_input: Option<bool>,
    prev_reset: Option<bool>,
}

impl Block for CycleCount {
    async fn execute(&mut self) {
        self.read_inputs_until_ready().await;

        let input = matches!(self.input.get_value(), Some(Value::Bool(b)) if b.value);
        let reset = matches!(self.reset.get_value(), Some(Value::Bool(b)) if b.value);

        let rising_reset = matches!(self.prev_reset, Some(false)) && reset;
        self.prev_reset = Some(reset);

        if rising_reset {
            self.count = 0;
        }

        let rising_input = matches!(self.prev_input, Some(false)) && input;
        self.prev_input = Some(input);

        if rising_input {
            self.count = self.count.saturating_add(1);
        }

        self.out.set((self.count as f64).into());
    }
}

#[cfg(test)]
mod test {

    use crate::{
        base::block::Block, base::block::test_utils::write_block_inputs, blocks::timers::CycleCount,
    };

    #[tokio::test]
    async fn test_cycle_count_increments_on_rising_edge() {
        let mut block = CycleCount::new();

        // Establish low
        write_block_inputs([(&mut block.input, false), (&mut block.reset, false)]).await;
        block.execute().await;
        assert_eq!(block.out.value, 0.into());

        // Rising edge → count = 1
        write_block_inputs([(&mut block.input, true)]).await;
        block.execute().await;
        assert_eq!(block.out.value, 1.into());

        // Holding true does not double-count
        write_block_inputs([(&mut block.input, true)]).await;
        block.execute().await;
        assert_eq!(block.out.value, 1.into());

        // Falling, then rising again → count = 2
        write_block_inputs([(&mut block.input, false)]).await;
        block.execute().await;
        write_block_inputs([(&mut block.input, true)]).await;
        block.execute().await;
        assert_eq!(block.out.value, 2.into());
    }

    #[tokio::test]
    async fn test_cycle_count_reset() {
        let mut block = CycleCount::new();
        block.count = 42;

        write_block_inputs([(&mut block.input, false), (&mut block.reset, false)]).await;
        block.execute().await;

        write_block_inputs([(&mut block.reset, true)]).await;
        block.execute().await;
        assert_eq!(block.count, 0);
    }
}