Struct Proposal 

pub struct Proposal {
    pub node_name: String,
    pub dtvlsn: u64,
    pub vlsn: u64,
    pub priority: u32,
    pub term: u64,
    pub timestamp_ms: u64,
}

Represents a candidate’s election proposal.

A proposal captures the state of the candidate at the moment it decides to run for master. The Ord implementation encodes the election’s preference rules so that max(proposals) yields the winning candidate.

Fields

node_name: String

Name of the candidate node.

dtvlsn: u64

Durable Transaction VLSN (the MAJOR ranking key, JE Ranking.major). The highest VLSN known durable on a majority of nodes. 0 means UNINITIALIZED (pre-DTVLSN), in which case ranking falls back to vlsn (JE MasterSuggestionGenerator.getRanking: if dtvlsn == UNINITIALIZED return Ranking(vlsn, 0)). Defaults to 0 for back-compat constructors.

vlsn: u64

Highest VLSN this node has acknowledged (the MINOR ranking key).

priority: u32

Election priority assigned to this node (higher = preferred).

term: u64

Election term number.

timestamp_ms: u64

Millisecond timestamp of when the proposal was created.

Implementations

impl Proposal

pub fn new(node_name: String, vlsn: u64, priority: u32, term: u64) -> Self

Create a new proposal, automatically timestamped to “now”.

pub fn with_timestamp( node_name: String, vlsn: u64, priority: u32, term: u64, timestamp_ms: u64, ) -> Self

Create a proposal with an explicit timestamp (useful for tests and deserialization).

pub fn is_better_than(&self, other: &Proposal) -> bool

Returns true if this proposal is strictly better than other according to the election ordering rules.

pub fn with_dtvlsn(self, dtvlsn: u64) -> Self

Builder: set the DTVLSN (the major ranking key). The election driver populates this from ReplicatedEnvironment::get_dtvlsn() so the most durable node, not merely the highest-raw-VLSN node, wins (D2).

Trait Implementations

impl Clone for Proposal

fn clone(&self) -> Proposal

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Proposal

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

Formats the value using the given formatter.

impl Display for Proposal

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

Formats the value using the given formatter.

impl Eq for Proposal

impl Ord for Proposal

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Proposal

fn eq(&self, other: &Proposal) -> 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 PartialOrd for Proposal

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for Proposal