Struct MergeLadder 

pub struct MergeLadder<M: Merger> { /* private fields */ }

A geometric ladder of sorted, consolidated chains, merged as they arrive.

Chains are kept in order of decreasing update count, each at least twice the next, so that there are logarithmically many and each update is merged logarithmically often.

Implementations

impl<M: Merger> MergeLadder<M>

pub fn new(logger: Option<Logger>, operator_id: usize) -> Self

Allocates a new empty ladder.

The logger and operator identifier are used to report the ladder’s memory footprint, attributed to the operator that owns it.

pub fn insert_chain(&mut self, chain: Vec<M::Chunk>)

Insert a chain and maintain chain properties: Chains are geometrically sized (by summed updates) and ordered by decreasing update weight.

pub fn merge_all(&mut self) -> Vec<M::Chunk>

Merge all chains into a single chain, and remove it from the ladder.

pub fn chains(&self) -> impl Iterator<Item = &[M::Chunk]>

The chains, largest first.

pub fn retain_chains(&mut self, logic: impl FnMut(&mut Vec<M::Chunk>))

Lets logic remove updates from each chain, largest first, for batchers that release updates from the fronts of chains rather than by merging them all.

A chain keeps the weight it was pushed with, so the ladder merges as though no updates had left it, and stays logarithmic in the updates inserted. Chains left empty are removed.

Trait Implementations

impl<M: Merger> Drop for MergeLadder<M>

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.