crack 0.1.0

verify distributed and lock-free algorithms through symbolic execution
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

pub enum PeerState {
    Connected,
    Disconnected,
}

pub struct Peer {
    state: PeerState,
    addr: String,
}

pub trait Kernel {
    fn peers(&self) -> Vec<Peer>;
    fn ping(&self, Peer) -> Result<(), ()>;
    fn purge(&self, Peer);
}

pub struct K {
    peers: Vec<Peer>,
}

impl Default for K {
    fn default() -> K {
        K { peers: vec![] }
    }
}

impl K {
    fn cron(&self) {
        // for
    }
}

impl Kernel for K {
    fn peers(&self) -> Vec<Peer> {
        vec![]
    }

    fn ping(&self, peer: Peer) -> Result<(), ()> {
        Ok(())
    }

    fn purge(&self, peer: Peer) {}
}

#[cfg(test)]
mod tests {
    #[test]
    fn it_works() {}
}