prns-core 0.3.4

Pure Reticulum engine and wire contract for Personal Reticulum
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

use crate::routing::group_keys::{GroupKey, GroupKeyTable};
use crate::storage::TablePushError;
use crate::wire::DestinationHash;

#[derive(Debug)]
pub struct FixedGroupKeyTable<const MAX_GROUP_KEYS: usize> {
    len: usize,
    destinations: [DestinationHash; MAX_GROUP_KEYS],
    keys: [GroupKey; MAX_GROUP_KEYS],
}

impl<const MAX_GROUP_KEYS: usize> Default for FixedGroupKeyTable<MAX_GROUP_KEYS> {
    fn default() -> Self {
        Self {
            len: 0,
            destinations: [DestinationHash::new([0u8; 16]); MAX_GROUP_KEYS],
            keys: core::array::from_fn(|_| GroupKey::default()),
        }
    }
}

impl<const MAX_GROUP_KEYS: usize> GroupKeyTable for FixedGroupKeyTable<MAX_GROUP_KEYS> {
    fn capacity(&self) -> usize {
        MAX_GROUP_KEYS
    }
    fn len(&self) -> usize {
        self.len
    }

    fn destinations(&self) -> &[DestinationHash] {
        &self.destinations[..self.len]
    }
    fn keys(&self) -> &[GroupKey] {
        &self.keys[..self.len]
    }

    fn upsert(
        &mut self,
        destination: DestinationHash,
        key: GroupKey,
    ) -> Result<(), TablePushError> {
        if let Some(slot) = self.destinations[..self.len]
            .iter()
            .position(|candidate| *candidate == destination)
        {
            self.keys[slot] = key;
            return Ok(());
        }
        if self.len >= MAX_GROUP_KEYS {
            return Err(TablePushError::TableFull);
        }
        self.destinations[self.len] = destination;
        self.keys[self.len] = key;
        self.len += 1;
        Ok(())
    }
}