plckit 0.1.2

Kit for PLCs and real-time micro-services
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

use std::collections::VecDeque;

use crate::{DeliveryPolicy, MessageDeliveryPolicy};

#[derive(Clone, Debug)]
pub struct Deque<T>
where
    T: MessageDeliveryPolicy,
{
    data: VecDeque<T>,
    capacity: usize,
    ordered: bool,
}

impl<T> Deque<T>
where
    T: MessageDeliveryPolicy,
{
    #[inline]
    pub fn bounded(capacity: usize) -> Self {
        Self {
            data: VecDeque::with_capacity(capacity),
            capacity,
            ordered: false,
        }
    }
    #[inline]
    pub fn with_ordering(mut self, v: bool) -> Self {
        self.ordered = v;
        self
    }
    /// Returns the value if data push failed
    pub fn try_push(&mut self, value: T) -> Option<T> {
        macro_rules! push {
            () => {
                self.data.push_back(value);
                if self.ordered {
                    sort_by_priority(&mut self.data);
                }
            };
        }
        if value.is_delivery_policy_single() {
            self.data.retain(|d| !d.eq_kind(&value));
        }
        if self.data.len() < self.capacity {
            push!();
            None
        } else {
            match value.delivery_policy() {
                DeliveryPolicy::Always | DeliveryPolicy::Single => {
                    let mut entry_removed = false;
                    self.data.retain(|d| {
                        if entry_removed {
                            true
                        } else {
                            let to_remove = d.is_expired() || d.is_delivery_policy_optional();
                            if to_remove {
                                entry_removed = true;
                                false
                            } else {
                                true
                            }
                        }
                    });
                    if self.data.len() < self.capacity {
                        push!();
                        None
                    } else {
                        Some(value)
                    }
                }
                DeliveryPolicy::Optional | DeliveryPolicy::SingleOptional => None,
            }
        }
    }
    #[inline]
    pub fn get(&mut self) -> Option<T> {
        self.data.pop_front()
    }
    #[inline]
    pub fn clear(&mut self) {
        self.data.clear();
    }
    #[inline]
    pub fn usage(&self) -> usize {
        self.data.len()
    }
    #[inline]
    pub fn is_full(&self) -> bool {
        self.usage() == self.capacity
    }
    #[inline]
    pub fn is_empty(&self) -> bool {
        self.data.is_empty()
    }
}

fn sort_by_priority<T: MessageDeliveryPolicy>(v: &mut VecDeque<T>) {
    let mut n = v.len();
    let mut swapped = true;
    while swapped {
        swapped = false;
        for i in 1..n {
            if v[i - 1].priority() > v[i].priority() {
                v.swap(i - 1, i);
                swapped = true;
            }
        }
        n -= 1;
    }
}