Enum ChangeMembers 

pub enum ChangeMembers<NID, N>
where
    NID: NodeId,
    N: Node,
{
    AddVoterIds(BTreeSet<NID>),
    AddVoters(BTreeMap<NID, N>),
    RemoveVoters(BTreeSet<NID>),
    ReplaceAllVoters(BTreeSet<NID>),
    AddNodes(BTreeMap<NID, N>),
    SetNodes(BTreeMap<NID, N>),
    RemoveNodes(BTreeSet<NID>),
    ReplaceAllNodes(BTreeMap<NID, N>),
}

Defines various actions to change the membership, including adding or removing learners or voters.

Variants

AddVoterIds(BTreeSet<NID>)

Upgrade learners to voters.

The learners have to present or error::LearnerNotFound error will be returned.

AddVoters(BTreeMap<NID, N>)

Add voters with corresponding nodes.

RemoveVoters(BTreeSet<NID>)

Remove voters, leave removed voters as learner or not.

ReplaceAllVoters(BTreeSet<NID>)

Replace voter ids with a new set. The node of every new voter has to already be a learner.

AddNodes(BTreeMap<NID, N>)

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

SetNodes(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

RemoveNodes(BTreeSet<NID>)

Remove nodes from membership.

If a node is still a voter, it returns error::LearnerNotFound error.

ReplaceAllNodes(BTreeMap<NID, N>)

Replace all nodes with a new set.

Every voter has to have a corresponding node in the new set, otherwise it returns error::LearnerNotFound error.

Trait Implementations

impl<NID, N> Clone for ChangeMembers<NID, N>

where NID: Clone + NodeId, N: Clone + Node,

fn clone(&self) -> ChangeMembers<NID, N>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<NID, N> Debug for ChangeMembers<NID, N>

where NID: Debug + NodeId, N: Debug + Node,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<'de, NID, N> Deserialize<'de> for ChangeMembers<NID, N>

where NID: NodeId, N: Node,

fn deserialize<__D>( __deserializer: __D, ) -> Result<ChangeMembers<NID, N>, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<NID, N> Eq for ChangeMembers<NID, N>

where NID: Eq + NodeId, N: Eq + Node,

impl<NID, N, I> From<I> for ChangeMembers<NID, N>

where NID: NodeId, N: Node, I: IntoIterator<Item = NID>,

Convert a series of ids to a Replace operation.

fn from(r: I) -> ChangeMembers<NID, N>

Converts to this type from the input type.

impl<NID, N> PartialEq for ChangeMembers<NID, N>

where NID: PartialEq + NodeId, N: PartialEq + Node,

fn eq(&self, other: &ChangeMembers<NID, N>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<NID, N> Serialize for ChangeMembers<NID, N>

where NID: NodeId, N: Node,

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<NID, N> StructuralPartialEq for ChangeMembers<NID, N>

where NID: NodeId, N: Node,