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

use crate::can_message::CanMessage;
use crate::can_network::CanNetwork;
use std::collections::hash_map::Entry;
use std::collections::HashMap;

pub struct MultiCan {
    networks: HashMap<u8, Box<CanNetwork>>,
}

impl MultiCan {
    /// Creates a new MultiCan instance given a vector of networks
    pub fn new(adapters: &mut Vec<Box<CanNetwork>>) -> Self {
        let mut networks = HashMap::new();
        // TODO: use config id number as the index
        // pop puts them in the wrong order, so reverse it
        networks.insert(2, adapters.pop().unwrap());
        networks.insert(1, adapters.pop().unwrap());
        networks.insert(0, adapters.pop().unwrap());
        // borrow problem here i don't feel like solving.  will want to fix
        // when we have more than 2 busses
        /*let mut idx = 0;
        for a in adapters {
            networks.insert(idx, adapters.pop().unwrap());
            idx += 1;
        }*/
        MultiCan { networks }
    }

    /// Sends a single CAN message on the bus specified by the message 
    pub fn send(&mut self, msg: CanMessage) {
        match self.networks.entry(msg.bus) {
            Entry::Occupied(n) => {
                n.into_mut().send(msg);
            }
            Entry::Vacant(_) => println!("empty entry for {}", msg.bus),
        };
    }

    /// Receives messages from any configured bus
    pub fn recv(&mut self) -> Vec<CanMessage> {
        let mut messages: Vec<CanMessage> = Vec::new();

        for (key, value) in &mut self.networks {
            if let Some(mut m) = value.recv() {
                m.bus = *key;
                messages.push(m);
            }
        }

        messages
    }
}