Struct PartitionMap 

pub struct PartitionMap {
    pub cell_to_rank: Vec<usize>,
    pub n_ranks: usize,
}

Partition assignment for load-balanced domain decomposition.

Fields

cell_to_rank: Vec<usize>

For each global cell index, the owning rank.

n_ranks: usize

Total number of ranks.

Implementations

impl PartitionMap

pub fn new(cell_to_rank: Vec<usize>, n_ranks: usize) -> Self

Create a PartitionMap from a flat assignment vector.

pub fn n_cells(&self) -> usize

Number of global cells.

pub fn cells_on_rank(&self, rank: usize) -> usize

Number of cells assigned to the given rank.

pub fn imbalance(&self) -> f64

Load imbalance factor: max_cells / ideal_cells.

Returns 1.0 for a perfectly balanced partition; higher values indicate greater imbalance. Returns 1.0 if there are no cells or ranks.

pub fn round_robin(n_cells: usize, n_ranks: usize) -> Self

Build a simple round-robin partition for n_cells cells over n_ranks ranks.

pub fn to_text(&self) -> String

Serialize to a simple text format (one rank per line).

Trait Implementations

impl Clone for PartitionMap

fn clone(&self) -> PartitionMap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PartitionMap

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

Formats the value using the given formatter.