rast 0.1.0-alpha.0

A toy implementation of the raft consistency protocol focused on speed
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

// Copyright 2020 Daniel Harrison. All Rights Reserved.

use std::collections::HashMap;

use crate::prelude::*;
use crate::runtime::{MemLog, MemRPC, RastClient, Runtime};

pub struct ConcurrentNode {
  runtime: Runtime,
  rpc: MemRPC,
}

impl ConcurrentNode {
  fn new(id: NodeID, nodes: Vec<NodeID>) -> ConcurrentNode {
    let cfg = Config::default();
    let raft = Raft::new(id, nodes, cfg);
    let rpc = MemRPC::new();
    let runtime = Runtime::new(raft, rpc.clone(), MemLog::new());
    ConcurrentNode { runtime: runtime, rpc: rpc }
  }

  pub fn client(&self) -> RastClient {
    self.runtime.client()
  }
}

pub struct ConcurrentGroup {
  // TODO: remove pub
  pub nodes: HashMap<NodeID, ConcurrentNode>,
}

impl ConcurrentGroup {
  pub fn new(nodes: u64) -> ConcurrentGroup {
    let node_ids: Vec<_> = (0..nodes).map(|node| NodeID(node)).collect();
    let mut nodes: HashMap<_, _> = node_ids
      .iter()
      .map(|node_id| (*node_id, ConcurrentNode::new(*node_id, node_ids.clone())))
      .collect();
    let senders: Vec<_> =
      nodes.iter().map(|(node_id, node)| (*node_id, node.runtime.sender())).collect();
    for (_, node) in nodes.iter_mut() {
      for (dest_id, dest_sender) in senders.iter() {
        node.rpc.register(*dest_id, dest_sender.clone());
      }
    }
    ConcurrentGroup { nodes: nodes }
  }
}