tender 0.1.1

A Raft-based election framework
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

use crate::ElectionType;
use fxhash::FxHashSet;

pub struct MemberConfig<T: ElectionType> {
    current: T::NodeId,
    peers: FxHashSet<T::NodeId>,
}

impl<T: ElectionType> MemberConfig<T> {
    #[inline]
    pub fn new(current: T::NodeId) -> Self {
        Self {
            current,
            peers: FxHashSet::with_hasher(Default::default()),
        }
    }

    #[inline]
    pub fn init_peers(&mut self, peers: FxHashSet<T::NodeId>) {
        debug_assert!(!peers.contains(&self.current));
        self.peers = peers;
    }

    #[inline]
    pub fn current(&self) -> &T::NodeId {
        &self.current
    }

    #[inline]
    pub fn peers(&self) -> &FxHashSet<T::NodeId> {
        &self.peers
    }

    #[inline]
    pub fn all_members_num(&self) -> usize {
        self.peers.len() + 1
    }

    #[inline]
    pub fn contains(&self, node_id: &T::NodeId) -> bool {
        self.peers.contains(node_id) || self.current.eq(node_id)
    }
}