Collect the leaf shard ids of an [`AggNode`] in left-to-right DFS order.
(node: &AggNode, out: &mut Vec<u32>)
| 1991 | hi, |
| 1992 | hi / lo.max(1.0), |
| 1993 | )) |
| 1994 | } |
| 1995 | |
| 1996 | /// Read a `.ixprof`, partition into `num_shards` shards, and emit a manifest with |
| 1997 | /// per-shard cost metrics, foreign-block sets, and (delta-based) assumption |
| 1998 | /// roots. Optionally writes the manifest (`.ixes`). Returns a what-if report. |
| 1999 | /// |
| 2000 | /// The assumption root here is the Merkle root over the foreign *blocks* whose |
| 2001 | /// bodies the shard must ingress (the cost-model-tight set). The fully-sound |
| 2002 | /// variant for proof generation uses the static reference closure over member |
| 2003 | /// constants and additionally needs the `.ixe`; see `plans/sharding.md` §4. |
| 2004 | pub fn shard_esp( |
no test coverage detected