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 69 70
use std::collections::BTreeMap;
use std::collections::BTreeSet;
use crate::Node;
use crate::NodeId;
/// Defines various actions to change the membership, including adding or removing learners or
/// voters.
#[derive(Debug, Clone)]
#[derive(PartialEq, Eq)]
#[cfg_attr(feature = "serde", derive(serde::Deserialize, serde::Serialize), serde(bound = ""))]
pub enum ChangeMembers<NID: NodeId, N: Node> {
/// Upgrade learners to voters.
///
/// The learners have to present or [`error::LearnerNotFound`](`crate::error::LearnerNotFound`)
/// error will be returned.
AddVoterIds(BTreeSet<NID>),
/// Add voters with corresponding nodes.
AddVoters(BTreeMap<NID, N>),
/// Remove voters, leave removed voters as learner or not.
RemoveVoters(BTreeSet<NID>),
/// Replace voter ids with a new set. The node of every new voter has to already be a learner.
ReplaceAllVoters(BTreeSet<NID>),
/// Add nodes to membership, as learners.
///
/// it **WONT** replace existing node.
///
/// Prefer using this variant instead of `SetNodes` whenever possible, as `AddNodes` ensures
/// safety, whereas incorrect usage of `SetNodes` can result in a brain split.
/// See: [Update-Node](`crate::docs::cluster_control::dynamic_membership#update-node`)
AddNodes(BTreeMap<NID, N>),
/// Add or replace nodes in membership config.
///
/// it **WILL** replace existing node.
///
/// Prefer using `AddNodes` instead of `SetNodes` whenever possible, as `AddNodes` ensures
/// safety, whereas incorrect usage of `SetNodes` can result in a brain split.
/// See: [Update-Node](`crate::docs::cluster_control::dynamic_membership#update-node`)
SetNodes(BTreeMap<NID, N>),
/// Remove nodes from membership.
///
/// If a node is still a voter, it returns
/// [`error::LearnerNotFound`](`crate::error::LearnerNotFound`) error.
RemoveNodes(BTreeSet<NID>),
/// Replace all nodes with a new set.
///
/// Every voter has to have a corresponding node in the new
/// set, otherwise it returns [`error::LearnerNotFound`](`crate::error::LearnerNotFound`) error.
ReplaceAllNodes(BTreeMap<NID, N>),
}
/// Convert a series of ids to a `Replace` operation.
impl<NID, N, I> From<I> for ChangeMembers<NID, N>
where
NID: NodeId,
N: Node,
I: IntoIterator<Item = NID>,
{
fn from(r: I) -> Self {
let ids = r.into_iter().collect::<BTreeSet<NID>>();
ChangeMembers::ReplaceAllVoters(ids)
}
}