openraft 0.10.0-alpha.18

Advanced Raft consensus
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68

use std::collections::BTreeMap;
use std::collections::BTreeSet;
use std::collections::HashMap;

use maplit::btreemap;

use crate::EmptyNode;
use crate::Node;
use crate::NodeId;

/// Convert into a map of `Node`.
///
/// This is used as a user input acceptor when building a Membership, to convert various input types
/// into a map of `Node`.
pub trait IntoNodes<NID, N>
where
    N: Node,
    NID: NodeId,
{
    /// Convert this type into a map of node IDs to nodes.
    fn into_nodes(self) -> BTreeMap<NID, N>;
}

impl<NID, N> IntoNodes<NID, N> for ()
where
    N: Node,
    NID: NodeId,
{
    fn into_nodes(self) -> BTreeMap<NID, N> {
        btreemap! {}
    }
}

impl<NID> IntoNodes<NID, ()> for BTreeSet<NID>
where NID: NodeId
{
    fn into_nodes(self) -> BTreeMap<NID, ()> {
        self.into_iter().map(|node_id| (node_id, ())).collect()
    }
}

impl<NID> IntoNodes<NID, EmptyNode> for BTreeSet<NID>
where NID: NodeId
{
    fn into_nodes(self) -> BTreeMap<NID, EmptyNode> {
        self.into_iter().map(|node_id| (node_id, EmptyNode {})).collect()
    }
}

impl<NID, N> IntoNodes<NID, N> for BTreeMap<NID, N>
where
    N: Node,
    NID: NodeId,
{
    fn into_nodes(self) -> BTreeMap<NID, N> {
        self
    }
}

impl<NID, N> IntoNodes<NID, N> for HashMap<NID, N>
where
    N: Node,
    NID: NodeId,
{
    fn into_nodes(self) -> BTreeMap<NID, N> {
        self.into_iter().collect()
    }
}