Struct BaseMergeAccumulator 

pub struct BaseMergeAccumulator {
    pub image_owner: HashMap<i64, RankId>,
    pub seen_rank_ids: HashSet<RankId>,
    pub strict: bool,
}

Cross-partial state that every paradigm’s merge accumulator shares: image-id ownership (for the disjoint-partition rule) and strict-mode rank-id distinctness.

Paradigms wrap this in their own outer accumulator and call Self::ingest_rank_id + Self::ingest_image_ids from their ingest per partial, before folding the paradigm-specific body.

Fields

image_owner: HashMap<i64, RankId>

Image id → rank that ingested it. Source of truth for the merged seen_images set.

seen_rank_ids: HashSet<RankId>

Rank ids observed so far. Only populated in strict mode (the distinctness invariant is strict-only); empty in corrected.

strict: bool

Whether the receiver is in strict mode.

Implementations

impl BaseMergeAccumulator

pub fn new(strict: bool) -> Self

Construct an empty accumulator. strict controls whether the rank-id distinctness check fires.

pub fn ingest_rank_id( &mut self, rank_id: Option<RankId>, ) -> Result<(), PartialError>

Record one partial’s rank_id. In strict mode, returns PartialError::RankCollision if a previous partial declared the same id. In corrected mode this is a no-op.

pub fn ingest_image_ids( &mut self, rank_id: Option<RankId>, image_ids: impl IntoIterator<Item = i64>, ) -> Result<(), PartialError>

Record one partial’s seen_images against its declared rank_id. Returns PartialError::PartitionOverlap if any image_id was already registered by a different rank.

pub fn image_ids(&self) -> impl Iterator<Item = i64> + '_

Borrow the merged image-id set. Order is unspecified — sort before consuming if determinism is needed.

Trait Implementations

impl Debug for BaseMergeAccumulator

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

Formats the value using the given formatter.