Struct BlockPartition 

pub struct BlockPartition { /* private fields */ }

An ordered, exhaustive partition of source positions into non-empty blocks.

Applying a partition concatenates its blocks in declaration order. This is a validated structural spelling of an ordinal permutation, not a search or partition enumerator.

Implementations

impl BlockPartition

pub fn try_new( cardinality: usize, blocks: Vec<Vec<usize>>, ) -> Result<Self, BlockPartitionError>

Validates non-empty blocks that cover every source position exactly once.

pub fn contiguous( block_lengths: Vec<usize>, ) -> Result<Self, BlockPartitionError>

Builds contiguous blocks from positive block lengths.

pub fn cardinality(&self) -> usize

Returns the number of source positions covered by the partition.

pub fn blocks(&self) -> &[Vec<usize>]

Returns the ordered blocks of source positions.

pub fn order_map(&self) -> &OrdinalMap

Returns the exact linearization map induced by the ordered blocks.

Trait Implementations

impl Clone for BlockPartition

fn clone(&self) -> BlockPartition

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BlockPartition

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

Formats the value using the given formatter.

impl Eq for BlockPartition

impl PartialEq for BlockPartition

fn eq(&self, other: &BlockPartition) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BlockPartition