Method partition

crates/kernel/src/shard.rs:221–223

Partition the blocks into `num_shards` shards via recursive bisection. Returns the shard id (in `0..num_shards`) for every block id. `epsilon` is the per-bisection balance tolerance (e.g. `0.05` for ±5%). `num_shards` need not be a power of two.

(&self, num_shards: usize, epsilon: f64)

  /// the per-bisection balance tolerance (e.g. `0.05` for ±5%). `num_shards`
  /// need not be a power of two.
  pub fn partition(&self, num_shards: usize, epsilon: f64) -> Vec<u32> {
    self.partition_with_tree(num_shards, epsilon).0
  }

  /// Like [`Self::partition`], but also returns the **bisection tree** — the
  /// binary tree of min-cut splits whose leaves are the shard ids. Reusing this