Struct StickyAssignor 

pub struct StickyAssignor;

Keep what you had where possible, Java’s StickyAssignor in spirit.

Not Java’s algorithm. Java’s does a balanced-then-shuffle pass with several refinement rounds; this keeps each member’s still-valid partitions and deals the rest to whoever holds fewest. The results agree on the cases tested here and will not agree on every case.

That difference is only safe because the leader’s assignment is the one used — a mixed group is consistent whoever leads, it just gets a slightly different balance depending. Where exact agreement is required, use range or roundrobin, which are reproduced exactly.

Trait Implementations

impl Assignor for StickyAssignor

fn name(&self) -> &'static str

The protocol name Kafka knows this by.

fn assign( &self, members: &[Subscription], partitions_per_topic: &BTreeMap<String, i32>, ) -> Assignment

Divide partitions_per_topic among members.

impl Clone for StickyAssignor

fn clone(&self) -> StickyAssignor

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for StickyAssignor

impl Debug for StickyAssignor

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

Formats the value using the given formatter.

impl Default for StickyAssignor

fn default() -> StickyAssignor

Returns the “default value” for a type.