Struct BpBudget 

pub struct BpBudget {
    pub min_partition_docs: Option<usize>,
    pub time_budget: Option<Duration>,
}

CPU/depth budget for a BP pass. BP is an anytime algorithm: stopping at any depth or deadline still yields a valid permutation, and because the output layout becomes the next pass’s input order, repeated budgeted passes warm-start and deepen (top levels converge in ~0 swaps, the budget flows to deeper levels).

Fields

min_partition_docs: Option<usize>

Stop recursion at partitions of at most this many docs instead of descending to block granularity. None = full depth. Capping at superblock granularity (superblock_size × block_size docs) keeps most of the superblock-pruning win at ~⅓ less depth.

time_budget: Option<Duration>

Wall-clock cap for the whole BP computation. The pass ends cleanly at the deadline with whatever depth it reached (converged = false). Ignored on wasm (no monotonic clock).

Implementations

impl BpBudget

pub fn full() -> Self

Unbudgeted: full depth, no deadline.

Trait Implementations

impl Clone for BpBudget

fn clone(&self) -> BpBudget

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for BpBudget

impl Debug for BpBudget

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

Formats the value using the given formatter.

impl Default for BpBudget

fn default() -> BpBudget

Returns the “default value” for a type.